Search dblp for Publications

export results for "toc:db/journals/jgaa/jgaa5.bht:"

 download as .bib file

@article{DBLP:journals/jgaa/Bar-YehudaEFN01,
  author    = {Reuven Bar{-}Yehuda and
               Guy Even and
               Jon Feldman and
               Joseph Naor},
  title     = {Computing an Optimal Orientation of a Balanced Decomposition Tree
               for Linear Arrangement Problems},
  journal   = {J. Graph Algorithms Appl.},
  volume    = {5},
  number    = {4},
  pages     = {1--27},
  year      = {2001},
  url       = {https://doi.org/10.7155/jgaa.00035},
  doi       = {10.7155/jgaa.00035},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jgaa/Bar-YehudaEFN01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Biedl01,
  author    = {Therese C. Biedl},
  title     = {1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved},
  journal   = {J. Graph Algorithms Appl.},
  volume    = {5},
  number    = {3},
  pages     = {1--15},
  year      = {2001},
  url       = {https://doi.org/10.7155/jgaa.00034},
  doi       = {10.7155/jgaa.00034},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jgaa/Biedl01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ClossonGJW01,
  author    = {Michael Closson and
               Shane Gartshore and
               John R. Johansen and
               Stephen K. Wismath},
  title     = {Fully Dynamic 3-Dimensional Orthogonal Graph Drawing},
  journal   = {J. Graph Algorithms Appl.},
  volume    = {5},
  number    = {2},
  pages     = {1--34},
  year      = {2001},
  url       = {https://doi.org/10.7155/jgaa.00033},
  doi       = {10.7155/jgaa.00033},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jgaa/ClossonGJW01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FraysseixM01,
  author    = {Hubert de Fraysseix and
               Patrice Ossona de Mendez},
  title     = {Connectivity of Planar Graphs},
  journal   = {J. Graph Algorithms Appl.},
  volume    = {5},
  number    = {5},
  pages     = {93--105},
  year      = {2001},
  url       = {https://doi.org/10.7155/jgaa.00041},
  doi       = {10.7155/jgaa.00041},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jgaa/FraysseixM01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/IwamaKM01,
  author    = {Kazuo Iwama and
               Yahiko Kambayashi and
               Eiji Miyano},
  title     = {New Bounds for Oblivious Mesh Routing},
  journal   = {J. Graph Algorithms Appl.},
  volume    = {5},
  number    = {5},
  pages     = {17--38},
  year      = {2001},
  url       = {https://doi.org/10.7155/jgaa.00038},
  doi       = {10.7155/jgaa.00038},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jgaa/IwamaKM01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LeePC01,
  author    = {Jae{-}Ha Lee and
               Chong{-}Dae Park and
               Kyung{-}Yong Chwa},
  title     = {Carrying Umbrellas: an Online Relocation Game on a Graph},
  journal   = {J. Graph Algorithms Appl.},
  volume    = {5},
  number    = {5},
  pages     = {3--16},
  year      = {2001},
  url       = {https://doi.org/10.7155/jgaa.00037},
  doi       = {10.7155/jgaa.00037},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jgaa/LeePC01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Liebers01,
  author    = {Annegret Liebers},
  title     = {Planarizing Graphs - {A} Survey and Annotated Bibliography},
  journal   = {J. Graph Algorithms Appl.},
  volume    = {5},
  number    = {1},
  pages     = {1--74},
  year      = {2001},
  url       = {https://doi.org/10.7155/jgaa.00032},
  doi       = {10.7155/jgaa.00032},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jgaa/Liebers01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Muller-Hannemann01,
  author    = {Matthias M{\"{u}}ller{-}Hannemann},
  title     = {Shelling Hexahedral Complexes for Mesh Generation},
  journal   = {J. Graph Algorithms Appl.},
  volume    = {5},
  number    = {5},
  pages     = {59--91},
  year      = {2001},
  url       = {https://doi.org/10.7155/jgaa.00040},
  doi       = {10.7155/jgaa.00040},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jgaa/Muller-Hannemann01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/NardelliPW01,
  author    = {Enrico Nardelli and
               Guido Proietti and
               Peter Widmayer},
  title     = {Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under
               Transient Edge Failures},
  journal   = {J. Graph Algorithms Appl.},
  volume    = {5},
  number    = {5},
  pages     = {39--57},
  year      = {2001},
  url       = {https://doi.org/10.7155/jgaa.00039},
  doi       = {10.7155/jgaa.00039},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jgaa/NardelliPW01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/NishizekiTW01,
  author    = {Takao Nishizeki and
               Roberto Tamassia and
               Dorothea Wagner},
  title     = {Guest Editors' Foreword},
  journal   = {J. Graph Algorithms Appl.},
  volume    = {5},
  number    = {5},
  pages     = {1},
  year      = {2001},
  url       = {https://doi.org/10.7155/jgaa.00036},
  doi       = {10.7155/jgaa.00036},
  timestamp = {Thu, 09 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jgaa/NishizekiTW01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics