| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time.  |
Theor. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
Updating the complexity status of coloring graphs without a fixed induced linear forest. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Induced packing of odd cycles in planar graphs. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pim van 't Hof, Marcin Kaminski, Daniël Paulusma |
Finding Induced Paths of Given Parity in Claw-Free Graphs. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma |
The k-in-a-Path Problem for Claw-free Graphs. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pim van 't Hof, Daniël Paulusma |
Obtaining Planarity by Contracting Few Edges |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen |
Induced Disjoint Paths in Claw-Free Graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma |
Finding vertex-surjective graph homomorphisms |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma |
Distance three labelings of trees. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Containment relations in split graphs. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos |
On graph contractions and induced minors. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain A. Stewart, Daniël Paulusma, Matthew Johnson |
Editorial. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Daniël Paulusma, Jian Song |
4-Coloring H-Free Graphs When H Is Small. |
SOFSEM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma |
On the diameter of reconfiguration graphs for vertex colourings. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Lift Contractions. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Parameterizing cut sets in a graph by the number of their components. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniël Paulusma, Johan M. M. van Rooij |
On partitioning a graph into two connected subgraphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Daniël Paulusma |
Graph labelings derived from models in distributed computing: A complete complexity classification. |
Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Barnaby Martin, Daniël Paulusma |
The Computational Complexity of Disconnected Cut and 2K2-Partition |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider |
Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II) |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
On disconnected cuts and separators. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Contracting planar graphs to contractions of triangulations. |
J. Discrete Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Daniël Paulusma, Jian Song |
Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma |
List Coloring in the Absence of a Linear Forest. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider |
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Marcin Kaminski, Daniël Paulusma |
Contracting a Chordal Graph to a Split Graph or a Tree. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Increasing the Minimum Degree of a Graph by Contractions. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Daniël Paulusma, Jian Song |
Coloring Graphs without Short Cycles and Long Induced Paths. |
FCT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma |
Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Barnaby Martin, Daniël Paulusma |
The Computational Complexity of Disconnected Cut and 2K 2-Partition. |
CP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij |
Computing role assignments of chordal graphs. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Johnson 0002, Daniël Paulusma, Chantal Wood |
Path factors and parallel knock-out schemes of almost claw-free graphs. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Contracting planar graphs to contractions of triangulations |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jirí Fiala, Daniël Paulusma |
Comparing Universal Covers in Polynomial Time. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pim van 't Hof, Daniël Paulusma |
A new characterization of P6-free graphs. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Daniël Paulusma |
Computing sharp 2-factors in claw-free graphs. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Johnson 0002, Viresh Patel, Daniël Paulusma, Théophile Trunck |
Obtaining Online Ecological Colourings by Generalizing First-Fit. |
CSR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Contractions of Planar Graphs in Polynomial Time. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Bernard Lidický, Daniël Paulusma |
L(2, 1, 1)-Labeling Is NP-Complete for Trees. |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Péter Biró, Walter Kern, Daniël Paulusma |
On Solution Concepts for Matching Games. |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma |
The k-in-a-path Problem for Claw-free Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos |
On Contracting Graphs to Fixed Pattern Graphs. |
SOFSEM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
On Coloring Graphs without Induced Forests. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Daniël Paulusma |
Computing Role Assignments of Proper Interval Graphs in Polynomial Time. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider |
Satisfiability of Acyclic and Almost Acyclic CNF Formulas. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Daniël Paulusma |
Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider |
Covering graphs with few complete bipartite subgraphs. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger |
Partitioning graphs into connected parts. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma |
Upper bounds and algorithms for parallel knock-out numbers. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | H. J. Broersma, Jun Fujisawa, L. Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto |
lambda-backbone colorings along pairwise disjoint stars and matchings. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto |
Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs. |
Graphs and Combinatorics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Walter Kern, Daniël Paulusma |
On the Core and f-Nucleolus of Flow Games. |
Math. Oper. Res. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman |
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. |
Discussiones Mathematicae Graph Theory |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma |
The k-in-a-path problem for claw-free graphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger |
Partitioning Graphs into Connected Parts. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma |
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pim van 't Hof, Marcin Kaminski, Daniël Paulusma |
Finding Induced Paths of Given Parity in Claw-Free Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij |
Computing Role Assignments of Chordal Graphs. |
FCT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Parameterizing Cut Sets in a Graph by the Number of Their Components. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniël Paulusma, Johan M. M. van Rooij |
On Partitioning a Graph into Two Connected Subgraphs. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos |
Induced Packing of Odd Cycles in a Planar Graph. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma |
Three Complexity Results on Coloring Pk-Free Graphs. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
P k -free graph, computational complexity, graph coloring |
| 1 | Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart |
The computational complexity of the parallel knock-out problem. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniël Paulusma, Kiyoshi Yoshimoto |
Relative length of longest paths and longest cycles in triangle-free graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger |
The computational complexity of graph contractions II: Two tough polynomially solvable cases. |
Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger |
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases. |
Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Daniël Paulusma, Jan Arne Telle |
Locally constrained graph homomorphisms and equitable partitions. |
Eur. J. Comb. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Agostino Capponi, Daniël Paulusma |
A New Algorithm for On-line Coloring Bipartite Graphs. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Daniël Paulusma |
Comparing Universal Covers in Polynomial Time. |
CSR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma (eds.) |
Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers |
WG |
2008 |
DBLP BibTeX RDF |
|
| 1 | Hajo Broersma, Daniël Paulusma |
Computing Sharp 2-Factors in Claw-Free Graphs. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pim van 't Hof, Daniël Paulusma |
A New Characterization of P6-Free Graphs. |
COCOON |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Johnson, Daniël Paulusma, Chantal Wood |
Path factors and parallel knock-out schemes of almost claw-free graphs. |
IWOCA |
2008 |
DBLP BibTeX RDF |
|
| 1 | Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto |
On components of 2-factors in claw-free graphs. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniël Paulusma, Kiyoshi Yoshimoto |
Cycles through specified vertices in triangle-free graphs. |
Discussiones Mathematicae Graph Theory |
2007 |
DBLP BibTeX RDF |
|
| 1 | Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma |
Upper Bounds and Algorithms for Parallel Knock-Out Numbers. |
SIROCCO |
2007 |
DBLP DOI BibTeX RDF |
parallel knock-out schemes, computational complexity, claw-free graphs |
| 1 | Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman |
Improved Upper Bounds for lambda -Backbone Colorings Along Matchings and Stars. |
SOFSEM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider |
Covering Graphs with Few Complete Bipartite Subgraphs. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Daniël Paulusma |
Graph Labelings Derived from Models in Distributed Computing. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart |
The Computational Complexity of the Parallel Knock-Out Problem. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
Parallel knock-out, computational complexity, graphs |
| 1 | Hajo Broersma, Agostino Capponi, Daniël Paulusma |
On-Line Coloring of H-Free Bipartite Graphs. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Daniël Paulusma |
A complete complexity classification of the role assignment problem. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Daniël Paulusma, Jan Arne Telle |
Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Daniël Paulusma, Jan Arne Telle |
Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Walter Kern, Daniël Paulusma |
The computational complexity of the elimination problem in generalized sports competitions. |
Discrete Optimization |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger |
The Computational Complexity of the Minimum Weight Processor Assignment Problem. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Walter Kern, Daniël Paulusma |
Matching Games: The Least Core and the Nucleolus. |
Math. Oper. Res. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger |
The Complexity of Graph Contractions. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Daniël Paulusma |
The Computational Complexity of the Role Assignment Problem. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
role assignment 2002 Mathematics Subject Classification: 05C15, computational complexity, 03D15, graph homomorphism |
| 1 | Walter Kern, Daniël Paulusma |
The new FIFA rules are hard: complexity aspects of sports competitions. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")