Pim van 't Hof

From MaRDI portal
Revision as of 17:16, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Pim van 't Hof to Pim van 't Hof: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:387007

Available identifiers

zbMath Open van-t-hof.pimMaRDI QIDQ387007

List of research outcomes





PublicationDate of PublicationType
Vector connectivity in graphs2018-05-23Paper
https://portal.mardi4nfdi.de/entity/Q29785052017-04-25Paper
The price of connectivity for feedback vertex set2017-03-15Paper
Editing to a planar graph of given degrees2016-12-28Paper
On the computational complexity of vertex integrity and component order connectivity2016-12-21Paper
Maximal Induced Matchings in Triangle-Free Graphs2016-11-16Paper
Editing to Eulerian graphs2015-12-11Paper
Editing to a Planar Graph of Given Degrees2015-10-20Paper
On the computational complexity of vertex integrity and component order connectivity2015-09-11Paper
Hadwiger Number of Graphs with Small Chordality2015-09-09Paper
Maximal Induced Matchings in Triangle-Free Graphs2015-09-09Paper
Finding disjoint paths in split graphs2015-09-04Paper
On the parameterized complexity of finding separators with non-hereditary properties2015-09-02Paper
Hadwiger Number of Graphs with Small Chordality2015-08-17Paper
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree2015-06-10Paper
Computing the metric dimension for chain graphs2015-06-02Paper
Modifying a graph using vertex elimination2015-05-21Paper
Finding Disjoint Paths in Split Graphs2015-01-13Paper
Induced subgraph isomorphism on proper interval and bipartite permutation graphs2014-12-02Paper
Parameterized complexity of three edge contraction problems with degree constraints2014-11-14Paper
Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set2014-10-14Paper
Graph classes and Ramsey numbers2014-08-22Paper
Detecting fixed patterns in chordal graphs in polynomial time2014-07-03Paper
https://portal.mardi4nfdi.de/entity/Q54199532014-06-11Paper
Contracting chordal graphs and bipartite graphs to paths and trees2014-05-05Paper
Characterizing graphs of small carving-width2014-04-22Paper
Obtaining a Bipartite Graph by Contracting Few Edges2014-04-10Paper
Contracting graphs to paths and trees2014-03-25Paper
Induced Subtrees in Interval Graphs2014-01-17Paper
Parameterized complexity of vertex deletion into perfect graph classes2014-01-13Paper
Minimal dominating sets in graph classes: combinatorial bounds and enumeration2013-12-11Paper
Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints2013-12-10Paper
Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree2013-08-16Paper
Contracting chordal graphs and bipartite graphs to paths and trees2013-07-23Paper
Vector Connectivity in Graphs2013-05-28Paper
Proper interval vertex deletion2013-05-16Paper
Obtaining planarity by contracting few edges2013-04-17Paper
Induced Immersions2013-03-21Paper
Choosability on \(H\)-free graphs2013-03-20Paper
Exact algorithms for finding longest cycles in claw-free graphs2013-03-05Paper
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time2013-01-04Paper
How to Eliminate a Graph2012-11-06Paper
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties2012-11-06Paper
Characterizing Graphs of Small Carving-Width2012-11-02Paper
Obtaining Planarity by Contracting Few Edges2012-09-25Paper
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs2012-09-25Paper
Ramsey Numbers for Line Graphs and Perfect Graphs2012-09-25Paper
Computing role assignments of proper interval graphs in polynomial time2012-09-13Paper
https://portal.mardi4nfdi.de/entity/Q29116262012-08-31Paper
Computing Minimum Geodetic Sets of Proper Interval Graphs2012-06-29Paper
Contracting graphs to paths and trees2012-06-15Paper
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration2012-06-15Paper
Edge contractions in subclasses of chordal graphs2012-05-30Paper
On graph contractions and induced minors2012-05-11Paper
Finding induced paths of given parity in claw-free graphs2012-04-26Paper
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths2011-12-16Paper
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes2011-08-19Paper
Edge Contractions in Subclasses of Chordal Graphs2011-07-01Paper
Computing Role Assignments of Proper Interval Graphs in Polynomial Time2011-05-19Paper
Constructing fair round robin tournaments with a minimum number of breaks2010-12-23Paper
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time2010-11-16Paper
Computing role assignments of chordal graphs2010-10-11Paper
A new characterization of \(P_{6}\)-free graphs2010-05-25Paper
On Contracting Graphs to Fixed Pattern Graphs2010-01-28Paper
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs2010-01-21Paper
Finding Induced Paths of Given Parity in Claw-Free Graphs2010-01-21Paper
Partitioning graphs into connected parts2009-11-06Paper
Computing Role Assignments of Chordal Graphs2009-10-20Paper
Partitioning Graphs into Connected Parts2009-08-18Paper
A New Characterization of P 6-Free Graphs2008-07-10Paper

Research outcomes over time

This page was built for person: Pim van 't Hof