default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Algorithms and Applications, Volume 28
Volume 28, Number 1, 2024
- Amirali Madani, Anil Maheshwari:
Distance-Preserving Graph Compression Techniques. - Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
On Critical Node Problems with Vulnerable Vertices. 1-26 - Ahmad Biniaz, Parham Khamsepour:
The Minimum Consistent Spanning Subset Problem on Trees. 81-93 - Hooman Reisi Dehkordi, Graham Farr:
Thrackles, Superthrackles and the Hanani-Tutte Theorem. 95-127 - Vahan Mkrtchyan:
The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability. 129-147 - Alexis Baudin, Clémence Magnien, Lionel Tabourier:
Faster maximal clique enumeration in large real-world link streams. 149-178 - Paul C. Kainen, Samuel Joslin, Shannon Overbay:
On Dispersability of Some Circulant Graphs. 225-241 - Van Bang Le, Christian Rosenke:
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. 243-274 - Danila Demin, Dmitry Sirotkin, Stanislav Moiseev:
Linear-algebraic implementation of Fibonacci heap. 27-50 - René van Bevern, Iyad Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
The role of twins in computing planar supports of hypergraphs. 51-79 - Patrizio Angelini, Steven Chaplick
, Sabine Cornelsen, Giordano Da Lozzo:
On Upward-Planar L-Drawings of Graphs. 275-299 - Simeon Pawlowski, Vincent Froese:
Nash Equilibria in Reverse Temporal Voronoi Games. 301-312 - Menno Theunis, Marcel Roeloffzen:
Experimental Analysis of Algorithms for the Dynamic Graph Coloring Problem. 313-349 - Bernd Schröder:
The Complexity of the Fixed Clique Property. 351-363 - Daniel Berend, Shaked Mamana:
A Greedy Probabilistic Heuristic for Graph Black-and-White Anticoloring. 365-383 - Peter Damaschke:
A Linear-Time Optimal Broadcasting Algorithm in Stars of Cliques. 385-388 - Patricia Bachmann, Ignaz Rutter, Peter Stumpf:
On 3-Coloring Circle Graphs. 389-402 - Carlos Alegría, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Unit-length Rectangular Drawings of Graphs. 403-437 - Ernestine Großmann, Sebastian Lamm, Christian Schulz, Darren Strash:
Finding Near-Optimal Weight Independent Sets at Scale. 439-473
Volume 28, Number 2, 2024
- Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. 1-35 - Csaba D. Tóth:
On RAC Drawings of Graphs with Two Bends per Edge. 37-45 - Michael A. Bekos, Markus Chimani:
Guest Editors' Foreword. i-iii - Phoebe de Nooijer, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote:
Removing Popular Faces in Curve Arrangements. 47-82 - David Eppstein:
On the Biplanarity of Blowups. 83-99 - Martin Nöllenburg, Markus Wallinger:
Computing Hive Plots: A Combinatorial Framework. 101-129 - Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager:
Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs. 131-150
Volume 28, Number 3, 2024
- Chun-Cheng Lin, Bertrand M. T. Lin, Giuseppe Liotta:
Special Issue on WALCOM 2023: Guest Editors' Foreword. 1-2 - A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees. 3-10 - Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Graph Burning in Community-based Networks. 11-30 - Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu:
Splitting Plane Graphs to Outerplanarity. 31-48 - Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis:
Certifying Induced Subgraphs in Large Graphs. 49-68 - Kaustav Paul, Arti Pandey:
Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs. 69-85 - Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara:
Reconfiguration of vertex-disjoint shortest paths on graphs. 87-101
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 2025-04-22 21:06 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:
