[{"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","status":"public","year":"2009","title":"Optimal algorithms for page migration in dynamic networks","publication_identifier":{"issn":["1570-8667"]},"author":[{"last_name":"Bienkowski","first_name":"Marcin","full_name":"Bienkowski, Marcin"},{"first_name":"Jaroslaw","last_name":"Byrka","full_name":"Byrka, Jaroslaw"},{"first_name":"Miroslaw","last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"user_id":"15415","doi":"10.1016/j.jda.2008.07.006","page":"545-569","language":[{"iso":"eng"}],"_id":"16398","publication":"Journal of Discrete Algorithms","citation":{"mla":"Bienkowski, Marcin, et al. “Optimal Algorithms for Page Migration in Dynamic Networks.” <i>Journal of Discrete Algorithms</i>, 2009, pp. 545–69, doi:<a href=\"https://doi.org/10.1016/j.jda.2008.07.006\">10.1016/j.jda.2008.07.006</a>.","ama":"Bienkowski M, Byrka J, Korzeniowski M, Meyer auf der Heide F. Optimal algorithms for page migration in dynamic networks. <i>Journal of Discrete Algorithms</i>. 2009:545-569. doi:<a href=\"https://doi.org/10.1016/j.jda.2008.07.006\">10.1016/j.jda.2008.07.006</a>","bibtex":"@article{Bienkowski_Byrka_Korzeniowski_Meyer auf der Heide_2009, title={Optimal algorithms for page migration in dynamic networks}, DOI={<a href=\"https://doi.org/10.1016/j.jda.2008.07.006\">10.1016/j.jda.2008.07.006</a>}, journal={Journal of Discrete Algorithms}, author={Bienkowski, Marcin and Byrka, Jaroslaw and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}, year={2009}, pages={545–569} }","apa":"Bienkowski, M., Byrka, J., Korzeniowski, M., &#38; Meyer auf der Heide, F. (2009). Optimal algorithms for page migration in dynamic networks. <i>Journal of Discrete Algorithms</i>, 545–569. <a href=\"https://doi.org/10.1016/j.jda.2008.07.006\">https://doi.org/10.1016/j.jda.2008.07.006</a>","ieee":"M. Bienkowski, J. Byrka, M. Korzeniowski, and F. Meyer auf der Heide, “Optimal algorithms for page migration in dynamic networks,” <i>Journal of Discrete Algorithms</i>, pp. 545–569, 2009.","chicago":"Bienkowski, Marcin, Jaroslaw Byrka, Miroslaw Korzeniowski, and Friedhelm Meyer auf der Heide. “Optimal Algorithms for Page Migration in Dynamic Networks.” <i>Journal of Discrete Algorithms</i>, 2009, 545–69. <a href=\"https://doi.org/10.1016/j.jda.2008.07.006\">https://doi.org/10.1016/j.jda.2008.07.006</a>.","short":"M. Bienkowski, J. Byrka, M. Korzeniowski, F. Meyer auf der Heide, Journal of Discrete Algorithms (2009) 545–569."},"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-04-03T10:40:45Z"},{"page":"475-498","_id":"16641","language":[{"iso":"eng"}],"user_id":"15701","doi":"10.1016/j.jda.2005.12.009","year":"2006","status":"public","title":"Upper bounds on the Bisection Width of 3- and 4-regular Graphs","author":[{"first_name":"Burkhard","last_name":"Monien","full_name":"Monien, Burkhard"},{"full_name":"Preis, Robert","last_name":"Preis","first_name":"Robert"}],"publication_identifier":{"issn":["1570-8667"]},"publication_status":"published","date_updated":"2022-01-06T06:52:53Z","date_created":"2020-04-16T08:59:15Z","type":"journal_article","department":[{"_id":"101"}],"publication":"Journal of Discrete Algorithms","citation":{"mla":"Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.” <i>Journal of Discrete Algorithms</i>, 2006, pp. 475–98, doi:<a href=\"https://doi.org/10.1016/j.jda.2005.12.009\">10.1016/j.jda.2005.12.009</a>.","bibtex":"@article{Monien_Preis_2006, title={Upper bounds on the Bisection Width of 3- and 4-regular Graphs}, DOI={<a href=\"https://doi.org/10.1016/j.jda.2005.12.009\">10.1016/j.jda.2005.12.009</a>}, journal={Journal of Discrete Algorithms}, author={Monien, Burkhard and Preis, Robert}, year={2006}, pages={475–498} }","ama":"Monien B, Preis R. Upper bounds on the Bisection Width of 3- and 4-regular Graphs. <i>Journal of Discrete Algorithms</i>. 2006:475-498. doi:<a href=\"https://doi.org/10.1016/j.jda.2005.12.009\">10.1016/j.jda.2005.12.009</a>","ieee":"B. Monien and R. Preis, “Upper bounds on the Bisection Width of 3- and 4-regular Graphs,” <i>Journal of Discrete Algorithms</i>, pp. 475–498, 2006.","apa":"Monien, B., &#38; Preis, R. (2006). Upper bounds on the Bisection Width of 3- and 4-regular Graphs. <i>Journal of Discrete Algorithms</i>, 475–498. <a href=\"https://doi.org/10.1016/j.jda.2005.12.009\">https://doi.org/10.1016/j.jda.2005.12.009</a>","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.” <i>Journal of Discrete Algorithms</i>, 2006, 475–98. <a href=\"https://doi.org/10.1016/j.jda.2005.12.009\">https://doi.org/10.1016/j.jda.2005.12.009</a>."}},{"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","author":[{"full_name":"Juurlink, Bernhardus","first_name":"Bernhardus","last_name":"Juurlink"},{"first_name":"Petr","last_name":"Kolman","full_name":"Kolman, Petr"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Rieping, Ingo","last_name":"Rieping","first_name":"Ingo"}],"publication_identifier":{"issn":["1570-8667"]},"title":"Optimal broadcast on parallel locality models","year":"2003","status":"public","user_id":"15415","doi":"10.1016/s1570-8667(03)00023-6","language":[{"iso":"eng"}],"_id":"16482","page":"151-166","citation":{"ieee":"B. Juurlink, P. Kolman, F. Meyer auf der Heide, and I. Rieping, “Optimal broadcast on parallel locality models,” <i>Journal of Discrete Algorithms</i>, pp. 151–166, 2003.","apa":"Juurlink, B., Kolman, P., Meyer auf der Heide, F., &#38; Rieping, I. (2003). Optimal broadcast on parallel locality models. <i>Journal of Discrete Algorithms</i>, 151–166. <a href=\"https://doi.org/10.1016/s1570-8667(03)00023-6\">https://doi.org/10.1016/s1570-8667(03)00023-6</a>","short":"B. Juurlink, P. Kolman, F. Meyer auf der Heide, I. Rieping, Journal of Discrete Algorithms (2003) 151–166.","chicago":"Juurlink, Bernhardus, Petr Kolman, Friedhelm Meyer auf der Heide, and Ingo Rieping. “Optimal Broadcast on Parallel Locality Models.” <i>Journal of Discrete Algorithms</i>, 2003, 151–66. <a href=\"https://doi.org/10.1016/s1570-8667(03)00023-6\">https://doi.org/10.1016/s1570-8667(03)00023-6</a>.","mla":"Juurlink, Bernhardus, et al. “Optimal Broadcast on Parallel Locality Models.” <i>Journal of Discrete Algorithms</i>, 2003, pp. 151–66, doi:<a href=\"https://doi.org/10.1016/s1570-8667(03)00023-6\">10.1016/s1570-8667(03)00023-6</a>.","bibtex":"@article{Juurlink_Kolman_Meyer auf der Heide_Rieping_2003, title={Optimal broadcast on parallel locality models}, DOI={<a href=\"https://doi.org/10.1016/s1570-8667(03)00023-6\">10.1016/s1570-8667(03)00023-6</a>}, journal={Journal of Discrete Algorithms}, author={Juurlink, Bernhardus and Kolman, Petr and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, year={2003}, pages={151–166} }","ama":"Juurlink B, Kolman P, Meyer auf der Heide F, Rieping I. Optimal broadcast on parallel locality models. <i>Journal of Discrete Algorithms</i>. 2003:151-166. doi:<a href=\"https://doi.org/10.1016/s1570-8667(03)00023-6\">10.1016/s1570-8667(03)00023-6</a>"},"publication":"Journal of Discrete Algorithms","department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-04-09T07:33:09Z"}]