Pim van 't Hof
Tittel
Sitert av
Sitert av
År
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
592013
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
522013
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
492016
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
482014
Obtaining planarity by contracting few edges
PA Golovach, P van’t Hof, D Paulusma
Theoretical Computer Science 476, 38-46, 2013
402013
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
372012
Partitioning graphs into connected parts
P van’t Hof, D Paulusma, GJ Woeginger
Theoretical Computer Science 410 (47-49), 4834-4843, 2009
372009
A new characterization of P6-free graphs
P van’t Hof, D Paulusma
Discrete Applied Mathematics 158 (7), 731-740, 2010
352010
Proper interval vertex deletion
P Van’t Hof, Y Villanger
Algorithmica 65 (4), 845-867, 2013
332013
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
312015
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
302012
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
282011
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
262011
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
222013
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
202014
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
18*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
182015
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
172014
Graph classes and Ramsey numbers
R Belmonte, P Heggernes, P van’t Hof, A Rafiey, R Saei
Discrete applied mathematics 173, 16-27, 2014
172014
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
172011
Systemet kan ikke utføre handlingen. Prøv igjen senere.
Artikler 1–20