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
2020	Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-.	Shinya Fujita, Boram Park, Tadashi Sakuma
2020	Degree Distribution for Duplication-Divergence Graphs: Large Deviations.	Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski
2020	Universal Geometric Graphs.	Fabrizio Frati, Michael Hoffmann, Csaba D. Tth
2020	Recognizing k-Clique Extendible Orderings.	Mathew C. Francis, Rian Neogi, Venkatesh Raman
2020	Plattenbauten: Touching Rectangles in Space.	Stefan Felsner, Kolja Knauer, Torsten Ueckerdt
2020	Parameterized Inapproximability of Independent Set in H-Free Graphs.	Pavel Dvork, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski
2020	Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure.	Clment Dallard, Martin Milanic, Kenny Storgel
2020	Clique-Width: Harnessing the Power of Atoms.	Konrad K. Dabrowski, Toms Masark, Jana Novotn, Danil Paulusma, Pawel Rzazewski
2020	Strong Cliques in Diamond-Free Graphs.	Nina Chiarelli, Berenice Martnez-Barona, Martin Milanic, Jrme Monnot, Peter Mursic
2020	On Finding Balanced Bicliques via Matchings.	Parinya Chalermsook, Wanchote Po Jiamjitrak, Ly Orgo
2020	Characterization and Linear-Time Recognition of Paired Threshold Graphs.	Yixin Cao, Guozhen Rong, Jianxin Wang
2020	Clique-Width of Point Configurations.	Onur agirici, Petr Hlinen, Filip Pokrvka, Abhisekh Sankaran
2020	Computing Subset Transversals in H-Free Graphs.	Nick Brettell, Matthew Johnson, Giacomo Paesani, Danil Paulusma
2020	Knot Diagrams of Treewidth Two.	Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev
2020	Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3.	Therese Biedl, Fabian Klute
2020	Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods.	Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram
2020	Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width.	Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
2020	On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings.	Rmy Belmonte, Ignasi Sau
2020	Edge Elimination and Weighted Graph Classes.	Jesse Beisegel, Nina Chiarelli, Ekkehard Khler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler
2020	The Linear Arboricity Conjecture for 3-Degenerate Graphs.	Manu Basavaraju, Arijit Bishnu, Mathew C. Francis, Drimit Pattanayak
2020	Inserting One Edge into a Simple Drawing Is Hard.	Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera
2020	Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting.	Patrizio Angelini, Michael A. Bekos, Henry Frster, Martin Gronemann
2020	Drawing Graphs as Spanners.	Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber
2020	Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths.	Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima
2020	Weighted Additive Spanners.	Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence

201–225 of 1,392← Previous Next →

Comparable venues

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