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 |
|---|---|---|
| 2019 | Local Approximation of the Maximum Cut in Regular Graphs. | tienne Bamas, Louis Esperet |
| 2019 | Geometric Representations of Dichotomous Ordinal Data. | Patrizio Angelini, Michael A. Bekos, Martin Gronemann, Antonios Symvonis |
| 2019 | Graph Functionality. | Bogdan Alecu, Aistis Atminas, Vadim V. Lozin |
| 2019 | Flip Distances Between Graph Orientations. | Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mtze, Raphael Steiner, Birgit Vogtenhuber |
| 2018 | Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three. | B. S. Panda, Anita Das |
| 2018 | Graph Amalgamation Under Logical Constraints. | Mateus de Oliveira Oliveira |
| 2018 | Construction and Local Routing for Angle-Monotone Graphs. | Anna Lubiw, Debajyoti Mondal |
| 2018 | Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. | Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta |
| 2018 | An Improved FPT Algorithm for Independent Feedback Vertex Set. | Shaohua Li, Marcin Pilipczuk |
| 2018 | Treedepth Bounds in Linear Colorings. | Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan |
| 2018 | Convexity-Increasing Morphs of Planar Graphs. | Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash |
| 2018 | Popular Matchings of Desired Size. | Telikepalli Kavitha |
| 2018 | Structurally Parameterized d-Scattered Set. | Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos |
| 2018 | On Weak Isomorphism of Rooted Vertex-Colored Graphs. | Lars Jaffke, Mateus de Oliveira Oliveira |
| 2018 | On Perfect Linegraph Squares. | Meike Hatzel, Sebastian Wiederrecht |
| 2018 | On the Relation of Strong Triadic Closure and Cluster Deletion. | Niels Grttemeier, Christian Komusiewicz |
| 2018 | Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization. | Renzo Gmez, Yoshiko Wakabayashi |
| 2018 | Temporal Graph Classes: A View Through Temporal Separators. | Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche |
| 2018 | Equiangular Polygon Contact Representations. | Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner |
| 2018 | Quasimonotone Graphs. | Martin E. Dyer, Haiko Mller |
| 2018 | Optimal General Matchings. | Szymon Dudycz, Katarzyna Paluch |
| 2018 | ∀∃ℝ-Completeness and Area-Universality. | Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Pawel Rzazewski |
| 2018 | Saving Probe Bits by Cube Domination. | Peter Damaschke |
| 2018 | Computing Small Pivot-Minors. | Konrad K. Dabrowski, Franois Dross, Jisu Jeong, Mamadou Moustapha Kant, O-joung Kwon, Sang-il Oum, Danil Paulusma |
| 2018 | Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. | Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari |
251–275 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