Abstract is missing.
- Tree-Like Structures in Graphs: A Metric Point of ViewFeodor F. Dragan. 1-4 [doi]
- Overview of New Approaches for Approximating TSPOla Svensson. 5-11 [doi]
- Linear Rank-Width and Linear Clique-Width of TreesIsolde Adler, Mamadou Moustapha Kanté. 12-25 [doi]
- Threshold-Coloring and Unit-Cube Contact Representation of GraphsMd. Jawaherul Alam, Steven Chaplick, Gasper Fijavz, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev. 26-37 [doi]
- Rolling Upward Planarity Testing of Strongly Connected GraphsChristopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Kathrin Hanauer. 38-49 [doi]
- Towards a Provably Resilient Scheme for Graph-Based WatermarkingLucila Maria Souza Bento, Davidson R. Boccardo, Raphael Carlos Santos Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter. 50-63 [doi]
- The Normal Graph Conjecture for Classes of Sparse GraphsAnne Berry, Annegret Wagler. 64-75 [doi]
- On the Parameterized Complexity of Computing Graph BisectionsRené van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý. 76-87 [doi]
- Fixed-Parameter Tractability and Characterizations of Small Special TreewidthHans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen. 88-99 [doi]
- The θ 5-Graph is a SpannerProsenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot. 100-114 [doi]
- Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract)Arman Boyaci, Tinaz Ekim, Mordechai Shalom, Shmuel Zaks. 115-126 [doi]
- Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval GraphsHajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski. 127-138 [doi]
- Equilateral L-Contact GraphsSteven Chaplick, Stephen G. Kobourov, Torsten Ueckerdt. 139-151 [doi]
- Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating TreesJianer Chen, Jia-Hao Fan, Sing-Hoi Sze. 152-164 [doi]
- Linear Separation of Total Dominating Sets in GraphsNina Chiarelli, Martin Milanic. 165-176 [doi]
- Sparse Square RootsManfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma. 177-188 [doi]
- Completing Colored Graphs to Meet a Target PropertyKathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang. 189-200 [doi]
- Colouring of Graphs with Ramsey-Type Forbidden SubgraphsKonrad Dabrowski, Petr A. Golovach, Daniël Paulusma. 201-212 [doi]
- Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar GraphsEmilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze. 213-224 [doi]
- Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear TimeCarola Doerr, G. Ramakrishna, Jens M. Schmidt. 225-236 [doi]
- Thickness and Colorability of Geometric GraphsStephane Durocher, Ellen Gethner, Debajyoti Mondal. 237-248 [doi]
- The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-CubeLuerbio Faria, Celina M. Herrera de Figueiredo, R. Bruce Richter, Imrich Vrto. 249-260 [doi]
- FPT Is Characterized by Useful Obstruction SetsMichael R. Fellows, Bart M. P. Jansen. 261-273 [doi]
- Excluding Graphs as Immersions in Surface Embedded GraphsArchontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos. 274-285 [doi]
- OBDD-Based Representation of Interval GraphsMarc Gillé. 286-297 [doi]
- Tight Upper Bounds for Minimum Feedback Arc Sets of Regular GraphsKathrin Hanauer, Franz-Josef Brandenburg, Christopher Auer. 298-309 [doi]
- A Linear-Time Kernelization for the Rooted k-Leaf Outbranching ProblemFrank Kammer. 310-320 [doi]
- On Retracts, Absolute Retracts, and Folds in CographsTon Kloks, Yue-Li Wang. 321-332 [doi]
- Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) ColorsTomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak. 333-344 [doi]
- On Finding Tucker Submatrices and Lekkerkerker-Boland SubgraphsNathan Lindzey, Ross M. McConnell. 345-357 [doi]
- Certifying 3-Edge-ConnectivityKurt Mehlhorn, Adrian Neumann, Jens M. Schmidt. 358-369 [doi]
- Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect GraphsNeeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh. 370-381 [doi]
- Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal GraphsRagnar Nevries, Christian Rosenke. 382-393 [doi]
- Beyond Knights and KnavesChristine T. Cheng, Andrew McConvey, Drew Onderko, Nathaniel Shar, Charles Tomlinson. 394-405 [doi]
- Drawing Graphs with Few ArcsAndré Schulz. 406-417 [doi]
- Connecting Terminals and 2-Disjoint Connected SubgraphsJan Arne Telle, Yngve Villanger. 418-428 [doi]