| 2013 | A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem. Frank Kammer |
| 2013 | Beyond Knights and Knaves. Christine T. Cheng, Andrew McConvey, Drew Onderko, Nathaniel Shar, Charles Tomlinson |
| 2013 | Certifying 3-Edge-Connectivity. Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt |
| 2013 | Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs. Ragnar Nevries, Christian Rosenke |
| 2013 | Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors. Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak |
| 2013 | Colouring of Graphs with Ramsey-Type Forbidden Subgraphs. Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma |
| 2013 | Completing Colored Graphs to Meet a Target Property. Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang |
| 2013 | Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time. Carola Doerr, G. Ramakrishna, Jens M. Schmidt |
| 2013 | Connecting Terminals and 2-Disjoint Connected Subgraphs. Jan Arne Telle, Yngve Villanger |
| 2013 | Drawing Graphs with Few Arcs. André Schulz |
| 2013 | Equilateral L-Contact Graphs. Steven Chaplick, Stephen G. Kobourov, Torsten Ueckerdt |
| 2013 | Excluding Graphs as Immersions in Surface Embedded Graphs. Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos |
| 2013 | FPT Is Characterized by Useful Obstruction Sets. Michael R. Fellows, Bart M. P. Jansen |
| 2013 | Fixed-Parameter Tractability and Characterizations of Small Special Treewidth. Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen |
| 2013 | Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk |
| 2013 | Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract). Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks |
| 2013 | Linear Rank-Width and Linear Clique-Width of Trees. Isolde Adler, Mamadou Moustapha Kanté |
| 2013 | Linear Separation of Total Dominating Sets in Graphs. Nina Chiarelli, Martin Milanic |
| 2013 | Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski |
| 2013 | Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs. Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze |
| 2013 | OBDD-Based Representation of Interval Graphs. Marc Gillé |
| 2013 | On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. Nathan Lindzey, Ross M. McConnell |
| 2013 | On Retracts, Absolute Retracts, and Folds in Cographs. Ton Kloks, Yue-Li Wang |
| 2013 | On the Parameterized Complexity of Computing Graph Bisections. René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý |
| 2013 | Overview of New Approaches for Approximating TSP. Ola Svensson |
| 2013 | Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh |
| 2013 | Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees. Jianer Chen, Jia-Hao Fan, Sing-Hoi Sze |
| 2013 | Rolling Upward Planarity Testing of Strongly Connected Graphs. Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Kathrin Hanauer |
| 2013 | Sparse Square Roots. Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma |
| 2013 | The Normal Graph Conjecture for Classes of Sparse Graphs. Anne Berry, Annegret K. Wagler |
| 2013 | The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube. Luérbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrto |
| 2013 | The θ 5-Graph is a Spanner. Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot |
| 2013 | Thickness and Colorability of Geometric Graphs. Stephane Durocher, Ellen Gethner, Debajyoti Mondal |
| 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 | Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs. Kathrin Hanauer, Franz-Josef Brandenburg, Christopher Auer |
| 2013 | Towards a Provably Resilient Scheme for Graph-Based Watermarking. Lucila Maria Souza Bento, Davidson R. Boccardo, Raphael Carlos Santos Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter |
| 2013 | Tree-Like Structures in Graphs: A Metric Point of View. Feodor F. Dragan |