Daniël Paulusma

Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma: Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs. Algorithmica 65(1): 129-145 (2013)

Petr A. Golovach, Daniël Paulusma, Jian Song: 4-coloring H-free graphs when H is small. Discrete Applied Mathematics 161(1-2): 140-150 (2013)

Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma: Three complexity results on coloring Pk-free graphs. Eur. J. Comb. 34(3): 609-619 (2013)

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Daniël Paulusma: Choosability on H-free graphs. Inf. Process. Lett. 113(4): 107-110 (2013)

Petr A. Golovach, Pim van 't Hof, Daniël Paulusma: Obtaining planarity by contracting few edges. Theor. Comput. Sci. 476: 38-46 (2013)

Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Increasing the minimum degree of a graph by contractions. Theor. Comput. Sci. 481: 74-84 (2013)

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider: Satisfiability of acyclic and almost acyclic CNF formulas. Theor. Comput. Sci. 481: 85-99 (2013)

Petr A. Golovach, Dieter Kratsch, Daniël Paulusma: Detecting induced minors in AT-free graphs. Theor. Comput. Sci. 482: 20-32 (2013)

Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider: Model Counting for CNF Formulas of Bounded Modular Treewidth. STACS 2013: 55-66

Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski: Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. CoRR abs/1301.5953 (2013)

Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma: Finding vertex-surjective graph homomorphisms. Acta Inf. 49(6): 381-394 (2012)

Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma: The k-in-a-Path Problem for Claw-free Graphs. Algorithmica 62(1-2): 499-519 (2012)

Pim van 't Hof, Marcin Kaminski, Daniël Paulusma: Finding Induced Paths of Given Parity in Claw-Free Graphs. Algorithmica 62(1-2): 537-563 (2012)

Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Containment relations in split graphs. Discrete Applied Mathematics 160(1-2): 155-163 (2012)

Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma: Distance three labelings of trees. Discrete Applied Mathematics 160(6): 764-779 (2012)

Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos: On graph contractions and induced minors. Discrete Applied Mathematics 160(6): 799-809 (2012)

Péter Biró, Walter Kern, Daniël Paulusma: Computing solutions for matching games. Int. J. Game Theory 41(1): 75-90 (2012)

Iain A. Stewart, Daniël Paulusma, Matthew Johnson: Editorial. J. Discrete Algorithms 12: 1 (2012)

Pinar Heggernes, Pim van 't Hof, Daniël Paulusma: Computing role assignments of proper interval graphs in polynomial time. J. Discrete Algorithms 14: 173-188 (2012)

Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma: On the parameterized complexity of coloring graphs in the absence of a linear forest. J. Discrete Algorithms 15: 56-62 (2012)

Jirí Fiala, Marcin Kaminski, Daniël Paulusma: Detecting induced star-like minors in polynomial time. J. Discrete Algorithms 17: 74-85 (2012)

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. 414(1): 9-19 (2012)

Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Induced packing of odd cycles in planar graphs. Theor. Comput. Sci. 420: 28-35 (2012)

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song: Determining the chromatic number of triangle-free 2P₃-free graphs in polynomial time. Theor. Comput. Sci. 423: 1-10 (2012)

Petr A. Golovach, Daniël Paulusma, Jian Song: Computing vertex-surjective homomorphisms to partially reflexive trees. Theor. Comput. Sci. 457: 86-100 (2012)

Rémy Belmonte, Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Characterizing Graphs of Small Carving-Width. COCOA 2012: 360-370

Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma: Finding Vertex-Surjective Graph Homomorphisms. CSR 2012: 160-171

Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen: Induced Disjoint Paths in Claw-Free Graphs. ESA 2012: 515-526

Petr A. Golovach, Daniël Paulusma, Jian Song: Closing Complexity Gaps for Coloring Problems on H-Free Graphs. ISAAC 2012: 14-23

Petr A. Golovach, Dieter Kratsch, Daniël Paulusma: Detecting Induced Minors in AT-Free Graphs. ISAAC 2012: 495-505

Petr A. Golovach, Daniël Paulusma, Bernard Ries: Coloring Graphs Characterized by a Forbidden Subgraph. MFCS 2012: 443-454

Petr A. Golovach, Pim van 't Hof, Daniël Paulusma: Obtaining Planarity by Contracting Few Edges. MFCS 2012: 455-466

Petr A. Golovach, Daniël Paulusma, Jian Song: 4-Coloring H-Free Graphs When H Is Small. SOFSEM 2012: 289-300

Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen: Induced Disjoint Paths in AT-Free Graphs. SWAT 2012: 153-164

Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma: Solutions for the Stable Roommates Problem with Payments. WG 2012: 69-80

Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk: How to Eliminate a Graph. WG 2012: 320-331

Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen: Induced Disjoint Paths in Claw-Free Graphs. CoRR abs/1202.4419 (2012)

Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma: Finding vertex-surjective graph homomorphisms. CoRR abs/1204.2124 (2012)

