{"department":[{"_id":"101"}],"publication_identifier":{"issn":["1570-8667"]},"title":"Upper bounds on the Bisection Width of 3- and 4-regular Graphs","_id":"16641","citation":{"apa":"Monien, B., & Preis, R. (2006). Upper bounds on the Bisection Width of 3- and 4-regular Graphs. Journal of Discrete Algorithms, 475–498. https://doi.org/10.1016/j.jda.2005.12.009","ama":"Monien B, Preis R. Upper bounds on the Bisection Width of 3- and 4-regular Graphs. Journal of Discrete Algorithms. 2006:475-498. doi:10.1016/j.jda.2005.12.009","mla":"Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.” Journal of Discrete Algorithms, 2006, pp. 475–98, doi:10.1016/j.jda.2005.12.009.","ieee":"B. Monien and R. Preis, “Upper bounds on the Bisection Width of 3- and 4-regular Graphs,” Journal of Discrete Algorithms, pp. 475–498, 2006.","short":"B. Monien, R. Preis, Journal of Discrete Algorithms (2006) 475–498.","chicago":"Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.” Journal of Discrete Algorithms, 2006, 475–98. https://doi.org/10.1016/j.jda.2005.12.009.","bibtex":"@article{Monien_Preis_2006, title={Upper bounds on the Bisection Width of 3- and 4-regular Graphs}, DOI={10.1016/j.jda.2005.12.009}, journal={Journal of Discrete Algorithms}, author={Monien, Burkhard and Preis, Robert}, year={2006}, pages={475–498} }"},"user_id":"15701","date_created":"2020-04-16T08:59:15Z","status":"public","year":"2006","author":[{"first_name":"Burkhard","last_name":"Monien","full_name":"Monien, Burkhard"},{"first_name":"Robert","full_name":"Preis, Robert","last_name":"Preis"}],"doi":"10.1016/j.jda.2005.12.009","page":"475-498","publication":"Journal of Discrete Algorithms","date_updated":"2022-01-06T06:52:53Z","type":"journal_article","language":[{"iso":"eng"}],"publication_status":"published"}