default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:streams/journals/jgaa:"
download as .bib file
@article{DBLP:journals/jgaa/BaudinMT24,
author = {Alexis Baudin and
Cl{\'{e}}mence Magnien and
Lionel Tabourier},
title = {Faster maximal clique enumeration in large real-world link streams},
journal = {J. Graph Algorithms Appl.},
volume = {28},
number = {1},
pages = {149--178},
year = {2024},
url = {https://doi.org/10.7155/jgaa.v28i1.2932},
doi = {10.7155/JGAA.V28I1.2932},
timestamp = {Wed, 26 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BaudinMT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BiniazK24,
author = {Ahmad Biniaz and
Parham Khamsepour},
title = {The Minimum Consistent Spanning Subset Problem on Trees},
journal = {J. Graph Algorithms Appl.},
volume = {28},
number = {1},
pages = {81--93},
year = {2024},
url = {https://doi.org/10.7155/jgaa.v28i1.2929},
doi = {10.7155/JGAA.V28I1.2929},
timestamp = {Wed, 26 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BiniazK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BinucciBBDD00LM24,
author = {Carla Binucci and
Aaron B{\"{u}}ngener and
Giuseppe Di Battista and
Walter Didimo and
Vida Dujmovic and
Seok{-}Hee Hong and
Michael Kaufmann and
Giuseppe Liotta and
Pat Morin and
Alessandra Tappini},
title = {Min-\emph{k}-planar Drawings of Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {28},
number = {2},
pages = {1--35},
year = {2024},
url = {https://doi.org/10.7155/jgaa.v28i2.2925},
doi = {10.7155/JGAA.V28I2.2925},
timestamp = {Wed, 26 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BinucciBBDD00LM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DehkordiF24,
author = {Hooman Reisi Dehkordi and
Graham Farr},
title = {Thrackles, Superthrackles and the Hanani-Tutte Theorem},
journal = {J. Graph Algorithms Appl.},
volume = {28},
number = {1},
pages = {95--127},
year = {2024},
url = {https://doi.org/10.7155/jgaa.v28i1.2930},
doi = {10.7155/JGAA.V28I1.2930},
timestamp = {Wed, 26 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/DehkordiF24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KainenJO24,
author = {Paul C. Kainen and
Samuel Joslin and
Shannon Overbay},
title = {On Dispersability of Some Circulant Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {28},
number = {1},
pages = {225--241},
year = {2024},
url = {https://doi.org/10.7155/jgaa.v28i1.2941},
doi = {10.7155/JGAA.V28I1.2941},
timestamp = {Wed, 26 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KainenJO24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LeR24,
author = {Van Bang Le and
Christian Rosenke},
title = {Computing Optimal Leaf Roots of Chordal Cographs in Linear Time},
journal = {J. Graph Algorithms Appl.},
volume = {28},
number = {1},
pages = {243--274},
year = {2024},
url = {https://doi.org/10.7155/jgaa.v28i1.2942},
doi = {10.7155/JGAA.V28I1.2942},
timestamp = {Wed, 26 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/LeR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MadaniM24,
author = {Amirali Madani and
Anil Maheshwari},
title = {Distance-Preserving Graph Compression Techniques},
journal = {J. Graph Algorithms Appl.},
volume = {28},
number = {1},
year = {2024},
url = {https://doi.org/10.7155/jgaa.v28i1.2933},
doi = {10.7155/JGAA.V28I1.2933},
timestamp = {Wed, 26 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/MadaniM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Mkrtchyan24,
author = {Vahan Mkrtchyan},
title = {The maximum 2-edge-colorable subgraph problem and its fixed-parameter
tractability},
journal = {J. Graph Algorithms Appl.},
volume = {28},
number = {1},
pages = {129--147},
year = {2024},
url = {https://doi.org/10.7155/jgaa.v28i1.2931},
doi = {10.7155/JGAA.V28I1.2931},
timestamp = {Wed, 26 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Mkrtchyan24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/SchestagGKS24,
author = {Jannik Schestag and
Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Frank Sommer},
title = {On Critical Node Problems with Vulnerable Vertices},
journal = {J. Graph Algorithms Appl.},
volume = {28},
number = {1},
pages = {1--26},
year = {2024},
url = {https://doi.org/10.7155/jgaa.v28i1.2922},
doi = {10.7155/JGAA.V28I1.2922},
timestamp = {Wed, 26 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/SchestagGKS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Toth24,
author = {Csaba T{\'{o}}th},
title = {On {RAC} Drawings of Graphs with Two Bends per Edge},
journal = {J. Graph Algorithms Appl.},
volume = {28},
number = {2},
pages = {37--45},
year = {2024},
url = {https://doi.org/10.7155/jgaa.v28i2.2939},
doi = {10.7155/JGAA.V28I2.2939},
timestamp = {Wed, 26 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Toth24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AkitayaBBCMSS23,
author = {Hugo A. Akitaya and
Ahmad Biniaz and
Prosenjit Bose and
Jean{-}Lou De Carufel and
Anil Maheshwari and
Lu{\'{\i}}s Fernando Schultz Xavier da Silveira and
Michiel Smid},
title = {The Minimum Moving Spanning Tree Problem},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {1},
pages = {1--18},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00607},
doi = {10.7155/JGAA.00607},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AkitayaBBCMSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniH23,
author = {Patrizio Angelini and
Reinhard von Hanxleden},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {8},
pages = {621--623},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00642},
doi = {10.7155/JGAA.00642},
timestamp = {Wed, 13 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ArrighiFOW23,
author = {Emmanuel Arrighi and
Henning Fernau and
Mateus de Oliveira Oliveira and
Petra Wolf},
title = {Order Reconfiguration under Width Constraints},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {6},
pages = {409--431},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00628},
doi = {10.7155/JGAA.00628},
timestamp = {Wed, 13 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ArrighiFOW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ArroyoF23,
author = {Alan Arroyo and
Stefan Felsner},
title = {Approximating the Bundled Crossing Number},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {6},
pages = {433--457},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00629},
doi = {10.7155/JGAA.00629},
timestamp = {Wed, 13 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ArroyoF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ArsenevaGI23,
author = {Elena Arseneva and
Rahul Gangopadhyay and
Aleksandra Istomina},
title = {Morphing tree drawings in a small 3D grid},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {4},
pages = {241--279},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00623},
doi = {10.7155/JGAA.00623},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ArsenevaGI23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BattistaDGGOPT23,
author = {Giuseppe Di Battista and
Walter Didimo and
Luca Grilli and
Fabrizio Grosso and
Giacomo Ortali and
Maurizio Patrignani and
Alessandra Tappini},
title = {Small Point-Sets Supporting Graph Stories},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {8},
pages = {651--677},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00639},
doi = {10.7155/JGAA.00639},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BattistaDGGOPT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BinucciDP23,
author = {Carla Binucci and
Walter Didimo and
Maurizio Patrignani},
title = {\emph{st}-Orientations with Few Transitive Edges},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {8},
pages = {625--650},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00638},
doi = {10.7155/JGAA.00638},
timestamp = {Wed, 26 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BinucciDP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CalderoniMM23,
author = {Luca Calderoni and
Luciano Margara and
Moreno Marzolla},
title = {A Heuristic for Direct Product Graph Decomposition},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {7},
pages = {581--601},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00635},
doi = {10.7155/JGAA.00635},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/CalderoniMM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CarmesinS23,
author = {Sarah Carmesin and
Andr{\'{e}} Schulz},
title = {Arrangements of orthogonal circles with many intersections},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {2},
pages = {49--70},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00614},
doi = {10.7155/JGAA.00614},
timestamp = {Sun, 19 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CarmesinS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChaplickFLRVW23,
author = {Steven Chaplick and
Krzysztof Fleszar and
Fabian Lipp and
Alexander Ravsky and
Oleg Verbitsky and
Alexander Wolff},
title = {The Complexity of Drawing Graphs on Few Lines and Few Planes},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {6},
pages = {459--488},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00630},
doi = {10.7155/JGAA.00630},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ChaplickFLRVW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChimaniH23,
author = {Markus Chimani and
Petr Hlinen{\'{y}}},
title = {Inserting Multiple Edges into a Planar Graph},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {6},
pages = {489--522},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00631},
doi = {10.7155/JGAA.00631},
timestamp = {Wed, 13 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ChimaniH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChimaniIW23,
author = {Markus Chimani and
Max Ilsen and
Tilo Wiedera},
title = {Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {2},
pages = {71--94},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00615},
doi = {10.7155/JGAA.00615},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ChimaniIW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Cleary23,
author = {Sean Cleary},
title = {Restricted rotation distance between k-ary trees},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {1},
pages = {19--33},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00611},
doi = {10.7155/JGAA.00611},
timestamp = {Thu, 28 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Cleary23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CornelsenD23,
author = {Sabine Cornelsen and
Gregor Diatzko},
title = {Planar Confluent Orthogonal Drawings of 4-Modal Digraphs},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {7},
pages = {523--540},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00632},
doi = {10.7155/JGAA.00632},
timestamp = {Wed, 13 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CornelsenD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DidimoKLO23,
author = {Walter Didimo and
Michael Kaufmann and
Giuseppe Liotta and
Giacomo Ortali},
title = {Rectilinear Planarity of Partial 2-Trees},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {8},
pages = {679--719},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00640},
doi = {10.7155/JGAA.00640},
timestamp = {Wed, 13 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DidimoKLO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DurrschnabelHS23,
author = {Dominik D{\"{u}}rrschnabel and
Tom Hanika and
Gerd Stumme},
title = {Drawing Order Diagrams Through Two-Dimension Extension},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {9},
pages = {783--802},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00645},
doi = {10.7155/JGAA.00645},
timestamp = {Wed, 13 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DurrschnabelHS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EppsteinLW23,
author = {David Eppstein and
Andrea Lincoln and
Virginia {Vassilevska Williams}},
title = {Quasipolynomiality of the Smallest Missing Induced Subgraph},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {5},
pages = {329--339},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00625},
doi = {10.7155/JGAA.00625},
timestamp = {Wed, 13 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EppsteinLW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EricksonL23,
author = {Jeff Erickson and
Patrick Lin},
title = {Planar and Toroidal Morphs Made Easier},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {2},
pages = {95--118},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00616},
doi = {10.7155/JGAA.00616},
timestamp = {Sun, 19 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EricksonL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GarciaTVW23,
author = {Alfredo Garc{\'{\i}}a and
Javier Tejel and
Birgit Vogtenhuber and
Alexandra Weinberger},
title = {Empty Triangles in Generalized Twisted Drawings of K\({}_{\mbox{n}}\)},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {8},
pages = {721--735},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00637},
doi = {10.7155/JGAA.00637},
timestamp = {Thu, 27 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/GarciaTVW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GeladarisLT23,
author = {Vasileios Geladaris and
Panagiotis Lionakis and
Ioannis G. Tollis},
title = {Effective Computation of a Feedback Arc Set Using PageRank},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {8},
pages = {737--757},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00641},
doi = {10.7155/JGAA.00641},
timestamp = {Wed, 13 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GeladarisLT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GotsmanH23,
author = {Craig Gotsman and
Kai Hormann},
title = {Efficient Point-to-Point Resistance Distance Queries in Large Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {1},
pages = {35--44},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00612},
doi = {10.7155/JGAA.00612},
timestamp = {Thu, 28 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GotsmanH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HuberMS23,
author = {Katharina T. Huber and
Vincent Moulton and
Andreas Spillner},
title = {Computing consensus networks for collections of 1-nested phylogenetic
networks},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {7},
pages = {541--563},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00633},
doi = {10.7155/JGAA.00633},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HuberMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Jacomy23,
author = {Mathieu Jacomy},
title = {Connected-closeness: {A} Visual Quantification of Distances in Network
Layouts},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {5},
pages = {341--404},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00626},
doi = {10.7155/JGAA.00626},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Jacomy23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/JainPR23,
author = {Sparsh Jain and
Sreejith K. Pallathumadam and
Deepak Rajendraprasad},
title = {{B0-VPG} Representation of AT-free Outerplanar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {9},
pages = {853--869},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00648},
doi = {10.7155/JGAA.00648},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/JainPR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KatsikarelisLP23,
author = {Ioannis Katsikarelis and
Michael Lampis and
Vangelis Th. Paschos},
title = {Improved (In-)Approximability Bounds for d-Scattered Set},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {3},
pages = {219--238},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00621},
doi = {10.7155/JGAA.00621},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KatsikarelisLP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KindermannSW23,
author = {Philipp Kindermann and
Jan Sauer and
Alexander Wolff},
title = {The Computational Complexity of the ChordLink Model},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {9},
pages = {759--767},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00643},
doi = {10.7155/JGAA.00643},
timestamp = {Wed, 13 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KindermannSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KlawitterZ23,
author = {Jonathan Klawitter and
Johannes Zink},
title = {Upward Planar Drawings with Three and More Slopes},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {2},
pages = {49--70},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00617},
doi = {10.7155/JGAA.00617},
timestamp = {Wed, 14 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KlawitterZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KlemzKRS23,
author = {Boris Klemz and
Kristin Knorr and
Meghana M. Reddy and
Felix Schr{\"{o}}der},
title = {Simplifying Non-Simple Fan-Planar Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {2},
pages = {147--172},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00618},
doi = {10.7155/JGAA.00618},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KlemzKRS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LimaSV23,
author = {Alane M. de Lima and
Murilo V. G. da Silva and
Andr{\'{e}} Lu{\'{\i}}s Vignatti},
title = {A Range Space with Constant {VC} Dimension for All-pairs Shortest
Paths in Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {7},
pages = {603--619},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00636},
doi = {10.7155/JGAA.00636},
timestamp = {Wed, 13 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/LimaSV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LozzoK23,
author = {Giordano Da Lozzo and
Philipp Kindermann},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {6},
pages = {405--408},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00627},
doi = {10.7155/JGAA.00627},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/LozzoK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/NishatSW23,
author = {Rahnuma Islam Nishat and
Venkatesh Srinivasan and
Sue Whitesides},
title = {1-Complex \emph{s,t} Hamiltonian Paths: Structure and Reconfiguration
in Rectangular Grids},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {4},
pages = {281--327},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00624},
doi = {10.7155/JGAA.00624},
timestamp = {Wed, 26 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/NishatSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RahmanMS23,
author = {Md. Saidur Rahman and
Petra Mutzel and
S. Slamin},
title = {Guest Editors' forewords},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {4},
pages = {239--240},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00622},
doi = {10.7155/JGAA.00622},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RahmanMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RajanGJ23,
author = {R. Sundara Rajan and
A. Berin Greeni and
P. Leo Joshwa},
title = {Minimum Linear Arrangement of Generalized Sierpinski Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {9},
pages = {767--782},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00644},
doi = {10.7155/JGAA.00644},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RajanGJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RutterP23,
author = {Ignaz Rutter and
Helen C. Purchase},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {2},
pages = {45--47},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00613},
doi = {10.7155/JGAA.00613},
timestamp = {Sun, 19 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RutterP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RymarMNN23,
author = {Maciej Rymar and
Hendrik Molter and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness
Centrality},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {3},
pages = {173--194},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00619},
doi = {10.7155/JGAA.00619},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/RymarMNN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Schaefer23,
author = {Marcus Schaefer},
title = {The Complexity of Angular Resolution},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {7},
pages = {565--580},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00634},
doi = {10.7155/JGAA.00634},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Schaefer23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Schaefer23a,
author = {Marcus Schaefer},
title = {RAC-Drawability is {\(\exists\)}{\(\mathbb{R}\)}-complete and Related
Results},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {9},
pages = {803--841},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00646},
doi = {10.7155/JGAA.00646},
timestamp = {Wed, 13 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Schaefer23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/SimardML23,
author = {Fr{\'{e}}d{\'{e}}ric Simard and
Cl{\'{e}}mence Magnien and
Matthieu Latapy},
title = {Computing Betweenness Centrality in Link Streams},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {3},
pages = {195--217},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00620},
doi = {10.7155/JGAA.00620},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/SimardML23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Wood23,
author = {David R. Wood},
title = {2-Layer Graph Drawings with Bounded Pathwidth},
journal = {J. Graph Algorithms Appl.},
volume = {27},
number = {9},
pages = {843--851},
year = {2023},
url = {https://doi.org/10.7155/jgaa.00647},
doi = {10.7155/JGAA.00647},
timestamp = {Wed, 13 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Wood23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AichholzerAMPPP22,
author = {Oswin Aichholzer and
Alan Arroyo and
Zuzana Mas{\'{a}}rov{\'{a}} and
Irene Parada and
Daniel Perz and
Alexander Pilz and
Josef Tkadlec and
Birgit Vogtenhuber},
title = {On Compatible Matchings},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {2},
pages = {225--240},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00591},
doi = {10.7155/JGAA.00591},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AichholzerAMPPP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniCCL22,
author = {Patrizio Angelini and
Steven Chaplick and
Sabine Cornelsen and
Giordano Da Lozzo},
title = {Planar L-Drawings of Bimodal Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {3},
pages = {307--334},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00596},
doi = {10.7155/JGAA.00596},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniCCL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BaderB22,
author = {David A. Bader and
Paul Burkhardt},
title = {A Simple and Efficient Algorithm for Finding Minimum Spanning Tree
Replacement Edges},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {577--588},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00609},
doi = {10.7155/JGAA.00609},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BaderB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BalzottiF22,
author = {Lorenzo Balzotti and
Paolo Giulio Franciosa},
title = {Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs
in Linear Time},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {589--606},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00610},
doi = {10.7155/JGAA.00610},
timestamp = {Fri, 12 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BalzottiF22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BekosBBDGKPR22,
author = {Michael A. Bekos and
Carla Binucci and
Giuseppe Di Battista and
Walter Didimo and
Martin Gronemann and
Karsten Klein and
Maurizio Patrignani and
Ignaz Rutter},
title = {On Turn-Regular Orthogonal Representations},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {3},
pages = {285--306},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00595},
doi = {10.7155/JGAA.00595},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BekosBBDGKPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BelbasiF22,
author = {Mahdi Belbasi and
Martin F{\"{u}}rer},
title = {An Improvement of Reed's Treewidth Approximation},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {2},
pages = {257--282},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00593},
doi = {10.7155/JGAA.00593},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BelbasiF22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BestW22,
author = {Darcy Best and
Max Ward},
title = {A faster algorithm for maximum independent set on interval filament
graphs},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {199--205},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00588},
doi = {10.7155/JGAA.00588},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BestW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BeusekomPS22,
author = {Nathan van Beusekom and
Irene Parada and
Bettina Speckmann},
title = {Crossing Numbers of Beyond-Planar Graphs Revisited},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {149--170},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00586},
doi = {10.7155/JGAA.00586},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BeusekomPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BhoreGMN22,
author = {Sujoy Bhore and
Robert Ganian and
Fabrizio Montecchiani and
Martin N{\"{o}}llenburg},
title = {Parameterized Algorithms for Queue Layouts},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {3},
pages = {335--352},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00597},
doi = {10.7155/JGAA.00597},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BhoreGMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Biedl22,
author = {Therese Biedl},
title = {Drawing outer-1-planar graphs revisited},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {59--73},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00581},
doi = {10.7155/JGAA.00581},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Biedl22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BiedlS22,
author = {Therese Biedl and
Milap Sheth},
title = {Drawing Halin-graphs with small height},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {473--502},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00604},
doi = {10.7155/JGAA.00604},
timestamp = {Fri, 12 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BiedlS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Biniaz22,
author = {Ahmad Biniaz},
title = {A short proof of the non-biplanarity of K\({}_{\mbox{9}}\)},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {75--80},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00582},
doi = {10.7155/JGAA.00582},
timestamp = {Wed, 26 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Biniaz22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Biniaz22a,
author = {Ahmad Biniaz},
title = {Better approximation algorithms for maximum weight internal spanning
trees in cubic graphs and claw-free graphs},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {2},
pages = {209--224},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00590},
doi = {10.7155/JGAA.00590},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Biniaz22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BokalCNSSWW22,
author = {Drago Bokal and
Markus Chimani and
Alexander Nover and
J{\"{o}}ran Schierbaum and
Tobias Stolzmann and
Mirko H. Wagner and
Tilo Wiedera},
title = {Properties of Large 2-Crossing-Critical Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {111--147},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00585},
doi = {10.7155/JGAA.00585},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BokalCNSSWW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BoomariZ22,
author = {Hossein Boomari and
Alireza Zarei},
title = {Visibility Graphs of Anchor Polygons},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {15--34},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00579},
doi = {10.7155/JGAA.00579},
timestamp = {Wed, 12 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BoomariZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CaiHSL22,
author = {Shijun Cai and
Seok{-}Hee Hong and
Jialiang Shen and
Tongliang Liu},
title = {A Machine Learning Approach for Predicting Human Preference for Graph
Layouts},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {447--471},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00603},
doi = {10.7155/JGAA.00603},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/CaiHSL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CelaG22,
author = {Eranda {\c{C}}ela and
Elisabeth Gaar},
title = {Monotonic Representations of Outerplanar Graphs as Edge Intersection
Graphs of Paths on a Grid},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {519--552},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00606},
doi = {10.7155/JGAA.00606},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/CelaG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CornelsenPFGHKS22,
author = {Sabine Cornelsen and
Maximilian Pfister and
Henry F{\"{o}}rster and
Martin Gronemann and
Michael Hoffmann and
Stephen G. Kobourov and
Thomas Schneck},
title = {Drawing Shortest Paths in Geodetic Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {3},
pages = {353--361},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00598},
doi = {10.7155/JGAA.00598},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/CornelsenPFGHKS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EfratFKT22,
author = {Alon Efrat and
Radoslav Fulek and
Stephen G. Kobourov and
Csaba D. T{\'{o}}th},
title = {Polygons with Prescribed Angles in 2D and 3D},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {3},
pages = {363--380},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00599},
doi = {10.7155/JGAA.00599},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/EfratFKT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FelsnerHKKP22,
author = {Stefan Felsner and
Michael Hoffmann and
Kristin Knorr and
Jan Kyncl and
Irene Parada},
title = {On the Maximum Number of Crossings in Star-Simple Drawings of K\({}_{\mbox{n}}\)
with No Empty Lens},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {3},
pages = {381--399},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00600},
doi = {10.7155/JGAA.00600},
timestamp = {Wed, 26 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/FelsnerHKKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FennerGGKT22,
author = {Stephen A. Fenner and
Daniel Grier and
Rohit Gurjar and
Arpita Korwar and
Thomas Thierauf},
title = {The Complexity of Poset Games},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {1--14},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00578},
doi = {10.7155/JGAA.00578},
timestamp = {Wed, 12 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/FennerGGKT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FischerGW22,
author = {Mareike Fischer and
Michelle Galla and
Kristina Wicke},
title = {Non-binary universal tree-based networks},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {81--90},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00583},
doi = {10.7155/JGAA.00583},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/FischerGW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HanakaKO22,
author = {Tesshu Hanaka and
Kazuma Kawai and
Hirotaka Ono},
title = {Computing L(p, 1)-Labeling with Combined Parameters},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {2},
pages = {241--255},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00592},
doi = {10.7155/JGAA.00592},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HanakaKO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HongNU22,
author = {Seok{-}Hee Hong and
Subhas C. Nandy and
Ryuhei Uehara},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {2},
pages = {207--208},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00589},
doi = {10.7155/JGAA.00589},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/HongNU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HullMNT22,
author = {Thomas C. Hull and
Manuel Morales and
Sarah Nash and
Natalya Ter{-}Saakov},
title = {Maximal origami flip graphs of flat-foldable vertices: properties
and algorithms},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {503--517},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00605},
doi = {10.7155/JGAA.00605},
timestamp = {Fri, 12 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/HullMNT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KeilMMN22,
author = {J. Mark Keil and
Debajyoti Mondal and
Ehsan Moradi and
Yakov Nekrich},
title = {Finding a Maximum Clique in a Grounded 1-Bend String Graph},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {553--575},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00608},
doi = {10.7155/JGAA.00608},
timestamp = {Fri, 12 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KeilMMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KellerhalsK22,
author = {Leon Kellerhals and
Tomohiro Koana},
title = {Parameterized Complexity of Geodetic Set},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {4},
pages = {401--419},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00601},
doi = {10.7155/JGAA.00601},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KellerhalsK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KlawitterM22,
author = {Jonathan Klawitter and
Tamara Mchedlidze},
title = {Upward planar drawings with two slopes},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {171--198},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00587},
doi = {10.7155/JGAA.00587},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KlawitterM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Liotta22,
author = {Giuseppe Liotta},
title = {Editor in Chief's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {3},
pages = {283--284},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00594},
doi = {10.7155/JGAA.00594},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Liotta22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LubiwMM22,
author = {Anna Lubiw and
Tillmann Miltzow and
Debajyoti Mondal},
title = {The Complexity of Drawing a Graph in a Polygonal Region},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {4},
pages = {421--446},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00602},
doi = {10.7155/JGAA.00602},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/LubiwMM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MkrtchyanP22,
author = {Vahan Mkrtchyan and
Garik Petrosyan},
title = {On the fixed-parameter tractability of the partial vertex cover problem
with a matching constraint in edge-weighted bipartite graphs},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {91--110},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00584},
doi = {10.7155/JGAA.00584},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/MkrtchyanP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/SchaferS22,
author = {Marcus Sch{\"{a}}fer and
Daniel Stefankovic},
title = {The Degenerate Crossing Number and Higher-Genus Embeddings},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {35--58},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00580},
doi = {10.7155/JGAA.00580},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/SchaferS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AcunaLISSS21,
author = {Vicente Acu{\~{n}}a and
Leandro Ishi Soares de Lima and
Giuseppe F. Italiano and
Luca Pep{\`{e}} Sciarria and
Marie{-}France Sagot and
Blerina Sinaimeri},
title = {A family of tree-based generators for bubbles in directed graphs},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {563--580},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00572},
doi = {10.7155/JGAA.00572},
timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AcunaLISSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniRS21,
author = {Patrizio Angelini and
Ignaz Rutter and
T. P. Sandhya},
title = {Extending Partial Orthogonal Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {581--602},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00573},
doi = {10.7155/JGAA.00573},
timestamp = {Wed, 24 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BarthBJR21,
author = {Lukas Barth and
Guido Br{\"{u}}ckner and
Paul Jungeblut and
Marcel Radermacher},
title = {Multilevel Planarity},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {151--170},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00554},
doi = {10.7155/JGAA.00554},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BarthBJR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BattistaFPT21,
author = {Giuseppe Di Battista and
Fabrizio Frati and
Maurizio Patrignani and
Marco Tais},
title = {Schematic Representation of Large Biconnected Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {311--352},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00560},
doi = {10.7155/JGAA.00560},
timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BattistaFPT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BentertW21,
author = {Matthias Bentert and
Mathias Weller},
title = {Tree Containment With Soft Polytomies},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {417--436},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00565},
doi = {10.7155/JGAA.00565},
timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BentertW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Boyer21,
author = {John M. Boyer},
title = {Revising the Fellows-Kaschube {\textdollar}K{\_}\{3, 3\}{\textdollar}
Search},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {513--520},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00569},
doi = {10.7155/JGAA.00569},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Boyer21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BrownF21,
author = {Paul Brown and
Trevor I. Fenner},
title = {Fast Generation of Unlabelled Free Trees using Weight Sequences},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {219--240},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00556},
doi = {10.7155/JGAA.00556},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BrownF21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BrucknerR21,
author = {Guido Br{\"{u}}ckner and
Ignaz Rutter},
title = {Radial Level Planarity with Fixed Embedding},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {353--366},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00561},
doi = {10.7155/JGAA.00561},
timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BrucknerR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DujmovicMY21,
author = {Vida Dujmovic and
Pat Morin and
C{\'{e}}line Yelle},
title = {Two Results on Layered Pathwidth and Linear Layouts},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {43--57},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00549},
doi = {10.7155/JGAA.00549},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/DujmovicMY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein21,
author = {David Eppstein},
title = {Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {549--562},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00571},
doi = {10.7155/JGAA.00571},
timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EvansFKK21,
author = {William S. Evans and
Stefan Felsner and
Linda Kleist and
Stephen G. Kobourov},
title = {On Area-Universal Quadrangulations},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {171--193},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00555},
doi = {10.7155/JGAA.00555},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EvansFKK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EvansGSW21,
author = {William S. Evans and
Ellen Gethner and
Jack Spalding{-}Jamieson and
Alexander Wolff},
title = {Angle Covers: Algorithms and Complexity},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {2},
pages = {643--661},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00576},
doi = {10.7155/JGAA.00576},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EvansGSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FabriciHMS21,
author = {Igor Fabrici and
Jochen Harant and
Samuel Mohr and
Jens M. Schmidt},
title = {Circumference of essentially 4-connected planar triangulations},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {121--132},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00552},
doi = {10.7155/JGAA.00552},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/FabriciHMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FigielHNN21,
author = {Aleksander Figiel and
Anne{-}Sophie Himmel and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {521--547},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00570},
doi = {10.7155/JGAA.00570},
timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/FigielHNN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FischerL21,
author = {Mareike Fischer and
Volkmar Liebscher},
title = {On the Balance of Unrooted Trees},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {133--150},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00553},
doi = {10.7155/JGAA.00553},
timestamp = {Wed, 11 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/FischerL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ForsterGKN21,
author = {Henry F{\"{o}}rster and
Robert Ganian and
Fabian Klute and
Martin N{\"{o}}llenburg},
title = {On Strict (Outer-)Confluent Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {481--512},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00568},
doi = {10.7155/JGAA.00568},
timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ForsterGKN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Hertz21,
author = {Alain Hertz},
title = {Decycling bipartite graphs},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {461--480},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00567},
doi = {10.7155/JGAA.00567},
timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Hertz21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Janssen21,
author = {Remie Janssen},
title = {Heading in the right direction? Using head moves to traverse phylogenetic
network space},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {263--310},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00559},
doi = {10.7155/JGAA.00559},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Janssen21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KangL21,
author = {Ming{-}Hsuan Kang and
Wu{-}Hsiung Lin},
title = {Equilateral Spherical Drawings of Planar Cayley Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {97--119},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00551},
doi = {10.7155/JGAA.00551},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KangL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KaufmannKLMRV21,
author = {Michael Kaufmann and
Jan Kratochv{\'{\i}}l and
Fabian Lipp and
Fabrizio Montecchiani and
Chrysanthi N. Raftopoulou and
Pavel Valtr},
title = {The Stub Resolution of 1-planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {2},
pages = {625--642},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00575},
doi = {10.7155/JGAA.00575},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KaufmannKLMRV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KaufmannPTU21,
author = {Michael Kaufmann and
J{\'{a}}nos Pach and
G{\'{e}}za T{\'{o}}th and
Torsten Ueckerdt},
title = {The number of crossings in multigraphs with no empty lens},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {383--396},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00563},
doi = {10.7155/JGAA.00563},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KaufmannPTU21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KindermannMSS21,
author = {Philipp Kindermann and
Fabrizio Montecchiani and
Lena Schlipf and
Andr{\'{e}} Schulz},
title = {Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large
Angles},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {1--28},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00547},
doi = {10.7155/JGAA.00547},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KindermannMSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LucaGHKLLMTW21,
author = {Felice De Luca and
Emilio Di Giacomo and
Seok{-}Hee Hong and
Stephen G. Kobourov and
William J. Lenhart and
Giuseppe Liotta and
Henk Meijer and
Alessandra Tappini and
Stephen K. Wismath},
title = {Packing Trees into 1-planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {2},
pages = {605--624},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00574},
doi = {10.7155/JGAA.00574},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/LucaGHKLLMTW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/PapV21,
author = {Gyula Pap and
J{\'{o}}zsef Varny{\'{u}}},
title = {Synchronized Traveling Salesman Problem},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {437--459},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00566},
doi = {10.7155/JGAA.00566},
timestamp = {Mon, 14 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/PapV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RahmanSS21,
author = {M. Sohel Rahman and
Kunihiko Sadakane and
Wing{-}Kin Sung},
title = {Guest editors' foreword},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {2},
pages = {603--604},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00577},
doi = {10.7155/JGAA.00577},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RahmanSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Schaefer21,
author = {Marcus Schaefer},
title = {Complexity of Geometric k-Planarity for Fixed k},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {29--41},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00548},
doi = {10.7155/JGAA.00548},
timestamp = {Thu, 17 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Schaefer21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Schaefer21a,
author = {Marcus Schaefer},
title = {On the Complexity of Some Geometric Problems With Fixed Parameters},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {195--218},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00557},
doi = {10.7155/JGAA.00557},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Schaefer21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/SchallerGHS21,
author = {David Schaller and
Manuela Gei{\ss} and
Marc Hellmuth and
Peter F. Stadler},
title = {Least resolved trees for two-colored best match graphs},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {397--416},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00564},
doi = {10.7155/JGAA.00564},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/SchallerGHS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ShantrinalKRR21,
author = {A. Arul Shantrinal and
Sandi Klavzar and
T. M. Rajalaxmi and
R. Sundara Rajan},
title = {An algorithm for embedding Tur{\'{a}}n graphs into incomplete
hypercubes with minimum wirelength},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {367--381},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00562},
doi = {10.7155/JGAA.00562},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ShantrinalKRR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Slettnes21,
author = {Espen Slettnes},
title = {Minimal Embedding Dimensions of Rectangle k-Visibility Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {59--96},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00550},
doi = {10.7155/JGAA.00550},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Slettnes21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/TumurbaatarS21,
author = {Altansuren Tumurbaatar and
Matthew J. Sottile},
title = {Algebraic Algorithms for Betweenness and Percolation Centrality},
journal = {J. Graph Algorithms Appl.},
volume = {25},
number = {1},
pages = {241--261},
year = {2021},
url = {https://doi.org/10.7155/jgaa.00558},
doi = {10.7155/JGAA.00558},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/TumurbaatarS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AichholzerBHKMP20,
author = {Oswin Aichholzer and
Martin Balko and
Michael Hoffmann and
Jan Kyncl and
Wolfgang Mulzer and
Irene Parada and
Alexander Pilz and
Manfred Scheucher and
Pavel Valtr and
Birgit Vogtenhuber and
Emo Welzl},
title = {Minimal Representations of Order Types by Geometric Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {4},
pages = {551--572},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00545},
doi = {10.7155/JGAA.00545},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AichholzerBHKMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AichholzerDMGH20,
author = {Oswin Aichholzer and
Frank Duque and
Ruy Fabila Monroy and
Oscar E. Garc{\'{\i}}a{-}Quintero and
Carlos Hidalgo{-}Toscano},
title = {An Ongoing Project to Improve the Rectilinear and the Pseudolinear
Crossing Constants},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {421--432},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00540},
doi = {10.7155/JGAA.00540},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AichholzerDMGH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AjayDDKRS20,
author = {Jammigumpula Ajay and
Avinandan Das and
Binayak Dutta and
Arindam Karmakar and
Sasanka Roy and
Navaneeta Saikia},
title = {Problems on One Way Road Networks},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {523--546},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00544},
doi = {10.7155/JGAA.00544},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AjayDDKRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AltmanovaKV20,
author = {Katerina Altmanov{\'{a}} and
Petr Kolman and
Jan Voborn{\'{\i}}k},
title = {On Polynomial-Time Combinatorial Algorithms for Maximum {\textdollar}L{\textdollar}-Bounded
Flow},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {303--322},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00534},
doi = {10.7155/JGAA.00534},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AltmanovaKV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniBKS20,
author = {Patrizio Angelini and
Michael A. Bekos and
Michael Kaufmann and
Thomas Schneck},
title = {Efficient Generation of Different Topological Representations of Graphs
Beyond-Planarity},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {4},
pages = {573--601},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00531},
doi = {10.7155/JGAA.00531},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniBKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ArchambaultT20,
author = {Daniel Archambault and
Csaba D. T{\'{o}}th},
title = {Guest editors' foreword},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {4},
pages = {547--549},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00546},
doi = {10.7155/JGAA.00546},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ArchambaultT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BatzillB20,
author = {Johannes Batzill and
Therese Biedl},
title = {Order-preserving Drawings of Trees with Approximately Optimal Height
(and Small Width)},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {1},
pages = {1--19},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00515},
doi = {10.7155/JGAA.00515},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BatzillB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BelmonteHKLOO20,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
title = {Parameterized Complexity of Safe Set},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {215--245},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00528},
doi = {10.7155/JGAA.00528},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BelmonteHKLOO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BentertDKNN20,
author = {Matthias Bentert and
Alexander Dittmann and
Leon Kellerhals and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {An Adaptive Version of Brandes' Algorithm for Betweenness Centrality},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {483--522},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00543},
doi = {10.7155/JGAA.00543},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BentertDKNN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BhoreGMN20,
author = {Sujoy Bhore and
Robert Ganian and
Fabrizio Montecchiani and
Martin N{\"{o}}llenburg},
title = {Parameterized Algorithms for Book Embedding Problems},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {4},
pages = {603--620},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00526},
doi = {10.7155/JGAA.00526},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BhoreGMN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BorrazzoLBFP20,
author = {Manuel Borrazzo and
Giordano Da Lozzo and
Giuseppe Di Battista and
Fabrizio Frati and
Maurizio Patrignani},
title = {Graph Stories in Small Area},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {269--292},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00530},
doi = {10.7155/JGAA.00530},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BorrazzoLBFP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BurkhardtFH20,
author = {Paul Burkhardt and
Vance Faber and
David G. Harris},
title = {Bounds and algorithms for graph trusses},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {191--214},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00527},
doi = {10.7155/JGAA.00527},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BurkhardtFH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChaplickDKPRW20,
author = {Steven Chaplick and
Thomas C. van Dijk and
Myroslav Kryven and
Ji{-}won Park and
Alexander Ravsky and
Alexander Wolff},
title = {Bundled Crossings Revisited},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {4},
pages = {621--655},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00535},
doi = {10.7155/JGAA.00535},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ChaplickDKPRW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChaplickKLTWZZ20,
author = {Steven Chaplick and
Philipp Kindermann and
Andre L{\"{o}}ffler and
Florian Thiele and
Alexander Wolff and
Alexander Zaft and
Johannes Zink},
title = {Recognizing Stick Graphs with and without Length Constraints},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {4},
pages = {657--681},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00524},
doi = {10.7155/JGAA.00524},
timestamp = {Wed, 14 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ChaplickKLTWZZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChenPPS20,
author = {Fati Chen and
Laurent Piccinini and
Pascal Poncelet and
Arnaud Sallaberry},
title = {Node Overlap Removal Algorithms: an Extended Comparative Study},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {4},
pages = {683--706},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00532},
doi = {10.7155/JGAA.00532},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ChenPPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChimaniDJKMN20,
author = {Markus Chimani and
Christine Dahn and
Martina Juhnke{-}Kubitzke and
Nils M. Kriege and
Petra Mutzel and
Alexander Nover},
title = {Maximum Cut Parameterized by Crossing Number},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {155--170},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00523},
doi = {10.7155/JGAA.00523},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ChimaniDJKMN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CornelissenM20,
author = {Kamiel Cornelissen and
Bodo Manthey},
title = {Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and
the Network Simplex Algorithm},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {397--421},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00539},
doi = {10.7155/JGAA.00539},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CornelissenM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Damaschke20,
author = {Peter Damaschke},
title = {Enumerating Grid Layouts of Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {433--460},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00541},
doi = {10.7155/JGAA.00541},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Damaschke20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EhounouBMWW20,
author = {Wilfried Joseph Ehounou and
Dominique Barth and
Arnaud De Moissac and
Dimitri Watel and
Marc{-}Antoine Weisser},
title = {Minimizing the Hamming distance between a graph and a line-graph to
discover the topology of an electrical network},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {133--153},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00522},
doi = {10.7155/JGAA.00522},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EhounouBMWW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FabriciHMS20,
author = {Igor Fabrici and
Jochen Harant and
Samuel Mohr and
Jens M. Schmidt},
title = {On the Circumference of Essentially 4-connected Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {1},
pages = {21--46},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00516},
doi = {10.7155/JGAA.00516},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/FabriciHMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FertinK20,
author = {Guillaume Fertin and
Christian Komusiewicz},
title = {Graph Motif Problems Parameterized by Dual},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {371--396},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00538},
doi = {10.7155/JGAA.00538},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/FertinK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GeffenJKM20,
author = {Bas A. M. van Geffen and
Bart M. P. Jansen and
Arnoud A. W. M. de Kroon and
Rolf Morel},
title = {Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {461--482},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00542},
doi = {10.7155/JGAA.00542},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GeffenJKM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Goncalves20,
author = {Daniel Gon{\c{c}}alves},
title = {Not all planar graphs are in {PURE-4-DIR}},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {293--301},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00533},
doi = {10.7155/JGAA.00533},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Goncalves20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KhoshkhahGMS20,
author = {Kaveh Khoshkhah and
Mehdi Khosravian Ghadikolaei and
J{\'{e}}r{\^{o}}me Monnot and
Florian Sikora},
title = {Weighted Upper Edge Cover: Complexity and Approximability},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {2},
pages = {65--88},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00519},
doi = {10.7155/JGAA.00519},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KhoshkhahGMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MchedlidzeRRZ20,
author = {Tamara Mchedlidze and
Marcel Radermacher and
Ignaz Rutter and
Nina Zimbel},
title = {Drawing Clustered Planar Graphs on Disk Arrangements},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {2},
pages = {105--131},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00521},
doi = {10.7155/JGAA.00521},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/MchedlidzeRRZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MizunashiHU20,
author = {Koichi Mizunashi and
Takashi Horiyama and
Ryuhei Uehara},
title = {Efficient Algorithm for Box Folding},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {2},
pages = {89--103},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00520},
doi = {10.7155/JGAA.00520},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/MizunashiHU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MukhopadhyayaN20,
author = {Krishnendu Mukhopadhyaya and
Shin{-}Ichi Nakano},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {2},
pages = {63--64},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00518},
doi = {10.7155/JGAA.00518},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/MukhopadhyayaN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MutzeS20,
author = {Torsten M{\"{u}}tze and
Manfred Scheucher},
title = {On L-shaped point set embeddings of trees: first non-embeddable examples},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {343--369},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00537},
doi = {10.7155/JGAA.00537},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/MutzeS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Pupyrev20,
author = {Sergey Pupyrev},
title = {Improved Bounds for Track Numbers of Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {323--341},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00536},
doi = {10.7155/JGAA.00536},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Pupyrev20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ScheucherSS20,
author = {Manfred Scheucher and
Hendrik Schrezenmaier and
Raphael Steiner},
title = {A Note on Universal Point Sets for Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {247--267},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00529},
doi = {10.7155/JGAA.00529},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ScheucherSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/SolanoBRCC20,
author = {Geoffrey Solano and
Guillaume Blin and
Mathieu Raffinot and
Jhoirene B. Clemente and
Jaime Caro},
title = {On the Approximability of the Minimum Weight {\textdollar}t{\textdollar}-partite
Clique Problem},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {171--190},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00525},
doi = {10.7155/JGAA.00525},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/SolanoBRCC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ArsenevaBCDDFLT19,
author = {Elena Arseneva and
Prosenjit Bose and
Pilar Cano and
Anthony D'Angelo and
Vida Dujmovic and
Fabrizio Frati and
Stefan Langerman and
Alessandra Tappini},
title = {Pole Dancing: 3D Morphs for Tree Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {3},
pages = {579--602},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00503},
doi = {10.7155/JGAA.00503},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ArsenevaBCDDFLT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AthertonRV19,
author = {Juli Atherton and
Derek Ruths and
Adrian Vetta},
title = {Computation in Causal Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {317--344},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00493},
doi = {10.7155/JGAA.00493},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AthertonRV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BelmonteGKLO19,
author = {R{\'{e}}my Belmonte and
Mehdi Khosravian Ghadikolaei and
Masashi Kiyomi and
Michael Lampis and
Yota Otachi},
title = {How Bad is the Freedom to Flood-It?},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {111--134},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00486},
doi = {10.7155/JGAA.00486},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BelmonteGKLO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BiedlK19,
author = {Therese Biedl and
Andreas Kerren},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {3},
pages = {459--461},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00498},
doi = {10.7155/JGAA.00498},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BiedlK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BlasiusRR19,
author = {Thomas Bl{\"{a}}sius and
Marcel Radermacher and
Ignaz Rutter},
title = {How to Draw a Planarization},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {4},
pages = {653--682},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00506},
doi = {10.7155/JGAA.00506},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BlasiusRR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BorradaileMW19,
author = {Glencora Borradaile and
Theresa Migler and
Gordon T. Wilfong},
title = {Density decompositions of networks},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {4},
pages = {625--651},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00505},
doi = {10.7155/JGAA.00505},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BorradaileMW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BukovacFM19,
author = {Zo{\"{e}} Bukovac and
Graham Farr and
Kerri Morgan},
title = {Short certificates for chromatic equivalence},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {227--269},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00490},
doi = {10.7155/JGAA.00490},
timestamp = {Tue, 26 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BukovacFM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CardinalDM19,
author = {Jean Cardinal and
Jean{-}Paul Doignon and
Keno Merckx},
title = {Finding a Maximum-Weight Convex Set in a Chordal Graph},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {167--190},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00488},
doi = {10.7155/JGAA.00488},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CardinalDM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CastermansGMNY19,
author = {Thom Castermans and
Mereke van Garderen and
Wouter Meulemans and
Martin N{\"{o}}llenburg and
Xiaoru Yuan},
title = {Short Plane Supports for Spatial Hypergraphs},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {3},
pages = {463--498},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00499},
doi = {10.7155/JGAA.00499},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CastermansGMNY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChancharyM19,
author = {Farah Chanchary and
Anil Maheshwari},
title = {Time Windowed Data Structures for Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {191--226},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00489},
doi = {10.7155/JGAA.00489},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ChancharyM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChepoiDHVA19,
author = {Victor Chepoi and
Feodor F. Dragan and
Michel Habib and
Yann Vax{\`{e}}s and
Hend Alrasheed},
title = {Fast approximation of eccentricities and distances in hyperbolic graphs},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {393--433},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00496},
doi = {10.7155/JGAA.00496},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ChepoiDHVA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ClancyHN19,
author = {Kieran Clancy and
Michael Haythorpe and
Alex Newcombe},
title = {An effective crossing minimisation heuristic based on star insertion},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {135--166},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00487},
doi = {10.7155/JGAA.00487},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ClancyHN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DawarK19,
author = {Anuj Dawar and
Kashif Khan},
title = {Constructing Hard Examples for Graph Isomorphism},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {293--316},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00492},
doi = {10.7155/JGAA.00492},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DawarK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DondiMSZ19,
author = {Riccardo Dondi and
Giancarlo Mauri and
Florian Sikora and
Italo Zoppis},
title = {Covering a Graph with Clubs},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {271--292},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00491},
doi = {10.7155/JGAA.00491},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DondiMSZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FratiHK19,
author = {Fabrizio Frati and
Michael Hoffmann and
Vincent Kusters},
title = {Simultaneous Embeddings with Few Bends and Crossings},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {4},
pages = {683--713},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00507},
doi = {10.7155/JGAA.00507},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/FratiHK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FujitoKM19,
author = {Toshihiro Fujito and
Kei Kimura and
Yuki Mizuno},
title = {Approximating Partially Bounded Degree Deletion on Directed Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {5},
pages = {759--780},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00511},
doi = {10.7155/JGAA.00511},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/FujitoKM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HaraguchiMSN19,
author = {Kazuya Haraguchi and
Yusuke Momoi and
Aleksandar Shurbevski and
Hiroshi Nagamochi},
title = {{COOMA:} {A} Components Overlaid Mining Algorithm for Enumerating
Connected Subgraphs with Common Itemsets},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {434--458},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00497},
doi = {10.7155/JGAA.00497},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HaraguchiMSN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/JanssenJKSW19,
author = {Remie Janssen and
Mark Jones and
Steven Kelk and
Georgios Stamoulis and
Taoyang Wu},
title = {Treewidth of display graphs: bounds, brambles and applications},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {4},
pages = {715--743},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00508},
doi = {10.7155/JGAA.00508},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/JanssenJKSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/JungerMS19,
author = {Michael J{\"{u}}nger and
Petra Mutzel and
Christiane Spisla},
title = {A Flow Formulation for Horizontal Coordinate Assignment with Prescribed
Width},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {3},
pages = {499--524},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00500},
doi = {10.7155/JGAA.00500},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/JungerMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KashyopNS19,
author = {Manas Jyoti Kashyop and
Tsunehiko Nagayama and
Kunihiko Sadakane},
title = {Faster algorithms for shortest path and network flow based on graph
decomposition},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {5},
pages = {781--813},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00512},
doi = {10.7155/JGAA.00512},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KashyopNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KawaharaSY19,
author = {Jun Kawahara and
Toshiki Saitoh and
Ryo Yoshinaka},
title = {The Time Complexity of Permutation Routing via Matching, Token Swapping
and a Variant},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {1},
pages = {29--70},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00483},
doi = {10.7155/JGAA.00483},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KawaharaSY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KraaijerKMR19,
author = {Rutger Kraaijer and
Marc J. van Kreveld and
Wouter Meulemans and
Andr{\'{e}} van Renssen},
title = {Geometry and Generation of a New Graph Planarity Game},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {4},
pages = {603--624},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00504},
doi = {10.7155/JGAA.00504},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KraaijerKMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KryvenRW19,
author = {Myroslav Kryven and
Alexander Ravsky and
Alexander Wolff},
title = {Drawing Graphs on Few Circles and Few Spheres},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {371--391},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00495},
doi = {10.7155/JGAA.00495},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KryvenRW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KurokiM19,
author = {Yuko Kuroki and
Tomomi Matsui},
title = {Approximation Algorithm for Cycle-Star Hub Network Design Problems
and Cycle-Metric Labeling Problems},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {1},
pages = {93--110},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00485},
doi = {10.7155/JGAA.00485},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KurokiM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LubiwM19,
author = {Anna Lubiw and
Debajyoti Mondal},
title = {Construction and Local Routing for Angle-Monotone Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {345--369},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00494},
doi = {10.7155/JGAA.00494},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/LubiwM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LucaGDKL19,
author = {Felice De Luca and
Emilio Di Giacomo and
Walter Didimo and
Stephen G. Kobourov and
Giuseppe Liotta},
title = {An Experimental Study on the Ply Number of Straight-line Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {1},
pages = {71--91},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00484},
doi = {10.7155/JGAA.00484},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/LucaGDKL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MchedlidzePK19,
author = {Tamara Mchedlidze and
Alexey Pak and
Moritz Klammler},
title = {Aesthetic Discrimination of Graph Layouts},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {3},
pages = {525--552},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00501},
doi = {10.7155/JGAA.00501},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/MchedlidzePK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Nakano19,
author = {Shin{-}Ichi Nakano},
title = {A Simple Algorithm for r-gatherings on the Line},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {5},
pages = {837--845},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00514},
doi = {10.7155/JGAA.00514},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Nakano19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/OrtaliT19,
author = {Giacomo Ortali and
Ioannis G. Tollis},
title = {A New Framework for Hierarchical Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {3},
pages = {553--578},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00502},
doi = {10.7155/JGAA.00502},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/OrtaliT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RahmanSU19,
author = {M. Sohel Rahman and
Wing{-}Kin Sung and
Ryuhei Uehara},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {5},
pages = {755--757},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00510},
doi = {10.7155/JGAA.00510},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RahmanSU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RahmanYP19,
author = {Md. Saidur Rahman and
Hsu{-}Chun Yen and
Sheung{-}Hung Poon},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {1},
pages = {1--2},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00481},
doi = {10.7155/JGAA.00481},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RahmanYP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RuangwisesI19,
author = {Suthee Ruangwises and
Toshiya Itoh},
title = {Random Popular Matchings with Incomplete Preference Lists},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {5},
pages = {815--835},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00513},
doi = {10.7155/JGAA.00513},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RuangwisesI19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/YamanakaDHKNOSS19,
author = {Katsuhisa Yamanaka and
Erik D. Demaine and
Takashi Horiyama and
Akitoshi Kawamura and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Toshiki Saitoh and
Akira Suzuki and
Ryuhei Uehara and
Takeaki Uno},
title = {Sequentially Swapping Colored Tokens on Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {1},
pages = {3--27},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00482},
doi = {10.7155/JGAA.00482},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/YamanakaDHKNOSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AckermanKV18,
author = {Eyal Ackerman and
Bal{\'{a}}zs Keszegh and
M{\'{a}}t{\'{e}} Vizer},
title = {On the size of planarly connected crossing graphs},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {1},
pages = {11--22},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00453},
doi = {10.7155/JGAA.00453},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AckermanKV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AuerBBBG18,
author = {Christopher Auer and
Christian Bachmaier and
Franz J. Brandenburg and
Wolfgang Brunner and
Andreas Glei{\ss}ner},
title = {Data Structures and their Planar Graph Layouts},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {2},
pages = {207--237},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00465},
doi = {10.7155/JGAA.00465},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AuerBBBG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BallwegPWL18,
author = {Kathrin Ballweg and
Margit Pohl and
G{\"{u}}nter Wallner and
Tatiana von Landesberger},
title = {Visual Similarity Perception of Directed Acyclic Graphs: {A} Study
on Influencing Factors and Similarity Judgment Strategies},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {3},
pages = {519--553},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00467},
doi = {10.7155/JGAA.00467},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BallwegPWL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BannisterCE18,
author = {Michael J. Bannister and
Sergio Cabello and
David Eppstein},
title = {Parameterized Complexity of 1-Planarity},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {1},
pages = {23--49},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00457},
doi = {10.7155/JGAA.00457},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BannisterCE18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BannisterE18,
author = {Michael J. Bannister and
David Eppstein},
title = {Crossing Minimization for 1-page and 2-page Drawings of Graphs with
Bounded Treewidth},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {4},
pages = {577--606},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00479},
doi = {10.7155/JGAA.00479},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BannisterE18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BekosKM18,
author = {Michael A. Bekos and
Michael Kaufmann and
Fabrizio Montecchiani},
title = {Guest Editors' Foreword and Overview},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {1},
pages = {1--10},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00459},
doi = {10.7155/JGAA.00459},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BekosKM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Brandenburg18,
author = {Franz J. Brandenburg},
title = {A First Order Logic Definition of Beyond-Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {1},
pages = {51--66},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00455},
doi = {10.7155/JGAA.00455},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Brandenburg18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Brandenburg18a,
author = {Franz J. Brandenburg},
title = {Recognizing IC-Planar and NIC-Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {2},
pages = {239--271},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00466},
doi = {10.7155/JGAA.00466},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Brandenburg18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CardinalFMTV18,
author = {Jean Cardinal and
Stefan Felsner and
Tillmann Miltzow and
Casey Tompkins and
Birgit Vogtenhuber},
title = {Intersection Graphs of Rays and Grounded Segments},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {2},
pages = {273--295},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00470},
doi = {10.7155/JGAA.00470},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CardinalFMTV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChimaniFKUVW18,
author = {Markus Chimani and
Stefan Felsner and
Stephen G. Kobourov and
Torsten Ueckerdt and
Pavel Valtr and
Alexander Wolff},
title = {On the Maximum Crossing Number},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {1},
pages = {67--87},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00458},
doi = {10.7155/JGAA.00458},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ChimaniFKUVW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DjelloulFK18,
author = {Selma Djelloul and
Odile Favaron and
Mekkia Kouider},
title = {Edge k-q-Colorability of Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {2},
pages = {193--206},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00464},
doi = {10.7155/JGAA.00464},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DjelloulFK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DujmovicF18,
author = {Vida Dujmovic and
Fabrizio Frati},
title = {Stack and Queue Layouts via Layered Separators},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {1},
pages = {89--99},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00454},
doi = {10.7155/JGAA.00454},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/DujmovicF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein18,
author = {David Eppstein},
title = {The Effect of Planarization on Width},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {3},
pages = {461--481},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00468},
doi = {10.7155/JGAA.00468},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein18a,
author = {David Eppstein},
title = {Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {3},
pages = {483--499},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00463},
doi = {10.7155/JGAA.00463},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FratiM18,
author = {Fabrizio Frati and
Kwan{-}Liu Ma},
title = {Guest editors' foreword},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {3},
pages = {397--399},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00477},
doi = {10.7155/JGAA.00477},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/FratiM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GanT18,
author = {Junhao Gan and
Yufei Tao},
title = {An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional
Grid Graphs and Its Applications},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {2},
pages = {297--327},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00471},
doi = {10.7155/JGAA.00471},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GanT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Grilli18,
author = {Luca Grilli},
title = {On the NP-hardness of GRacSim drawing and k-SEFE Problems},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {1},
pages = {101--116},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00456},
doi = {10.7155/JGAA.00456},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Grilli18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Guttmann-BeckKS18,
author = {Nili Guttmann{-}Beck and
Eyal Knaan and
Michal Stern},
title = {Approximation Algorithms for Not Necessarily Disjoint Clustered {TSP}},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {4},
pages = {555--575},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00478},
doi = {10.7155/JGAA.00478},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Guttmann-BeckKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HajnalIRS18,
author = {P{\'{e}}ter Hajnal and
Alexander Igamberdiev and
G{\"{u}}nter Rote and
Andr{\'{e}} Schulz},
title = {Saturated simple and 2-simple topological graphs with few edges},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {1},
pages = {117--138},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00460},
doi = {10.7155/JGAA.00460},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HajnalIRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HultenschmidtKM18,
author = {Gregor H{\"{u}}ltenschmidt and
Philipp Kindermann and
Wouter Meulemans and
Andr{\'{e}} Schulz},
title = {Drawing Planar Graphs with Few Geometric Primitives},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {2},
pages = {357--387},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00473},
doi = {10.7155/JGAA.00473},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HultenschmidtKM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KindermannMS18,
author = {Philipp Kindermann and
Wouter Meulemans and
Andr{\'{e}} Schulz},
title = {Experimental Analysis of the Accessibility of Drawings with Few Segments},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {3},
pages = {501--518},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00474},
doi = {10.7155/JGAA.00474},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KindermannMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Klawitter18,
author = {Jonathan Klawitter},
title = {The {SNPR} neighbourhood of tree-child networks},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {2},
pages = {329--355},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00472},
doi = {10.7155/JGAA.00472},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Klawitter18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Kolman18,
author = {Petr Kolman},
title = {On Algorithms Employing Treewidth for L-bounded Cut Problems},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {2},
pages = {177--191},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00462},
doi = {10.7155/JGAA.00462},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Kolman18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KriegeDM18,
author = {Nils M. Kriege and
Andre Droschinsky and
Petra Mutzel},
title = {A note on block-and-bridge preserving maximum common subgraph algorithms
for outerplanar graphs},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {4},
pages = {607--616},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00480},
doi = {10.7155/JGAA.00480},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KriegeDM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LozzoBFP18,
author = {Giordano Da Lozzo and
Giuseppe Di Battista and
Fabrizio Frati and
Maurizio Patrignani},
title = {Computing NodeTrix Representations of Clustered Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {2},
pages = {139--176},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00461},
doi = {10.7155/JGAA.00461},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/LozzoBFP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MchedlidzeRR18,
author = {Tamara Mchedlidze and
Marcel Radermacher and
Ignaz Rutter},
title = {Aligned Drawings of Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {3},
pages = {401--429},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00475},
doi = {10.7155/JGAA.00475},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/MchedlidzeRR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/SitchinavaS18,
author = {Nodari Sitchinava and
Darren Strash},
title = {Reconstructing Generalized Staircase Polygons with Uniform Step Length},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {3},
pages = {431--459},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00469},
doi = {10.7155/JGAA.00469},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/SitchinavaS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/WardGWD18,
author = {Max Ward and
Andrew Gozzard and
Michael J. Wise and
Amitava Datta},
title = {A Faster Algorithm for Maximum Induced Matchings on Circle Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {22},
number = {2},
pages = {389--396},
year = {2018},
url = {https://doi.org/10.7155/jgaa.00476},
doi = {10.7155/JGAA.00476},
timestamp = {Fri, 16 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/WardGWD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AbuthawabehZ17,
author = {Ala Abuthawabeh and
Dirk Zeckzer},
title = {Topological Decomposition of Directed Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {589--630},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00431},
doi = {10.7155/JGAA.00431},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AbuthawabehZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AkashFLLMM17,
author = {Aditya Kumar Akash and
S{\'{a}}ndor P. Fekete and
Seoung Kyou Lee and
Alejandro L{\'{o}}pez{-}Ortiz and
Daniela Maftuleac and
James McLurkin},
title = {Lower Bounds for Graph Exploration Using Local Policies},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {3},
pages = {371--387},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00421},
doi = {10.7155/JGAA.00421},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AkashFLLMM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AltinakarCH17,
author = {Sivan Altinakar and
Gilles Caporossi and
Alain Hertz},
title = {Symmetry Breaking Constraints for the Minimum Deficiency Problem},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {2},
pages = {195--218},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00412},
doi = {10.7155/JGAA.00412},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AltinakarCH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniBLD0KMR17,
author = {Patrizio Angelini and
Michael A. Bekos and
Felice De Luca and
Walter Didimo and
Michael Kaufmann and
Stephen G. Kobourov and
Fabrizio Montecchiani and
Chrysanthi N. Raftopoulou and
Vincenzo Roselli and
Antonios Symvonis},
title = {Vertex-Coloring with Defects},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {3},
pages = {313--340},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00418},
doi = {10.7155/JGAA.00418},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniBLD0KMR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniLBFPR17,
author = {Patrizio Angelini and
Giordano Da Lozzo and
Giuseppe Di Battista and
Fabrizio Frati and
Maurizio Patrignani and
Ignaz Rutter},
title = {Intersection-Link Representations of Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {731--755},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00437},
doi = {10.7155/JGAA.00437},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniLBFPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AthenstadtC17,
author = {Jan Christoph Athenst{\"{a}}dt and
Sabine Cornelsen},
title = {Planarity of Overlapping Clusterings Including Unions of Two Partitions},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {6},
pages = {1057--1089},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00450},
doi = {10.7155/JGAA.00450},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AthenstadtC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AuberBDP17,
author = {David Auber and
Nicolas Bonichon and
Paul Dorbec and
Claire Pennarun},
title = {Rook-drawings of Plane Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {1},
pages = {103--120},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00402},
doi = {10.7155/JGAA.00402},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AuberBDP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Bantva17,
author = {Devsi Bantva},
title = {Hamiltonian chromatic number of block graphs},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {3},
pages = {353--369},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00420},
doi = {10.7155/JGAA.00420},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Bantva17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BarbaEHKSS17,
author = {Luis Barba and
William Evans and
Michael Hoffmann and
Vincent Kusters and
Maria Saumell and
Bettina Speckmann},
title = {Column planarity and partially-simultaneous geometric embedding},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {6},
pages = {983--1002},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00446},
doi = {10.7155/JGAA.00446},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BarbaEHKSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BekosKK17,
author = {Michael A. Bekos and
Michael Kaufmann and
Robert Krug},
title = {On the Total Number of Bends for Planar Octilinear Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {709--730},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00436},
doi = {10.7155/JGAA.00436},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BekosKK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BermanCFGHW17,
author = {Leah Wrenn Berman and
Glenn G. Chappell and
Jill R. Faudree and
John Gimbel and
Chris Hartman and
Gordon I. Williams},
title = {Graphs with Obstacle Number Greater than One},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {6},
pages = {1107--1119},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00452},
doi = {10.7155/JGAA.00452},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BermanCFGHW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Biedl17,
author = {Therese Biedl},
title = {Ideal Drawings of Rooted Trees With Approximately Optimal Width},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {631--648},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00432},
doi = {10.7155/JGAA.00432},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Biedl17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BiedlP17,
author = {Therese Biedl and
Claire Pennarun},
title = {Non-aligned Drawings of Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {5},
pages = {915--937},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00444},
doi = {10.7155/JGAA.00444},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BiedlP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BiniazBDMS17,
author = {Ahmad Biniaz and
Prosenjit Bose and
Ingo van Duijn and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {527--546},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00427},
doi = {10.7155/JGAA.00427},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BiniazBDMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BinucciCDGKKMT17,
author = {Carla Binucci and
Markus Chimani and
Walter Didimo and
Martin Gronemann and
Karsten Klein and
Jan Kratochv{\'{\i}}l and
Fabrizio Montecchiani and
Ioannis G. Tollis},
title = {Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar
to Stegosaurus},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {1},
pages = {81--102},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00398},
doi = {10.7155/JGAA.00398},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BinucciCDGKKMT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BorradaileIMOWZ17,
author = {Glencora Borradaile and
Jennifer Iglesias and
Theresa Migler and
Antonio Ochoa and
Gordon T. Wilfong and
Lisa Zhang},
title = {Egalitarian Graph Orientations},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {687--708},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00435},
doi = {10.7155/JGAA.00435},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BorradaileIMOWZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BoseCSS17,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Alina Shaikhet and
Michiel H. M. Smid},
title = {Essential Constraints of Edge-Constrained Proximity Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {389--415},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00422},
doi = {10.7155/JGAA.00422},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BoseCSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BrandenburgEN17,
author = {Franz J. Brandenburg and
Alexander Esch and
Daniel Neuwirth},
title = {On Aligned Bar 1-Visibility Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {3},
pages = {281--312},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00417},
doi = {10.7155/JGAA.00417},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BrandenburgEN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BruckdorferCGKM17,
author = {Till Bruckdorfer and
Sabine Cornelsen and
Carsten Gutwenger and
Michael Kaufmann and
Fabrizio Montecchiani and
Martin N{\"{o}}llenburg and
Alexander Wolff},
title = {Progress on Partial Edge Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {757--786},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00438},
doi = {10.7155/JGAA.00438},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BruckdorferCGKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CrnovrsaninCM17,
author = {Tarik Crnovrsanin and
Jacqueline Chu and
Kwan{-}Liu Ma},
title = {An Incremental Layout Method for Visualizing Online Dynamic Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {1},
pages = {55--80},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00406},
doi = {10.7155/JGAA.00406},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CrnovrsaninCM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Cymer17,
author = {Radoslaw Cymer},
title = {A Note on the Existence of All (g, f)-Factors},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {555--560},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00429},
doi = {10.7155/JGAA.00429},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Cymer17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DijkFFLMRSW17,
author = {Thomas C. van Dijk and
Martin Fink and
Norbert Fischer and
Fabian Lipp and
Peter Markfelder and
Alexander Ravsky and
Subhash Suri and
Alexander Wolff},
title = {Block Crossings in Storyline Visualizations},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {5},
pages = {873--913},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00443},
doi = {10.7155/JGAA.00443},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DijkFFLMRSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Dujmovic17,
author = {Vida Dujmovic},
title = {The Utility of Untangling},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {1},
pages = {121--134},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00407},
doi = {10.7155/JGAA.00407},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Dujmovic17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DurocherM17,
author = {Stephane Durocher and
Debajyoti Mondal},
title = {Drawing Planar Graphs with Reduced Height},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {433--453},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00424},
doi = {10.7155/JGAA.00424},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DurocherM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EadesH0K17,
author = {Peter Eades and
Seok{-}Hee Hong and
An Nguyen and
Karsten Klein},
title = {Shape-Based Quality Metrics for Large Graph Visualization},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {1},
pages = {29--53},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00405},
doi = {10.7155/JGAA.00405},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/EadesH0K17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EirinakisWS17,
author = {Pavlos Eirinakis and
Matthew D. Williamson and
K. Subramani},
title = {On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {2},
pages = {177--181},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00410},
doi = {10.7155/JGAA.00410},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EirinakisWS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EngelKS17,
author = {Konrad Engel and
Thomas Kalinowski and
Martin W. P. Savelsbergh},
title = {Incremental Network Design with Minimum Spanning Trees},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {417--432},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00423},
doi = {10.7155/JGAA.00423},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EngelKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EppsteinMP17,
author = {David Eppstein and
J. Michael McCarthy and
Brian E. Parrish},
title = {Rooted Cycle Bases},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {663--686},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00434},
doi = {10.7155/JGAA.00434},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EppsteinMP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FoucaudK17,
author = {Florent Foucaud and
Ralf Klasing},
title = {Parameterized and approximation complexity of the detection pair problem
in graphs},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {6},
pages = {1039--1056},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00449},
doi = {10.7155/JGAA.00449},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/FoucaudK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FulekPS17,
author = {Radoslav Fulek and
Michael J. Pelsmajer and
Marcus Schaefer},
title = {Hanani-Tutte for Radial Planarity},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {1},
pages = {135--154},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00408},
doi = {10.7155/JGAA.00408},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/FulekPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GiacomoL17,
author = {Emilio Di Giacomo and
Anna Lubiw},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {1},
pages = {1--3},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00404},
doi = {10.7155/JGAA.00404},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GiacomoL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Gorain0M17,
author = {Barun Gorain and
Partha Sarathi Mandal and
Krishnendu Mukhopadhyaya},
title = {Generalized Bounded Tree Cover of a Graph},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {3},
pages = {265--280},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00416},
doi = {10.7155/JGAA.00416},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Gorain0M17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HeH17,
author = {Xin He and
Dayu He},
title = {Star-Shaped and L-Shaped Orthogonal Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {2},
pages = {155--175},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00409},
doi = {10.7155/JGAA.00409},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HeH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Hoffmann17,
author = {Udo Hoffmann},
title = {On the Complexity of the Planar Slope Number Problem},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {2},
pages = {183--193},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00411},
doi = {10.7155/JGAA.00411},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Hoffmann17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HossainS0M17,
author = {Md. Iqbal Hossain and
Sammi Abida Salma and
Md. Saidur Rahman and
Debajyoti Mondal},
title = {A Necessary Condition and a Sufficient Condition for Pairwise Compatibility
Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {3},
pages = {341--352},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00419},
doi = {10.7155/JGAA.00419},
timestamp = {Wed, 13 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HossainS0M17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HuN17,
author = {Yifan Hu and
Martin N{\"{o}}llenburg},
title = {Guest editors' foreword},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {5},
pages = {787--789},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00439},
doi = {10.7155/JGAA.00439},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HuN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/IgamberdievMS17,
author = {Alexander Igamberdiev and
Wouter Meulemans and
Andr{\'{e}} Schulz},
title = {Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms
{\&} Experiments},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {561--588},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00430},
doi = {10.7155/JGAA.00430},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/IgamberdievMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Jansen17,
author = {Bart M. P. Jansen},
title = {On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs
Using 2-SAT},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {2},
pages = {219--243},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00413},
doi = {10.7155/JGAA.00413},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Jansen17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KalaghatgiL17,
author = {Prabhav Kalaghatgi and
Thomas Lengauer},
title = {Computing phylogenetic trees using topologically related minimum spanning
trees},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {6},
pages = {1003--1025},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00447},
doi = {10.7155/JGAA.00447},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KalaghatgiL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KaykobadP17,
author = {Mohammad Kaykobad and
Rossella Petreschi},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {3},
pages = {245--246},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00414},
doi = {10.7155/JGAA.00414},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KaykobadP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MagruderB17,
author = {Daniel Sumner Magruder and
Stefan Bonn},
title = {Root demotion: efficient post-processing of layered graphs to reduce
dummy vertices for hierarchical graph drawing},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {6},
pages = {1027--1038},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00448},
doi = {10.7155/JGAA.00448},
timestamp = {Wed, 10 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/MagruderB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/NachmansonNBZH17,
author = {Lev Nachmanson and
Arlind Nocaj and
Sergey Bereg and
Leishi Zhang and
Alexander E. Holroyd},
title = {Node Overlap Removal by Growing a Tree},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {5},
pages = {857--872},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00442},
doi = {10.7155/JGAA.00442},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/NachmansonNBZH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/OomineSN17,
author = {Morito Oomine and
Aleksandar Shurbevski and
Hiroshi Nagamochi},
title = {Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility
Game},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {3},
pages = {247--263},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00415},
doi = {10.7155/JGAA.00415},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/OomineSN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/OrtmannKB17,
author = {Mark Ortmann and
Mirza Klimenta and
Ulrik Brandes},
title = {A Sparse Stress Model},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {5},
pages = {791--821},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00440},
doi = {10.7155/JGAA.00440},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/OrtmannKB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RueggESH17,
author = {Ulf R{\"{u}}egg and
Thorsten Ehlers and
Miro Sp{\"{o}}nemann and
Reinhard von Hanxleden},
title = {Generalized Layerings for Arbitrary and Fixed Drawing Areas},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {5},
pages = {823--856},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00441},
doi = {10.7155/JGAA.00441},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RueggESH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Soulignac17,
author = {Francisco J. Soulignac},
title = {Bounded, minimal, and short representations of unit interval and unit
circular-arc graphs. Chapter {I:} theory},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {455--489},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00425},
doi = {10.7155/JGAA.00425},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Soulignac17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Soulignac17a,
author = {Francisco J. Soulignac},
title = {Bounded, minimal, and short representations of unit interval and unit
circular-arc graphs. Chapter {II:} algorithms},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {491--525},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00426},
doi = {10.7155/JGAA.00426},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Soulignac17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Tilley17,
author = {James A. Tilley},
title = {D-resolvability of vertices in planar graphs},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {649--661},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00433},
doi = {10.7155/JGAA.00433},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Tilley17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/VerclosS17,
author = {R{\'{e}}mi de Joannis de Verclos and
Jean{-}S{\'{e}}bastien Sereni},
title = {Equitable colorings of {\textdollar}K{\_}4{\textdollar}-minor-free
graphs},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {6},
pages = {1091--1105},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00451},
doi = {10.7155/JGAA.00451},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/VerclosS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/VerdiereKPPT17,
author = {{\'{E}}ric Colin de Verdi{\`{e}}re and
Vojtech Kaluza and
Pavel Pat{\'{a}}k and
Zuzana Pat{\'{a}}kov{\'{a}} and
Martin Tancer},
title = {A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective
Plane},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {5},
pages = {939--981},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00445},
doi = {10.7155/JGAA.00445},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/VerdiereKPPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/WardGD17,
author = {Max Ward and
Andrew Gozzard and
Amitava Datta},
title = {A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many
Shared Endpoints},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {4},
pages = {547--554},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00428},
doi = {10.7155/JGAA.00428},
timestamp = {Fri, 16 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/WardGD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ZimmerK17,
author = {Bj{\"{o}}rn Zimmer and
Andreas Kerren},
title = {OnGraX: {A} Web-Based System for the Collaborative Visual Analysis
of Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {1},
pages = {5--27},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00399},
doi = {10.7155/JGAA.00399},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ZimmerK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ArakiHU16,
author = {Yoshiaki Araki and
Takashi Horiyama and
Ryuhei Uehara},
title = {Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {1},
pages = {101--114},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00386},
doi = {10.7155/JGAA.00386},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ArakiHU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AsadaOI16,
author = {Yuma Asada and
Fukuhito Ooshita and
Michiko Inoue},
title = {An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm
in Anonymous Networks},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {1},
pages = {59--78},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00384},
doi = {10.7155/JGAA.00384},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AsadaOI16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BekosDKW16,
author = {Michael A. Bekos and
Thomas C. van Dijk and
Philipp Kindermann and
Alexander Wolff},
title = {Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and
Few Bends},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {1},
pages = {133--158},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00388},
doi = {10.7155/JGAA.00388},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BekosDKW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BerendS16,
author = {Daniel Berend and
Amir Sapir},
title = {Exponential vs. Subexponential Tower of Hanoi Variants},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {2},
pages = {461--479},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00403},
doi = {10.7155/JGAA.00403},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BerendS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BiedlD16,
author = {Therese Biedl and
Martin Derka},
title = {The (3, 1)-ordering for 4-connected planar triangulations},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {2},
pages = {347--362},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00396},
doi = {10.7155/JGAA.00396},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BiedlD16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Cymer16,
author = {Radoslaw Cymer},
title = {Propagation Rules for Graph Partitioning Constraints},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {2},
pages = {363--410},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00397},
doi = {10.7155/JGAA.00397},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Cymer16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DraganL16,
author = {Feodor F. Dragan and
Arne Leitert},
title = {Minimum Eccentricity Shortest Paths in some Structured Graph Classes},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {2},
pages = {299--322},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00394},
doi = {10.7155/JGAA.00394},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DraganL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Engels16,
author = {Christian Engels},
title = {Dichotomy Theorems for Homomorphism Polynomials of Graph Classes},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {1},
pages = {3--22},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00382},
doi = {10.7155/JGAA.00382},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Engels16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein16,
author = {David Eppstein},
title = {Simple Recognition of Halin Graphs and Their Generalizations},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {2},
pages = {323--346},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00395},
doi = {10.7155/JGAA.00395},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GaubRW16,
author = {Emily Gaub and
Michelle Rose and
Paul S. Wenger},
title = {The Unit Bar Visibility Number of a Graph},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {2},
pages = {269--297},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00393},
doi = {10.7155/JGAA.00393},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GaubRW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HertzMG16,
author = {Alain Hertz and
Romain Montagn{\'{e}} and
Fran{\c{c}}ois Gagnon},
title = {Constructive algorithms for the partial directed weighted improper
coloring problem},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {2},
pages = {159--188},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00389},
doi = {10.7155/JGAA.00389},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HertzMG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/IwaideN16,
author = {Ken Iwaide and
Hiroshi Nagamochi},
title = {An Improved Algorithm for Parameterized Edge Dominating Set Problem},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {1},
pages = {23--58},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00383},
doi = {10.7155/JGAA.00383},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/IwaideN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KelkISW16,
author = {Steven Kelk and
Leo van Iersel and
C{\'{e}}line Scornavacca and
Mathias Weller},
title = {Phylogenetic incongruence through the lens of Monadic Second Order
logic},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {2},
pages = {189--215},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00390},
doi = {10.7155/JGAA.00390},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KelkISW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KornaropoulosT16,
author = {Evgenios M. Kornaropoulos and
Ioannis G. Tollis},
title = {Algorithms for Overloaded Orthogonal Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {2},
pages = {217--246},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00391},
doi = {10.7155/JGAA.00391},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KornaropoulosT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MarkMS16,
author = {Sarah Mark and
Jeanette C. McLeod and
Mike A. Steel},
title = {A navigation system for tree space},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {2},
pages = {247--268},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00392},
doi = {10.7155/JGAA.00392},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/MarkMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RahmanT16,
author = {M. Sohel Rahman and
Etsuji Tomita},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {1},
pages = {1--2},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00381},
doi = {10.7155/JGAA.00381},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RahmanT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Strothmann16,
author = {Thim Strothmann},
title = {The Impact of Communication Patterns on Distributed Self-Adjusting
Binary Search Tree},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {1},
pages = {79--100},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00385},
doi = {10.7155/JGAA.00385},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Strothmann16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/UchizawaYZ16,
author = {Kei Uchizawa and
Daiki Yashima and
Xiao Zhou},
title = {Threshold Circuits Detecting Global Patterns in Two-dimensional Maps},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {1},
pages = {115--131},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00387},
doi = {10.7155/JGAA.00387},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/UchizawaYZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/WangR16,
author = {Yong Wang and
Jeffrey B. Remmel},
title = {A Binomial Distribution Model for the Traveling Salesman Problem Based
on Frequency Quadrilaterals},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {2},
pages = {411--434},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00400},
doi = {10.7155/JGAA.00400},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/WangR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ZhangP16,
author = {Yani Zhang and
Alex Pang},
title = {Graph Layout with Boundary Constraints},
journal = {J. Graph Algorithms Appl.},
volume = {20},
number = {2},
pages = {435--459},
year = {2016},
url = {https://doi.org/10.7155/jgaa.00401},
doi = {10.7155/JGAA.00401},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ZhangP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AertsF15,
author = {Nieke Aerts and
Stefan Felsner},
title = {Straight-Line Triangle Representations via Schnyder Labelings},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {467--505},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00372},
doi = {10.7155/JGAA.00372},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AertsF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AertsF15a,
author = {Nieke Aerts and
Stefan Felsner},
title = {Vertex Contact Representations of Paths on a Grid},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {3},
pages = {817--849},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00380},
doi = {10.7155/JGAA.00380},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AertsF15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AichholzerAADJR15,
author = {Oswin Aichholzer and
Wolfgang Aigner and
Franz Aurenhammer and
Katerina Cech Dobi{\'{a}}sov{\'{a}} and
Bert J{\"{u}}ttler and
G{\"{u}}nter Rote},
title = {Triangulations with Circular Arcs},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {43--65},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00346},
doi = {10.7155/JGAA.00346},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AichholzerAADJR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AichholzerHLMPV15,
author = {Oswin Aichholzer and
Thomas Hackl and
Sarah Lutteropp and
Tamara Mchedlidze and
Alexander Pilz and
Birgit Vogtenhuber},
title = {Monotone Simultaneous Embeddings of Upward Planar Digraphs},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {87--110},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00350},
doi = {10.7155/JGAA.00350},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AichholzerHLMPV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AichholzerHLMV15,
author = {Oswin Aichholzer and
Thomas Hackl and
Sarah Lutteropp and
Tamara Mchedlidze and
Birgit Vogtenhuber},
title = {Embedding Four-directional Paths on Convex Point Sets},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {2},
pages = {743--759},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00368},
doi = {10.7155/JGAA.00368},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AichholzerHLMV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Alam0KM15,
author = {Md. Jawaherul Alam and
Michael Kaufmann and
Stephen G. Kobourov and
Tamara Mchedlidze},
title = {Fitting Planar Graphs on Planar Maps},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {413--440},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00367},
doi = {10.7155/JGAA.00367},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Alam0KM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AsahiroJMO15,
author = {Yuichi Asahiro and
Jesper Jansson and
Eiji Miyano and
Hirotaka Ono},
title = {Graph Orientations Optimizing the Number of Light or Heavy Vertices},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {441--465},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00371},
doi = {10.7155/JGAA.00371},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AsahiroJMO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AuerBGR15,
author = {Christopher Auer and
Franz J. Brandenburg and
Andreas Glei{\ss}ner and
Josef Reislhuber},
title = {1-Planarity of Graphs with a Rotation System},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {67--86},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00347},
doi = {10.7155/JGAA.00347},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AuerBGR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BabbittGK15,
author = {Matthew Babbitt and
Jesse Geneson and
Tanya Khovanova},
title = {On k-visibility graphs},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {345--360},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00362},
doi = {10.7155/JGAA.00362},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BabbittGK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BannisterDEG15,
author = {Michael J. Bannister and
William E. Devanny and
David Eppstein and
Michael T. Goodrich},
title = {The Galois Complexity of Graph Drawing: Why Numerical Solutions are
Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {2},
pages = {619--656},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00349},
doi = {10.7155/JGAA.00349},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BannisterDEG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BekosCFH0NRS15,
author = {Michael A. Bekos and
Sabine Cornelsen and
Martin Fink and
Seok{-}Hee Hong and
Michael Kaufmann and
Martin N{\"{o}}llenburg and
Ignaz Rutter and
Antonios Symvonis},
title = {Many-to-One Boundary Labeling with Backbones},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {3},
pages = {779--816},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00379},
doi = {10.7155/JGAA.00379},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BekosCFH0NRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BekosG0015,
author = {Michael A. Bekos and
Martin Gronemann and
Michael Kaufmann and
Robert Krug},
title = {Planar Octilinear Drawings with One Bend Per Edge},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {2},
pages = {657--680},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00369},
doi = {10.7155/JGAA.00369},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BekosG0015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Bessy0S15,
author = {St{\'{e}}phane Bessy and
Daniel Gon{\c{c}}alves and
Jean{-}S{\'{e}}bastien Sereni},
title = {Two-floor buildings need eight colors},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {1--9},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00344},
doi = {10.7155/JGAA.00344},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Bessy0S15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BorradaileEZ15,
author = {Glencora Borradaile and
David Eppstein and
Pingan Zhu},
title = {Planar Induced Subgraphs of Sparse Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {281--297},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00358},
doi = {10.7155/JGAA.00358},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BorradaileEZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BoseCGMS15,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Carsten Grimm and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Optimal Data Structures for Farthest-Point Queries in Cactus Networks},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {11--41},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00345},
doi = {10.7155/JGAA.00345},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BoseCGMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CardinalHK15,
author = {Jean Cardinal and
Michael Hoffmann and
Vincent Kusters},
title = {On Universal Point Sets for Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {529--547},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00374},
doi = {10.7155/JGAA.00374},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CardinalHK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CardinalK15,
author = {Jean Cardinal and
Vincent Kusters},
title = {The Complexity of Simultaneous Geometric Graph Embedding},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {259--272},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00356},
doi = {10.7155/JGAA.00356},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CardinalK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChanFGLMS15,
author = {Timothy M. Chan and
Fabrizio Frati and
Carsten Gutwenger and
Anna Lubiw and
Petra Mutzel and
Marcus Schaefer},
title = {Drawing Partially Embedded and Simultaneously Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {2},
pages = {681--706},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00375},
doi = {10.7155/JGAA.00375},
timestamp = {Thu, 17 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ChanFGLMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChimaniG15,
author = {Markus Chimani and
Carsten Gutwenger},
title = {Hypergraph and Minor Crossing Number Problems},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {191--222},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00353},
doi = {10.7155/JGAA.00353},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ChimaniG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DehkordiFG15,
author = {Hooman Reisi Dehkordi and
Fabrizio Frati and
Joachim Gudmundsson},
title = {Increasing-Chord Graphs On Point Sets},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {2},
pages = {761--778},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00348},
doi = {10.7155/JGAA.00348},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/DehkordiFG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EfratHKP15,
author = {Alon Efrat and
Yifan Hu and
Stephen G. Kobourov and
Sergey Pupyrev},
title = {MapSets: Visualizing Embedded and Clustered Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {2},
pages = {571--593},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00364},
doi = {10.7155/JGAA.00364},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/EfratHKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Elbassioni15,
author = {Khaled M. Elbassioni},
title = {A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs
of a Given Cardinality},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {273--280},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00357},
doi = {10.7155/JGAA.00357},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Elbassioni15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein15,
author = {David Eppstein},
title = {Metric Dimension Parameterized by Max Leaf Number},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {313--323},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00360},
doi = {10.7155/JGAA.00360},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FinkPW15,
author = {Martin Fink and
Sergey Pupyrev and
Alexander Wolff},
title = {Ordering Metro Lines by Block Crossings},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {111--153},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00351},
doi = {10.7155/JGAA.00351},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/FinkPW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GiacomoLM15,
author = {Emilio Di Giacomo and
Giuseppe Liotta and
Fabrizio Montecchiani},
title = {Drawing Outer 1-planar Graphs with Few Slopes},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {2},
pages = {707--741},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00376},
doi = {10.7155/JGAA.00376},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GiacomoLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GrigorievKL15,
author = {Alexander Grigoriev and
Steven Kelk and
Nela Lekic},
title = {On Low Treewidth Graphs and Supertrees},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {325--343},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00361},
doi = {10.7155/JGAA.00361},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GrigorievKL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HartungKN15,
author = {Sepp Hartung and
Christian Komusiewicz and
Andr{\'{e}} Nichterlein},
title = {Parameterized Algorithmics and Computational Experiments for Finding
2-Clubs},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {155--190},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00352},
doi = {10.7155/JGAA.00352},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HartungKN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LarjomaaP15,
author = {Tommi Larjomaa and
Alexandru Popa},
title = {The Min-Max Edge q-Coloring Problem},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {507--528},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00373},
doi = {10.7155/JGAA.00373},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/LarjomaaP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MeijerW15,
author = {Henk Meijer and
Stephen K. Wismath},
title = {Point Set Embedding in 3D},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {243--257},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00355},
doi = {10.7155/JGAA.00355},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/MeijerW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/NarayanaswamyS15,
author = {N. S. Narayanaswamy and
N. Sadagopan},
title = {Connected (s, t)-Vertex Separator Parameterized by Chordality},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {549--565},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00377},
doi = {10.7155/JGAA.00377},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/NarayanaswamyS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/NocajOB15,
author = {Arlind Nocaj and
Mark Ortmann and
Ulrik Brandes},
title = {Untangling the Hairballs of Multi-Centered, Small-World Online Social
Media Networks},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {2},
pages = {595--618},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00370},
doi = {10.7155/JGAA.00370},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/NocajOB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Pach15,
author = {J{\'{a}}nos Pach},
title = {Every graph admits an unambiguous bold drawing},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {299--312},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00359},
doi = {10.7155/JGAA.00359},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Pach15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Pettie15,
author = {Seth Pettie},
title = {Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann
Time},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {375--391},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00365},
doi = {10.7155/JGAA.00365},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Pettie15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RajanMR15,
author = {R. Sundara Rajan and
Paul D. Manuel and
Indra Rajasingh},
title = {Embeddings Between Hypercubes and Hypertrees},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {361--373},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00363},
doi = {10.7155/JGAA.00363},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RajanMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Schulz15,
author = {Andr{\'{e}} Schulz},
title = {Drawing Graphs with Few Arcs},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {393--412},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00366},
doi = {10.7155/JGAA.00366},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Schulz15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Turau015,
author = {Volker Turau and
Sven K{\"{o}}hler},
title = {A Distributed Algorithm for Minimum Distance-k Domination in Trees},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {1},
pages = {223--242},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00354},
doi = {10.7155/JGAA.00354},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Turau015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/X15,
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {2},
pages = {567--569},
year = {2015},
url = {https://doi.org/10.7155/jgaa.00378},
doi = {10.7155/JGAA.00378},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/X15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AlamM14,
author = {Md. Shafiul Alam and
Asish Mukhopadhyay},
title = {More on Generalized Jewels and the Point Placement Problem},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {1},
pages = {133--173},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00317},
doi = {10.7155/JGAA.00317},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AlamM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniEFKLMTW14,
author = {Patrizio Angelini and
David Eppstein and
Fabrizio Frati and
Michael Kaufmann and
Sylvain Lazard and
Tamara Mchedlidze and
Monique Teillaud and
Alexander Wolff},
title = {Universal Point Sets for Drawing Planar Graphs with Circular Arcs},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {3},
pages = {313--324},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00324},
doi = {10.7155/JGAA.00324},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniEFKLMTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ArikushiT14,
author = {Karin Arikushi and
Csaba D. T{\'{o}}th},
title = {Crossing Angles of Geometric Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {3},
pages = {401--420},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00329},
doi = {10.7155/JGAA.00329},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ArikushiT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BannisterCDE14,
author = {Michael J. Bannister and
Zhanpeng Cheng and
William E. Devanny and
David Eppstein},
title = {Superpatterns and Universal Point Sets},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {2},
pages = {177--209},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00318},
doi = {10.7155/JGAA.00318},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BannisterCDE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Bekos0KLNR14,
author = {Michael A. Bekos and
Michael Kaufmann and
Robert Krug and
Thorsten Ludwig and
Stefan N{\"{a}}her and
Vincenzo Roselli},
title = {Slanted Orthogonal Drawings: Model, Algorithms and Evaluations},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {3},
pages = {459--489},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00332},
doi = {10.7155/JGAA.00332},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Bekos0KLNR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BetzGMRW14,
author = {Gregor Betz and
Andreas Gemsa and
Christof Mathies and
Ignaz Rutter and
Dorothea Wagner},
title = {Column-Based Graph Layouts},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {5},
pages = {677--708},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00341},
doi = {10.7155/JGAA.00341},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BetzGMRW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Brandenburg14,
author = {Franz J. Brandenburg},
title = {1-Visibility Representations of 1-Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {3},
pages = {421--438},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00330},
doi = {10.7155/JGAA.00330},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Brandenburg14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BruckdorferKM14,
author = {Till Bruckdorfer and
Michael Kaufmann and
Fabrizio Montecchiani},
title = {1-Bend Orthogonal Partial Edge Drawing},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {1},
pages = {111--131},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00316},
doi = {10.7155/JGAA.00316},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BruckdorferKM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BrunelGKRW14,
author = {Edith Brunel and
Andreas Gemsa and
Marcus Krug and
Ignaz Rutter and
Dorothea Wagner},
title = {Generalizing Geometric Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {1},
pages = {35--76},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00314},
doi = {10.7155/JGAA.00314},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BrunelGKRW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DamaschkeM14,
author = {Peter Damaschke and
Olof Mogren},
title = {Editing Simple Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {4},
pages = {557--576},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00337},
doi = {10.7155/JGAA.00337},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DamaschkeM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DoerrRS14,
author = {Carola Doerr and
G. Ramakrishna and
Jens M. Schmidt},
title = {Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear
Time},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {3},
pages = {325--346},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00325},
doi = {10.7155/JGAA.00325},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DoerrRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein14,
author = {David Eppstein},
title = {Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {2},
pages = {211--231},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00319},
doi = {10.7155/JGAA.00319},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Evans0LMW14,
author = {William S. Evans and
Michael Kaufmann and
William J. Lenhart and
Tamara Mchedlidze and
Stephen K. Wismath},
title = {Bar 1-Visibility Graphs vs. other Nearly Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {5},
pages = {721--739},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00343},
doi = {10.7155/JGAA.00343},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Evans0LMW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Felsner14,
author = {Stefan Felsner},
title = {Exploiting Air-Pressure to Map Floorplans on Point Sets},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {2},
pages = {233--252},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00320},
doi = {10.7155/JGAA.00320},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Felsner14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Frati14,
author = {Fabrizio Frati},
title = {Multilayer Drawings of Clustered Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {5},
pages = {633--675},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00340},
doi = {10.7155/JGAA.00340},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Frati14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FratiKPTW14,
author = {Fabrizio Frati and
Michael Kaufmann and
J{\'{a}}nos Pach and
Csaba D. T{\'{o}}th and
David R. Wood},
title = {On the Upward Planarity of Mixed Plane Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {2},
pages = {253--279},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00322},
doi = {10.7155/JGAA.00322},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/FratiKPTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GerbnerMPPR14,
author = {D{\'{a}}niel Gerbner and
Viola M{\'{e}}sz{\'{a}}ros and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
Alexey Pokrovskiy and
G{\"{u}}nter Rote},
title = {Advantage in the discrete Voronoi game},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {3},
pages = {439--457},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00331},
doi = {10.7155/JGAA.00331},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GerbnerMPPR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GroshausST14,
author = {Marina Groshaus and
Francisco J. Soulignac and
Pablo Terlisky},
title = {Star and Biclique Coloring and Choosability},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {3},
pages = {347--383},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00326},
doi = {10.7155/JGAA.00326},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GroshausST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GuoS14,
author = {Jiong Guo and
Yash Raj Shrestha},
title = {Complexity of Disjoint {\(\Pi\)}-Vertex Deletion for Disconnected
Forbidden Subgraphs},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {4},
pages = {603--631},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00339},
doi = {10.7155/JGAA.00339},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GuoS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HigashikawaGK14,
author = {Yuya Higashikawa and
Mordecai J. Golin and
Naoki Katoh},
title = {Minimax Regret Sink Location Problem in Dynamic Tree Networks with
Uniform Capacity},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {4},
pages = {539--555},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00336},
doi = {10.7155/JGAA.00336},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HigashikawaGK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HuKV14,
author = {Yifan Hu and
Stephen G. Kobourov and
Sankar Veeramoni},
title = {Embedding, Clustering and Coloring for Dynamic Maps},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {1},
pages = {77--109},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00315},
doi = {10.7155/JGAA.00315},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HuKV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/JacobsTT14,
author = {David Pokrass Jacobs and
Vilmar Trevisan and
Fernando Tura},
title = {Computing the Characteristic Polynomial of Threshold Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {5},
pages = {709--719},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00342},
doi = {10.7155/JGAA.00342},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/JacobsTT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KriegeMS14,
author = {Nils M. Kriege and
Petra Mutzel and
Till Sch{\"{a}}fer},
title = {Practical {SAHN} Clustering for Very Large Data Sets and Expensive
Distance Metrics},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {4},
pages = {577--602},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00338},
doi = {10.7155/JGAA.00338},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KriegeMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LiNV14,
author = {Zhentao Li and
Manikandan Narayanan and
Adrian Vetta},
title = {The Complexity of the Simultaneous Cluster Problem},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {1},
pages = {1--34},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00313},
doi = {10.7155/JGAA.00313},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/LiNV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Lopez-OrtizR14,
author = {Alejandro L{\'{o}}pez{-}Ortiz and
Jazm{\'{\i}}n Romero},
title = {Parameterized Algorithms for the H-Packing with t-Overlap Problem},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {4},
pages = {515--538},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00335},
doi = {10.7155/JGAA.00335},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Lopez-OrtizR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MonroyL14,
author = {Ruy Fabila Monroy and
Jorge L{\'{o}}pez},
title = {Computational search of small point sets with small rectilinear crossing
number},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {3},
pages = {393--399},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00328},
doi = {10.7155/JGAA.00328},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/MonroyL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/PalS14,
author = {Sudebkumar Prasant Pal and
Kunihiko Sadakane},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {4},
pages = {491--492},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00333},
doi = {10.7155/JGAA.00333},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/PalS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/PandaP14,
author = {Bhawani Sankar Panda and
Arti Pandey},
title = {Algorithm and Hardness Results for Outer-connected Dominating Set
in Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {4},
pages = {493--513},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00334},
doi = {10.7155/JGAA.00334},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/PandaP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Purchase14,
author = {Helen C. Purchase},
title = {A healthy critical attitude: Revisiting the results of a graph drawing
study},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {2},
pages = {281--311},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00323},
doi = {10.7155/JGAA.00323},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Purchase14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ScornavaccaIKB14,
author = {C{\'{e}}line Scornavacca and
Leo van Iersel and
Steven Kelk and
David Bryant},
title = {The agreement problem for unrooted phylogenetic trees is {FPT}},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {3},
pages = {385--392},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00327},
doi = {10.7155/JGAA.00327},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ScornavaccaIKB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/WismathW14,
author = {Stephen K. Wismath and
Alexander Wolff},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {2},
pages = {174--175},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00321},
doi = {10.7155/JGAA.00321},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/WismathW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ArgyriouBKS13,
author = {Evmorfia N. Argyriou and
Michael A. Bekos and
Michael Kaufmann and
Antonios Symvonis},
title = {Geometric {RAC} Simultaneous Drawings of Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {1},
pages = {11--34},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00282},
doi = {10.7155/JGAA.00282},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ArgyriouBKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AuerBBGR13,
author = {Christopher Auer and
Christian Bachmaier and
Franz J. Brandenburg and
Andreas Glei{\ss}ner and
Josef Reislhuber},
title = {Optical Graph Recognition},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {4},
pages = {541--565},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00303},
doi = {10.7155/JGAA.00303},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AuerBBGR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BachmaierM13,
author = {Christian Bachmaier and
Marco Matzeder},
title = {Drawing Unordered Trees on k-Grids},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {2},
pages = {103--128},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00287},
doi = {10.7155/JGAA.00287},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BachmaierM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BauerBRW13,
author = {Reinhard Bauer and
Moritz Baum and
Ignaz Rutter and
Dorothea Wagner},
title = {On the Complexity of Partitioning Graphs for Arc-Flags},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {3},
pages = {265--299},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00294},
doi = {10.7155/JGAA.00294},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BauerBRW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BekosKKS13,
author = {Michael A. Bekos and
Michael Kaufmann and
Stephen G. Kobourov and
Antonios Symvonis},
title = {Smooth Orthogonal Layouts},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {5},
pages = {575--595},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00305},
doi = {10.7155/JGAA.00305},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BekosKKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BrandesP13,
author = {Ulrik Brandes and
Barbara Pampel},
title = {Orthogonal-Ordering Constraints are Tough},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {1},
pages = {1--10},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00281},
doi = {10.7155/JGAA.00281},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BrandesP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BrunschCMR13,
author = {Tobias Brunsch and
Kamiel Cornelissen and
Bodo Manthey and
Heiko R{\"{o}}glin},
title = {Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and
Matching},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {6},
pages = {647--670},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00310},
doi = {10.7155/JGAA.00310},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BrunschCMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChambersE13,
author = {Erin W. Chambers and
David Eppstein},
title = {Flows in One-Crossing-Minor-Free Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {3},
pages = {201--220},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00291},
doi = {10.7155/JGAA.00291},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ChambersE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChaplickU13,
author = {Steven Chaplick and
Torsten Ueckerdt},
title = {Planar Graphs as VPG-Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {4},
pages = {475--494},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00300},
doi = {10.7155/JGAA.00300},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ChaplickU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChimaniH13,
author = {Markus Chimani and
Philipp Hungerl{\"{a}}nder},
title = {Multi-level Verticality Optimization: Concept, Strategies, and Drawing
Scheme},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {3},
pages = {329--362},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00296},
doi = {10.7155/JGAA.00296},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ChimaniH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DidimoP13,
author = {Walter Didimo and
Maurizio Patrignani},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {4},
pages = {363--365},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00297},
doi = {10.7155/JGAA.00297},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DidimoP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DurocherMNW13,
author = {Stephane Durocher and
Debajyoti Mondal and
Rahnuma Islam Nishat and
Sue Whitesides},
title = {A Note on Minimum-Segment Drawings of Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {3},
pages = {301--328},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00295},
doi = {10.7155/JGAA.00295},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/DurocherMNW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein13,
author = {David Eppstein},
title = {The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {1},
pages = {35--55},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00283},
doi = {10.7155/JGAA.00283},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EppsteinLMN13,
author = {David Eppstein and
Maarten L{\"{o}}ffler and
Elena Mumford and
Martin N{\"{o}}llenburg},
title = {Optimal 3D Angular Resolution for Low-Degree Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {3},
pages = {173--200},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00290},
doi = {10.7155/JGAA.00290},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EppsteinLMN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EppsteinS13,
author = {David Eppstein and
Joseph A. Simons},
title = {Confluent Hasse Diagrams},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {7},
pages = {689--710},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00312},
doi = {10.7155/JGAA.00312},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EppsteinS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FratiFR13,
author = {Fabrizio Frati and
Radoslav Fulek and
Andres J. Ruiz{-}Vargas},
title = {On the Page Number of Upward Planar Directed Acyclic Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {3},
pages = {221--244},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00292},
doi = {10.7155/JGAA.00292},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/FratiFR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GansnerHN13,
author = {Emden R. Gansner and
Yifan Hu and
Stephen C. North},
title = {Interactive Visualization of Streaming Text Data with Dynamic Maps},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {4},
pages = {515--540},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00302},
doi = {10.7155/JGAA.00302},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GansnerHN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Ghosh13,
author = {Subir Kumar Ghosh},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {6},
pages = {597--598},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00306},
doi = {10.7155/JGAA.00306},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Ghosh13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HaeuplerJL13,
author = {Bernhard Haeupler and
Krishnam Raju Jampani and
Anna Lubiw},
title = {Testing Simultaneous Planarity when the Common Graph is 2-Connected},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {3},
pages = {147--171},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00289},
doi = {10.7155/JGAA.00289},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HaeuplerJL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Hasan0K13,
author = {Md. Manzurul Hasan and
Md. Saidur Rahman and
Muhammad Rezaul Karim},
title = {Box-Rectangular Drawings of Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {6},
pages = {629--646},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00309},
doi = {10.7155/JGAA.00309},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Hasan0K13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HossainM0S13,
author = {Md. Iqbal Hossain and
Debajyoti Mondal and
Md. Saidur Rahman and
Sammi Abida Salma},
title = {Universal Line-Sets for Drawing Planar 3-Trees},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {2},
pages = {59--79},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00285},
doi = {10.7155/JGAA.00285},
timestamp = {Wed, 13 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HossainM0S13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KrithikaN13,
author = {R. Krithika and
N. S. Narayanaswamy},
title = {Parameterized Algorithms for (r, l)-Partization},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {2},
pages = {129--146},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00288},
doi = {10.7155/JGAA.00288},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KrithikaN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LiW13,
author = {Peng Li and
Yaokun Wu},
title = {Maximal Neighborhood Search and Rigid Interval Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {3},
pages = {245--264},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00293},
doi = {10.7155/JGAA.00293},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/LiW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MishraP13,
author = {Tapas Kumar Mishra and
Sudebkumar Prasant Pal},
title = {Lower bounds for Ramsey numbers for complete bipartite and 3-uniform
tripartite subgraphs},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {6},
pages = {671--688},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00311},
doi = {10.7155/JGAA.00311},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/MishraP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Nakano13,
author = {Shin{-}Ichi Nakano},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {2},
pages = {57--58},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00284},
doi = {10.7155/JGAA.00284},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Nakano13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/NollenburgPR13,
author = {Martin N{\"{o}}llenburg and
Roman Prutkin and
Ignaz Rutter},
title = {Edge-weighted contact representations of planar graphs},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {4},
pages = {441--473},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00299},
doi = {10.7155/JGAA.00299},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/NollenburgPR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/OlsenR13,
author = {Martin Olsen and
Morten Revsb{\ae}k},
title = {On Alliance Partitions and Bisection Width for Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {6},
pages = {599--614},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00307},
doi = {10.7155/JGAA.00307},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/OlsenR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RamanSS13,
author = {Venkatesh Raman and
Saket Saurabh and
Ondrej Such{\'{y}}},
title = {An {FPT} algorithm for Tree Deletion Set},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {6},
pages = {615--628},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00308},
doi = {10.7155/JGAA.00308},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RamanSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Salma0H13,
author = {Sammi Abida Salma and
Md. Saidur Rahman and
Md. Iqbal Hossain},
title = {Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {2},
pages = {81--102},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00286},
doi = {10.7155/JGAA.00286},
timestamp = {Wed, 13 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Salma0H13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/SarmaGLN13,
author = {Atish Das Sarma and
Amita Gajewar and
Richard J. Lipton and
Danupon Nanongkai},
title = {An Approximate Restatement of the Four-Color Theorem},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {5},
pages = {567--573},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00304},
doi = {10.7155/JGAA.00304},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/SarmaGLN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Schaefer13,
author = {Marcus Schaefer},
title = {Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {4},
pages = {367--440},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00298},
doi = {10.7155/JGAA.00298},
timestamp = {Thu, 17 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Schaefer13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Tantau13,
author = {Till Tantau},
title = {Graph Drawing in TikZ},
journal = {J. Graph Algorithms Appl.},
volume = {17},
number = {4},
pages = {495--513},
year = {2013},
url = {https://doi.org/10.7155/jgaa.00301},
doi = {10.7155/JGAA.00301},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Tantau13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AlamBFKK12,
author = {Md. Jawaherul Alam and
Therese Biedl and
Stefan Felsner and
Michael Kaufmann and
Stephen G. Kobourov},
title = {Proportional Contact Representations of Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {3},
pages = {701--728},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00276},
doi = {10.7155/JGAA.00276},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AlamBFKK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniCBFP12,
author = {Patrizio Angelini and
Enrico Colasante and
Giuseppe Di Battista and
Fabrizio Frati and
Maurizio Patrignani},
title = {Monotone Drawings of Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {1},
pages = {5--35},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00249},
doi = {10.7155/JGAA.00249},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniCBFP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniGKN12,
author = {Patrizio Angelini and
Markus Geyer and
Michael Kaufmann and
Daniel Neuwirth},
title = {On a Tree and a Path with no Geometric Simultaneous Embedding},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {1},
pages = {37--83},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00250},
doi = {10.7155/JGAA.00250},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniGKN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ArgyriouBS12,
author = {Evmorfia N. Argyriou and
Michael A. Bekos and
Antonios Symvonis},
title = {The Straight-Line {RAC} Drawing Problem is NP-Hard},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {569--597},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00274},
doi = {10.7155/JGAA.00274},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ArgyriouBS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AsinowskiCGLLS12,
author = {Andrei Asinowski and
Elad Cohen and
Martin Charles Golumbic and
Vincent Limouzy and
Marina Lipshteyn and
Michal Stern},
title = {Vertex Intersection Graphs of Paths on a Grid},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {129--150},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00253},
doi = {10.7155/JGAA.00253},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AsinowskiCGLLS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BachmaierBBF12,
author = {Christian Bachmaier and
Franz{-}Josef Brandenburg and
Wolfgang Brunner and
Raymund F{\"{u}}l{\"{o}}p},
title = {Drawing Recurrent Hierarchies},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {151--198},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00254},
doi = {10.7155/JGAA.00254},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BachmaierBBF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BannisterES12,
author = {Michael J. Bannister and
David Eppstein and
Joseph A. Simons},
title = {Inapproximability of Orthogonal Compaction},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {3},
pages = {651--673},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00263},
doi = {10.7155/JGAA.00263},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BannisterES12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BattistaSN12,
author = {Giuseppe Di Battista and
Claudio Squarcella and
Wolfgang Nagele},
title = {How to Visualize the K-root Name Server},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {3},
pages = {675--699},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00267},
doi = {10.7155/JGAA.00267},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BattistaSN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BauerDDSW12,
author = {Reinhard Bauer and
Gianlorenzo D'Angelo and
Daniel Delling and
Andrea Schumm and
Dorothea Wagner},
title = {The Shortcut Problem - Complexity and Algorithms},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {447--481},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00270},
doi = {10.7155/JGAA.00270},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BauerDDSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Ben-MosheDST12,
author = {Boaz Ben{-}Moshe and
Amit Dvir and
Michael Segal and
Arie Tamir},
title = {Centdian Computation in Cactus Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {199--224},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00255},
doi = {10.7155/JGAA.00255},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Ben-MosheDST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Boyer12,
author = {John M. Boyer},
title = {Subgraph Homeomorphism via the Edge Addition Planarity Algorithm},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {381--410},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00268},
doi = {10.7155/JGAA.00268},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Boyer12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BrandesC12,
author = {Ulrik Brandes and
Sabine Cornelsen},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {1},
pages = {3--4},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00248},
doi = {10.7155/JGAA.00248},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BrandesC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChambersEGL12,
author = {Erin W. Chambers and
David Eppstein and
Michael T. Goodrich and
Maarten L{\"{o}}ffler},
title = {Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial
Area},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {243--259},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00257},
doi = {10.7155/JGAA.00257},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ChambersEGL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChimaniG12,
author = {Markus Chimani and
Carsten Gutwenger},
title = {Advances in the Planarization Method: Effective Multiple Edge Insertions},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {3},
pages = {729--757},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00264},
doi = {10.7155/JGAA.00264},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ChimaniG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChristofidesKKO12,
author = {Demetres Christofides and
Peter Keevash and
Daniela K{\"{u}}hn and
Deryk Osthus},
title = {Finding Hamilton cycles in robustly expanding digraphs},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {335--358},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00261},
doi = {10.7155/JGAA.00261},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ChristofidesKKO12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CornelsenK12,
author = {Sabine Cornelsen and
Andreas Karrenbauer},
title = {Accelerated Bend Minimization},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {3},
pages = {635--650},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00265},
doi = {10.7155/JGAA.00265},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CornelsenK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DuncanEGKN12,
author = {Christian A. Duncan and
David Eppstein and
Michael T. Goodrich and
Stephen G. Kobourov and
Martin N{\"{o}}llenburg},
title = {Lombardi Drawings of Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {1},
pages = {85--108},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00251},
doi = {10.7155/JGAA.00251},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DuncanEGKN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EppsteinS12,
author = {David Eppstein and
Emma S. Spiro},
title = {The h-Index of a Graph and its Application to Dynamic Subgraph Statistics},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {543--567},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00273},
doi = {10.7155/JGAA.00273},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/EppsteinS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FulekPSS12,
author = {Radoslav Fulek and
Michael J. Pelsmajer and
Marcus Schaefer and
Daniel Stefankovic},
title = {Adjacent Crossings Do Matter},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {3},
pages = {759--782},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00266},
doi = {10.7155/JGAA.00266},
timestamp = {Thu, 17 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/FulekPSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GorkeHW12,
author = {Robert G{\"{o}}rke and
Tanja Hartmann and
Dorothea Wagner},
title = {Dynamic Graph Clustering Using Minimum-Cut Trees},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {411--446},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00269},
doi = {10.7155/JGAA.00269},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GorkeHW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HalupczokS12,
author = {Immanuel Halupczok and
Andr{\'{e}} Schulz},
title = {Pinning balloons with perfect angles and optimal area},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {4},
pages = {847--870},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00280},
doi = {10.7155/JGAA.00280},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HalupczokS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/JampaniL12,
author = {Krishnam Raju Jampani and
Anna Lubiw},
title = {The Simultaneous Representation Problem for Chordal, Comparability
and Permutation Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {283--315},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00259},
doi = {10.7155/JGAA.00259},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/JampaniL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Jansen12,
author = {Bart M. P. Jansen},
title = {Kernelization for Maximum Leaf Spanning Tree with Positive Vertex
Weights},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {4},
pages = {811--846},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00279},
doi = {10.7155/JGAA.00279},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Jansen12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KreveldS12,
author = {Marc J. van Kreveld and
Bettina Speckmann},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {3},
pages = {631--633},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00277},
doi = {10.7155/JGAA.00277},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KreveldS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LozzoBI12,
author = {Giordano Da Lozzo and
Giuseppe Di Battista and
Francesco Ingrassia},
title = {Drawing Graphs on a Smartphone},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {1},
pages = {109--126},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00252},
doi = {10.7155/JGAA.00252},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/LozzoBI12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/McColm12,
author = {Gregory L. McColm},
title = {Generating Geometric Graphs Using Automorphisms},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {507--541},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00272},
doi = {10.7155/JGAA.00272},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/McColm12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MoharS12,
author = {Bojan Mohar and
Petr Skoda},
title = {Minimizing the Number of Label Transitions Around a Nonseparating
Vertex of a Planar Graph},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {225--241},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00256},
doi = {10.7155/JGAA.00256},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/MoharS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Rosenberg12,
author = {Arnold L. Rosenberg},
title = {The Parking Problem for Finite-State Robots},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {483--506},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00271},
doi = {10.7155/JGAA.00271},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Rosenberg12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RutterW12,
author = {Ignaz Rutter and
Alexander Wolff},
title = {Augmenting the Connectivity of Planar and Geometric Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {599--628},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00275},
doi = {10.7155/JGAA.00275},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RutterW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/StevensW12,
author = {Brett Stevens and
Aaron Williams},
title = {Hamilton Cycles in Restricted and Incomplete Rotator Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {4},
pages = {785--810},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00278},
doi = {10.7155/JGAA.00278},
timestamp = {Thu, 18 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/StevensW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/TsiarasT12,
author = {Vassilis Tsiaras and
Ioannis G. Tollis},
title = {DAGmaps and {\(\epsilon\)}-Visibility Representations for DAGs: Algorithms
and Characterizations},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {359--380},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00262},
doi = {10.7155/JGAA.00262},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/TsiarasT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/WangH12,
author = {Jiun{-}Jie Wang and
Xin He},
title = {Visibility Representation of Plane Graphs with Simultaneous Bound
for Both Width and Height},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {317--334},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00260},
doi = {10.7155/JGAA.00260},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/WangH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Zucker12,
author = {Shira Zucker},
title = {The Black-and-White Coloring Problem on Chordal Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {261--281},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00258},
doi = {10.7155/JGAA.00258},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Zucker12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniCDFBKS11,
author = {Patrizio Angelini and
Luca Cittadini and
Walter Didimo and
Fabrizio Frati and
Giuseppe Di Battista and
Michael Kaufmann and
Antonios Symvonis},
title = {On the Perspectives Opened by Right Angle Crossing Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {1},
pages = {53--78},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00217},
doi = {10.7155/JGAA.00217},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniCDFBKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AsanoMW11,
author = {Tetsuo Asano and
Wolfgang Mulzer and
Yajun Wang},
title = {Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple
Polygons},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {5},
pages = {569--586},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00240},
doi = {10.7155/JGAA.00240},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AsanoMW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BachmaierBBH11,
author = {Christian Bachmaier and
Franz{-}Josef Brandenburg and
Wolfgang Brunner and
Ferdinand H{\"{u}}bner},
title = {Global k-Level Crossing Reduction},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {5},
pages = {631--659},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00242},
doi = {10.7155/JGAA.00242},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BachmaierBBH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BadentBC11,
author = {Melanie Badent and
Ulrik Brandes and
Sabine Cornelsen},
title = {More Canonical Ordering},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {1},
pages = {97--126},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00219},
doi = {10.7155/JGAA.00219},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BadentBC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BinucciGDR11,
author = {Carla Binucci and
Emilio Di Giacomo and
Walter Didimo and
Aimal Rextin},
title = {Switch-Regular Upward Planarity Testing of Directed Trees},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {5},
pages = {587--629},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00241},
doi = {10.7155/JGAA.00241},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BinucciGDR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BorriCP11,
author = {Alessandro Borri and
Tiziana Calamoneri and
Rossella Petreschi},
title = {Recognition of Unigraphs through Superposition of Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {3},
pages = {323--343},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00229},
doi = {10.7155/JGAA.00229},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BorriCP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BrandesP11,
author = {Ulrik Brandes and
Christian Pich},
title = {More Flexible Radial Layout},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {1},
pages = {157--173},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00221},
doi = {10.7155/JGAA.00221},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BrandesP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BuchinKMSV11,
author = {Kevin Buchin and
Marc J. van Kreveld and
Henk Meijer and
Bettina Speckmann and
Kevin Verbeek},
title = {On Planar Supports for Hypergraphs},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {4},
pages = {533--549},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00237},
doi = {10.7155/JGAA.00237},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BuchinKMSV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CabelloKLMSV11,
author = {Sergio Cabello and
Marc J. van Kreveld and
Giuseppe Liotta and
Henk Meijer and
Bettina Speckmann and
Kevin Verbeek},
title = {Geometric Simultaneous Embeddings of a Graph and a Matching},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {1},
pages = {79--96},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00218},
doi = {10.7155/JGAA.00218},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/CabelloKLMSV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChangHKP11,
author = {Maw{-}Shang Chang and
Ling{-}Ju Hung and
Ton Kloks and
Sheng{-}Lung Peng},
title = {On the threshold-width of graphs},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {2},
pages = {253--268},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00225},
doi = {10.7155/JGAA.00225},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ChangHKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChimaniGMW11,
author = {Markus Chimani and
Carsten Gutwenger and
Petra Mutzel and
Hoi{-}Ming Wong},
title = {Upward Planarization Layout},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {1},
pages = {127--155},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00220},
doi = {10.7155/JGAA.00220},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ChimaniGMW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DasU11,
author = {Sandip Das and
Ryuhei Uehara},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {3},
pages = {319--321},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00228},
doi = {10.7155/JGAA.00228},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DasU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DidimoLR11,
author = {Walter Didimo and
Giuseppe Liotta and
Salvatore Agostino Romeo},
title = {A Graph Drawing Application to Web Site Traffic Analysis},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {2},
pages = {229--251},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00224},
doi = {10.7155/JGAA.00224},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DidimoLR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DuncanGK11,
author = {Christian A. Duncan and
Michael T. Goodrich and
Stephen G. Kobourov},
title = {Planar Drawings of Higher-Genus Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {1},
pages = {7--32},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00215},
doi = {10.7155/JGAA.00215},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DuncanGK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein11,
author = {David Eppstein},
title = {Recognizing Partial Cubes in Quadratic Time},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {2},
pages = {269--293},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00226},
doi = {10.7155/JGAA.00226},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EppsteinG11,
author = {David Eppstein and
Emden R. Gansner},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {1},
pages = {3--5},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00214},
doi = {10.7155/JGAA.00214},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EppsteinG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EppsteinW11,
author = {David Eppstein and
Kevin A. Wortman},
title = {Optimal Angular Resolution for Face-Symmetric Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {4},
pages = {551--564},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00238},
doi = {10.7155/JGAA.00238},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EppsteinW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Gross11,
author = {Jonathan L. Gross},
title = {Genus Distributions of Cubic Outerplanar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {2},
pages = {295--316},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00227},
doi = {10.7155/JGAA.00227},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Gross11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HasheminezhadMR11,
author = {Mahdieh Hasheminezhad and
Brendan D. McKay and
Tristan Reeves},
title = {Recursive generation of simple planar 5-regular graphs and pentangulations},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {3},
pages = {417--436},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00232},
doi = {10.7155/JGAA.00232},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/HasheminezhadMR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HaverkortT11,
author = {Herman J. Haverkort and
Laura Toma},
title = {I/O-Efficient Algorithms on Near-Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {4},
pages = {503--532},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00236},
doi = {10.7155/JGAA.00236},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HaverkortT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KarakawaMN11,
author = {Seigo Karakawa and
Ehab Morsy and
Hiroshi Nagamochi},
title = {Minmax Tree Cover in the Euclidean Space},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {3},
pages = {345--371},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00230},
doi = {10.7155/JGAA.00230},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KarakawaMN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KarimAR11,
author = {Muhammad Rezaul Karim and
Md. Jawaherul Alam and
Md. Saidur Rahman},
title = {Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs
with O(n log n) Area},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {3},
pages = {437--456},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00233},
doi = {10.7155/JGAA.00233},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KarimAR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LubiwP11,
author = {Anna Lubiw and
Mark Petrick},
title = {Morphing Planar Graph Drawings with Bent Edges},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {2},
pages = {205--227},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00223},
doi = {10.7155/JGAA.00223},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/LubiwP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MchedlidzeS11,
author = {Tamara Mchedlidze and
Antonios Symvonis},
title = {Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {3},
pages = {373--415},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00231},
doi = {10.7155/JGAA.00231},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/MchedlidzeS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MondalNRA11,
author = {Debajyoti Mondal and
Rahnuma Islam Nishat and
Md. Saidur Rahman and
Muhammad Jawaherul Alam},
title = {Minimum-Area Drawings of Plane 3-Trees},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {2},
pages = {177--204},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00222},
doi = {10.7155/JGAA.00222},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/MondalNRA11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/OkamotoOUU11,
author = {Yoshio Okamoto and
Yota Otachi and
Ryuhei Uehara and
Takeaki Uno},
title = {Hardness Results and an Exact Exponential Algorithm for the Spanning
Tree Congestion Problem},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {6},
pages = {727--751},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00246},
doi = {10.7155/JGAA.00246},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/OkamotoOUU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ParvezRN11,
author = {Mohammad Tanvir Parvez and
Md. Saidur Rahman and
Shin{-}Ichi Nakano},
title = {Generating All Triangulations of Plane Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {3},
pages = {457--482},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00234},
doi = {10.7155/JGAA.00234},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ParvezRN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RahmanF11,
author = {Md. Saidur Rahman and
Satoshi Fujita},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {5},
pages = {567--568},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00239},
doi = {10.7155/JGAA.00239},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RahmanF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ReddyR11,
author = {T. V. Thirumala Reddy and
C. Pandu Rangan},
title = {Variants of Spreading Messages},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {5},
pages = {683--699},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00244},
doi = {10.7155/JGAA.00244},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ReddyR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Schulz11,
author = {Andr{\'{e}} Schulz},
title = {Drawing 3-Polytopes with Good Vertex Resolution},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {1},
pages = {33--52},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00216},
doi = {10.7155/JGAA.00216},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Schulz11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ShigezumiUW11,
author = {Takeya Shigezumi and
Yushi Uno and
Osamu Watanabe},
title = {A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {5},
pages = {661--682},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00243},
doi = {10.7155/JGAA.00243},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ShigezumiUW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/TeramotoDU11,
author = {Sachio Teramoto and
Erik D. Demaine and
Ryuhei Uehara},
title = {The Voronoi game on graphs and its complexity},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {4},
pages = {485--501},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00235},
doi = {10.7155/JGAA.00235},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/TeramotoDU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/TsourakakisKM11,
author = {Charalampos E. Tsourakakis and
Mihail N. Kolountzakis and
Gary L. Miller},
title = {Triangle Sparsifiers},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {6},
pages = {703--726},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00245},
doi = {10.7155/JGAA.00245},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/TsourakakisKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/VijayalakshmiNRTN11,
author = {Ramasamy Vijayalakshmi and
Nadarajan Rethnasamy and
John F. Roddick and
M. Thilaga and
Parisutham Nirmala},
title = {FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network
Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {6},
pages = {753--776},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00247},
doi = {10.7155/JGAA.00247},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/VijayalakshmiNRTN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AckermanBKR10,
author = {Eyal Ackerman and
Kevin Buchin and
Christian Knauer and
G{\"{u}}nter Rote},
title = {Acyclic Orientation of Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {367--384},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00211},
doi = {10.7155/JGAA.00211},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AckermanBKR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AlamSRR10,
author = {Muhammad Jawaherul Alam and
Md. Abul Hassan Samee and
Mashfiqui Rabbi and
Md. Saidur Rahman},
title = {Minimum-Layer Upward Drawings of Trees},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {245--267},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00206},
doi = {10.7155/JGAA.00206},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AlamSRR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngeliniFG10,
author = {Patrizio Angelini and
Fabrizio Frati and
Luca Grilli},
title = {An Algorithm to Construct Greedy Drawings of Triangulations},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {1},
pages = {19--51},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00197},
doi = {10.7155/JGAA.00197},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/AngeliniFG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ArgyriouBKS10,
author = {Evmorfia N. Argyriou and
Michael A. Bekos and
Michael Kaufmann and
Antonios Symvonis},
title = {On Metro-Line Crossing Minimization},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {1},
pages = {75--96},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00199},
doi = {10.7155/JGAA.00199},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ArgyriouBKS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BuchinCGLLRSSW10,
author = {Kevin Buchin and
Sergio Cabello and
Joachim Gudmundsson and
Maarten L{\"{o}}ffler and
Jun Luo and
G{\"{u}}nter Rote and
Rodrigo I. Silveira and
Bettina Speckmann and
Thomas Wolle},
title = {Finding the Most Relevant Fragments in Networks},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {307--336},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00209},
doi = {10.7155/JGAA.00209},
timestamp = {Mon, 11 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BuchinCGLLRSSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ClearyJ10,
author = {Sean Cleary and
Katherine St. John},
title = {A Linear-Time Approximation Algorithm for Rotation Distance},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {385--390},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00212},
doi = {10.7155/JGAA.00212},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ClearyJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DangelmayrFT10,
author = {Cornelia Dangelmayr and
Stefan Felsner and
William T. Trotter},
title = {Intersection Graphs of Pseudosegments: Chordal Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {199--220},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00204},
doi = {10.7155/JGAA.00204},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DangelmayrFT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DasGW10,
author = {Shantanu Das and
Beat Gfeller and
Peter Widmayer},
title = {Computing All Best Swaps for Minimum-Stretch Tree Spanners},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {287--306},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00208},
doi = {10.7155/JGAA.00208},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DasGW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GansnerH10,
author = {Emden R. Gansner and
Yifan Hu},
title = {Efficient, Proximity-Preserving Node Overlap Removal},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {1},
pages = {53--74},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00198},
doi = {10.7155/JGAA.00198},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GansnerH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GiacomoDLP10,
author = {Emilio Di Giacomo and
Walter Didimo and
Giuseppe Liotta and
Pietro Palladino},
title = {Visual Analysis of One-To-Many Matched Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {1},
pages = {97--119},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00200},
doi = {10.7155/JGAA.00200},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GiacomoDLP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GorkeGHW10,
author = {Robert G{\"{o}}rke and
Marco Gaertler and
Florian H{\"{u}}bner and
Dorothea Wagner},
title = {Computational Aspects of Lucidity-Driven Graph Clustering},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {165--197},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00203},
doi = {10.7155/JGAA.00203},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/GorkeGHW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KeszeghPPT10,
author = {Bal{\'{a}}zs Keszegh and
J{\'{a}}nos Pach and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi and
G{\'{e}}za T{\'{o}}th},
title = {Cubic graphs have bounded slope parameter},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {1},
pages = {5--17},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00196},
doi = {10.7155/JGAA.00196},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KeszeghPPT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KlugeBR10,
author = {Sebastian Kluge and
Martin Brokate and
Konrad Reif},
title = {New complexity results for time-constrained dynamical optimal path
problems},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {123--147},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00201},
doi = {10.7155/JGAA.00201},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KlugeBR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LozinM10,
author = {Vadim V. Lozin and
Martin Milanic},
title = {On the Maximum Independent Set Problem in Subclasses of Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {269--286},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00207},
doi = {10.7155/JGAA.00207},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/LozinM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/PapamanthouT10,
author = {Charalampos Papamanthou and
Ioannis G. Tollis},
title = {Applications of Parameterized st-Orientations},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {337--365},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00210},
doi = {10.7155/JGAA.00210},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/PapamanthouT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ShiouraY10,
author = {Akiyoshi Shioura and
Mutsunori Yagiura},
title = {A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with
Balanced Conditions},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {391--407},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00213},
doi = {10.7155/JGAA.00213},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ShiouraY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Sieben10,
author = {N{\'{a}}ndor Sieben},
title = {A Graph Pebbling Algorithm on Weighted Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {221--244},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00205},
doi = {10.7155/JGAA.00205},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Sieben10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/TollisP10,
author = {Ioannis G. Tollis and
Maurizio Patrignani},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {1},
pages = {3--4},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00195},
doi = {10.7155/JGAA.00195},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/TollisP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Wildstrom10,
author = {D. Jacob Wildstrom},
title = {Resource relocation on asymmetric networks},
journal = {J. Graph Algorithms Appl.},
volume = {14},
number = {2},
pages = {149--163},
year = {2010},
url = {https://doi.org/10.7155/jgaa.00202},
doi = {10.7155/JGAA.00202},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Wildstrom10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngibaudFRTV09,
author = {S{\'{e}}bastien Angibaud and
Guillaume Fertin and
Irena Rusu and
Annelyse Th{\'{e}}venin and
St{\'{e}}phane Vialette},
title = {On the Approximability of Comparing Genomes with Duplicates},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {1},
pages = {19--53},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00175},
doi = {10.7155/JGAA.00175},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AngibaudFRTV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BattistaF09,
author = {Giuseppe Di Battista and
Fabrizio Frati},
title = {Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with
Small Faces},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {3},
pages = {349--378},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00191},
doi = {10.7155/JGAA.00191},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BattistaF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BenkertHKN09,
author = {Marc Benkert and
Herman J. Haverkort and
Moritz Kroll and
Martin N{\"{o}}llenburg},
title = {Algorithms for Multi-Criteria Boundary Labeling},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {3},
pages = {289--317},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00189},
doi = {10.7155/JGAA.00189},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BenkertHKN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BentzCPRW09,
author = {C{\'{e}}dric Bentz and
Marie{-}Christine Costa and
Christophe Picouleau and
Bernard Ries and
Dominique de Werra},
title = {Degree-constrained edge partitioning in graphs arising from discrete
tomography},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {2},
pages = {99--118},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00178},
doi = {10.7155/JGAA.00178},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BentzCPRW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BerendZ09,
author = {Daniel Berend and
Shira Zucker},
title = {The Black-and-White Coloring Problem on Trees},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {2},
pages = {133--152},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00180},
doi = {10.7155/JGAA.00180},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BerendZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BrandesF09,
author = {Ulrik Brandes and
Daniel Fleischer},
title = {Vertex Bisection is Hard, too},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {2},
pages = {119--131},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00179},
doi = {10.7155/JGAA.00179},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BrandesF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DaescuK09,
author = {Ovidiu Daescu and
Anastasia Kurdia},
title = {Towards an optimal algorithm for recognizing Laman graphs},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {2},
pages = {219--232},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00185},
doi = {10.7155/JGAA.00185},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DaescuK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein09,
author = {David Eppstein},
title = {Finding Large Clique Minors is Hard},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {2},
pages = {197--204},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00183},
doi = {10.7155/JGAA.00183},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FratiKK09,
author = {Fabrizio Frati and
Michael Kaufmann and
Stephen G. Kobourov},
title = {Constrained Simultaneous and Near-Simultaneous Embeddings},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {3},
pages = {447--465},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00194},
doi = {10.7155/JGAA.00194},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/FratiKK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GiacomoDKLS09,
author = {Emilio Di Giacomo and
Walter Didimo and
Marc J. van Kreveld and
Giuseppe Liotta and
Bettina Speckmann},
title = {Matched Drawings of Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {3},
pages = {423--445},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00193},
doi = {10.7155/JGAA.00193},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GiacomoDKLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HongN09,
author = {Seok{-}Hee Hong and
Hiroshi Nagamochi},
title = {New Approximation to the One-sided Radial Crossing Minimization},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {2},
pages = {179--196},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00182},
doi = {10.7155/JGAA.00182},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/HongN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HongN09a,
author = {Seok{-}Hee Hong and
Takao Nishizeki},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {3},
pages = {285--287},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00188},
doi = {10.7155/JGAA.00188},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/HongN09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Huffner09,
author = {Falk H{\"{u}}ffner},
title = {Algorithm Engineering for Optimal Graph Bipartization},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {2},
pages = {77--98},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00177},
doi = {10.7155/JGAA.00177},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Huffner09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ItoPS09,
author = {Hiro Ito and
Mike Paterson and
Kenya Sugihara},
title = {The Multi-Commodity Source Location Problems and the Price of Greed},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {1},
pages = {55--73},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00176},
doi = {10.7155/JGAA.00176},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ItoPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/JelinkovaKKPSV09,
author = {Eva Jel{\'{\i}}nkov{\'{a}} and
Jan K{\'{a}}ra and
Jan Kratochv{\'{\i}}l and
Martin Pergel and
Ondrej Such{\'{y}} and
Tom{\'{a}}s Vyskocil},
title = {Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {3},
pages = {379--422},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00192},
doi = {10.7155/JGAA.00192},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/JelinkovaKKPSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/JungerS09,
author = {Michael J{\"{u}}nger and
Michael Schulz},
title = {Intersection Graphs in Simultaneous Embedding with Fixed Edges},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {2},
pages = {205--218},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00184},
doi = {10.7155/JGAA.00184},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/JungerS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KarimR09,
author = {Muhammad Rezaul Karim and
Md. Saidur Rahman},
title = {On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear
Area},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {2},
pages = {153--177},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00181},
doi = {10.7155/JGAA.00181},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KarimR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Mestre09,
author = {{\^{A}}ngela Mestre},
title = {Generating connected and 2-edge connected graphs},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {2},
pages = {251--281},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00187},
doi = {10.7155/JGAA.00187},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Mestre09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/PferschyS09,
author = {Ulrich Pferschy and
Joachim Schauer},
title = {The Knapsack Problem with Conflict Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {2},
pages = {233--249},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00186},
doi = {10.7155/JGAA.00186},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/PferschyS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Rahman09,
author = {Md. Saidur Rahman},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {1},
pages = {3--4},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00173},
doi = {10.7155/JGAA.00173},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Rahman09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/TsiarasTT09,
author = {Vassilis Tsiaras and
Sofia Triantafilou and
Ioannis G. Tollis},
title = {DAGmaps: Space Filling Visualization of Directed Acyclic Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {3},
pages = {319--347},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00190},
doi = {10.7155/JGAA.00190},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/TsiarasTT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/YamanakaN09,
author = {Katsuhisa Yamanaka and
Shin{-}Ichi Nakano},
title = {Listing All Plane Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {1},
pages = {5--18},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00174},
doi = {10.7155/JGAA.00174},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/YamanakaN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BekosKS08,
author = {Michael A. Bekos and
Michael Kaufmann and
Antonios Symvonis},
title = {Efficient Labeling of Collinear Sites},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {3},
pages = {357--380},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00170},
doi = {10.7155/JGAA.00170},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BekosKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CalinescuP08,
author = {Gruia C{\u{a}}linescu and
Michael J. Pelsmajer},
title = {Fast edge colorings with fixed number of colors to minimize imbalance},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {4},
pages = {401--417},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00172},
doi = {10.7155/JGAA.00172},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CalinescuP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CorteseBFPP08,
author = {Pier Francesco Cortese and
Giuseppe Di Battista and
Fabrizio Frati and
Maurizio Patrignani and
Maurizio Pizzonia},
title = {C-Planarity of C-Connected Clustered Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {2},
pages = {225--262},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00165},
doi = {10.7155/JGAA.00165},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/CorteseBFPP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DidimoGL08,
author = {Walter Didimo and
Francesco Giordano and
Giuseppe Liotta},
title = {Overlapping Cluster Planarity},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {3},
pages = {267--291},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00167},
doi = {10.7155/JGAA.00167},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DidimoGL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein08,
author = {David Eppstein},
title = {Upright-Quad Drawing of st-Planar Learning Spaces},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {1},
pages = {51--72},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00159},
doi = {10.7155/JGAA.00159},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FelsnerM08,
author = {Stefan Felsner and
Mareike Massow},
title = {Parameters of Bar k-Visibility Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {1},
pages = {5--27},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00157},
doi = {10.7155/JGAA.00157},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/FelsnerM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GiacomoDLMTW08,
author = {Emilio Di Giacomo and
Walter Didimo and
Giuseppe Liotta and
Henk Meijer and
Francesco Trotta and
Stephen K. Wismath},
title = {k-colored Point-set Embeddability of Outerplanar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {1},
pages = {29--49},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00158},
doi = {10.7155/JGAA.00158},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GiacomoDLMTW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GiacomoGL08,
author = {Emilio Di Giacomo and
Luca Grilli and
Giuseppe Liotta},
title = {Drawing Bipartite Graphs on Two Parallel Convex Curves},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {1},
pages = {97--112},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00161},
doi = {10.7155/JGAA.00161},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GiacomoGL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GutwengerKM08,
author = {Carsten Gutwenger and
Karsten Klein and
Petra Mutzel},
title = {Planarity Testing and Optimal Edge Insertion with Embedding Constraints},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {1},
pages = {73--95},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00160},
doi = {10.7155/JGAA.00160},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GutwengerKM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HarriganH08,
author = {Martin Harrigan and
Patrick Healy},
title = {Using a Significant Spanning Tree to Draw a Directed Graph},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {3},
pages = {293--317},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00168},
doi = {10.7155/JGAA.00168},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/HarriganH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Hong08,
author = {Seok{-}Hee Hong},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {3},
pages = {265--266},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00166},
doi = {10.7155/JGAA.00166},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/Hong08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KaufmannW08,
author = {Michael Kaufmann and
Dorothea Wagner},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {1},
pages = {3--4},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00156},
doi = {10.7155/JGAA.00156},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KaufmannW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KobourovL08,
author = {Stephen G. Kobourov and
Matthew Landis},
title = {Morphing Planar Graphs in Spherical Space},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {1},
pages = {113--127},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00162},
doi = {10.7155/JGAA.00162},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KobourovL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LinKY08,
author = {Chun{-}Cheng Lin and
Hao{-}Jen Kao and
Hsu{-}Chun Yen},
title = {Many-to-One Boundary Labeling},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {3},
pages = {319--356},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00169},
doi = {10.7155/JGAA.00169},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/LinKY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MiuraKN08,
author = {Kazuyuki Miura and
Akira Kamada and
Takao Nishizeki},
title = {Convex Grid Drawings of Plane Graphs with Rectangular Contours},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {2},
pages = {197--224},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00164},
doi = {10.7155/JGAA.00164},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/MiuraKN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RusuS08,
author = {Adrian Rusu and
Confesor Santiago},
title = {Grid Drawings of Binary Trees: An Experimental Study},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {2},
pages = {131--195},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00163},
doi = {10.7155/JGAA.00163},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RusuS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/XieYOHZ08,
author = {Xuzhen Xie and
Mutsunori Yagiura and
Takao Ono and
Tomio Hirata and
Uri Zwick},
title = {An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem},
journal = {J. Graph Algorithms Appl.},
volume = {12},
number = {4},
pages = {383--399},
year = {2008},
url = {https://doi.org/10.7155/jgaa.00171},
doi = {10.7155/JGAA.00171},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/XieYOHZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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}
}
@article{DBLP:journals/jgaa/AuberDDD06,
author = {David Auber and
Maylis Delest and
Jean{-}Philippe Domenger and
Serge Dulucq},
title = {Efficient drawing of {RNA} secondary structure},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {329--351},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00131},
doi = {10.7155/JGAA.00131},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AuberDDD06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AusielloFI06,
author = {Giorgio Ausiello and
Paolo Giulio Franciosa and
Giuseppe F. Italiano},
title = {Small Stretch Spanners on Dynamic Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {365--385},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00133},
doi = {10.7155/JGAA.00133},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AusielloFI06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Bar-YehudaY06,
author = {Reuven Bar{-}Yehuda and
Irad Yavneh},
title = {A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {123--139},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00121},
doi = {10.7155/JGAA.00121},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Bar-YehudaY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BodlaenderWK06,
author = {Hans L. Bodlaender and
Thomas Wolle and
Arie M. C. A. Koster},
title = {Contraction and Treewidth Lower Bounds},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {1},
pages = {5--49},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00117},
doi = {10.7155/JGAA.00117},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BodlaenderWK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Cabello06,
author = {Sergio Cabello},
title = {Planar embeddability of the vertices of a graph using a fixed point
set is NP-hard},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {353--363},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00132},
doi = {10.7155/JGAA.00132},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Cabello06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ChestonJ06,
author = {Grant A. Cheston and
Tjoen Seng Jap},
title = {A Survey of the Algorithmic Properties of Simplicial, Upper Bound
and Middle Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {159--190},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00123},
doi = {10.7155/JGAA.00123},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ChestonJ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DemangeEW06,
author = {Marc Demange and
T{\'{\i}}naz Ekim and
Dominique de Werra},
title = {On the approximation of Min Split-coloring and Min Cocoloring},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {297--315},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00129},
doi = {10.7155/JGAA.00129},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DemangeEW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DevillersELPW06,
author = {Olivier Devillers and
Hazel Everett and
Sylvain Lazard and
Maria Pentcheva and
Stephen K. Wismath},
title = {Drawing Kn in Three Dimensions with One Bend per Edge},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {287--295},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00128},
doi = {10.7155/JGAA.00128},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DevillersELPW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Didimo06,
author = {Walter Didimo},
title = {Upward Planar Drawings and Switch-regularity Heuristics},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {259--285},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00127},
doi = {10.7155/JGAA.00127},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Didimo06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DonatoLLMMS06,
author = {Debora Donato and
Luigi Laura and
Stefano Leonardi and
Ulrich Meyer and
Stefano Millozzi and
Jop F. Sibeyn},
title = {Algorithms and Experiments for the Webgraph},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {219--236},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00125},
doi = {10.7155/JGAA.00125},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DonatoLLMMS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DraganYC06,
author = {Feodor F. Dragan and
Chenyu Yan and
Derek G. Corneil},
title = {Collective Tree Spanners and Routing in AT-free Related Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {97--122},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00120},
doi = {10.7155/JGAA.00120},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DraganYC06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ElsasserMS06,
author = {Robert Els{\"{a}}sser and
Burkhard Monien and
Stefan Schamberger},
title = {Distributing Unit Size Workload Packages in Heterogeneous Networks},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {1},
pages = {51--68},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00118},
doi = {10.7155/JGAA.00118},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ElsasserMS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EschbachGB06,
author = {Thomas Eschbach and
Wolfgang G{\"{u}}nther and
Bernd Becker},
title = {Orthogonal Hypergraph Drawing for Improved Visibility},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {141--157},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00122},
doi = {10.7155/JGAA.00122},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EschbachGB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Fukuyama06,
author = {Junichiro Fukuyama},
title = {NP-completeness of the Planar Separator Problems},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {317--328},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00130},
doi = {10.7155/JGAA.00130},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Fukuyama06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GeorgiadisTW06,
author = {Loukas Georgiadis and
Robert Endre Tarjan and
Renato Fonseca F. Werneck},
title = {Finding Dominators in Practice},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {1},
pages = {69--94},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00119},
doi = {10.7155/JGAA.00119},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GeorgiadisTW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LevitinKMZ06,
author = {Lev B. Levitin and
Mark G. Karpovsky and
Mehmet Mustafa and
Lev Zakrevski},
title = {A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in
a Graph},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {387--420},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00134},
doi = {10.7155/JGAA.00134},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/LevitinKMZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/PonsL06,
author = {Pascal Pons and
Matthieu Latapy},
title = {Computing Communities in Large Networks Using Random Walks},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {191--218},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00124},
doi = {10.7155/JGAA.00124},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/PonsL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Radzik06,
author = {Tomasz Radzik},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {1},
pages = {3--4},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00116},
doi = {10.7155/JGAA.00116},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Radzik06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/SafroRB06,
author = {Ilya Safro and
Dorit Ron and
Achi Brandt},
title = {A Multilevel Algorithm for the Minimum 2-sum Problem},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {2},
pages = {237--258},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00126},
doi = {10.7155/JGAA.00126},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/SafroRB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BachmaierBF05,
author = {Christian Bachmaier and
Franz{-}Josef Brandenburg and
Michael Forster},
title = {Radial Level Planarity Testing and Embedding in Linear Time},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {1},
pages = {53--97},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00100},
doi = {10.7155/JGAA.00100},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BachmaierBF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BonichonGH05,
author = {Nicolas Bonichon and
Cyril Gavoille and
Nicolas Hanusse},
title = {Canonical Decomposition of Outerplanar Maps and Application to Enumeration,
Coding and Generation},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {2},
pages = {185--204},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00105},
doi = {10.7155/JGAA.00105},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BonichonGH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BrandesCW05,
author = {Ulrik Brandes and
Sabine Cornelsen and
Dorothea Wagner},
title = {Characterizing Families of Cuts that can be Represented by Axis-Parallel
Rectangles},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {1},
pages = {99--115},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00101},
doi = {10.7155/JGAA.00101},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BrandesCW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ColittiBMPP05,
author = {Lorenzo Colitti and
Giuseppe Di Battista and
Federico Mariani and
Maurizio Patrignani and
Maurizio Pizzonia},
title = {Visualizing Interdomain Routing with BGPlay},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {1},
pages = {117--148},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00102},
doi = {10.7155/JGAA.00102},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ColittiBMPP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CorteseBPP05,
author = {Pier Francesco Cortese and
Giuseppe Di Battista and
Maurizio Patrignani and
Maurizio Pizzonia},
title = {Clustering Cycles into Cycles of Clusters},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {3},
pages = {391--413},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00115},
doi = {10.7155/JGAA.00115},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CorteseBPP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DickersonEGM05,
author = {Matthew Dickerson and
David Eppstein and
Michael T. Goodrich and
Jeremy Yu Meng},
title = {Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {1},
pages = {31--52},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00099},
doi = {10.7155/JGAA.00099},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DickersonEGM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Dourisboure05,
author = {Yon Dourisboure},
title = {Compact Routing Schemes for Generalised Chordal Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {2},
pages = {277--297},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00109},
doi = {10.7155/JGAA.00109},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Dourisboure05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EiglspergerSK05,
author = {Markus Eiglsperger and
Martin Siebenhaller and
Michael Kaufmann},
title = {An Efficient Implementation of Sugiyama's Algorithm for Layered Graph
Drawing},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {3},
pages = {305--325},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00111},
doi = {10.7155/JGAA.00111},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EiglspergerSK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ErtenK05,
author = {Cesim Erten and
Stephen G. Kobourov},
title = {Simultaneous Embedding of Planar Graphs with Few Bends},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {3},
pages = {347--364},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00113},
doi = {10.7155/JGAA.00113},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ErtenK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ErtenKLN05,
author = {Cesim Erten and
Stephen G. Kobourov and
Vu Le and
Armand Navabi},
title = {Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {1},
pages = {165--182},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00104},
doi = {10.7155/JGAA.00104},
timestamp = {Thu, 28 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/ErtenKLN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Fernau05,
author = {Henning Fernau},
title = {Two-Layer Planarization: Improving on Parameterized Algorithmics},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {2},
pages = {205--238},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00106},
doi = {10.7155/JGAA.00106},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Fernau05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GansnerP05,
author = {Emden R. Gansner and
J{\'{a}}nos Pach},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {3},
pages = {301--304},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00110},
doi = {10.7155/JGAA.00110},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GansnerP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GiacomoDLM05,
author = {Emilio Di Giacomo and
Walter Didimo and
Giuseppe Liotta and
Henk Meijer},
title = {Computing Radial Drawings on the Minimum Number of Circles},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {3},
pages = {365--389},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00114},
doi = {10.7155/JGAA.00114},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GiacomoDLM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GotsmanK05,
author = {Craig Gotsman and
Yehuda Koren},
title = {Distributed Graph Layout for Sensor Networks},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {3},
pages = {327--346},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00112},
doi = {10.7155/JGAA.00112},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GotsmanK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HolleisZG05,
author = {Paul Holleis and
Thomas Zimmermann and
Daniel Gmach},
title = {Drawing Graphs Within Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {1},
pages = {7--18},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00097},
doi = {10.7155/JGAA.00097},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HolleisZG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KavvadiasS05,
author = {Dimitris J. Kavvadias and
Elias C. Stavropoulos},
title = {An Efficient Algorithm for the Transversal Hypergraph Generation},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {2},
pages = {239--264},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00107},
doi = {10.7155/JGAA.00107},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KavvadiasS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KlukasKS05,
author = {Christian Klukas and
Dirk Kosch{\"{u}}tzki and
Falk Schreiber},
title = {Graph Pattern Analysis with PatternGravisto},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {1},
pages = {19--29},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00098},
doi = {10.7155/JGAA.00098},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KlukasKS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Liotta05,
author = {Giuseppe Liotta},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {1},
pages = {3--5},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00096},
doi = {10.7155/JGAA.00096},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Liotta05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/SchankW05,
author = {Thomas Schank and
Dorothea Wagner},
title = {Approximating Clustering Coefficient and Transitivity},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {2},
pages = {265--275},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00108},
doi = {10.7155/JGAA.00108},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/SchankW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/SudermanW05,
author = {Matthew Suderman and
Sue Whitesides},
title = {Experiments with the Fixed-Parameter Approach for Two-Layer Planarization},
journal = {J. Graph Algorithms Appl.},
volume = {9},
number = {1},
pages = {149--163},
year = {2005},
url = {https://doi.org/10.7155/jgaa.00103},
doi = {10.7155/JGAA.00103},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/SudermanW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AslamPR04,
author = {Javed A. Aslam and
Ekaterina Pelekhov and
Daniela Rus},
title = {The Star Clustering Algorithm for Static and Dynamic Information Organization},
journal = {J. Graph Algorithms Appl.},
volume = {8},
pages = {95--129},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00084},
doi = {10.7155/JGAA.00084},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AslamPR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BachlBG04,
author = {Sabine Bachl and
Franz{-}Josef Brandenburg and
Daniel Gmach},
title = {Computing and Drawing Isomorphic Subgraphs},
journal = {J. Graph Algorithms Appl.},
volume = {8},
number = {2},
pages = {215--238},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00090},
doi = {10.7155/JGAA.00090},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BachlBG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BarequetGR04,
author = {Gill Barequet and
Michael T. Goodrich and
Chris Riley},
title = {Drawing Planar Graphs with Large Vertices and Thick Edges},
journal = {J. Graph Algorithms Appl.},
volume = {8},
pages = {3--20},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00078},
doi = {10.7155/JGAA.00078},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BarequetGR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BarthMJ04,
author = {Wilhelm Barth and
Petra Mutzel and
Michael J{\"{u}}nger},
title = {Simple and Efficient Bilayer Cross Counting},
journal = {J. Graph Algorithms Appl.},
volume = {8},
number = {2},
pages = {179--194},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00088},
doi = {10.7155/JGAA.00088},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BarthMJ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BhosleG04,
author = {Amit M. Bhosle and
Teofilo F. Gonzalez},
title = {Algorithms for Single Link Failure Recovery and Related Problems},
journal = {J. Graph Algorithms Appl.},
volume = {8},
number = {3},
pages = {275--294},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00092},
doi = {10.7155/JGAA.00092},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BhosleG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BodlaenderT04,
author = {Hans L. Bodlaender and
Gerard Tel},
title = {A Note on Rectilinearity and Angular Resolution},
journal = {J. Graph Algorithms Appl.},
volume = {8},
pages = {89--94},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00083},
doi = {10.7155/JGAA.00083},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BodlaenderT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BoseCMW04,
author = {Prosenjit Bose and
Jurek Czyzowicz and
Pat Morin and
David R. Wood},
title = {The Maximum Number of Edges in a Three-Dimensional Grid-Drawing},
journal = {J. Graph Algorithms Appl.},
volume = {8},
pages = {21--26},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00079},
doi = {10.7155/JGAA.00079},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BoseCMW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BoyerM04,
author = {John M. Boyer and
Wendy J. Myrvold},
title = {On the Cutting Edge: Simplified O(n) Planarity by Edge Addition},
journal = {J. Graph Algorithms Appl.},
volume = {8},
number = {3},
pages = {241--273},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00091},
doi = {10.7155/JGAA.00091},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BoyerM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CornelsenSW04,
author = {Sabine Cornelsen and
Thomas Schank and
Dorothea Wagner},
title = {Drawing Graphs on Two and Three Lines},
journal = {J. Graph Algorithms Appl.},
volume = {8},
number = {2},
pages = {161--177},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00087},
doi = {10.7155/JGAA.00087},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CornelsenSW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DumitrescuG04,
author = {Adrian Dumitrescu and
Sumanta Guha},
title = {Extreme Distances in Multicolored Point Sets},
journal = {J. Graph Algorithms Appl.},
volume = {8},
pages = {27--38},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00080},
doi = {10.7155/JGAA.00080},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DumitrescuG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EppsteinW04,
author = {David Eppstein and
Joseph Wang},
title = {Fast Approximation of Centrality},
journal = {J. Graph Algorithms Appl.},
volume = {8},
pages = {39--45},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00081},
doi = {10.7155/JGAA.00081},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EppsteinW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GargR04,
author = {Ashim Garg and
Adrian Rusu},
title = {Straight-line Drawings of Binary Trees with Linear Area and Arbitrary
Aspect Ratio},
journal = {J. Graph Algorithms Appl.},
volume = {8},
number = {2},
pages = {135--160},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00086},
doi = {10.7155/JGAA.00086},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GargR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HarelK04,
author = {David Harel and
Yehuda Koren},
title = {Graph Drawing by High-Dimensional Embedding},
journal = {J. Graph Algorithms Appl.},
volume = {8},
number = {2},
pages = {195--214},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00089},
doi = {10.7155/JGAA.00089},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HarelK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/He04,
author = {Xin He},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {8},
number = {2},
pages = {133--134},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00085},
doi = {10.7155/JGAA.00085},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/He04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KuklukHC04,
author = {Jacek P. Kukluk and
Lawrence B. Holder and
Diane J. Cook},
title = {Algorithm and Experiments in Testing Planar Graphs for Isomorphism},
journal = {J. Graph Algorithms Appl.},
volume = {8},
number = {3},
pages = {313--356},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00094},
doi = {10.7155/JGAA.00094},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KuklukHC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MaheshwariZ04,
author = {Anil Maheshwari and
Norbert Zeh},
title = {I/O-Optimal Algorithms for Outerplanar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {8},
pages = {47--87},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00082},
doi = {10.7155/JGAA.00082},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/MaheshwariZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MarriottS04,
author = {Kim Marriott and
Peter J. Stuckey},
title = {NP-Completeness of Minimal Width Unordered Tree Layout},
journal = {J. Graph Algorithms Appl.},
volume = {8},
number = {3},
pages = {295--312},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00093},
doi = {10.7155/JGAA.00093},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/MarriottS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MorinW04,
author = {Pat Morin and
David R. Wood},
title = {Three-Dimensional 1-Bend Graph Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {8},
number = {3},
pages = {357--366},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00095},
doi = {10.7155/JGAA.00095},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/MorinW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ArgeMTZ03,
author = {Lars Arge and
Ulrich Meyer and
Laura Toma and
Norbert Zeh},
title = {On External-Memory Planar Depth First Search},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {2},
pages = {105--129},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00063},
doi = {10.7155/JGAA.00063},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ArgeMTZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BabilonMMV03,
author = {Robert Babilon and
Jir{\'{\i}} Matousek and
Jana Maxov{\'{a}} and
Pavel Valtr},
title = {Low-Distortion Embeddings of Trees},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {4},
pages = {399--409},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00076},
doi = {10.7155/JGAA.00076},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BabilonMMV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BarrettMMCHFSST03,
author = {Christopher L. Barrett and
Achla Marathe and
Madhav V. Marathe and
Doug Cook and
Gregory Hicks and
Vance Faber and
Aravind Srinivasan and
Yoram J. Sussmann and
Heidi Thornquist},
title = {Statistical Analysis of Algorithms: {A} Case Study of Market-Clearing
Mechanisms in the Power Industry},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {1},
pages = {3--31},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00059},
doi = {10.7155/JGAA.00059},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BarrettMMCHFSST03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BassS03,
author = {Douglas W. Bass and
Ivan Hal Sudborough},
title = {Hamilton Decompositions and (n/2)-Factorizations of Hypercubes},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {1},
pages = {79--98},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00061},
doi = {10.7155/JGAA.00061},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BassS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BrandesC03,
author = {Ulrik Brandes and
Sabine Cornelsen},
title = {Visual Ranking of Link Structures},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {2},
pages = {181--201},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00066},
doi = {10.7155/JGAA.00066},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BrandesC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DidimoP03,
author = {Walter Didimo and
Maurizio Pizzonia},
title = {Upward Embeddings and Orientations of Undirected Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {2},
pages = {221--241},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00068},
doi = {10.7155/JGAA.00068},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DidimoP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DjidjevV03,
author = {Hristo N. Djidjev and
Imrich Vrto},
title = {Crossing Numbers and Cutwidths},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {3},
pages = {245--251},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00069},
doi = {10.7155/JGAA.00069},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/DjidjevV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DuncanK03,
author = {Christian A. Duncan and
Stephen G. Kobourov},
title = {Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {4},
pages = {311--333},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00073},
doi = {10.7155/JGAA.00073},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DuncanK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EiglspergerKE03,
author = {Markus Eiglsperger and
Michael Kaufmann and
Frank Eppinger},
title = {An Approach for Mixed Upward Planarization},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {2},
pages = {203--220},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00067},
doi = {10.7155/JGAA.00067},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EiglspergerKE03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein03,
author = {David Eppstein},
title = {Small Maximal Independent Sets and Faster Exact Graph Coloring},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {2},
pages = {131--140},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00064},
doi = {10.7155/JGAA.00064},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EspelageGW03,
author = {Wolfgang Espelage and
Frank Gurski and
Egon Wanke},
title = {Deciding Clique-Width for Graphs of Bounded Tree-Width},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {2},
pages = {141--180},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00065},
doi = {10.7155/JGAA.00065},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EspelageGW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FelsnerLW03,
author = {Stefan Felsner and
Giuseppe Liotta and
Stephen K. Wismath},
title = {Straight-Line Drawings on Restricted Integer Grids in Two and Three
Dimensions},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {4},
pages = {363--398},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00075},
doi = {10.7155/JGAA.00075},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/FelsnerLW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FraysseixM03,
author = {Hubert de Fraysseix and
Patrice Ossona de Mendez},
title = {On Cotree-Critical and {DFS} Cotree-Critical Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {4},
pages = {411--427},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00077},
doi = {10.7155/JGAA.00077},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/FraysseixM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LiottaT03,
author = {Giuseppe Liotta and
Ioannis G. Tollis},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {2},
pages = {101--103},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00062},
doi = {10.7155/JGAA.00062},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/LiottaT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Loh03,
author = {Po{-}Shen Loh},
title = {Finding Shortest Paths With Computational Geometry},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {3},
pages = {287--303},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00071},
doi = {10.7155/JGAA.00071},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Loh03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/MutzelJ03,
author = {Petra Mutzel and
Michael J{\"{u}}nger},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {4},
pages = {307--309},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00072},
doi = {10.7155/JGAA.00072},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/MutzelJ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RahmanNN03,
author = {Md. Saidur Rahman and
Takao Nishizeki and
Mahmuda Naznin},
title = {Orthogonal Drawings of Plane Graphs Without Bends},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {4},
pages = {335--362},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00074},
doi = {10.7155/JGAA.00074},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/RahmanNN03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Walshaw03,
author = {Chris Walshaw},
title = {A Multilevel Algorithm for Force-Directed Graph-Drawing},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {3},
pages = {253--285},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00070},
doi = {10.7155/JGAA.00070},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Walshaw03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Wood03,
author = {David R. Wood},
title = {Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal
Graph Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {7},
number = {1},
pages = {33--77},
year = {2003},
url = {https://doi.org/10.7155/jgaa.00060},
doi = {10.7155/JGAA.00060},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Wood03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BhattEGT02,
author = {Sandeep N. Bhatt and
Shimon Even and
David S. Greenberg and
Rafi Tayar},
title = {Traversing Directed Eulerian Mazes},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {2},
pages = {157--173},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00049},
doi = {10.7155/JGAA.00049},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BhattEGT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BridgemanT02,
author = {Stina S. Bridgeman and
Roberto Tamassia},
title = {A User Study in Similarity Measures for Graph Drawing},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {3},
pages = {225--254},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00053},
doi = {10.7155/JGAA.00053},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BridgemanT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CarmignaniBDMP02,
author = {Andrea Carmignani and
Giuseppe Di Battista and
Walter Didimo and
Francesco Matera and
Maurizio Pizzonia},
title = {Visualization of the High Level Structure of the Internet with {HERMES}},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {3},
pages = {281--311},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00055},
doi = {10.7155/JGAA.00055},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CarmignaniBDMP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CastelloMT02,
author = {Rodolfo Castell{\'{o}} and
Rym Mili and
Ioannis G. Tollis},
title = {A Framework for the Static and Interactive Visualization of Statecharts},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {3},
pages = {313--351},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00056},
doi = {10.7155/JGAA.00056},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CastelloMT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CastroCDMN02,
author = {Natalia de Castro and
Francisco Javier Cobos and
Juan Carlos Dana and
Alberto M{\'{a}}rquez and
Marc Noy},
title = {Triangle-Free Planar Graphs and Segment Intersection Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {1},
pages = {7--26},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00043},
doi = {10.7155/JGAA.00043},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CastroCDMN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Dornheim02,
author = {Christoph Dornheim},
title = {Planar Graphs with Topological Constraints},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {1},
pages = {27--66},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00044},
doi = {10.7155/JGAA.00044},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Dornheim02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FraysseixK02,
author = {Hubert de Fraysseix and
Jan Kratochv{\'{\i}}l},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {1},
pages = {3--5},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00042},
doi = {10.7155/JGAA.00042},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/FraysseixK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FriedrichE02,
author = {Carsten Friedrich and
Peter Eades},
title = {Graph Drawing in Motion},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {3},
pages = {353--370},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00057},
doi = {10.7155/JGAA.00057},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/FriedrichE02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/GajerK02,
author = {Pawel Gajer and
Stephen G. Kobourov},
title = {{GRIP:} Graph Drawing with Intelligent Placement},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {3},
pages = {203--224},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00052},
doi = {10.7155/JGAA.00052},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/GajerK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HarelK02,
author = {David Harel and
Yehuda Koren},
title = {A Fast Multi-Scale Method for Drawing Large Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {3},
pages = {179--202},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00051},
doi = {10.7155/JGAA.00051},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HarelK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/IridonM02,
author = {Mihaela Iridon and
David W. Matula},
title = {Regular Triangulated Toroidal Graphs with Applications to Cellular
and Interconnection Networks},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {4},
pages = {373--404},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00058},
doi = {10.7155/JGAA.00058},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/IridonM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/JungerL02,
author = {Michael J{\"{u}}nger and
Sebastian Leipert},
title = {Level Planar Embedding in Linear Time},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {1},
pages = {67--113},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00045},
doi = {10.7155/JGAA.00045},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/JungerL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Kaufmann02,
author = {Michael Kaufmann},
title = {Guest Editor's Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {3},
pages = {177--178},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00050},
doi = {10.7155/JGAA.00050},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Kaufmann02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KaufmannW02,
author = {Michael Kaufmann and
Roland Wiese},
title = {Embedding Vertices at Points: Few Bends Suffice for Planar Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {1},
pages = {115--129},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00046},
doi = {10.7155/JGAA.00046},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KaufmannW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Mendez02,
author = {Patrice Ossona de Mendez},
title = {Realization of Posets},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {1},
pages = {149--153},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00048},
doi = {10.7155/JGAA.00048},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Mendez02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Nesetril02,
author = {Jaroslav Nesetril},
title = {Art of Graph Drawing and Art},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {1},
pages = {131--147},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00047},
doi = {10.7155/JGAA.00047},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Nesetril02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/PurchaseAC02,
author = {Helen C. Purchase and
Jo{-}Anne Allder and
David A. Carrington},
title = {Graph Layout Aesthetics in {UML} Diagrams: User Preferences},
journal = {J. Graph Algorithms Appl.},
volume = {6},
number = {3},
pages = {255--279},
year = {2002},
url = {https://doi.org/10.7155/jgaa.00054},
doi = {10.7155/JGAA.00054},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/PurchaseAC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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 = {Tue, 16 Feb 2021 00:00:00 +0100},
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 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 = {Tue, 02 Jul 2024 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 = {Tue, 16 Feb 2021 00:00:00 +0100},
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 = {Tue, 16 Feb 2021 00:00:00 +0100},
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 = {Sun, 02 Oct 2022 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 = {Tue, 16 Feb 2021 00:00:00 +0100},
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 = {Tue, 16 Feb 2021 00:00:00 +0100},
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 = {Tue, 16 Feb 2021 00:00:00 +0100},
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, 23 Jun 2022 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 = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/NishizekiTW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BattistaPV00,
author = {Giuseppe Di Battista and
Maurizio Patrignani and
Francesco Vargiu},
title = {A Split {\&} Push Approach to 3D Orthogonal Drawing},
journal = {J. Graph Algorithms Appl.},
volume = {4},
number = {3},
pages = {105--133},
year = {2000},
url = {https://doi.org/10.7155/jgaa.00027},
doi = {10.7155/JGAA.00027},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BattistaPV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BrandesKLWW00,
author = {Ulrik Brandes and
Vanessa K{\"{a}}{\"{a}}b and
Andres L{\"{o}}h and
Dorothea Wagner and
Thomas Willhalm},
title = {Dynamic {WWW} Structures in 3D},
journal = {J. Graph Algorithms Appl.},
volume = {4},
number = {3},
pages = {183--191},
year = {2000},
url = {https://doi.org/10.7155/jgaa.00030},
doi = {10.7155/JGAA.00030},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BrandesKLWW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BrandesW00,
author = {Ulrik Brandes and
Dorothea Wagner},
title = {Using Graph Layout to Visualize Train Interconnection Data},
journal = {J. Graph Algorithms Appl.},
volume = {4},
number = {3},
pages = {135--155},
year = {2000},
url = {https://doi.org/10.7155/jgaa.00028},
doi = {10.7155/JGAA.00028},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BrandesW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BridgemanT00,
author = {Stina S. Bridgeman and
Roberto Tamassia},
title = {Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms},
journal = {J. Graph Algorithms Appl.},
volume = {4},
number = {3},
pages = {47--74},
year = {2000},
url = {https://doi.org/10.7155/jgaa.00025},
doi = {10.7155/JGAA.00025},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BridgemanT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DillencourtEH00,
author = {Michael B. Dillencourt and
David Eppstein and
Daniel S. Hirschberg},
title = {Geometric Thickness of Complete Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {4},
number = {3},
pages = {5--17},
year = {2000},
url = {https://doi.org/10.7155/jgaa.00023},
doi = {10.7155/JGAA.00023},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DillencourtEH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DuncanGK00,
author = {Christian A. Duncan and
Michael T. Goodrich and
Stephen G. Kobourov},
title = {Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {4},
number = {3},
pages = {19--46},
year = {2000},
url = {https://doi.org/10.7155/jgaa.00024},
doi = {10.7155/JGAA.00024},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DuncanGK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EadesH00,
author = {Peter Eades and
Mao Lin Huang},
title = {Navigating Clustered Graphs Using Force-Directed Methods},
journal = {J. Graph Algorithms Appl.},
volume = {4},
number = {3},
pages = {157--181},
year = {2000},
url = {https://doi.org/10.7155/jgaa.00029},
doi = {10.7155/JGAA.00029},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/EadesH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Halldorsson00,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Approximations of Weighted Independent Set and Hereditary Subset Problems},
journal = {J. Graph Algorithms Appl.},
volume = {4},
number = {1},
pages = {1--16},
year = {2000},
url = {https://doi.org/10.7155/jgaa.00020},
doi = {10.7155/JGAA.00020},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Halldorsson00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HambruschLL00,
author = {Susanne E. Hambrusch and
Chuan{-}Ming Liu and
Hyeong{-}Seok Lim},
title = {Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees},
journal = {J. Graph Algorithms Appl.},
volume = {4},
number = {4},
pages = {1--26},
year = {2000},
url = {https://doi.org/10.7155/jgaa.00031},
doi = {10.7155/JGAA.00031},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HambruschLL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HeLZ00,
author = {George He and
Jiping Liu and
Cheng Zhao},
title = {Approximation Algorithms for Some Graph Partitioning Problems},
journal = {J. Graph Algorithms Appl.},
volume = {4},
number = {2},
pages = {1--11},
year = {2000},
url = {https://doi.org/10.7155/jgaa.00021},
doi = {10.7155/JGAA.00021},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HeLZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LiottaW00,
author = {Giuseppe Liotta and
Sue Whitesides},
title = {Guest Editors' Foreword},
journal = {J. Graph Algorithms Appl.},
volume = {4},
number = {3},
pages = {1--3},
year = {2000},
url = {https://doi.org/10.7155/jgaa.00022},
doi = {10.7155/JGAA.00022},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/LiottaW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/SixKT00,
author = {Janet M. Six and
Konstantinos G. Kakoulis and
Ioannis G. Tollis},
title = {Techniques for the Refinement of Orthogonal Graph Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {4},
number = {3},
pages = {75--103},
year = {2000},
url = {https://doi.org/10.7155/jgaa.00026},
doi = {10.7155/JGAA.00026},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/SixKT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BattistaM99,
author = {Giuseppe Di Battista and
Petra Mutzel},
title = {Guest Editors' Introduction},
journal = {J. Graph Algorithms Appl.},
volume = {3},
number = {4},
pages = {1--2},
year = {1999},
url = {https://doi.org/10.7155/jgaa.00015},
doi = {10.7155/JGAA.00015},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BattistaM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BiedlSWW99,
author = {Therese Biedl and
Thomas C. Shermer and
Sue Whitesides and
Stephen K. Wismath},
title = {Bounds for Orthogonal 3-D Graph Drawing},
journal = {J. Graph Algorithms Appl.},
volume = {3},
number = {4},
pages = {63--79},
year = {1999},
url = {https://doi.org/10.7155/jgaa.00018},
doi = {10.7155/JGAA.00018},
timestamp = {Tue, 02 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BiedlSWW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/CalamoneriJP99,
author = {Tiziana Calamoneri and
Simone Jannelli and
Rossella Petreschi},
title = {Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {3},
number = {2},
pages = {1--23},
year = {1999},
url = {https://doi.org/10.7155/jgaa.00013},
doi = {10.7155/JGAA.00013},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/CalamoneriJP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/EadesFN99,
author = {Peter Eades and
Qing{-}Wen Feng and
Hiroshi Nagamochi},
title = {Drawing Clustered Graphs on an Orthogonal Grid},
journal = {J. Graph Algorithms Appl.},
volume = {3},
number = {4},
pages = {3--29},
year = {1999},
url = {https://doi.org/10.7155/jgaa.00016},
doi = {10.7155/JGAA.00016},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/EadesFN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Eppstein99,
author = {David Eppstein},
title = {Subgraph Isomorphism in Planar Graphs and Related Problems},
journal = {J. Graph Algorithms Appl.},
volume = {3},
number = {3},
pages = {1--27},
year = {1999},
url = {https://doi.org/10.7155/jgaa.00014},
doi = {10.7155/JGAA.00014},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Eppstein99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/PapakostasT99,
author = {Achilleas Papakostas and
Ioannis G. Tollis},
title = {Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions},
journal = {J. Graph Algorithms Appl.},
volume = {3},
number = {4},
pages = {81--115},
year = {1999},
url = {https://doi.org/10.7155/jgaa.00019},
doi = {10.7155/JGAA.00019},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/PapakostasT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/RahmanNN99,
author = {Md. Saidur Rahman and
Shin{-}Ichi Nakano and
Takao Nishizeki},
title = {A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected
Cubic Plane Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {3},
number = {4},
pages = {31--62},
year = {1999},
url = {https://doi.org/10.7155/jgaa.00017},
doi = {10.7155/JGAA.00017},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/RahmanNN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ZhouN99,
author = {Xiao Zhou and
Takao Nishizeki},
title = {Edge-Coloring and f-Coloring for Various Classes of Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {3},
number = {1},
pages = {1--18},
year = {1999},
url = {https://doi.org/10.7155/jgaa.00012},
doi = {10.7155/JGAA.00012},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ZhouN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BaiMEN98,
author = {Leqiang Bai and
Hajime Maeda and
Hiroyuki Ebara and
Hideo Nakano},
title = {A Broadcasting Algorithm with Time and Message Optimum on Arrangement
Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {2},
number = {2},
pages = {1--17},
year = {1998},
url = {https://doi.org/10.7155/jgaa.00005},
doi = {10.7155/JGAA.00005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BaiMEN98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/Biedl98,
author = {Therese C. Biedl},
title = {New Lower Bounds For Orthogonal Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {2},
number = {7},
pages = {1--31},
year = {1998},
url = {https://doi.org/10.7155/jgaa.00010},
doi = {10.7155/JGAA.00010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/Biedl98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BodlaenderKKM98,
author = {Hans L. Bodlaender and
Ton Kloks and
Dieter Kratsch and
Haiko M{\"{u}}ller},
title = {Treewidth and Minimum Fill-in on d-Trapezoid Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {2},
number = {5},
pages = {1--23},
year = {1998},
url = {https://doi.org/10.7155/jgaa.00008},
doi = {10.7155/JGAA.00008},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BodlaenderKKM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BoseEFHLMRRSWZ98,
author = {Prosenjit Bose and
Hazel Everett and
S{\'{a}}ndor P. Fekete and
Michael E. Houle and
Anna Lubiw and
Henk Meijer and
Kathleen Romanik and
G{\"{u}}nter Rote and
Thomas C. Shermer and
Sue Whitesides and
Christian Zelle},
title = {A Visibility Representation for Graphs in Three Dimensions},
journal = {J. Graph Algorithms Appl.},
volume = {2},
number = {3},
pages = {1--16},
year = {1998},
url = {https://doi.org/10.7155/jgaa.00006},
doi = {10.7155/JGAA.00006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BoseEFHLMRRSWZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DeanH98,
author = {Alice M. Dean and
Joan P. Hutchinson},
title = {Rectangle-visibility Layouts of Unions and Products of Trees},
journal = {J. Graph Algorithms Appl.},
volume = {2},
number = {8},
pages = {1--21},
year = {1998},
url = {https://doi.org/10.7155/jgaa.00011},
doi = {10.7155/JGAA.00011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/DeanH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FeuersteinM98,
author = {Esteban Feuerstein and
Alberto Marchetti{-}Spaccamela},
title = {Memory Paging for Connectivity and Path Problems in Graphs},
journal = {J. Graph Algorithms Appl.},
volume = {2},
number = {6},
pages = {1--22},
year = {1998},
url = {https://doi.org/10.7155/jgaa.00009},
doi = {10.7155/JGAA.00009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/FeuersteinM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/LyonsMR98,
author = {Kelly A. Lyons and
Henk Meijer and
David Rappaport},
title = {Algorithms for Cluster Busting in Anchored Graph Drawing},
journal = {J. Graph Algorithms Appl.},
volume = {2},
number = {1},
pages = {1--24},
year = {1998},
url = {https://doi.org/10.7155/jgaa.00004},
doi = {10.7155/JGAA.00004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/LyonsMR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/NaorOR98,
author = {Joseph Naor and
Ariel Orda and
Raphael Rom},
title = {Scheduled Hot-Potato Routing},
journal = {J. Graph Algorithms Appl.},
volume = {2},
number = {4},
pages = {1--20},
year = {1998},
url = {https://doi.org/10.7155/jgaa.00007},
doi = {10.7155/JGAA.00007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/NaorOR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BoseMS97,
author = {Prosenjit Bose and
Michael McAllister and
Jack Snoeyink},
title = {Optimal Algorithms to Embed Trees in a Point Set},
journal = {J. Graph Algorithms Appl.},
volume = {1},
number = {2},
pages = {1--15},
year = {1997},
url = {https://doi.org/10.7155/jgaa.00002},
doi = {10.7155/JGAA.00002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BoseMS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HalldorssonL97,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Hoong Chuin Lau},
title = {Low-degree Graph Partitioning via Local Search with Applications to
Constraint Satisfaction, Max Cut, and Coloring},
journal = {J. Graph Algorithms Appl.},
volume = {1},
number = {3},
pages = {1--13},
year = {1997},
url = {https://doi.org/10.7155/jgaa.00003},
doi = {10.7155/JGAA.00003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HalldorssonL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/JungerM97,
author = {Michael J{\"{u}}nger and
Petra Mutzel},
title = {2-Layer Straightline Crossing Minimization: Performance of Exact and
Heuristic Algorithms},
journal = {J. Graph Algorithms Appl.},
volume = {1},
number = {1},
pages = {1--25},
year = {1997},
url = {https://doi.org/10.7155/jgaa.00001},
doi = {10.7155/JGAA.00001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/JungerM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2024-09-21 23:04 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