Petr A. Golovach, Pim van 't Hof, Daniël Paulusma: Obtaining Planarity by Contracting Few Edges. CoRR abs/1204.5113 (2012)

Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: On disconnected cuts and separators. Discrete Applied Mathematics 159(13): 1345-1351 (2011)

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 38: 161-166 (2011)

Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Lift Contractions. Electronic Notes in Discrete Mathematics 38: 407-412 (2011)

Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Contracting planar graphs to contractions of triangulations. J. Discrete Algorithms 9(3): 299-306 (2011)

Jérémie Chalopin, Daniël Paulusma: Graph labelings derived from models in distributed computing: A complete complexity classification. Networks 58(3): 207-231 (2011)

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. 412(45): 6340-6350 (2011)

Daniël Paulusma, Johan M. M. van Rooij: On partitioning a graph into two connected subgraphs. Theor. Comput. Sci. 412(48): 6761-6769 (2011)

Barnaby Martin, Daniël Paulusma: The Computational Complexity of Disconnected Cut and 2K 2-Partition. CP 2011: 561-575

Petr A. Golovach, Daniël Paulusma, Jian Song: Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees. CSR 2011: 261-274

Petr A. Golovach, Daniël Paulusma, Jian Song: Coloring Graphs without Short Cycles and Long Induced Paths. FCT 2011: 193-204

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: 110-119

Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Increasing the Minimum Degree of a Graph by Contractions. IPEC 2011: 67-79

Petr A. Golovach, Marcin Kaminski, Daniël Paulusma: Contracting a Chordal Graph to a Split Graph or a Tree. MFCS 2011: 339-350

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider: Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). SAT 2011: 47-60

Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma: List Coloring in the Absence of a Linear Forest. WG 2011: 119-130

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider: Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II). CoRR abs/1104.4279 (2011)

Barnaby Martin, Daniël Paulusma: The Computational Complexity of Disconnected Cut and 2K2-Partition. CoRR abs/1104.4779 (2011)

Pim van 't Hof, Daniël Paulusma: A new characterization of P₆-free graphs. Discrete Applied Mathematics 158(7): 731-740 (2010)

Matthew Johnson, Daniël Paulusma, Chantal Wood: Path factors and parallel knock-out schemes of almost claw-free graphs. Discrete Mathematics 310(9): 1413-1423 (2010)

Hajo Broersma, Daniël Paulusma: Computing sharp 2-factors in claw-free graphs. J. Discrete Algorithms 8(3): 321-329 (2010)

Jirí Fiala, Daniël Paulusma: Comparing Universal Covers in Polynomial Time. Theory Comput. Syst. 46(4): 620-635 (2010)

Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij: Computing role assignments of chordal graphs. Theor. Comput. Sci. 411(40-42): 3601-3613 (2010)

Jérémie Chalopin, Daniël Paulusma: Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. CIAC 2010: 276-287

Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck: Obtaining Online Ecological Colourings by Generalizing First-Fit. CSR 2010: 240-251

Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Contractions of Planar Graphs in Polynomial Time. ESA (1) 2010: 122-133

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider: Satisfiability of Acyclic and Almost Acyclic CNF Formulas. FSTTCS 2010: 84-95

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song: On Coloring Graphs without Induced Forests. ISAAC (2) 2010: 156-167

Pinar Heggernes, Pim van 't Hof, Daniël Paulusma: Computing Role Assignments of Proper Interval Graphs in Polynomial Time. IWOCA 2010: 167-180

Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos: On Contracting Graphs to Fixed Pattern Graphs. SOFSEM 2010: 503-514

Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma: The k-in-a-path Problem for Claw-free Graphs. STACS 2010: 371-382

Péter Biró, Walter Kern, Daniël Paulusma: On Solution Concepts for Matching Games. TAMC 2010: 117-127

Petr A. Golovach, Bernard Lidický, Daniël Paulusma: L(2, 1, 1)-Labeling Is NP-Complete for Trees. TAMC 2010: 211-221

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song: Narrowing Down the Gap on the Complexity of Coloring P_k-Free Graphs. WG 2010: 63-74

Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Contracting planar graphs to contractions of triangulations. CoRR abs/1012.2460 (2010)

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 309(18): 5596-5609 (2009)

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 29(1): 143-162 (2009)

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 25(4): 427-460 (2009)

Walter Kern, Daniël Paulusma: On the Core and f-Nucleolus of Flow Games. Math. Oper. Res. 34(4): 981-991 (2009)

Hajo Broersma, Matthew Johnson, Daniël Paulusma: Upper bounds and algorithms for parallel knock-out numbers. Theor. Comput. Sci. 410(14): 1319-1327 (2009)

Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider: Covering graphs with few complete bipartite subgraphs. Theor. Comput. Sci. 410(21-23): 2045-2053 (2009)

Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger: Partitioning graphs into connected parts. Theor. Comput. Sci. 410(47-49): 4834-4843 (2009)

Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger: Partitioning Graphs into Connected Parts. CSR 2009: 143-154

Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij: Computing Role Assignments of Chordal Graphs. FCT 2009: 193-204

Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Induced Packing of Odd Cycles in a Planar Graph. ISAAC 2009: 514-523

Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Parameterizing Cut Sets in a Graph by the Number of Their Components. ISAAC 2009: 605-615

