Pim van 't Hof

81 papers B 20C 5Misc 5Journal 46Unranked 4

Year	Rank	Type	Title / Venue / Authors
2020	—	`conf`	Anticipatory Vehicle Routing for Same-Day Pick-up and Delivery using Historical Data Clustering. ITSC Jelmer van Lochem, Maximilian Kronmueller, Pim van 't Hof, Javier Alonso-Mora
2017	J	`jnl`	Editing to a planar graph of given degrees. J. Comput. Syst. Sci. Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
2017	J	`jnl`	The price of connectivity for feedback vertex set. Discret. Appl. Math. Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2016	J	`jnl`	Editing to Eulerian graphs. J. Comput. Syst. Sci. Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2016	J	`jnl`	Maximal Induced Matchings in Triangle-Free Graphs. J. Graph Theory Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
2016	J	`jnl`	On the Computational Complexity of Vertex Integrity and Component Order Connectivity. Algorithmica Pål Grønås Drange, Markus S. Dregi, Pim van 't Hof
2015	J	`jnl`	Computing the metric dimension for chain graphs. Inf. Process. Lett. Henning Fernau, Pinar Heggernes, Pim van 't Hof, Daniel Meister, Reza Saei
2015	Misc	`conf`	Editing to a Planar Graph of Given Degrees. CSR Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
2015	J	`jnl`	Editing to a Planar Graph of Given Degrees. CoRR Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
2015	J	`jnl`	Finding Disjoint Paths in Split Graphs. Theory Comput. Syst. Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei
2015	J	`jnl`	Hadwiger Number of Graphs with Small Chordality. SIAM J. Discret. Math. Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
2015	J	`jnl`	Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs. Theor. Comput. Sci. Pinar Heggernes, Pim van 't Hof, Daniel Meister, Yngve Villanger
2015	J	`jnl`	Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Theor. Comput. Sci. Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar
2015	J	`jnl`	Modifying a Graph Using Vertex Elimination. Algorithmica Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk
2015	J	`jnl`	On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. Algorithmica Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
2015	J	`jnl`	The Price of Connectivity for Feedback Vertex Set. CoRR Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma
2014	J	`jnl`	Contracting Graphs to Paths and Trees. Algorithmica Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
2014	J	`jnl`	Contracting chordal graphs and bipartite graphs to paths and trees. Discret. Appl. Math. Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul
2014	J	`jnl`	Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. Algorithmica Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2014	—	`conf`	Editing to Eulerian Graphs. FSTTCS Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2014	J	`jnl`	Editing to Eulerian Graphs. CoRR Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2014	B	`conf`	Finding Disjoint Paths in Split Graphs. SOFSEM Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei
2014	—	`conf`	Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set. MFCS (2) Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma
2014	J	`jnl`	Graph classes and Ramsey numbers. Discret. Appl. Math. Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Arash Rafiey, Reza Saei
2014	B	`conf`	Hadwiger Number of Graphs with Small Chordality. WG Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
2014	J	`jnl`	Hadwiger number of graphs with small chordality. CoRR Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
2014	J	`jnl`	Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. CoRR Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar
2014	B	`conf`	Maximal Induced Matchings in Triangle-Free Graphs. WG Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
2014	B	`conf`	On the Computational Complexity of Vertex Integrity and Component Order Connectivity. ISAAC Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof
2014	J	`jnl`	On the Computational Complexity of Vertex Integrity. CoRR Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof
2014	J	`jnl`	Parameterized complexity of three edge contraction problems with degree constraints. Acta Informatica Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2014	J	`jnl`	Vector connectivity in graphs. Networks Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic
2013	J	`jnl`	Characterizing graphs of small carving-width. Discret. Appl. Math. Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2013	J	`jnl`	Choosability on H-free graphs. Inf. Process. Lett. Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma
2013	J	`jnl`	Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs. Algorithmica Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma
2013	C	`conf`	Induced Subtrees in Interval Graphs. IWOCA Pinar Heggernes, Pim van 't Hof, Martin Milanic
2013	B	`conf`	Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. FCT Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar
2013	J	`jnl`	Maximal induced matchings in triangle-free graphs. CoRR Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
2013	J	`jnl`	Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. Theor. Comput. Sci. Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch
2013	J	`jnl`	Obtaining a Bipartite Graph by Contracting Few Edges. SIAM J. Discret. Math. Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
2013	J	`jnl`	Obtaining planarity by contracting few edges. Theor. Comput. Sci. Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2013	B	`conf`	Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints. IPEC Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2013	J	`jnl`	Parameterized complexity of vertex deletion into perfect graph classes. Theor. Comput. Sci. Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger
2013	J	`jnl`	Proper Interval Vertex Deletion. Algorithmica Pim van 't Hof, Yngve Villanger
2013	C	`conf`	Vector Connectivity in Graphs. TAMC Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic
2012	C	`conf`	Characterizing Graphs of Small Carving-Width. COCOA Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2012	B	`conf`	Computing Minimum Geodetic Sets of Proper Interval Graphs. LATIN Tínaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister
2012	J	`jnl`	Computing role assignments of proper interval graphs in polynomial time. J. Discrete Algorithms Pinar Heggernes, Pim van 't Hof, Daniël Paulusma
2012	J	`jnl`	Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. SIAM J. Discret. Math. Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof
2012	J	`jnl`	Edge contractions in subclasses of chordal graphs. Discret. Appl. Math. Rémy Belmonte, Pinar Heggernes, Pim van 't Hof
2012	J	`jnl`	Finding Induced Paths of Given Parity in Claw-Free Graphs. Algorithmica Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2012	B	`conf`	How to Eliminate a Graph. WG Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk
2012	B	`conf`	Induced Immersions. ISAAC Rémy Belmonte, Pim van 't Hof, Marcin Kaminski
2012	Misc	`conf`	Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs. COCOON Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger
2012	B	`conf`	Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. SOFSEM Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch
2012	J	`jnl`	Obtaining Planarity by Contracting Few Edges CoRR Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2012	B	`conf`	Obtaining Planarity by Contracting Few Edges. MFCS Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2012	J	`jnl`	On graph contractions and induced minors. Discret. Appl. Math. Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos
2012	B	`conf`	On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. WG Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger
2012	Misc	`conf`	Ramsey Numbers for Line Graphs and Perfect Graphs. COCOON Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei
2011	J	`jnl`	Contracting Graphs to Paths and Trees CoRR Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
2011	B	`conf`	Contracting Graphs to Paths and Trees. IPEC Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
2011	J	`jnl`	Contracting chordal graphs and bipartite graphs to paths and trees. Electron. Notes Discret. Math. Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul
2011	C	`conf`	Edge Contractions in Subclasses of Chordal Graphs. TAMC Rémy Belmonte, Pinar Heggernes, Pim van 't Hof
2011	B	`conf`	Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. ISAAC Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2011	J	`jnl`	Obtaining a Bipartite Graph by Contracting Few Edges CoRR Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
2011	—	`conf`	Obtaining a Bipartite Graph by Contracting Few Edges. FSTTCS Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul
2011	B	`conf`	Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. FCT Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger
2010	J	`jnl`	A new characterization of P Discret. Appl. Math. Pim van 't Hof, Daniël Paulusma
2010	C	`conf`	Computing Role Assignments of Proper Interval Graphs in Polynomial Time. IWOCA Pinar Heggernes, Pim van 't Hof, Daniël Paulusma
2010	J	`jnl`	Computing role assignments of chordal graphs. Theor. Comput. Sci. Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij
2010	B	`conf`	Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. WG Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof
2010	J	`jnl`	Constructing fair round robin tournaments with a minimum number of breaks. Oper. Res. Lett. Pim van 't Hof, Gerhard F. Post, Dirk Briskorn
2010	—	`—`	Exploiting structure to cope with NP-hard graph problems : polynomial and exponential time exact algorithms. Pim van 't Hof
2010	B	`conf`	On Contracting Graphs to Fixed Pattern Graphs. SOFSEM Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos
2009	B	`conf`	Computing Role Assignments of Chordal Graphs. FCT Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij
2009	B	`conf`	Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. WG Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma
2009	B	`conf`	Finding Induced Paths of Given Parity in Claw-Free Graphs. WG Pim van 't Hof, Marcin Kaminski, Daniël Paulusma
2009	Misc	`conf`	Partitioning Graphs into Connected Parts. CSR Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger
2009	J	`jnl`	Partitioning graphs into connected parts. Theor. Comput. Sci. Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger
2008	Misc	`conf`	A New Characterization of P6-Free Graphs. COCOON Pim van 't Hof, Daniël Paulusma