Pim van 't Hof
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
29
Venues
11
Active years
2008–2015
Best venue rank
B
Where they publish
Papers
29 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2015 | CSR | Editing to a Planar Graph of Given Degrees. | Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Danil Paulusma, Dimitrios M. Thilikos |
| 2014 | ISAAC | On the Computational Complexity of Vertex Integrity and Component Order Connectivity. | Pl Grns Drange, Markus Sortland Dregi, Pim van 't Hof |
| 2014 | MFCS | Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set. | Rmy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Danil Paulusma |
| 2014 | SOFSEM | Finding Disjoint Paths in Split Graphs. | Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei |
| 2014 | WG | Maximal Induced Matchings in Triangle-Free Graphs. | Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger |
| 2014 | WG | Hadwiger Number of Graphs with Small Chordality. | Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul |
| 2013 | FCT | Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. | Steven Chaplick, Jir Fiala, Pim van 't Hof, Danil Paulusma, Marek Tesar |
| 2013 | IWOCA | Induced Subtrees in Interval Graphs. | Pinar Heggernes, Pim van 't Hof, Martin Milanic |
| 2013 | TAMC | Vector Connectivity in Graphs. | Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic |
| 2012 | COCOA | Characterizing Graphs of Small Carving-Width. | Rmy Belmonte, Pim van 't Hof, Marcin Kaminski, Danil Paulusma, Dimitrios M. Thilikos |
| 2012 | COCOON | Ramsey Numbers for Line Graphs and Perfect Graphs. | Rmy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei |
| 2012 | COCOON | Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs. | Jean-Franois Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger |
| 2012 | ISAAC | Induced Immersions. | Rmy Belmonte, Pim van 't Hof, Marcin Kaminski |
| 2012 | LATIN | Computing Minimum Geodetic Sets of Proper Interval Graphs. | Tnaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister |
| 2012 | MFCS | Obtaining Planarity by Contracting Few Edges. | Petr A. Golovach, Pim van 't Hof, Danil Paulusma |
| 2012 | SOFSEM | Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. | Jean-Franois Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch |
| 2012 | WG | How to Eliminate a Graph. | Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Danil Paulusma, Michal Pilipczuk |
| 2012 | WG | On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. | Pinar Heggernes, Pim van 't Hof, Dniel Marx, Neeldhara Misra, Yngve Villanger |
| 2011 | FCT | Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. | Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger |
| 2011 | ISAAC | Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. | Rmy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Danil Paulusma |
| 2011 | TAMC | Edge Contractions in Subclasses of Chordal Graphs. | Rmy Belmonte, Pinar Heggernes, Pim van 't Hof |
| 2010 | IWOCA | Computing Role Assignments of Proper Interval Graphs in Polynomial Time. | Pinar Heggernes, Pim van 't Hof, Danil Paulusma |
| 2010 | SOFSEM | On Contracting Graphs to Fixed Pattern Graphs. | Pim van 't Hof, Marcin Kaminski, Danil Paulusma, Stefan Szeider, Dimitrios M. Thilikos |
| 2010 | WG | Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof |
| 2009 | CSR | Partitioning Graphs into Connected Parts. | Pim van 't Hof, Danil Paulusma, Gerhard J. Woeginger |
| 2009 | FCT | Computing Role Assignments of Chordal Graphs. | Pim van 't Hof, Danil Paulusma, Johan M. M. van Rooij |
| 2009 | WG | Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. | Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Danil Paulusma |
| 2009 | WG | Finding Induced Paths of Given Parity in Claw-Free Graphs. | Pim van 't Hof, Marcin Kaminski, Danil Paulusma |
| 2008 | COCOON | A New Characterization of P6-Free Graphs. | Pim van 't Hof, Danil Paulusma |