Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jgaa/jgaa18.bht:"
download as .bib file
@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}
}
a service of 
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-04-25 19:25 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:
