[{"publication_status":"published","date_updated":"2022-01-06T06:52:53Z","year":"2007","title":"Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs","status":"public","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540424963","9783540446835"]},"author":[{"first_name":"Burkhard","last_name":"Monien","full_name":"Monien, Burkhard"},{"full_name":"Preis, Robert","first_name":"Robert","last_name":"Preis"}],"user_id":"15701","doi":"10.1007/3-540-44683-4_46","_id":"16640","publication":"Mathematical Foundations of Computer Science 2001","citation":{"bibtex":"@inbook{Monien_Preis_2007, place={Berlin, Heidelberg}, title={Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs}, DOI={<a href=\"https://doi.org/10.1007/3-540-44683-4_46\">10.1007/3-540-44683-4_46</a>}, booktitle={Mathematical Foundations of Computer Science 2001}, author={Monien, Burkhard and Preis, Robert}, year={2007} }","ama":"Monien B, Preis R. Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. In: <i>Mathematical Foundations of Computer Science 2001</i>. Berlin, Heidelberg; 2007. doi:<a href=\"https://doi.org/10.1007/3-540-44683-4_46\">10.1007/3-540-44683-4_46</a>","mla":"Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.” <i>Mathematical Foundations of Computer Science 2001</i>, 2007, doi:<a href=\"https://doi.org/10.1007/3-540-44683-4_46\">10.1007/3-540-44683-4_46</a>.","short":"B. Monien, R. Preis, in: Mathematical Foundations of Computer Science 2001, Berlin, Heidelberg, 2007.","chicago":"Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.” In <i>Mathematical Foundations of Computer Science 2001</i>. Berlin, Heidelberg, 2007. <a href=\"https://doi.org/10.1007/3-540-44683-4_46\">https://doi.org/10.1007/3-540-44683-4_46</a>.","ieee":"B. Monien and R. Preis, “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs,” in <i>Mathematical Foundations of Computer Science 2001</i>, Berlin, Heidelberg, 2007.","apa":"Monien, B., &#38; Preis, R. (2007). Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. In <i>Mathematical Foundations of Computer Science 2001</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-44683-4_46\">https://doi.org/10.1007/3-540-44683-4_46</a>"},"type":"book_chapter","department":[{"_id":"101"}],"date_created":"2020-04-16T08:58:07Z","place":"Berlin, Heidelberg"}]