- October 14, 2008 Sharp upper bounds on the minimum number of
- Covering Graphs with Few Complete Bipartite Subgraphs
- A new characterization of P6-free graphs Pim van 't Hof and Daniel Paulusma
- The computational complexity of the parallel knock-out problem Hajo Broersma 1
- Obtaining Online Ecological Colourings by Generalizing Matthew Johnson , Viresh Patel , Daniel Paulusma , and Theophile Trunck
- Induced packing of odd cycles in planar graphs Petr A. Golovach
- A new algorithm for on-line coloring bipartite graphs H. J. Broersma 1
- Distance Three Labelings of Trees Jiri Fiala
- Parameterizing cut sets in a graph by the number of their components
- Resolving complexity of matrix surjectivity Jiri Fiala1, Daniel Paulusma2, and Jan Arne Telle3
- Run-Time Mapping of Applications to a Heterogeneous Reconfigurable Tiled
- Faculty of Mathematical Sciences University of Twente
- Computing role assignments of chordal graphs Pim van 't Hof1,
- On Graph Contractions and Induced Minors Pim van 't Hof1,
- The k-in-a-path problem for claw-free graphs Jiri Fiala1, Marcin Kaminski2, Bernard Lidicky1, and Daniel Paulusma3
- On partitioning a graph into two connected Daniel Paulusma1
- Finding induced paths of given parity in claw-free graphs ,
- Computing role assignments of proper interval graphs in polynomial time
- Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs
- Updating the complexity status of coloring graphs without a fixed induced linear forest
- Comparing universal covers in polynomial time Jiri Fiala1
- Computing solutions for matching games Peter Biro1
- Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time
- Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number
- Computing Sharp 2-factors in Claw-free Graphs Hajo Broersma and Daniel Paulusma
- Faculty of Mathematical Sciences University of Twente
- Faculty of Mathematical Sciences University of Twente
- A complete complexity classification of the role assignment problem
- Containment relations in split graphs Petr A. Golovach
- Partitioning graphs into connected parts Pim van 't Hof1,
- Contractions of graphs on surfaces in polynomial time
- Faculty of Mathematical Sciences University of Twente
- Faculty of Mathematical Sciences University of Twente
- Complexity Aspects of Cooperative Games Danil Paulusma
- March 6, 2006 Cycles through specified vertices in triangle-free graphs
- October 25, 2006 Relative length of longest paths and longest cycles in
- -Backbone Colorings Along Pairwise Disjoint Stars and Matchings
- Three complexity results on coloring Pk-free graphs ! Hajo Broersmaa,1
- The Computational Complexity of Disconnected Cut and 2K2-Partition 1
- List coloring in the absence of a linear forest Jean-Francois Couturier1
- Satisfiability of Acyclic and Almost Acyclic CNF Sebastian Ordyniak1
- Increasing the Minimum Degree of a Graph by Contractions
- On the parameterized complexity of coloring graphs in the absence of a linear forest
- 4-Coloring H-Free Graphs When H Is Small Petr A. Golovach, Daniel Paulusma, and Jian Song
- On the diameter of reconfiguration graphs for vertex colourings
- Coloring graphs without short cycles and long induced paths
- Finding vertex-surjective graph homomorphisms
- Computing vertex-surjective homomorphisms to partially reflexive trees
- Lift-contractions Petr A. Golovach
- arXiv:1202.4419v1[cs.DM]20Feb2012 Induced Disjoint Paths in Claw-Free Graphs
- A note on induced tree minors Jiri Fiala1
- A note on contracting claw-free graphs Jiri Fiala1