International Workshop on Graph-Theoretic Concepts in Computer Science

CORE rank

CORE rank (raw)

Fields of research

Theory of Computation

Papers indexed

1,392

1975–2026

Best Theory of Computation conferences

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
2018	Anagram-Free Chromatic Number Is Not Pathwidth-Bounded.	Paz Carmi, Vida Dujmovic, Pat Morin
2018	Optimality Program in Segment and String Graphs.	douard Bonnet, Pawel Rzazewski
2018	On Directed Feedback Vertex Set Parameterized by Treewidth.	Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
2018	Recognizing Hyperelliptic Graphs in Polynomial Time.	Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen
2018	On Minimum Connecting Transition Sets in Graphs.	Thomas Bellitto, Benjamin Bergougnoux
2018	Edge Partitions of Optimal 2-plane and 3-plane Graphs.	Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou
2018	Characterising AT-free Graphs with BFS.	Jesse Beisegel
2018	On Dispersable Book Embeddings.	Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev
2018	Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs.	Matthew Johnson, Giacomo Paesani, Danil Paulusma
2017	Homothetic Triangle Contact Representations.	Hendrik Schrezenmaier
2017	The Parameterized Complexity of the Equidomination Problem.	Oliver Schaudt, Fabian Senger
2017	New Results on Weighted Independent Domination.	Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
2017	On Strongly Chordal Graphs That Are Not Leaf Powers.	Manuel Lafond
2017	On Low Rank-Width Colorings.	O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz
2017	Extending Partial Representations of Trapezoid Graphs.	Tomasz Krawczyk, Bartosz Walczak
2017	Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity.	Dusan Knop, Martin Kouteck, Toms Masark, Toms Toufar
2017	Mixed Dominating Set: A Parameterized Perspective.	Pallavi Jain, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu
2017	Drawing Planar Graphs with Few Geometric Primitives.	Gregor Hltenschmidt, Philipp Kindermann, Wouter Meulemans, Andr Schulz
2017	The Minimum Conflict-Free Row Split Problem Revisited.	Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
2017	Counting Graphs and Null Models of Complex Networks: Configuration Model and Extensions.	Remco van der Hofstad
2017	Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs.	Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi
2017	Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2.	Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Danil Paulusma
2017	Linearly \chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free Graphs.	Serge Gaspers, Shenwei Huang
2017	The Minimum Shared Edges Problem on Grid-Like Graphs.	Till Fluschnik, Meike Hatzel, Steffen Hrtlein, Hendrik Molter, Henning Seidler
2017	Finding Cut-Vertices in the Square Roots of a Graph.	Guillaume Ducoffe

276–300 of 1,392← Previous Next →

Comparable venues

Other A*/A conferences filed under the same field of research.