Daniël Paulusma, Johan M. M. van Rooij: On Partitioning a Graph into Two Connected Subgraphs. ISAAC 2009: 1215-1224

Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma: Three Complexity Results on Coloring P_k-Free Graphs. IWOCA 2009: 95-104

Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma: Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. WG 2009: 44-53

Pim van 't Hof, Marcin Kaminski, Daniël Paulusma: Finding Induced Paths of Given Parity in Claw-Free Graphs. WG 2009: 341-352

Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma: The k-in-a-path problem for claw-free graphs. CoRR abs/0912.5468 (2009)

Daniël Paulusma, Kiyoshi Yoshimoto: Relative length of longest paths and longest cycles in triangle-free graphs. Discrete Mathematics 308(7): 1222-1229 (2008)

Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Locally constrained graph homomorphisms and equitable partitions. Eur. J. Comb. 29(4): 850-880 (2008)

Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger: The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases. Networks 51(3): 178-189 (2008)

Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger: The computational complexity of graph contractions II: Two tough polynomially solvable cases. Networks 52(1): 32-56 (2008)

Hajo Broersma, Agostino Capponi, Daniël Paulusma: A New Algorithm for On-line Coloring Bipartite Graphs. SIAM J. Discrete Math. 22(1): 72-91 (2008)

Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart: The computational complexity of the parallel knock-out problem. Theor. Comput. Sci. 393(1-3): 182-195 (2008)

Pim van 't Hof, Daniël Paulusma: A New Characterization of P6-Free Graphs. COCOON 2008: 415-424

Jirí Fiala, Daniël Paulusma: Comparing Universal Covers in Polynomial Time. CSR 2008: 158-167

Matthew Johnson, Daniël Paulusma, Chantal Wood: Path factors and parallel knock-out schemes of almost claw-free graphs. IWOCA 2008: 27-41

Hajo Broersma, Daniël Paulusma: Computing Sharp 2-Factors in Claw-Free Graphs. MFCS 2008: 193-204

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. Lecture Notes in Computer Science 5344, 2008, isbn 978-3-540-92247-6

Daniël Paulusma, Kiyoshi Yoshimoto: Cycles through specified vertices in triangle-free graphs. Discussiones Mathematicae Graph Theory 27(1): 179-191 (2007)

Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto: On components of 2-factors in claw-free graphs. Electronic Notes in Discrete Mathematics 29: 289-293 (2007)

Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider: Covering Graphs with Few Complete Bipartite Subgraphs. FSTTCS 2007: 340-351

Hajo Broersma, Matthew Johnson, Daniël Paulusma: Upper Bounds and Algorithms for Parallel Knock-Out Numbers. SIROCCO 2007: 328-340

Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman: Improved Upper Bounds for lambda -Backbone Colorings Along Matchings and Stars. SOFSEM (1) 2007: 188-199

Hajo Broersma, Agostino Capponi, Daniël Paulusma: On-Line Coloring of H-Free Bipartite Graphs. CIAC 2006: 284-295

Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart: The Computational Complexity of the Parallel Knock-Out Problem. LATIN 2006: 250-261

Jérémie Chalopin, Daniël Paulusma: Graph Labelings Derived from Models in Distributed Computing. WG 2006: 301-312

Jirí Fiala, Daniël Paulusma: A complete complexity classification of the role assignment problem. Theor. Comput. Sci. 349(1): 67-81 (2005)

Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. MFCS 2005: 340-351

Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. WG 2005: 115-126

Walter Kern, Daniël Paulusma: The computational complexity of the elimination problem in generalized sports competitions. Discrete Optimization 1(2): 205-214 (2004)

Lodewijk T. Smit, Gerard J. M. Smit, Johann L. Hurink, Hajo Broersma, Daniël Paulusma, Pascal T. Wolkotte: Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture. FPT 2004: 421-424

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: 189-200

Walter Kern, Daniël Paulusma: Matching Games: The Least Core and the Nucleolus. Math. Oper. Res. 28(2): 294-308 (2003)

Jirí Fiala, Daniël Paulusma: The Computational Complexity of the Role Assignment Problem. ICALP 2003: 817-828

Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger: The Complexity of Graph Contractions. WG 2003: 322-333

Walter Kern, Daniël Paulusma: The new FIFA rules are hard: complexity aspects of sports competitions. Discrete Applied Mathematics 108(3): 317-323 (2001)

Theo S. H. Driessen, Daniël Paulusma: Two extensions of the Shapley value for cooperative games. Math. Meth. of OR 53(1): 35-49 (2001)

Ulrich Faigle, Walter Kern, Daniël Paulusma: Note on the computational complexity of least core concepts for min-cost spanning tree games. Math. Meth. of OR 52(1): 23-38 (2000)