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
2016Drawing Planar Graphs with Prescribed Face Areas.Linda Kleist
2016Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability.Didem Gzpek, Sibel zkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
2016Exhaustive Generation of k-Critical ℋ-Free Graphs.Jan Goedgebeur, Oliver Schaudt
2016Packing and Covering Immersion Models of Planar Subcubic Graphs.Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2016Vertex Cover Structural Parameterization Revisited.Fedor V. Fomin, Torstein J. F. Strmme
2016Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results.Bruno Escoffier
2016On Subgraphs of Bounded Degeneracy in Hypergraphs.Kunal Dutta, Arijit Ghosh
2016Eccentricity Approximating Trees - Extended Abstract.Feodor F. Dragan, Ekkehard Khler, Hend Alrasheed
2016Geodetic Convexity Parameters for Graphs with Few Short Induced Paths.Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach
2016Sequences of Radius k for Complete Bipartite Graphs.Michal Debski, Zbigniew Lonc, Pawel Rzazewski
2016Tight Bounds for Gomory-Hu-like Cut Counting.Rajesh Chitnis, Lior Kamma, Robert Krauthgamer
2016Finding Two Edge-Disjoint Paths with Length Constraints.Leizhen Cai, Junjie Ye
2016Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs.Andreas Brandstdt, Raffaele Mosca
2016Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property.douard Bonnet, Nick Brettell, O-joung Kwon, Dniel Marx
2016Sequence Hypergraphs.Katerina Bhmov, Jrmie Chalopin, Mats Mihalk, Guido Proietti, Peter Widmayer
2016Parameterized Power Vertex Cover.Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis
2015On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks.Shmuel Zaks
2015Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs.Kenjiro Takazawa
2015Open Problems on Graph Coloring for Special Graph Classes.Danil Paulusma
2015Unsplittable Coverings in the Plane.Jnos Pach, Dmtr Plvlgyi
2015A Slice Theoretic Approach for Embedding Problems on Digraphs.Mateus de Oliveira Oliveira
2015On the Complexity of Computing the k-restricted Edge-connectivity of a Graph.Luis Pedro Montejano, Ignasi Sau
2015The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results.Thiago Braga Marcilon, Rudini M. Sampaio
2015Well-quasi-ordering Does Not Imply Bounded Clique-width.Vadim V. Lozin, Igor Razgon, Victor Zamaraev
2015Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques.Mathieu Liedloff, Pedro Montealegre, Ioan Todinca
326350 of 1,392← PreviousNext →

Comparable venues

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