---
_id: '16398'
author:
- first_name: Marcin
  full_name: Bienkowski, Marcin
  last_name: Bienkowski
- first_name: Jaroslaw
  full_name: Byrka, Jaroslaw
  last_name: Byrka
- first_name: Miroslaw
  full_name: Korzeniowski, Miroslaw
  last_name: Korzeniowski
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  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>
  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>
  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} }'
  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>.
  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.
  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>.
  short: M. Bienkowski, J. Byrka, M. Korzeniowski, F. Meyer auf der Heide, Journal
    of Discrete Algorithms (2009) 545–569.
date_created: 2020-04-03T10:40:45Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1016/j.jda.2008.07.006
language:
- iso: eng
page: 545-569
publication: Journal of Discrete Algorithms
publication_identifier:
  issn:
  - 1570-8667
publication_status: published
status: public
title: Optimal algorithms for page migration in dynamic networks
type: journal_article
user_id: '15415'
year: '2009'
...
---
_id: '16641'
author:
- first_name: Burkhard
  full_name: Monien, Burkhard
  last_name: Monien
- first_name: Robert
  full_name: Preis, Robert
  last_name: Preis
citation:
  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>
  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>
  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} }'
  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>.
  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.
  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>.
  short: B. Monien, R. Preis, Journal of Discrete Algorithms (2006) 475–498.
date_created: 2020-04-16T08:59:15Z
date_updated: 2022-01-06T06:52:53Z
department:
- _id: '101'
doi: 10.1016/j.jda.2005.12.009
language:
- iso: eng
page: 475-498
publication: Journal of Discrete Algorithms
publication_identifier:
  issn:
  - 1570-8667
publication_status: published
status: public
title: Upper bounds on the Bisection Width of 3- and 4-regular Graphs
type: journal_article
user_id: '15701'
year: '2006'
...
---
_id: '16482'
author:
- first_name: Bernhardus
  full_name: Juurlink, Bernhardus
  last_name: Juurlink
- first_name: Petr
  full_name: Kolman, Petr
  last_name: Kolman
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Ingo
  full_name: Rieping, Ingo
  last_name: Rieping
citation:
  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>
  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>
  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}
    }'
  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>.
  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.
  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>.
  short: B. Juurlink, P. Kolman, F. Meyer auf der Heide, I. Rieping, Journal of Discrete
    Algorithms (2003) 151–166.
date_created: 2020-04-09T07:33:09Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1016/s1570-8667(03)00023-6
language:
- iso: eng
page: 151-166
publication: Journal of Discrete Algorithms
publication_identifier:
  issn:
  - 1570-8667
publication_status: published
status: public
title: Optimal broadcast on parallel locality models
type: journal_article
user_id: '15415'
year: '2003'
...