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
Most published authors
WG papers
1,392 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2017 | Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. | Konrad K. Dabrowski, Vadim V. Lozin, Danil Paulusma |
| 2017 | New and Simple Algorithms for Stable Flow Problems. | gnes Cseh, Jannik Matuschke |
| 2017 | Approximately Coloring Graphs Without Long Induced Paths. | Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong |
| 2017 | The Hardness of Embedding Grids and Walls. | Yijia Chen, Martin Grohe, Bingkai Lin |
| 2017 | On H-Topological Intersection Graphs. | Steven Chaplick, Martin Toepfer, Jan Vobornk, Peter Zeman |
| 2017 | Intersection Graphs of Rays and Grounded Segments. | Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber |
| 2017 | Computing Maximum Cliques in B_2 -EPG Graphs. | Nicolas Bousquet, Marc Heinrich |
| 2017 | Token Sliding on Chordal Graphs. | Marthe Bonamy, Nicolas Bousquet |
| 2017 | Defective Coloring on Classes of Perfect Graphs. | Rmy Belmonte, Michael Lampis, Valia Mitsou |
| 2017 | Uniquely Restricted Matchings and Edge Colorings. | Julien Baste, Dieter Rautenbach, Ignasi Sau |
| 2017 | On the Number of Labeled Graphs of Bounded Treewidth. | Julien Baste, Marc Noy, Ignasi Sau |
| 2017 | Extension Complexity of Stable Set Polytopes of Bipartite Graphs. | Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia |
| 2017 | On the Relationship Between k-Planar and k-Quasi-Planar Graphs. | Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter |
| 2017 | Hierarchical Partial Planarity. | Patrizio Angelini, Michael A. Bekos |
| 2017 | Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard. | Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad |
| 2017 | On Bubble Generators in Directed Graphs. | Vicente Acua, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri |
| 2016 | Induced Separation Dimension. | Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jrmie Dusart |
| 2016 | Approximate Association via Dissociation. | Jie You, Jianxin Wang, Yixin Cao |
| 2016 | Almost Induced Matching: Linear Kernels and Parameterized Algorithms. | Mingyu Xiao, Shaowei Kou |
| 2016 | On Directed Steiner Trees with Multiple Roots. | Ondrej Such |
| 2016 | A Faster Parameterized Algorithm for Group Feedback Edge Set. | M. S. Ramanujan |
| 2016 | On Edge Intersection Graphs of Paths with 2 Bends. | Martin Pergel, Pawel Rzazewski |
| 2016 | On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators. | Pedro Montealegre, Ioan Todinca |
| 2016 | The Maximum Weight Stable Set Problem in ( P_6 , bull)-Free Graphs. | Frdric Maffray, Lucas Pastor |
| 2016 | Harmonious Coloring: Parameterized Algorithms and Upper Bounds. | Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale |
301–325 of 1,392← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*ICALPInternational Colloquium on Automata Languages and Programming
- A*STOCACM Symposium on Theory of Computing
- A*FOCSIEEE Symposium on Foundations of Computer Science
- AESAEuropean Symposium on Algorithms
- ASTACSInternational Symposium on Theoretical Aspects of Computer Science
- A*LICSIEEE Symposium on Logic in Computer Science
- AGDGraph Drawing