International Workshop on Graph-Theoretic Concepts in Computer Science
WG
B
CORE rank
CORE rank (raw)
B
Fields of research
Theory of Computation
Papers indexed
1,392
1975–2026
Papers per year
197540 peak2026
Most published authors
WG papers
1,392 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2025 | Matchings with Five Directions in Hypercubes Extend to Hamilton Cycles and Paths with Prescribed Ends. | Jir Fink, Vojtech Hotmar |
| 2025 | Reductions in Local Certification. | Louis Esperet, Sbastien Zeitoun |
| 2025 | The Peculiarities of Extending Queue Layouts. | Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nllenburg |
| 2025 | Bounding Width on Graph Classes of Constant Diameter. | Konrad K. Dabrowski, Tala Eagling-Vose, Noleen Khler, Sebastian Ordyniak, Danil Paulusma |
| 2025 | A Simple Quadratic Kernel for Token Jumping on Surfaces. | Daniel W. Cranston, Moritz Mhlenthaler, Benjamin Peyrille |
| 2025 | Excluding an Induced Wheel Minor in Graphs Without Large Induced Stars. | Mujin Choi, Claire Hilaire, Martin Milanic, Sebastian Wiederrecht |
| 2025 | Non-crossing H-Graphs: A Generalization of Proper Interval Graphs Admitting FPT Algorithms. | Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Danil Paulusma |
| 2025 | Concurrency Constrained Scheduling with Tree-Like Constraints. | Hans L. Bodlaender, Danny Hermelin, Erik Jan van Leeuwen |
| 2025 | Chromatic Index Under Parameterized Settings. | Sriram Bhyravarapu, Soumen Mandal, Ashutosh Rai, Saket Saurabh, Shaily Verma |
| 2025 | Subset Feedback Vertex Set Parameterized by Multiway Cut is FPT. | Sriram Bhyravarapu, Shashanka Kulamarva, Pritesh Kumar, Shivesh K. Roy, Saket Saurabh |
| 2025 | Subgraph-Universal Planar Graphs for Trees. | Helena Bergold, Vesna Irsic Chenoweth, Robert Lauff, Joachim Orthaber, Manfred Scheucher, Alexandra Wesolek |
| 2025 | When Does FTP Become FPT? | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Laure Morelle |
| 2025 | Canadian Traveler Problems in Temporal Graphs. | Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Minh-Hang Nguyen, Mikal Rabie |
| 2025 | Boundaried Kernelization. | Leonid Antipov, Stefan Kratsch |
| 2025 | Unbent Collections of Orthogonal Drawings. | Todor Antic, Giuseppe Liotta, Toms Masark, Giacomo Ortali, Matthias Pfretzschner, Peter Stumpf, Alexander Wolff, Johannes Zink |
| 2025 | Succinct Preferential-Attachment Graphs. | Ziad Ismaili Alaoui, Namrata, Sebastian Wild |
| 2024 | Approximating Branchwidth on Parametric Extensions of Planarity. | Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2024 | The Complexity of Diameter on H-free Graphs. | Jelle J. Oostveen, Danil Paulusma, Erik Jan van Leeuwen |
| 2024 | Exact and Approximate k-planarity Testing for Maximal Graphs of Small Pathwidth. | Miriam Mnch, Maximilian Pfister, Ignaz Rutter |
| 2024 | Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. | Felicia Lucke, Ali Momeni, Danil Paulusma, Siani Smith |
| 2024 | Many Views of Planar Point Sets. | Jan Kyncl, Jan Soukup |
| 2024 | On the Complexity of Simultaneous Geometric Embedding for Edge-Disjoint Graphs. | Benedikt Knzel, Jonathan Rollin |
| 2024 | Revisiting Path Contraction and Cycle Contraction. | R. Krithika, V. K. Kutty Malu, Prafullkumar Tale |
| 2024 | On Polynomial Kernelization for Stable Cutset. | Stefan Kratsch, Van Bang Le |
| 2024 | Graph Reconstruction with Connectivity Queries. | Kacper Kluk, Hoang La, Marta Piecyk |
51–75 of 1,392← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*ICALPInternational Colloquium on Automata Languages and Programming
- A*STOCACM Symposium on Theory of Computing
- A*FOCSIEEE Symposium on Foundations of Computer Science
- AESAEuropean Symposium on Algorithms
- ASTACSInternational Symposium on Theoretical Aspects of Computer Science
- A*LICSIEEE Symposium on Logic in Computer Science
- AGDGraph Drawing