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/jgaa19.bht:"
download as .bib file
@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}
}
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-05-25 20:34 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:
