Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jgaa/jgaa14.bht:"
@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} }
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.