| Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria | 0 | 0.34 | 2022 |
| Computational Complexity of Covering Multigraphs with Semi-Edges - Small Cases. | 0 | 0.34 | 2021 |
| The Stub Resolution of 1-planar Graphs. | 0 | 0.34 | 2021 |
| Cops, a fast robber and defensive domination on interval graphs | 0 | 0.34 | 2019 |
| Homothetic polygons and beyond: Maximal cliques in intersection graphs. | 0 | 0.34 | 2018 |
| 3-connected reduction for regular graph covers | 3 | 0.37 | 2018 |
| Bounded Stub Resolution for Some Maximal 1-Planar Graphs. | 0 | 0.34 | 2018 |
| Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus. | 5 | 0.40 | 2017 |
| Simultaneous Orthogonal Planarity | 0 | 0.34 | 2016 |
| Computational complexity of covering three-vertex multigraphs. | 0 | 0.34 | 2016 |
| Algorithmic Aspects of Regular Graph Covers. | 1 | 0.35 | 2016 |
| Distance constrained labeling on graphs with bounded neighborhood diversity. | 0 | 0.34 | 2015 |
| 2-Layer Fan-Planarity: From Caterpillar to Stegosaurus. | 0 | 0.34 | 2015 |
| Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique. | 0 | 0.34 | 2014 |
| Guest editors' foreword. | 0 | 0.34 | 2014 |
| Planar Embeddings with Small and Uniform Faces. | 0 | 0.34 | 2014 |
| Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs. | 5 | 0.42 | 2014 |
| Completion of the Mixed Unit Interval Graphs Hierarchy. | 0 | 0.34 | 2014 |
| The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree | 6 | 0.59 | 2013 |
| Linear-time Algorithm for Partial Representation Extension of Interval Graphs. | 3 | 0.43 | 2013 |
| Determining the L(2, 1)L(2, 1)-span in polynomial space. | 0 | 0.34 | 2013 |
| Parameterized complexity of generalized domination problems | 8 | 0.50 | 2012 |
| Cluster vertex deletion: a parameterization between vertex cover and clique-width | 16 | 0.70 | 2012 |
| Determining the l(2,1)-span in polynomial space | 1 | 0.37 | 2012 |
| Bend-bounded path intersection graphs: sausages, noodles, and waffles on a grill | 7 | 0.60 | 2012 |
| Distance three labelings of trees | 5 | 0.48 | 2012 |
| A note on planar partial 3-trees | 0 | 0.34 | 2012 |
| MSOL restricted contractibility to planar graphs | 1 | 0.38 | 2012 |
| Extending partial representations of subclasses of chordal graphs | 5 | 0.48 | 2012 |
| Non-crossing Connectors in the Plane | 3 | 0.48 | 2012 |
| Parameterized Problems Related to Seidel's Switching | 3 | 0.51 | 2011 |
| Exact Algorithms for (2,1)-Labeling of Graphs | 20 | 1.02 | 2011 |
| Parameterized complexity of coloring problems: Treewidth versus vertex cover | 26 | 1.06 | 2011 |
| Extending partial representations of interval graphs | 12 | 0.63 | 2011 |
| Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers | 30 | 1.42 | 2011 |
| Fast exact algorithm for L(2, 1)-labeling of graphs | 7 | 0.52 | 2011 |
| Faithful representations of graphs by islands in the extended grid | 3 | 0.47 | 2010 |
| Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings | 29 | 1.96 | 2010 |
| On the computational complexity of degenerate unit distance representations of graphs | 1 | 0.39 | 2010 |
| Sort and Search: Exact algorithms for generalized domination | 3 | 0.40 | 2009 |
| Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs | 12 | 0.57 | 2009 |
| Untangling a Planar Graph. | 9 | 0.83 | 2009 |
| On the computation of the hull number of a graph | 37 | 1.58 | 2009 |
| Combinatorial Algorithms: 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28---July 2, 2009, Revised Selected Papers | 46 | 5.76 | 2009 |
| Locally constrained graph homomorphisms-structure, complexity, and applications | 20 | 0.80 | 2008 |
| Generalized domination in degenerate graphs: a complete dichotomy of computational complexity | 2 | 0.37 | 2008 |
| Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) | 11 | 0.61 | 2008 |
| On tractability of Cops and Robbers game | 18 | 0.92 | 2008 |
| Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters | 12 | 0.60 | 2008 |
| Distance constrained labelings of trees | 2 | 0.39 | 2008 |
