Skip to content

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

WG papers

1,392 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2021Beyond Helly Graphs: The Diameter Problem on Absolute Retracts.Guillaume Ducoffe
2021Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set.Huib Donkers, Bart M. P. Jansen
2021Block Elimination Distance.znur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
2021Odd Cycle Transversal in Mixed Graphs.Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh
2021Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel.Christophe Crespelle, Benjamin Gras, Anthony Perez
2021Linearizable Special Cases of the Quadratic Shortest Path Problem.Eranda ela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf
2021Feedback Vertex Set on Hamiltonian Graphs.Dario Cavallaro, Till Fluschnik
2021Complementation in T-perfect Graphs.Yixin Cao, Shenghua Wang
2021A Linear-Time Parameterized Algorithm for Computing the Width of a DAG.Manuel Cceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu
2021Acyclic, Star, and Injective Colouring: Bounding the Diameter.Christoph Brause, Petr A. Golovach, Barnaby Martin, Danil Paulusma, Siani Smith
2021Parameterized Complexity of Bandwidth of Caterpillars and Weighted Path Emulation.Hans L. Bodlaender
2021Bears with Hats and Independence Polynomials.Vclav Blazej, Pavel Dvork, Michal Opler
2021The Complexity of Gerrymandering over Graphs: Paths and Trees.Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
2021The Largest Connected Subgraph Game.Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse
2021On Fair Covering and Hitting Problems.Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
2021On Subgraph Complementation to H-free Graphs.Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini
2021On Morphing 1-Planar Drawings.Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister
2021On Additive Spanners in Weighted Graphs with Local Error.Abu Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen G. Kobourov, Richard Spence
2020Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space.Jesper Nederlof, Michal Pilipczuk, Cline M. F. Swennenhuis, Karol Wegrzycki
2020On Flips in Planar Matchings.Marcel Milich, Torsten Mtze, Martin Pergel
2020Linear-Time Recognition of Double-Threshold Graphs.Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
2020Graph Isomorphism Restricted by Lists.Pavel Klavk, Dusan Knop, Peter Zeman
2020Guarding Quadrangulations and Stacked Triangulations with Edges.Paul Jungeblut, Torsten Ueckerdt
20202.5-Connectivity: Unique Components, Critical Graphs, and Applications.Irene Heinrich, Till Heller, Eva Schmidt, Manuel Streicher
2020Feedback Edge Sets in Temporal Graphs.Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken
176200 of 1,392← PreviousNext →

Comparable venues

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