| On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. | 0 | 0.34 | 2020 |
| Enumeration of minimal connected dominating sets for chordal graphs | 0 | 0.34 | 2020 |
| Parameterized Aspects of Strong Subgraph Closure | 2 | 0.39 | 2018 |
| Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. | 0 | 0.34 | 2018 |
| Linear-Time Generation of Random Chordal Graphs. | 0 | 0.34 | 2017 |
| Minimal dominating sets in interval graphs and trees. | 1 | 0.41 | 2017 |
| Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded. | 0 | 0.34 | 2017 |
| Preface: Algorithmic Graph Theory on the Adriatic Coast | 0 | 0.34 | 2017 |
| Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. | 2 | 0.37 | 2017 |
| Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality. | 1 | 0.35 | 2016 |
| Foreword: Special Issue on IPEC 2014. | 0 | 0.34 | 2016 |
| Enumerating minimal dominating sets in chordal graphs. | 3 | 0.40 | 2016 |
| The Firefighter problem on graph classes. | 3 | 0.50 | 2016 |
| Erratum to: Foreword: Special Issue on IPEC 2014. | 0 | 0.34 | 2016 |
| Enumerating minimal dominating sets in chordal bipartite graphs | 5 | 0.52 | 2016 |
| Modifying a Graph Using Vertex Elimination | 0 | 0.34 | 2015 |
| Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs. | 3 | 0.39 | 2015 |
| Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width | 2 | 0.38 | 2015 |
| A characterisation of clique-width through nested partitions | 3 | 0.40 | 2015 |
| Hadwiger Number of Graphs with Small Chordality. | 3 | 0.41 | 2015 |
| Computing the metric dimension for chain graphs | 6 | 0.49 | 2015 |
| A multi-parameter analysis of hard problems on deterministic finite automata. | 5 | 0.45 | 2015 |
| Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality | 5 | 0.45 | 2015 |
| Contracting Graphs to Paths and Trees. | 0 | 0.34 | 2014 |
| Subset feedback vertex sets in chordal graphs. | 9 | 0.54 | 2014 |
| Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. | 4 | 0.43 | 2014 |
| Enumerating minimal subset feedback vertex sets | 7 | 0.49 | 2014 |
| Graph classes and Ramsey numbers. | 1 | 0.35 | 2014 |
| Graph Modification Problems (Dagstuhl Seminar 14071). | 3 | 0.41 | 2014 |
| Finding Disjoint Paths in Split Graphs. | 2 | 0.40 | 2014 |
| Finding clubs in graph classes. | 3 | 0.41 | 2014 |
| Vector connectivity in graphs | 1 | 0.37 | 2013 |
| Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. | 5 | 0.44 | 2013 |
| Minimal dominating sets in graph classes: combinatorial bounds and enumeration | 10 | 0.81 | 2013 |
| Choosability on H-free graphs | 2 | 0.36 | 2013 |
| Cliques and Clubs. | 0 | 0.34 | 2013 |
| A Multivariate Analysis of Some DFA Problems. | 5 | 0.44 | 2013 |
| An incremental polynomial time algorithm to enumerate all minimal edge dominating sets | 4 | 0.42 | 2013 |
| Polar permutation graphs are polynomial-time recognisable | 3 | 0.42 | 2013 |
| Parameterized complexity of vertex deletion into perfect graph classes. | 4 | 0.42 | 2013 |
| Obtaining a Bipartite Graph by Contracting Few Edges | 14 | 0.73 | 2013 |
| Edge search number of cographs | 0 | 0.34 | 2012 |
| Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs. | 6 | 0.51 | 2012 |
| Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay | 2 | 0.39 | 2012 |
| Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs | 13 | 0.54 | 2012 |
| Computing minimum geodetic sets of proper interval graphs | 7 | 0.59 | 2012 |
| Ramsey Numbers for Line Graphs and Perfect Graphs. | 2 | 0.39 | 2012 |
| Broadcast Domination on Block Graphs in Linear Time. | 2 | 0.43 | 2012 |
| Edge contractions in subclasses of chordal graphs | 15 | 0.80 | 2012 |
| On the parameterized complexity of finding separators with non-hereditary properties | 0 | 0.34 | 2012 |
