default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Algorithms and Applications, Volume 24
Volume 24, Number 1, 2020
- Johannes Batzill, Therese Biedl:
Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width). 1-19 - Igor Fabrici
, Jochen Harant, Samuel Mohr, Jens M. Schmidt:
On the Circumference of Essentially 4-connected Planar Graphs. 21-46
Volume 24, Number 2, 2020
- Krishnendu Mukhopadhyaya, Shin-Ichi Nakano:
Guest Editors' Foreword. 63-64 - Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Weighted Upper Edge Cover: Complexity and Approximability. 65-88 - Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara:
Efficient Algorithm for Box Folding. 89-103 - Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, Nina Zimbel:
Drawing Clustered Planar Graphs on Disk Arrangements. 105-131
Volume 24, Number 3, 2020
- Wilfried Joseph Ehounou, Dominique Barth, Arnaud De Moissac, Dimitri Watel, Marc-Antoine Weisser:
Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network. 133-153 - Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, Alexander Nover:
Maximum Cut Parameterized by Crossing Number. 155-170 - Geoffrey Solano, Guillaume Blin, Mathieu Raffinot, Jhoirene B. Clemente, Jaime Caro:
On the Approximability of the Minimum Weight $t$-partite Clique Problem. 171-190 - Paul Burkhardt, Vance Faber, David G. Harris:
Bounds and algorithms for graph trusses. 191-214 - Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. 215-245 - Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner:
A Note on Universal Point Sets for Planar Graphs. 247-267 - Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Graph Stories in Small Area. 269-292 - Daniel Gonçalves:
Not all planar graphs are in PURE-4-DIR. 293-301 - Katerina Altmanová, Petr Kolman, Jan Voborník:
On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow. 303-322 - Sergey Pupyrev:
Improved Bounds for Track Numbers of Planar Graphs. 323-341 - Torsten Mütze, Manfred Scheucher:
On L-shaped point set embeddings of trees: first non-embeddable examples. 343-369 - Guillaume Fertin, Christian Komusiewicz:
Graph Motif Problems Parameterized by Dual. 371-396 - Kamiel Cornelissen, Bodo Manthey:
Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm. 397-421 - Oswin Aichholzer, Frank Duque, Ruy Fabila Monroy, Oscar E. García-Quintero, Carlos Hidalgo-Toscano:
An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants. 421-432 - Peter Damaschke:
Enumerating Grid Layouts of Graphs. 433-460 - Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, Rolf Morel:
Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth. 461-482 - Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier:
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. 483-522 - Jammigumpula Ajay, Avinandan Das, Binayak Dutta, Arindam Karmakar, Sasanka Roy, Navaneeta Saikia:
Problems on One Way Road Networks. 523-546
Volume 24, Number 4, 2020
- Daniel Archambault, Csaba D. Tóth:
Guest editors' foreword. 547-549 - Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl:
Minimal Representations of Order Types by Geometric Graphs. 551-572 - Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck:
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. 573-601 - Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. 603-620 - Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff:
Bundled Crossings Revisited. 621-655 - Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink:
Recognizing Stick Graphs with and without Length Constraints. 657-681 - Fati Chen, Laurent Piccinini, Pascal Poncelet, Arnaud Sallaberry:
Node Overlap Removal Algorithms: an Extended Comparative Study. 683-706
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.
last updated on 2024-10-14 23:19 CEST 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:
