![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Journal 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
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 Tóth:
On RAC Drawings of Graphs with Two Bends per Edge. 37-45
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.