Pim van 't Hof

Cited by

	All	Since 2016
Citations	850	488
h-index	16	13
i10-index	29	18

140

105

20092010201120122013201420152016201720182019202020216 7 39 59 104 58 80 91 91 76 80 128 22

Co-authors

Pinar HeggernesProfessor of computer science, University of BergenVerified email at ii.uib.no
Daniel PaulusmaDepartment of Computer Science, Durham UniversityVerified email at durham.ac.uk
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Marcin KamińskiVerified email at mimuw.edu.pl
Yngve VillangerUniversity of BergenVerified email at uib.no
Christophe PaulCNRS LIRMMVerified email at lirmm.fr
Reza SaeiNord UniversityVerified email at nord.no
Daniel LokshtanovAssociate Professor in Computer Science, UCSBVerified email at ucsb.edu
Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of Athens, AthensVerified email at math.uoa.gr
Pål Grønås DrangeUniversity of Bergen, Department of InformaticsVerified email at ii.uib.no
Stefan SzeiderProfessor, Head of Algorithms and Complexity Group, TU Wien, Vienna, AustriaVerified email at szeider.net
Bart M. P. JansenAssistant Professor, Eindhoven University of TechnologyVerified email at tue.nl
Stefan KratschProfessor at Humboldt University BerlinVerified email at informatik.hu-berlin.de
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de
Konrad K. DabrowskiDurham UniversityVerified email at durham.ac.uk
Martin MilaničUniversity of Primorska, Koper, SloveniaVerified email at upr.si
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.fr
Gerhard PostUniversity of TwenteVerified email at utwente.nl
Arash RafieySimon Fraser UniversityVerified email at sfu.ca
Hajo BroersmaFaculty EEMCS, University of Twente, NLVerified email at utwente.nl

Pim van 't Hof

University of Twente

Verified email at utwente.nl - Homepage

Algorithms Graph Theory Computational Complexity Parameterized Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Minimal dominating sets in graph classes: combinatorial bounds and enumeration JF Couturier, P Heggernes, P Van’t Hof, D Kratsch Theoretical Computer Science 487, 82-94, 2013	55	2013
Obtaining a bipartite graph by contracting few edges P Heggernes, PVT Hof, D Lokshtanov, C Paul SIAM Journal on Discrete Mathematics 27 (4), 2143-2156, 2013	50	2013
On the computational complexity of vertex integrity and component order connectivity PG Drange, M Dregi, P van’t Hof Algorithmica 76 (4), 1181-1202, 2016	46	2016
Contracting graphs to paths and trees P Heggernes, P Van’t Hof, B Lévêque, D Lokshtanov, C Paul Algorithmica 68 (1), 109-132, 2014	46	2014
Obtaining planarity by contracting few edges PA Golovach, P van’t Hof, D Paulusma Theoretical Computer Science 476, 38-46, 2013	38	2013
On graph contractions and induced minors P van’t Hof, M Kamiński, D Paulusma, S Szeider, DM Thilikos Discrete Applied Mathematics 160 (6), 799-809, 2012	37	2012
A new characterization of P6-free graphs P van’t Hof, D Paulusma Discrete Applied Mathematics 158 (7), 731-740, 2010	36	2010
Partitioning graphs into connected parts P van’t Hof, D Paulusma, GJ Woeginger Theoretical computer science 410 (47-49), 4834-4843, 2009	32	2009
Proper interval vertex deletion P Van’t Hof, Y Villanger Algorithmica 65 (4), 845-867, 2013	30	2013
Computing the metric dimension for chain graphs H Fernau, P Heggernes, P van't Hof, D Meister, R Saei Information Processing Letters 115 (9), 671-676, 2015	28	2015
Computing minimum geodetic sets of proper interval graphs T Ekim, A Erey, P Heggernes, P van’t Hof, D Meister Latin American Symposium on Theoretical Informatics, 279-290, 2012	28	2012
Finding contractions and induced minors in chordal graphs via disjoint paths R Belmonte, PA Golovach, P Heggernes, P van’t Hof, M Kamiński, ... International Symposium on Algorithms and Computation, 110-119, 2011	27	2011
Parameterized complexity of vertex deletion into perfect graph classes P Heggernes, P Van’t Hof, BMP Jansen, S Kratsch, Y Villanger International Symposium on Fundamentals of Computation Theory, 240-251, 2011	23	2011
Detecting fixed patterns in chordal graphs in polynomial time R Belmonte, PA Golovach, P Heggernes, P van’t Hof, M Kamiński, ... Algorithmica 69 (3), 501-521, 2014	21	2014
Parameterized complexity of vertex deletion into perfect graph classes P Heggernes, P Van’t Hof, BMP Jansen, S Kratsch, Y Villanger Theoretical Computer Science 511, 172-180, 2013	20	2013
Constructing fair round robin tournaments with a minimum number of breaks P van’t Hof, G Post, D Briskorn Operations research letters 38 (6), 592-596, 2010	17	2010
The price of connectivity for feedback vertex set R Belmonte, P van't Hof, M Kamiński, D Paulusma Discrete Applied Mathematics 217, 132-143, 2017	16*	2017
Induced subgraph isomorphism on proper interval and bipartite permutation graphs P Heggernes, P van't Hof, D Meister, Y Villanger Theoretical Computer Science 562, 252-269, 2015	16	2015
Parameterized complexity of three edge contraction problems with degree constraints R Belmonte, PA Golovach, P van’t Hof, D Paulusma Acta Informatica 51 (7), 473-497, 2014	16	2014
Edge contractions in subclasses of chordal graphs R Belmonte, P Heggernes, P van’t Hof International Conference on Theory and Applications of Models of Computation …, 2011	16	2011

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors