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 |
|---|---|---|
| 2013 | The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube. | Lurbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrto |
| 2013 | Thickness and Colorability of Geometric Graphs. | Stephane Durocher, Ellen Gethner, Debajyoti Mondal |
| 2013 | Tree-Like Structures in Graphs: A Metric Point of View. | Feodor F. Dragan |
| 2013 | Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. | Carola Doerr, G. Ramakrishna, Jens M. Schmidt |
| 2013 | Colouring of Graphs with Ramsey-Type Forbidden Subgraphs. | Konrad K. Dabrowski, Petr A. Golovach, Danil Paulusma |
| 2013 | Completing Colored Graphs to Meet a Target Property. | Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang |
| 2013 | Sparse Square Roots. | Manfred Cochefert, Jean-Franois Couturier, Petr A. Golovach, Dieter Kratsch, Danil Paulusma |
| 2013 | Linear Separation of Total Dominating Sets in Graphs. | Nina Chiarelli, Martin Milanic |
| 2013 | Beyond Knights and Knaves. | Christine T. Cheng, Andrew McConvey, Drew Onderko, Nathaniel Shar, Charles Tomlinson |
| 2013 | Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees. | Jianer Chen, Jia-Hao Fan, Sing-Hoi Sze |
| 2013 | Equilateral L-Contact Graphs. | Steven Chaplick, Stephen G. Kobourov, Torsten Ueckerdt |
| 2013 | Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. | Hajo Broersma, Jir Fiala, Petr A. Golovach, Toms Kaiser, Danil Paulusma, Andrzej Proskurowski |
| 2013 | Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract). | Arman Boyaci, Tnaz Ekim, Mordechai Shalom, Shmuel Zaks |
| 2013 | The θ 5-Graph is a Spanner. | Prosenjit Bose, Pat Morin, Andr van Renssen, Sander Verdonschot |
| 2013 | Fixed-Parameter Tractability and Characterizations of Small Special Treewidth. | Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen |
| 2013 | On the Parameterized Complexity of Computing Graph Bisections. | Ren van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Such |
| 2013 | The Normal Graph Conjecture for Classes of Sparse Graphs. | Anne Berry, Annegret K. Wagler |
| 2013 | Towards a Provably Resilient Scheme for Graph-Based Watermarking. | Lucila Maria Souza Bento, Davidson R. Boccardo, Raphael Carlos Santos Machado, Vincius Gusmo Pereira de S, Jayme Luiz Szwarcfiter |
| 2013 | Rolling Upward Planarity Testing of Strongly Connected Graphs. | Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Kathrin Hanauer |
| 2013 | Threshold-Coloring and Unit-Cube Contact Representation of Graphs. | Md. Jawaherul Alam, Steven Chaplick, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev |
| 2013 | Linear Rank-Width and Linear Clique-Width of Trees. | Isolde Adler, Mamadou Moustapha Kant |
| 2012 | Hydras: Directed Hypergraphs and Horn Formulas. | Robert H. Sloan, Despina Stasi, Gyrgy Turn |
| 2012 | Account on Intervals. | Dieter Rautenbach |
| 2012 | Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance. | David Peleg |
| 2012 | On the Stable Degree of Graphs. | Haiko Mller |
426–450 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