Pim van 't Hof

Cited by

	All	Since 2020
Citations	1162	495
h-index	21	14
i10-index	33	21

120

200920102011201220132014201520162017201820192020202120222023202420254 13 27 54 89 55 74 86 93 73 83 112 72 86 104 108 13

Public access

View all

16 articles

0 articles

available

not available

Based on funding mandates

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
Rémy BelmonteUniversité Gustave EiffelVerified email at univ-eiffel.fr
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Marcin Kamiński4colors ResearchVerified email at mimuw.edu.pl
Yngve VillangerUniversity of BergenVerified email at uib.no
Reza SaeiNord UniversityVerified email at nord.no
Christophe PaulCNRS LIRMMVerified email at lirmm.fr
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
Dimitrios M. ThilikosVerified email at thilikos.info
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
Johan M. M. van RooijUtrecht University (20%) and Valcon (80%)Verified email at uu.nl
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
Bart M. P. JansenAssociate Professor, Eindhoven University of TechnologyVerified email at tue.nl
Stefan KratschProfessor at Humboldt University BerlinVerified email at informatik.hu-berlin.de
Henning FernauProfessor für Informatik, Universität TrierVerified email at uni-trier.de
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de

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
On the computational complexity of vertex integrity and component order connectivity PG Drange, M Dregi, P van’t Hof Algorithmica 76, 1181-1202, 2016	92	2016
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	73	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	63	2013
Contracting graphs to paths and trees P Heggernes, P Van’t Hof, B Lévêque, D Lokshtanov, C Paul Algorithmica 68, 109-132, 2014	57	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	55	2013
A new characterization of P6-free graphs P van’t Hof, D Paulusma Discrete applied mathematics 158 (7), 731-740, 2010	53	2010
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	48	2015
Obtaining planarity by contracting few edges PA Golovach, P van’t Hof, D Paulusma Theoretical Computer Science 476, 38-46, 2013	47	2013
Partitioning graphs into connected parts P van’t Hof, D Paulusma, GJ Woeginger Theoretical computer science 410 (47-49), 4834-4843, 2009	47	2009
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	46	2012
Proper interval vertex deletion P Van’t Hof, Y Villanger Algorithmica 65 (4), 845-867, 2013	44	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	43	2012
Edge contractions in subclasses of chordal graphs R Belmonte, P Heggernes, P van’t Hof Discrete Applied Mathematics 160 (7-8), 999-1010, 2012	31	2012
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	28	2014
Finding contractions and induced minors in chordal graphs via disjoint paths R Belmonte, PA Golovach, P Heggernes, P van’t Hof, M Kamiński, ... Algorithms and Computation: 22nd International Symposium, ISAAC 2011 …, 2011	27	2011
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	27	2010
Graph classes and Ramsey numbers R Belmonte, P Heggernes, P van’t Hof, A Rafiey, R Saei Discrete applied mathematics 173, 16-27, 2014	26	2014
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	23	2015
Maximal Induced Matchings in Triangle‐Free Graphs M Basavaraju, P Heggernes, P van′ t Hof, R Saei, Y Villanger Journal of Graph Theory 83 (3), 231-250, 2016	21	2016
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	21	2014

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

Follow

Cited by

Co-authors