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/jgaa25.bht:"
download as .bib file
@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}
}
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-06-01 01:41 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:
