default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPim van 't Hof
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c34]Jelmer van Lochem, Maximilian Kronmueller
, Pim van 't Hof, Javier Alonso-Mora:
Anticipatory Vehicle Routing for Same-Day Pick-up and Delivery using Historical Data Clustering. ITSC 2020: 1-6
2010 – 2019
- 2017
- [j36]Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
The price of connectivity for feedback vertex set. Discret. Appl. Math. 217: 132-143 (2017) - [j35]Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos:
Editing to a planar graph of given degrees. J. Comput. Syst. Sci. 85: 168-182 (2017) - 2016
- [j34]Pål Grønås Drange, Markus S. Dregi, Pim van 't Hof:
On the Computational Complexity of Vertex Integrity and Component Order Connectivity. Algorithmica 76(4): 1181-1202 (2016) - [j33]Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Editing to Eulerian graphs. J. Comput. Syst. Sci. 82(2): 213-228 (2016) - [j32]Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger:
Maximal Induced Matchings in Triangle-Free Graphs. J. Graph Theory 83(3): 231-250 (2016) - 2015
- [j31]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk:
Modifying a Graph Using Vertex Elimination. Algorithmica 72(1): 99-125 (2015) - [j30]Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger:
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. Algorithmica 72(3): 687-713 (2015) - [j29]Henning Fernau, Pinar Heggernes, Pim van 't Hof, Daniel Meister, Reza Saei:
Computing the metric dimension for chain graphs. Inf. Process. Lett. 115(9): 671-676 (2015) - [j28]Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei:
Finding Disjoint Paths in Split Graphs. Theory Comput. Syst. 57(1): 140-159 (2015) - [j27]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul:
Hadwiger Number of Graphs with Small Chordality. SIAM J. Discret. Math. 29(3): 1427-1451 (2015) - [j26]Pinar Heggernes, Pim van 't Hof, Daniel Meister, Yngve Villanger:
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs. Theor. Comput. Sci. 562: 252-269 (2015) - [j25]Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar:
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Theor. Comput. Sci. 590: 86-95 (2015) - [c33]Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos:
Editing to a Planar Graph of Given Degrees. CSR 2015: 143-156 - [i10]Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos:
Editing to a Planar Graph of Given Degrees. CoRR abs/1508.02773 (2015) - [i9]Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma:
The Price of Connectivity for Feedback Vertex Set. CoRR abs/1510.02639 (2015) - 2014
- [j24]Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Parameterized complexity of three edge contraction problems with degree constraints. Acta Informatica 51(7): 473-497 (2014) - [j23]Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul:
Contracting Graphs to Paths and Trees. Algorithmica 68(1): 109-132 (2014) - [j22]Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Detecting Fixed Patterns in Chordal Graphs in Polynomial Time. Algorithmica 69(3): 501-521 (2014) - [j21]Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul:
Contracting chordal graphs and bipartite graphs to paths and trees. Discret. Appl. Math. 164: 444-449 (2014) - [j20]Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Arash Rafiey, Reza Saei:
Graph classes and Ramsey numbers. Discret. Appl. Math. 173: 16-27 (2014) - [j19]Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic:
Vector connectivity in graphs. Networks 63(4): 277-285 (2014) - [c32]Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Editing to Eulerian Graphs. FSTTCS 2014: 97-108 - [c31]Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof:
On the Computational Complexity of Vertex Integrity and Component Order Connectivity. ISAAC 2014: 285-297 - [c30]Rémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma:
Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set. MFCS (2) 2014: 57-68 - [c29]Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei:
Finding Disjoint Paths in Split Graphs. SOFSEM 2014: 315-326 - [c28]Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger:
Maximal Induced Matchings in Triangle-Free Graphs. WG 2014: 93-104 - [c27]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul:
Hadwiger Number of Graphs with Small Chordality. WG 2014: 201-213 - [i8]Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof:
On the Computational Complexity of Vertex Integrity. CoRR abs/1403.6331 (2014) - [i7]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul:
Hadwiger number of graphs with small chordality. CoRR abs/1406.3812 (2014) - [i6]Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar:
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. CoRR abs/1408.6676 (2014) - [i5]Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Editing to Eulerian Graphs. CoRR abs/1410.6863 (2014) - 2013
- [j18]Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma:
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs. Algorithmica 65(1): 129-145 (2013) - [j17]Pim van 't Hof, Yngve Villanger:
Proper Interval Vertex Deletion. Algorithmica 65(4): 845-867 (2013) - [j16]Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Characterizing graphs of small carving-width. Discret. Appl. Math. 161(13-14): 1888-1893 (2013) - [j15]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma:
Choosability on H-free graphs. Inf. Process. Lett. 113(4): 107-110 (2013) - [j14]Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul:
Obtaining a Bipartite Graph by Contracting Few Edges. SIAM J. Discret. Math. 27(4): 2143-2156 (2013) - [j13]Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Obtaining planarity by contracting few edges. Theor. Comput. Sci. 476: 38-46 (2013) - [j12]Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch:
Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. Theor. Comput. Sci. 487: 82-94 (2013) - [j11]Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger:
Parameterized complexity of vertex deletion into perfect graph classes. Theor. Comput. Sci. 511: 172-180 (2013) - [c26]Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar:
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree. FCT 2013: 121-132 - [c25]Pinar Heggernes, Pim van 't Hof, Martin Milanic:
Induced Subtrees in Interval Graphs. IWOCA 2013: 230-243 - [c24]Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints. IPEC 2013: 16-27 - [c23]Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic:
Vector Connectivity in Graphs. TAMC 2013: 331-342 - [i4]Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger:
Maximal induced matchings in triangle-free graphs. CoRR abs/1312.5180 (2013) - 2012
- [j10]Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Finding Induced Paths of Given Parity in Claw-Free Graphs. Algorithmica 62(1-2): 537-563 (2012) - [j9]Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos:
On graph contractions and induced minors. Discret. Appl. Math. 160(6): 799-809 (2012) - [j8]Rémy Belmonte, Pinar Heggernes, Pim van 't Hof:
Edge contractions in subclasses of chordal graphs. Discret. Appl. Math. 160(7-8): 999-1010 (2012) - [j7]Pinar Heggernes, Pim van 't Hof, Daniël Paulusma:
Computing role assignments of proper interval graphs in polynomial time. J. Discrete Algorithms 14: 173-188 (2012) - [j6]Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof:
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. SIAM J. Discret. Math. 26(3): 1008-1021 (2012) - [c22]Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Characterizing Graphs of Small Carving-Width. COCOA 2012: 360-370 - [c21]Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger:
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs. COCOON 2012: 133-144 - [c20]Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei:
Ramsey Numbers for Line Graphs and Perfect Graphs. COCOON 2012: 204-215 - [c19]Rémy Belmonte, Pim van 't Hof, Marcin Kaminski:
Induced Immersions. ISAAC 2012: 299-308 - [c18]Tínaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister:
Computing Minimum Geodetic Sets of Proper Interval Graphs. LATIN 2012: 279-290 - [c17]Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Obtaining Planarity by Contracting Few Edges. MFCS 2012: 455-466 - [c16]Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch:
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. SOFSEM 2012: 202-213 - [c15]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk:
How to Eliminate a Graph. WG 2012: 320-331 - [c14]Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger:
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. WG 2012: 332-343 - [i3]Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Obtaining Planarity by Contracting Few Edges. CoRR abs/1204.5113 (2012) - 2011
- [j5]Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul:
Contracting chordal graphs and bipartite graphs to paths and trees. Electron. Notes Discret. Math. 37: 87-92 (2011) - [c13]Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger:
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. FCT 2011: 240-251 - [c12]Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul:
Obtaining a Bipartite Graph by Contracting Few Edges. FSTTCS 2011: 217-228 - [c11]Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. ISAAC 2011: 110-119 - [c10]Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul:
Contracting Graphs to Paths and Trees. IPEC 2011: 55-66 - [c9]Rémy Belmonte, Pinar Heggernes, Pim van 't Hof:
Edge Contractions in Subclasses of Chordal Graphs. TAMC 2011: 528-539 - [i2]Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul:
Obtaining a Bipartite Graph by Contracting Few Edges. CoRR abs/1102.5441 (2011) - [i1]Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul:
Contracting Graphs to Paths and Trees. CoRR abs/1104.3677 (2011) - 2010
- [b1]Pim van 't Hof:
Exploiting structure to cope with NP-hard graph problems : polynomial and exponential time exact algorithms. Durham University, UK, 2010 - [j4]Pim van 't Hof, Daniël Paulusma:
A new characterization of P6-free graphs. Discret. Appl. Math. 158(7): 731-740 (2010) - [j3]Pim van 't Hof, Gerhard F. Post, Dirk Briskorn:
Constructing fair round robin tournaments with a minimum number of breaks. Oper. Res. Lett. 38(6): 592-596 (2010) - [j2]Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij:
Computing role assignments of chordal graphs. Theor. Comput. Sci. 411(40-42): 3601-3613 (2010) - [c8]Pinar Heggernes, Pim van 't Hof, Daniël Paulusma:
Computing Role Assignments of Proper Interval Graphs in Polynomial Time. IWOCA 2010: 167-180 - [c7]Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos:
On Contracting Graphs to Fixed Pattern Graphs. SOFSEM 2010: 503-514 - [c6]Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof:
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. WG 2010: 75-87
2000 – 2009
- 2009
- [j1]Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger:
Partitioning graphs into connected parts. Theor. Comput. Sci. 410(47-49): 4834-4843 (2009) - [c5]Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger:
Partitioning Graphs into Connected Parts. CSR 2009: 143-154 - [c4]Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij:
Computing Role Assignments of Chordal Graphs. FCT 2009: 193-204 - [c3]Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma:
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. WG 2009: 44-53 - [c2]Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Finding Induced Paths of Given Parity in Claw-Free Graphs. WG 2009: 341-352 - 2008
- [c1]Pim van 't Hof, Daniël Paulusma:
A New Characterization of P6-Free Graphs. COCOON 2008: 415-424
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
