{"status":"public","year":"2004","author":[{"first_name":"S.","full_name":"Bezrukov, S.","last_name":"Bezrukov"},{"full_name":"Elsässer, R.","last_name":"Elsässer","first_name":"R."},{"first_name":"B.","last_name":"Monien","full_name":"Monien, B."},{"last_name":"Preis","full_name":"Preis, R.","first_name":"R."},{"full_name":"Tillich, J.-P.","last_name":"Tillich","first_name":"J.-P."}],"publication_identifier":{"issn":["0304-3975"]},"department":[{"_id":"101"}],"_id":"16521","title":"New spectral lower bounds on the bisection width of graphs","citation":{"apa":"Bezrukov, S., Elsässer, R., Monien, B., Preis, R., &#38; Tillich, J.-P. (2004). New spectral lower bounds on the bisection width of graphs. <i>Theoretical Computer Science</i>, 155–174. <a href=\"https://doi.org/10.1016/j.tcs.2004.03.059\">https://doi.org/10.1016/j.tcs.2004.03.059</a>","short":"S. Bezrukov, R. Elsässer, B. Monien, R. Preis, J.-P. Tillich, Theoretical Computer Science (2004) 155–174.","chicago":"Bezrukov, S., R. Elsässer, B. Monien, R. Preis, and J.-P. Tillich. “New Spectral Lower Bounds on the Bisection Width of Graphs.” <i>Theoretical Computer Science</i>, 2004, 155–74. <a href=\"https://doi.org/10.1016/j.tcs.2004.03.059\">https://doi.org/10.1016/j.tcs.2004.03.059</a>.","ieee":"S. Bezrukov, R. Elsässer, B. Monien, R. Preis, and J.-P. Tillich, “New spectral lower bounds on the bisection width of graphs,” <i>Theoretical Computer Science</i>, pp. 155–174, 2004.","mla":"Bezrukov, S., et al. “New Spectral Lower Bounds on the Bisection Width of Graphs.” <i>Theoretical Computer Science</i>, 2004, pp. 155–74, doi:<a href=\"https://doi.org/10.1016/j.tcs.2004.03.059\">10.1016/j.tcs.2004.03.059</a>.","ama":"Bezrukov S, Elsässer R, Monien B, Preis R, Tillich J-P. New spectral lower bounds on the bisection width of graphs. <i>Theoretical Computer Science</i>. 2004:155-174. doi:<a href=\"https://doi.org/10.1016/j.tcs.2004.03.059\">10.1016/j.tcs.2004.03.059</a>","bibtex":"@article{Bezrukov_Elsässer_Monien_Preis_Tillich_2004, title={New spectral lower bounds on the bisection width of graphs}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2004.03.059\">10.1016/j.tcs.2004.03.059</a>}, journal={Theoretical Computer Science}, author={Bezrukov, S. and Elsässer, R. and Monien, B. and Preis, R. and Tillich, J.-P.}, year={2004}, pages={155–174} }"},"user_id":"15701","date_created":"2020-04-15T08:05:40Z","language":[{"iso":"eng"}],"publication_status":"published","doi":"10.1016/j.tcs.2004.03.059","page":"155-174","publication":"Theoretical Computer Science","type":"journal_article","date_updated":"2022-01-06T06:52:52Z"}