Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/jgaa/Addario-BerryOV07,
  author       = {Louigi Addario{-}Berry and
                  Neil Olver and
                  Adrian Vetta},
  title        = {A Polynomial Time Algorithm for Finding Nash Equilibria in Planar
                  Win-Lose Games},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {1},
  pages        = {309--319},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00147},
  doi          = {10.7155/JGAA.00147},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/Addario-BerryOV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/BrandesFP07,
  author       = {Ulrik Brandes and
                  Daniel Fleischer and
                  Thomas Puppe},
  title        = {Dynamic Spectral Layout with an Application to Small Worlds},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {2},
  pages        = {325--343},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00149},
  doi          = {10.7155/JGAA.00149},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/BrandesFP07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/CabelloDR07,
  author       = {Sergio Cabello and
                  Erik D. Demaine and
                  G{\"{u}}nter Rote},
  title        = {Planar Embeddings of Graphs with Specified Edge Lengths},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {1},
  pages        = {259--276},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00145},
  doi          = {10.7155/JGAA.00145},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/CabelloDR07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/ConteFV07,
  author       = {Donatello Conte and
                  Pasquale Foggia and
                  Mario Vento},
  title        = {Challenging Complexity of Maximum Common Subgraph Detection Algorithms:
                  {A} Performance Analysis of Three Algorithms on a Wide Database of
                  Graphs},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {1},
  pages        = {99--143},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00139},
  doi          = {10.7155/JGAA.00139},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgaa/ConteFV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/DeanEGLST07,
  author       = {Alice M. Dean and
                  William S. Evans and
                  Ellen Gethner and
                  Joshua D. Laison and
                  Mohammad Ali Safari and
                  William T. Trotter},
  title        = {Bar k-Visibility Graphs},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {1},
  pages        = {45--59},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00136},
  doi          = {10.7155/JGAA.00136},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/DeanEGLST07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/EadesH07,
  author       = {Peter Eades and
                  Patrick Healy},
  title        = {Guest Editor's Foreword},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {2},
  pages        = {323--324},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00148},
  doi          = {10.7155/JGAA.00148},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/EadesH07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/EfratEK07,
  author       = {Alon Efrat and
                  Cesim Erten and
                  Stephen G. Kobourov},
  title        = {Fixed-Location Circular Arc Drawing of Planar Graphs},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {1},
  pages        = {145--164},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00140},
  doi          = {10.7155/JGAA.00140},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgaa/EfratEK07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/Eppstein07,
  author       = {David Eppstein},
  title        = {The Traveling Salesman Problem for Cubic Graphs},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {1},
  pages        = {61--81},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00137},
  doi          = {10.7155/JGAA.00137},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/Eppstein07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/GunawardenaM07,
  author       = {Athula Gunawardena and
                  Robert R. Meyer},
  title        = {Equi-partitioning of Higher-dimensional Hyper-rectangular Grid Graphs},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {1},
  pages        = {83--98},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00138},
  doi          = {10.7155/JGAA.00138},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/GunawardenaM07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/HachulJ07,
  author       = {Stefan Hachul and
                  Michael J{\"{u}}nger},
  title        = {Large-Graph Layout Algorithms at Work: An Experimental Study},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {2},
  pages        = {345--369},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00150},
  doi          = {10.7155/JGAA.00150},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/HachulJ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/HealyL07,
  author       = {Patrick Healy and
                  Karol Lynch},
  title        = {Building Blocks of Upward Planar Digraphs},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {1},
  pages        = {3--44},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00135},
  doi          = {10.7155/JGAA.00135},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/HealyL07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/HongNT07,
  author       = {Seok{-}Hee Hong and
                  Nikola S. Nikolov and
                  Alexandre Tarassov},
  title        = {A 2.5D Hierarchical Drawing of Directed Graphs},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {2},
  pages        = {371--396},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00151},
  doi          = {10.7155/JGAA.00151},
  timestamp    = {Thu, 27 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgaa/HongNT07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/HuangHE07,
  author       = {Weidong Huang and
                  Seok{-}Hee Hong and
                  Peter Eades},
  title        = {Effects of Sociogram Drawing Conventions and Edge Crossings in Social
                  Network Visualization},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {2},
  pages        = {397--429},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00152},
  doi          = {10.7155/JGAA.00152},
  timestamp    = {Thu, 27 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgaa/HuangHE07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/LinY07,
  author       = {Chun{-}Cheng Lin and
                  Hsu{-}Chun Yen},
  title        = {On Balloon Drawings of Rooted Trees},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {2},
  pages        = {431--452},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00153},
  doi          = {10.7155/JGAA.00153},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/LinY07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/Mezzini07,
  author       = {Mauro Mezzini},
  title        = {Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {1},
  pages        = {239--257},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00144},
  doi          = {10.7155/JGAA.00144},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgaa/Mezzini07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/MorganF07,
  author       = {Kerri Morgan and
                  Graham Farr},
  title        = {Approximation Algorithms for the Maximum Induced Planar and Outerplanar
                  Subgraph Problems},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {1},
  pages        = {165--193},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00141},
  doi          = {10.7155/JGAA.00141},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/MorganF07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/Noack07,
  author       = {Andreas Noack},
  title        = {Energy Models for Graph Clustering},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {2},
  pages        = {453--480},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00154},
  doi          = {10.7155/JGAA.00154},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/Noack07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/PapadopoulosV07,
  author       = {Charis Papadopoulos and
                  Constantinos Voglis},
  title        = {Drawing graphs using modular decomposition},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {2},
  pages        = {481--511},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00155},
  doi          = {10.7155/JGAA.00155},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgaa/PapadopoulosV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/PoulosBKPA07,
  author       = {Marios Poulos and
                  George Bokos and
                  Nikolaos Kanellopoulos and
                  Sozon Papavlasopoulos and
                  Markos Avlonitis},
  title        = {Specific Selection of {FFT} Amplitudes from Audio Sports and News
                  Broadcasting for Classification Purposes},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {1},
  pages        = {277--307},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00146},
  doi          = {10.7155/JGAA.00146},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/PoulosBKPA07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/RobertsK07,
  author       = {Ben Roberts and
                  Dirk P. Kroese},
  title        = {Estimating the Number of s-t Paths in a Graph},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {1},
  pages        = {195--214},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00142},
  doi          = {10.7155/JGAA.00142},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgaa/RobertsK07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgaa/WuM07,
  author       = {Xiaodong Wu and
                  Michael B. Merickel},
  title        = {Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical
                  Images},
  journal      = {J. Graph Algorithms Appl.},
  volume       = {11},
  number       = {1},
  pages        = {215--237},
  year         = {2007},
  url          = {https://doi.org/10.7155/jgaa.00143},
  doi          = {10.7155/JGAA.00143},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgaa/WuM07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.