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
2012	Bisections above Tight Lower Bounds.	Matthias Mnich, Rico Zenklusen
2012	Parameterized Algorithms for Even Cycle Transversal.	Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
2012	On the Recognition of k-Equistable Graphs.	Vadim E. Levit, Martin Milanic, David Tankus
2012	Approximating Infeasible 2VPI-Systems.	Neele Leithuser, Sven Oliver Krumke, Maximilian Merkert
2012	Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs.	Stefan Kratsch, Pascal Schweitzer
2012	A 9k Kernel for Nonseparating Independent Set in Planar Graphs.	Lukasz Kowalik, Marcin Mucha
2012	Determining the L(2, 1)-Span in Polynomial Space.	Konstanty Junosza-Szaniawski, Jan Kratochvl, Mathieu Liedloff, Pawel Rzazewski
2012	On the Minimum Degree Up to Local Complementation: Bounds and Complexity.	Jrme Javelle, Mehdi Mhalla, Simon Perdrix
2012	Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications.	Tomoya Hibi, Toshihiro Fujito
2012	Optimization Problems in Dotted Interval Graphs.	Danny Hermelin, Julin Mestre, Dror Rawitz
2012	On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.	Pinar Heggernes, Pim van 't Hof, Dniel Marx, Neeldhara Misra, Yngve Villanger
2012	Student Poster Session.	Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern
2012	How to Eliminate a Graph.	Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Danil Paulusma, Michal Pilipczuk
2012	h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area.	Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2012	Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs.	Fanica Gavril
2012	The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract).	Mathew C. Francis, Daniel Gonalves, Pascal Ochem
2012	The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases.	Leah Epstein, Asaf Levin, Gerhard J. Woeginger
2012	On Group Feedback Vertex Set Parameterized by the Size of the Cutset.	Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk
2012	Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill.	Steven Chaplick, Vt Jelnek, Jan Kratochvl, Toms Vyskocil
2012	Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity.	Carmen Cecilia Centeno, Lucia Draque Penso, Dieter Rautenbach, Vincius Gusmo Pereira de S
2012	Minimum Weight Dynamo and Fast Opinion Spreading - (Extended Abstract).	Sara Brunetti, Gennaro Cordasco, Luisa Gargano, Elena Lodi, Walter Quattrociocchi
2012	Fault Tolerant Additive Spanners.	Gilad Braunschvig, Shiri Chechik, David Peleg
2012	Parameterized Domination in Circle Graphs.	Nicolas Bousquet, Daniel Gonalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stphan Thomass
2012	Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs.	Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels
2012	Solutions for the Stable Roommates Problem with Payments.	Pter Bir, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Danil Paulusma

451–475 of 1,392← Previous Next →

Comparable venues

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