Papers

For preprints see here.

Theses

  1. D. Paulusma, Complexity Aspects of Cooperative Games, PhD-Thesis, University of Twente, Enschede, the Netherlands, 2001.
  2. D. Paulusma, Extensions of the Shapley Value for TU-Games Defined on Posets, Master Thesis, University of Twente, Enschede, the Netherlands, 1997.

Journal Publications

  1. P. Biro, W. Kern, D. Paulusma and P. Wojuteczky, The stable fixtures problem with payments, to appear in Games and Economic Behavior doi.
  2. M. Cochefert, J.F. Couturier, P.A. Golovach, D. Kratsch, D. Paulusma and A. Stewart, Computing square roots of graphs with low maximum degree, to appear in Discrete Applied Mathematics doi.
  3. K.K. Dabrowski, S. Huang and D. Paulusma, Bounding clique-width via perfect graphs, to appear in Journal of Computer and System Sciences doi.
  4. K.K. Dabrowski, V. Lozin and D. Paulusma, Well-quasi-ordering versus clique-width: new results on bigenic classes, to appear in Order doi.
  5. P.A. Golovach, D. Kratsch, D. Paulusma and A. Stewart, Finding cactus roots in polynomial time, to appear in Theory of Computing Systems doi.
  6. M. Bonamy, K.K. Dabrowski, C. Feghali, M. Johnson and D. Paulusma, Independent feedback vertex sets for graphs of bounded diameter Information Processing Letters 131 (2018) 26-32 doi.
  7. N. Chiarelli, T.R. Hartinger, M. Johnson, M. Milanic and D. Paulusma, Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity, Theoretical Computer Science 705 (2018) 75-83 doi.
  8. A. Brandstadt, K.K. Dabrowski, S. Huang and D. Paulusma, Bounding the clique-width of H-free chordal graphs, Journal of Graph Theory 86 (2017) 42-77 doi.
  9. R. Belmonte, P. van 't Hof, M. Kaminski and D. Paulusma, The price of connectivity for feedback vertex set, Discrete Applied Mathematics 217 (2017) 132-143 doi.
  10. K.K. Dabrowski, F. Dross and D. Paulusma, Colouring diamond-free graphs, Journal of Computer and System Sciences 89 (2017) 410-431 doi.
  11. K.K. Dabrowski, P.A. Golovach, P. van 't Hof, D. Paulusma and D.M. Thilikos, Editing to a planar graph of given degrees, Journal of Computer and System Sciences 85 (2017) 168-182 doi.
  12. K.K. Dabrowski and D. Paulusma, Contracting bipartite graphs to paths and cycles, Information Processing Letters 127 (2017) 37-42 doi.
  13. C. Feghali, M. Johnson and D. Paulusma, Kempe equivalence of colourings of cubic graphs, European Journal of Combinatorics 59 (2017) 1-10 doi.
  14. P.A. Golovach, M. Johnson, D. Paulusma and J. Song, A survey on the computational complexity of colouring graphs with forbidden subgraphs, Journal of Graph Theory 84 (2017) 331-363 doi.
  15. P.A. Golovach, D. Kratsch, D. Paulusma and A. Stewart, A linear kernel for finding square roots of almost planar graphs, Theoretical Computer Science 689 (2017) 36-47 doi.
  16. P.A. Golovach, D. Paulusma and I.A. Stewart, Graph editing to a fixed target, Discrete Applied Mathematics 216 (2017) 181-190 doi.
  17. A. Brandstadt, K.K. Dabrowski, S. Huang and D. Paulusma, Bounding the clique-width of H-free split graphs, Discrete Applied Mathematics 211 (2016) 30-39 doi.
  18. M. Cochefert, J.F. Couturier, P.A. Golovach, D. Kratsch and D. Paulusma, Parameterized algorithms for finding square roots, Algorithmica 74 (2016) 602-629 doi.
  19. K.K. Dabrowski, P.A. Golovach, P. van 't Hof and D. Paulusma, Editing to Eulerian graphs, Journal of Computer and System Sciences 82 (2016) 213-228 doi.
  20. K.K. Dabrowski and D. Paulusma, Classifying the clique-width of H-free bipartite graphs, Discrete Applied Mathematics 200 (2016) 43-51 doi.
  21. K.K. Dabrowksi and D. Paulusma, Clique-width of graph classes defined by two forbidden induced subgraphs, The Computer Journal 59 (2016) 650-666 doi.
  22. C. Feghali, M. Johnson and D. Paulusma, A reconfigurations analogue of Brooks' Theorem and its consequences, Journal of Graph Theory 83 (2016) 340-358 doi.
  23. P.A. Golovach, D. Paulusma and E.J. van Leeuwen, Induced disjoint paths in circular-arc graphs in linear time, Theoretical Computer Science 640 (2016) 70-83 doi.
  24. T.R. Hartinger, M. Johnson, M. Milanic and D. Paulusma, The price of connectivity for cycle transversals, European Journal of Combinatorics 58 (2016) 203-224 doi.
  25. M. Johnson, D. Kratsch, S. Kratsch, V. Patel and D. Paulusma, Finding shortest paths between graph colourings, Algorithmica 75 (2016) 295-321 doi.
  26. M. Kaminski, D. Paulusma, A. Stewart and D.M. Thilikos, Minimal disconnected cuts in planar graphs, Networks 68 (2016) 250-259 doi.
  27. D. Paulusma, F. Slivovsky and S. Szeider, Model counting for CNF formulas of bounded modular treewidth, Algorithmica 76 (2016) 168-194 doi.
  28. H.J. Broersma, J. Fiala, P.A. Golovach, T. Kaiser, D. Paulusma and A. Proskurowski, Linear-time algorithms for scattering number and hamilton-connectivity of interval graphs, Journal of Graph Theory 79 (2015) 282-299. doi.
  29. S. Chaplick, J. Fiala, P. van 't Hof, D. Paulusma and M. Tesar, Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree, Theoretical Computer Science 590 (2015) 86-95 doi.
  30. J.F. Couturier, P.A. Golovach, D. Kratsch and D. Paulusma, List coloring in the absence of a linear forest, Algorithmica 71 (2015) 21-35 doi.
  31. P.A. Golovach, P. Heggernes, P. van 't Hof, F. Manne, D. Paulusma and M. Pilipczuk, Modifying a graph using vertex elimination, Algorithmica 72 (2015) 99-125 doi.
  32. P.A. Golovach, D. Paulusma and B. Ries, Coloring graphs characterized by a forbidden subgraph, Discrete Applied Mathematics 180 (2015) 101-110 doi.
  33. P.A. Golovach, D. Paulusma and E.J. van Leeuwen, Induced disjoint paths in claw-free graphs, SIAM Journal on Discrete Mathematics 29 (2015) 348-375 doi.
  34. S. Huang, M. Johnson and D. Paulusma, Narrowing the complexity gap for colouring (Cs,Pt)-free graphs, The Computer Journal 58 (2015) 3074-3088 doi.
  35. M. Johnson, D. Paulusma and A. Stewart, Knocking out Pk-free graphs, Discrete Applied Mathematics 190 (2015) 100-108 doi.
  36. M. Johnson, D. Paulusma and E.J. van Leeuwen, Algorithms to measure diversity and clustering in social networks through dot product graphs, Social Networks 41 (2015) 48-55 doi.
  37. B. Martin and D. Paulusma, The computational complexity of Disconnected Cut and 2K2-Partition, Journal of Combinatorial Theory, Series B 111 (2015) 17-37 doi.
  38. R. Belmonte, P.A. Golovach, P. Heggernes, P. van 't Hof, M. Kaminski and D. Paulusma, Detecting fixed patterns in chordal graphs in polynomial time, Algorithmica 69 (2014) 501-521 doi.
  39. R. Belmonte, P.A. Golovach, P. van 't Hof and D. Paulusma, Parameterized complexity of three edge contraction problems with degree constraints, Acta Informatica 51 (2014) 473-497 doi.
  40. P. Biro, M. Bomhoff, P.A. Golovach, W. Kern and D. Paulusma, Solutions for the stable roommates problem with payments, Theoretical Computer Science 540 (2014) 53-61 doi.
  41. M. Bonamy, M. Johnson, I.M. Lignos, V. Patel and D. Paulusma, Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs, Journal of Combinatorial Optimization 27 (2014) 132-143 doi.
  42. J. Chalopin and D. Paulusma, Packing bipartite graphs with covers of complete bipartite graphs, Discrete Applied Mathematics 168 (2014) 40-50 doi.
  43. K.K. Dabrowski, P.A. Golovach and D. Paulusma, Colouring of graphs with Ramsey-type forbidden subgraphs, Theoretical Computer Science 522 (2014) 34-43 doi.
  44. P.A. Golovach, M. Kaminski, D. Paulusma and D.M. Thilikos, Lift-contractions, European Journal of Combinatorics 35 (2014) 286-296 doi.
  45. P.A. Golovach and D. Paulusma, List coloring in the absence of two subgraphs, Discrete Applied Mathematics 166 (2014) 123-130 doi.
  46. P.A. Golovach, D. Paulusma and J. Song, Closing complexity gaps for coloring problems on H-free graphs, Information and Computation 237 (2014) 204-214 doi.
  47. P.A. Golovach, D. Paulusma and J. Song, Coloring graphs without short cycles and long induced paths, Discrete Applied Mathematics 167 (2014) 107-120 doi.
  48. M. Johnson, V. Patel, D. Paulusma and T. Trunck, Obtaining online ecological colourings by generalizing first-fit, Theory of Computing Systems 54 (2014) 244-260 doi.
  49. R. Belmonte, P. van 't Hof, M. Kaminski, D. Paulusma and D.M. Thilikos, Characterizing graphs of small carving-width, Discrete Applied Mathematics 161 (2013) 1888-1893 doi.
  50. H.J. Broersma, F.V. Fomin, P.A. Golovach and D. Paulusma, Three complexity results on coloring Pk-free graphs, European Journal of Combinatorics 34 (2013) 609-619 doi.
  51. H.J. Broersma, F.V. Fomin, P. van 't Hof and D. Paulusma, Exact algorithms for finding longest cycles in claw-free graphs, Algorithmica 65 (2013) 129-145 doi.
  52. J. Fiala, M. Kaminski and D. Paulusma, A note on contracting claw-free graphs, Discrete Mathematics & Theoretical Computer Science 15 (2013) 223-232 doi.
  53. P.A. Golovach, P. Heggernes, P. van 't Hof and D. Paulusma, Choosability on H-free graphs, Information Processing Letters 113 (2013) 107-110 doi.
  54. P.A. Golovach, P. van 't Hof and D. Paulusma, Obtaining planarity by contracting few edges, Theoretical Computer Science 476 (2013) 38-46 doi.
  55. P.A. Golovach, M. Kaminski, D. Paulusma and D.M. Thilikos, Increasing the minimum degree of a graph by contractions, Theoretical Computer Science 481 (2013) 74-84 doi.
  56. P.A. Golovach, D. Kratsch and D. Paulusma, Detecting induced minors in AT-free graphs, Theoretical Computer Science 482 (2013) 20-32 doi.
  57. P.A. Golovach, D. Paulusma and J. Song, 4-Coloring H-free graphs when H is small, Discrete Applied Mathematics 161 (2013) 140-150 doi.
  58. S. Ordyniak, D. Paulusma and S. Szeider, Satisfiability of acyclic and almost acyclic CNF formulas, Theoretical Computer Science 481 (2013) 85-99 doi.
  59. P. Biro, W. Kern and D. Paulusma, Computing solutions for matching games, International Journal of Game Theory 41 (2012) 75-90 doi.
  60. H.J. Broersma, P.A. Golovach, D. Paulusma and J. Song, Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time, Theoretical Computer Science 423 (2012) 1-10 doi.
  61. H.J. Broersma, P.A. Golovach, D. Paulusma and J. Song, Updating the complexity status of coloring graphs without a fixed induced linear forest, Theoretical Computer Science 414 (2012) 9-19 doi.
  62. J.F. Couturier, P.A. Golovach, D. Kratsch and D. Paulusma, On the parameterized complexity of coloring graphs in the absence of a linear forest, Journal of Discrete Algorithms 15 (2012) 56-62 doi.
  63. J. Fiala, P.A. Golovach, J. Kratochvil, B. Lidicky and D. Paulusma, Distance three labelings of trees, Discrete Applied Mathematics 160 (2012) 764-779 doi.
  64. J. Fiala, M. Kaminski, B. Lidicky and D. Paulusma, The k-in-a-path problem for claw-free graphs, Algorithmica 62 (2012) 499-519 doi.
  65. J. Fiala, M. Kaminski and D. Paulusma, Detecting induced star-like minors in polynomial time, Journal of Discrete Algorithms 17 (2012) 74-85 doi.
  66. P.A. Golovach, M. Kaminski, D. Paulusma and D.M. Thilikos, Containment relations in split graphs, Discrete Applied Mathematics 160 (2012) 155-163 doi.
  67. P.A. Golovach, M. Kaminski, D. Paulusma and D.M. Thilikos, Induced packing of odd cycles in planar graphs, Theoretical Computer Science 420 (2012) 28-35 doi.
  68. P.A. Golovach, B. Lidicky, B. Martin and D. Paulusma, Finding vertex-surjective graph homomorphisms, Acta Informatica 49 (2012) 381-394 doi.
  69. P.A. Golovach, D. Paulusma and J. Song, Computing vertex-surjective homomorphisms to partially reflexive trees, Theoretical Computer Science 457 (2012) 86-100 doi.
  70. P. Heggernes, P. van 't Hof and D. Paulusma, Computing role assignments of proper interval graphs in polynomial time, Journal of Discrete Algorithms 14 (2012) 173-188 doi.
  71. P. van 't Hof, M. Kaminski and D. Paulusma, Finding induced paths of given parity in claw-free graphs, Algorithmica 62 (2012) 537-563 doi.
  72. P. van 't Hof, M. Kaminski, D. Paulusma, S. Szeider and D.M. Thilikos, On graph contractions and induced minors, Discrete Applied Mathematics 160 (2012) 799-809 doi.
  73. J. Chalopin and D. Paulusma, Graph labelings derived from models in distributed computing: a complete complexity classification, Networks 58 (2011) 207-231 doi.
  74. T. Ito, M. Kaminski, D. Paulusma and D.M. Thilikos, Parameterizing cut sets in a graph by the number of their components, Theoretical Computer Science 412 (2011) 6340-6350 doi.
  75. T. Ito, M. Kaminski, D. Paulusma and D.M. Thilikos, On disconnected cuts and separators, Discrete Applied Mathematics 159 (2011) 1345-1351 doi.
  76. M. Kaminski, D. Paulusma and D.M. Thilikos, Contracting planar graphs to contractions of triangulations, Journal of Discrete Algorithms 9 (2011) 299-306 doi.
  77. D. Paulusma and J.M.M. van Rooij, On partitioning a graph into two connected subgraphs, Theoretical Computer Science 412 (2011) 6761-6769 doi.
  78. H.J. Broersma and D. Paulusma, Computing sharp 2-factors in claw-free graphs, Journal of Discrete Algorithms 8 (2010) 321-329 doi.
  79. J. Fiala and D. Paulusma, Comparing universal covers in polynomial time, Theory of Computing Systems 46 (2010) 620-635 doi.
  80. P. van 't Hof and D. Paulusma, A new characterization of P6-free graphs, Discrete Applied Mathematics 158 (2010) 731-740 doi.
  81. P. van 't Hof, D. Paulusma and J.M.M. van Rooij, Computing role assignments of chordal graphs, Theoretical Computer Science 411 (2010) 3601-3613 doi.
  82. M. Johnson, D. Paulusma and C. Wood, Path factors and parallel knock-out schemes of almost claw-free graphs, Discrete Mathematics 310 (2010) 1413-1423 doi.
  83. H.J. Broersma, J. Fujisawa, L. Marchal, D. Paulusma, A.N.M. Salman and K. Yoshimoto, l-Backbone colorings along pairwise disjoint stars and matchings, Discrete Mathematics 309 (2009) 5596-5609 doi.
  84. H.J. Broersma, M. Johnson and D. Paulusma, Upper bounds and algorithms for parallel knock-out numbers, Theoretical Computer Science 410 (2009) 1319-1327 doi.
  85. H.J. Broersma, L. Marchal, D. Paulusma and 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 (2009) 143-162 doi.
  86. H.J. Broersma, D. Paulusma and K. Yoshimoto, Sharp upper bounds for the minimum number of components of 2-factors in claw-free graphs, Graphs and Combinatorics 25 (2009) 427-460 doi.
  87. H. Fleischner, E. Mujuni, D. Paulusma and S. Szeider, Covering graphs with few complete bipartite subgraphs, Theoretical Computer Science 410 (2009) 2045-2053 doi.
  88. P. van 't Hof, D. Paulusma and G.J. Woeginger, Partitioning graphs into connected parts, Theoretical Computer Science 410 (2009) 4834-4843 doi.
  89. W. Kern and D. Paulusma, On the core and f-nucleolus of flow games, Mathematics of Operations Research 34 (2009) 981-991 doi.
  90. H.J. Broersma, A. Capponi and D. Paulusma, A new algorithm for on-line coloring bipartite graphs, SIAM Journal on Discrete Mathematics 22 (2008) 72-91 doi.
  91. H.J. Broersma, M. Johnson, D. Paulusma and I.A. Stewart, The computational complexity of the parallel knock-out problem, Theoretical Computer Science 393 (2008) 182-195 doi.
  92. J. Fiala, D. Paulusma and J.A. Telle, Locally constrained graph homomorphisms and equitable partitions, European Journal of Combinatorics 29 (2008) 850-880 doi.
  93. A. Levin, D. Paulusma and G.J. Woeginger, The computational complexity of graph contractions II: two tough polynomially solvable cases, Networks 52 (2008) 32-56 doi.
  94. A. Levin, D. Paulusma and G.J. Woeginger, The computational complexity of graph contractions I: polynomially solvable and NP-complete cases, Networks 51 (2008) 178-189 doi.
  95. D. Paulusma and K. Yoshimoto, Relative length of longest paths and longest cycles in triangle-free graphs, Discrete Mathematics 308 (2008) 1222-1229 doi.
  96. D. Paulusma and K. Yoshimoto, Cycles through specified vertices in triangle-free graphs, Discussiones Mathematicae Graph Theory 27 (2007) 179-191 doi.
  97. J. Fiala and D. Paulusma, A complete complexity classification of the role assignment problem, Theoretical Computer Science 349 (2005) 67-81 doi.
  98. W. Kern and D. Paulusma, The computational complexity of the elimination problem in generalized sports competitions, Discrete Optimization 1 (2004) 205-214 doi.
  99. W. Kern and D. Paulusma, Matching games: the least core and the nucleolus, Mathematics of Operations Research 28 (2003) 294-308 doi.
  100. T.S.H. Driessen and D. Paulusma, Two extensions of the Shapley value for cooperative games, Mathematical Methods of Operations Research 53 (2001) 35-49 doi.
  101. W. Kern and D. Paulusma, The new FIFA rules are hard: complexity aspects of sport competitions, Discrete Applied Mathematics 108 (2001) 317-323 doi.
  102. U. Faigle, W. Kern and D. Paulusma, Note on the computational complexity of least core concepts for min-cost spanning tree games, Mathematical Methods of Operations Research 52 (2000) 23-38 doi.

Publications in Conference Proceedings

  1. A. Blanche, K.K. Dabrowski, M. Johnson, V.V. Lozin, D. Paulusma and V. Zamaraev, Clique-width for graph classes closed under complementation, Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Aalborg, Denmark, August 21-25, 2017, Leibniz International Proceedings in Informatics, to appear.
  2. M. Bonamy, K.K. Dabrowski, C. Feghali, M. Johnson and D. Paulusma, Recognizing graphs close to bipartite graphs, Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Aalborg, Denmark, August 21-25, 2017, Leibniz International Proceedings in Informatics, to appear.
  3. M. Bonamy, K.K. Dabrowski, C. Feghali, M. Johnson and D. Paulusma, Independent feedback vertex set for P5-free graphs, Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), Phuket, Thailand, December 9-12, 2017, Leibniz International Proceedings in Informatics, to appear.
  4. K.K. Dabrowski, V.V. Lozin and D. Paulusma, Clique-width and well-quasi ordering of triangle-free graph classes, Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), Eindhoven, the Netherlands, June 21-23, 2017, Lecture Notes in Computer Science 10520, 220-233 doi.
  5. P.A. Golovach, P. Heggernes, D. Kratch, P.T. Lima and D. Paulusma, Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2, Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), Eindhoven, the Netherlands, June 21-23, 2017, Lecture Notes in Computer Science 10520, 275-288 doi.
  6. D. Paulusma, C. Picouleau and B. Ries, Reducing the chromatic number by vertex or edge deletions, Proceedings of the 9th Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2017), Marseille, France, September 11-15, 2017, Electronic Notes in Discrete Mathematics 62, 243-248 doi.
  7. K.K. Dabrowski and D. Paulusma, Contracting bipartite graphs to paths and cycles, Proceedings of the 9th European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017), Vienna, Austria, August 28 - September 1, 2017, Electronic Notes in Discrete Mathematics 61, 309-315 doi.
  8. P.A. Golovach, M. Johnson, B. Martin, D. Paulusma and A. Stewart, Surjective H-Colouring: new hardness results, Proceedings of the 13th Conference on Computability in Europe (CiE 2017), Turku, Finaland, June 12-16, Lecture Notes in Computer Science 10307, 270-281 doi.
  9. D. Paulusma, C. Picouleau and B. Ries, Blocking independent sets for H-free graphs via edge contractions and vertex deletions, Proceedings of the 14th Annual Conference on Theory and Applications of Models of Computation (TAMC 2017), Bern, Switzerland, April 20-22, 2017, Lecture Notes in Computer Science 10185, 470-483 doi.
  10. D. Paulusma, C. Picouleau and B. Ries, Reducing the clique and chromatic number via edge contractions and vertex deletions, Proceedings of the 4th International Symposium on Combinatorial Optimization (ISCO 2016), Vietri sul Mare, Salerno, Italy, May 16-18, 2016, Lecture Notes in Computer Science 9849, 38-49 doi.
  11. P. Bonsma and D. Paulusma, Using contracted solution graphs for solving reconfiguration problems, Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Krakow, Poland, August 22-26, 2016, Leibniz International Proceedings in Informatics 58, 20:1-20:15 doi.
  12. K.K. Dabrowski, V. Lozin and D. Paulusma, Well-quasi-ordering versus clique-width: new results on bigenic classes, Proceedings of the 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), Helsinki, Finland, August 17-19, 2016, Lecture Notes in Computer Science 9843, 253-265 doi.
  13. P.A. Golovach, D. Kratsch, D. Paulusma and A. Stewart, Finding cactus roots in polynomial time, Proceedings of the 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), Helsinki, Finland, August 17-19, 2016, Lecture Notes in Computer Science 9843, 361-372 doi.
  14. K.K. Dabrowski, F. Dross and D. Paulusma, Colouring diamond-free graphs, Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), Reykjavik, Iceland, June 22-24, 2016, Leibniz International Proceedings in Informatics 53, 16:1-16:14 doi.
  15. P.A. Golovach, D. Kratsch, D. Paulusma and A. Stewart, A linear kernel for finding square roots of almost planar graphs, Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), Reykjavik, Iceland, June 22-24, 2016, Leibniz International Proceedings in Informatics 53, 4:1-4:14 doi.
  16. P.A. Golovach, D. Kratsch, D. Paulusma and A. Stewart, Squares of low clique number, Proceedings of the 14th Cologne Twente Workshop 2016 (CTW 2016), Gargnano, Italy, June 6-8, 2016, Electronic Notes in Discrete Mathematics 55, 195-198 doi.
  17. K.K. Dabrowski, F. Dross, M. Johnson and D. Paulusma, Filling the complexity gaps for colouring planar and bounded degree graphs, Proceedings of the 26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Verona, Italy, October 5-7, 2015, Lecture Notes in Computer Science 9538, 100-111 doi.
  18. A. Brandstadt, K.K. Dabrowski, S. Huang and D. Paulusma, Bounding the clique-width of H-free split graphs, Proceedings of the 8th European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2015), Bergen, Norway, August 31 - September 4, 2015, Electronic Notes in Discrete Mathematics 49, 497-503 doi.
  19. C. Feghali, M. Johnson and D. Paulusma, Kempe equivalence of colourings of cubic graphs, Proceedings of the 8th European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2015), Bergen, Norway, August 31 - September 4, 2015, Electronic Notes in Discrete Mathematics 49, 243-249 doi.
  20. M. Johnson, D. Paulusma and E.J. van Leeuwen, What graphs are 2-dot product graphs?, Proceedings of the 8th European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2015), Bergen, Norway, August 31 - September 4, 2015, Electronic Notes in Discrete Mathematics 49, 705-711 doi.
  21. A. Brandstadt, K.K. Dabrowski, S. Huang and D. Paulusma, Bounding the clique-width of H-free chordal graphs, Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science (MFCS 2015), Milan, Italy, August 24-28, 2015, Lecture Notes in Computer Science 9235, 139-150 doi.
  22. T.R. Hartinger, M. Johnson, M. Milanic and D. Paulusma, The price of connectivity for cycle transversals, Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science (MFCS 2015), Milan, Italy, August 24-28, 2015, Lecture Notes in Computer Science 9235, 395-406 doi.
  23. P. Biro, W. Kern, D. Paulusma and P. Wojuteczky, The stable fixtures problem with payments, Proceedings of the 41th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015), Munich, Germany, June 17-19, 2015, Lecture Notes in Computer Science 9224, 49-63 doi.
  24. D. Paulusma, Open problems on graph coloring for special graph classes, Proceedings of the 41th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015), Munich, Germany, June 17-19, 2015, Lecture Notes in Computer Science 9224, 16-30 doi.
  25. M. Kaminski, D. Paulusma, A. Stewart and D.M. Thilikos, Minimal disconnected cuts in planar graphs, Proceedings of the 20th International Symposium on Fundamentals of Computation Theory (FCT 2015), Gdansk, Poland, August 17-19, 2015, Lecture Notes in Computer Science 9210, 243-254 doi.
  26. K.K. Dabrowski, P.A. Golovach, P. van 't Hof, D. Paulusma and D.M. Thilikos, Editing to a planar graph of given degrees, Proceedings of the 10th International Computer Science Symposium in Russia (CSR 2015), Listvyanka, Russia, July 13-17, 2015, Lecture Notes in Computer Science 9139, 143-156 doi.
  27. K.K. Dabrowksi and D. Paulusma, Clique-width of graph classes defined by two forbidden induced subgraphs, Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC 2015), Paris, France, May 20-22, 2015, Lecture Notes in Computer Science 9079, 167-181 doi.
  28. O. Diner, D. Paulusma, C. Picouleau and B. Ries, Contraction blockers for graphs with forbidden induced paths, Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC 2015), Paris, France, May 20-22, 2015, Lecture Notes in Computer Science 9079, 194-207 doi
  29. K.K. Dabrowski, S. Huang and D. Paulusma, Bounding clique-width via perfect graphs, Proceedings of the 9th International Conference on Language and Automata Theory and Applications (LATA 2015), Nice, France, March 2-6, 2015, Lecture Notes in Computer Science 8977, 676-688 doi.
  30. K.K. Dabrowski, P.A. Golovach, P. van 't Hof and D. Paulusma, Editing to Eulerian graphs, Proceedings of the 34th International Conference of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2014), New Delhi, India, December 15-17, 2014, Leibniz International Proceedings in Informatics 29, 97-108 doi.
  31. M. Johnson, D. Kratsch, S. Kratsch, V. Patel and D. Paulusma, Finding shortest paths between graph colourings, Proceedings of the 9th International Symposium on Parameterized and Exact Computation (IPEC 2014), Wroclaw, Poland, September 10-12, 2014, Lecture Notes in Computer Science 8894, 221-233 doi.
  32. P.A. Golovach, D. Paulusma and E.J. van Leeuwen, Induced disjoint paths in circular-arc graphs in linear time, Proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2014), Domaine de Chales, France, June 25-27, 2014, Lecture Notes in Computer Science 8747, 225-237 doi.
  33. R. Belmonte, P. van 't Hof, M. Kaminski and D. Paulusma, Forbidden induced subgraphs and the price of connectivity for feedback vertex set, Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), Budapest, Hungary, August 25-29, 2014, Lecture Notes in Computer Science 8635, 57-68 doi.
  34. C. Feghali, M. Johnson and D. Paulusma, A reconfigurations analogue of Brooks' Theorem, Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), Budapest, Hungary, August 25-29, 2014, Lecture Notes in Computer Science 8635, 287-298 doi.
  35. M. Johnson, D. Paulusma and A. Stewart, Knocking out Pk-free graphs, Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), Budapest, Hungary, August 25-29, 2014, Lecture Notes in Computer Science 8635, 396-407 doi.
  36. K.K. Dabrowski and D. Paulusma, Classifying the clique-width of H-free bipartite graphs, Proceedings of the 20th International Computing and Combinatorics Conference (COCOON 2014), Atlanta, Georgia, USA, August 4-6, 2014, Lecture Notes in Computer Science 8591, 489-500 doi.
  37. S. Huang, M. Johnson and D. Paulusma, Narrowing the complexity gap for colouring (Cs,Pt)-free graphs, Proceedings of the 10th International Conference on Algorithmic Aspects of Information and Management (AAIM 2014), Vancouver, Canada, July 8-11, 2014, Lecture Notes in Computer Science 8546, 162-173 doi.
  38. R. Belmonte, P. van 't Hof, M. Kaminski and D. Paulusma, The price of connectivity for feedback vertex set, Proceedings of the 7th European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2013), Pisa, Italy, September 9 -13, 2013, CRM Series 16, 123-128 doi.
  39. P.A. Golovach, D. Paulusma and I.A. Stewart, Graph editing to a fixed target, Proceedings of the 24th International Workshop on Combinatorial Algorithms (IWOCA 2013), Rouen, France, July 10-12, 2013, Lecture Notes in Computer Science 8288, 192-205 doi.
  40. M. Johnson, D.Paulusma and E.J. van Leeuwen, Algorithms to measure diversity and clustering in social networks through dot product graphs, Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC 2013), Hong Kong, China, December 16-18, 2013, Lecture Notes in Computer Science 8283, 130-140 doi.
  41. R. Belmonte, P.A. Golovach, P. van 't Hof and D. Paulusma, Parameterized complexity of two edge contraction problems with degree constraints, Proceedings of the 8th International Symposium on Parameterized and Exact Computation (IPEC 2013), Sophia Antipolis, France, September 4-6, 2013, Lecture Notes in Computer Science 8246, 16-27 doi.
  42. H.J. Broersma, J. Fiala, P.A. Golovach, T. Kaiser, D. Paulusma and A. Proskurowski, Linear-time algorithms for scattering number and hamilton-connectivity of interval graphs, Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2013), Luebeck, Germany, June 19-21, 2013, Lecture Notes in Computer Science 8165, 127-138 doi.
  43. M. Cochefert, J.F. Couturier, P.A. Golovach, D. Kratsch and D. Paulusma, Sparse square roots, Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2013), Luebeck, Germany, June 19-21, 2013, Lecture Notes in Computer Science 8165, 177-188 doi.
  44. K.K. Dabrowski, P.A. Golovach and D. Paulusma, Colouring of graphs with Ramsey-type forbidden subgraphs, Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2013), Luebeck, Germany, June 19-21, 2013, Lecture Notes in Computer Science 8165, 201-212 doi.
  45. S. Chaplick, J. Fiala, P. van 't Hof, D. Paulusma and M. Tesar, Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree, Proceedings of the 19th International Symposium on Fundamentals of Computation Theory (FCT 2013), Liverpool, UK, August 19-21, 2013, Lecture Notes in Computer Science 8070, 121-132 doi.
  46. P.A. Golovach and D. Paulusma, List coloring in the absence of two subgraphs, Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC 2013), Barcelona, Spain, May 22-24, 2013, Lecture Notes in Computer Science 7878, 288-299 doi.
  47. D. Paulusma, F. Slivovsky and S. Szeider, Model counting for CNF formulas of bounded modular treewidth, Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Kiel, Germany, February 27 - March 2, 2013, Leibniz International Proceedings in Informatics 20, 55-66 doi.
  48. P.A. Golovach, D. Paulusma and J. Song, Closing complexity gaps for coloring problems on H-free graphs, Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC 2012), Taipei, Taiwan, December 19-21, 2012, Lecture Notes in Computer Science 7676, 14-23 doi.
  49. P.A. Golovach, D. Kratsch and D. Paulusma, Detecting induced minors in AT-free graphs, Proceedings of the 23nd International Symposium on Algorithms and Computation (ISAAC 2012), Taipei, Taiwan, December 19-21, 2012, Lecture Notes in Computer Science 7676, 495-505 doi.
  50. P. Biro, M. Bomhoff, P.A. Golovach, W. Kern and D. Paulusma, Solutions for the stable roommates problem with payments, Proceedings of the 38th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2012), Jerusalem, Israel, June 26-28, 2012, Lecture Notes in Computer Science 7551, 69-80 doi.
  51. P.A. Golovach, P. Heggernes, P. van 't Hof, F. Manne, D. Paulusma and M. Pilipczuk, How to eliminate a graph, Proceedings of the 38th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2012), Jerusalem, Israel, June 26-28, 2012, Lecture Notes in Computer Science 7551, 320-331 doi.
  52. P.A. Golovach, D. Paulusma and E.J. van Leeuwen, Induced disjoint paths in claw-free graphs, Proceedings of the 20th Annual European Symposium on Algorithms (ESA 2012), Ljubljana, Slovenia, September 10-12, 2012, Lecture Notes in Computer Science 7501, 515-526 doi.
  53. P.A. Golovach, P. van 't Hof and D. Paulusma, Obtaining planarity by contracting few edges, Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), Bratislava, Slovakia, August 27-31, 2012, Lecture Notes in Computer Science 7464, 455-466 doi.
  54. P.A. Golovach, D. Paulusma and B. Ries, Coloring graphs characterized by a forbidden subgraph, Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), Bratislava, Slovakia, August 27-31, 2012, Lecture Notes in Computer Science 7464, 443-454 doi.
  55. R. Belmonte, P. van 't Hof, M. Kaminski, D. Paulusma and D.M. Thilikos, Characterizing graphs of small carving-width, Proceedings of the 6th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2012), Banff, Canada, August 5-9, 2012, Lecture Notes in Computer Science 7402, 360-370 doi.
  56. P.A. Golovach, D. Paulusma and E.J. van Leeuwen, Induced disjoint paths in AT-free graphs, Proceedings of the 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2012), Helsinki, Finland, July 4-6, 2012, Lecture Notes in Computer Science 7357, 153-164 doi.
  57. P.A. Golovach, B. Lidicky, B. Martin and D. Paulusma, Finding vertex-surjective graph homomorphisms, Proceedings of the 7th International Computer Science Symposium in Russia (CSR 2012), Nizhny Novgorod, Russia, July 3-7, 2012, Lecture Notes in Computer Science 7353, 160-171 doi.
  58. P.A. Golovach, D. Paulusma and J. Song, 4-Coloring H-free graphs when H is small, Proceedings of the 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012), Spindleruv Mlyn, Czech Republic, January 21-27, 2012, Lecture Notes in Computer Science 7147, 289-300 doi.
  59. P.A. Golovach, M. Kaminski, D. Paulusma and D.M. Thilikos, Increasing the minimum degree of a graph by contractions, Proceedings of the 6th International Symposium on Parameterized and Exact Computation (IPEC 2011), Saarbrucken, Germany, September 7-9, 2011, Lecture Notes in Computer Science 7112 , 67-79 doi
  60. R. Belmonte, P.A. Golovach, P. Heggernes, P. van 't Hof, M. Kaminski and D. Paulusma, Finding contractions and induced minors in chordal graphs via disjoint paths, Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC 2011), Yokohama, Japan, December 5-8, 2011, Lecture Notes in Computer Science 7074, 110-119 doi.
  61. M. Bonamy, M. Johnson, I.M. Lignos, V. Patel and D. Paulusma, On the diameter of reconfiguration graphs for vertex colourings, Proceedings of the 6th European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2011), Budapest, Hungary, August 29 - September 2, 2011, Electronic Notes in Discrete Mathematics 38, 161-166 doi.
  62. P.A. Golovach, M. Kaminski, D. Paulusma and D.M. Thilikos, Lift contractions, Proceedings of the 6th European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2011), Budapest, Hungary, August 29 - September 2, 2011, Electronic Notes in Discrete Mathematics 38, 407-412 doi.
  63. J.F. Couturier, P.A. Golovach, D. Kratsch and D. Paulusma, List coloring in the absence of a linear forest, Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011), Tepla Monastery, Czech Republic, June 21-24, 2011, Lecture Notes in Computer Science 6986, 119-130 doi.
  64. P.A. Golovach, D. Paulusma and J. Song, Coloring graphs without short cycles and long induced paths, Proceedings of the 18th International Symposium on Fundamentals of Computation Theory (FCT 2011), Oslo, Norway, August 22-25, 2011, Lecture Notes in Computer Science 6914, 193-204 doi.
  65. P.A. Golovach, M. Kaminski and D. Paulusma, Contracting a chordal graph to a split graph or a tree, Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS 2011), Warsaw, Poland, August 22-26, 2011, Lecture Notes in Computer Science 6907, 339-350 doi.
  66. B. Martin and D. Paulusma, The computational complexity of Disconnected Cut and 2K2-Partition, Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP 2011), Perugia, Italy, September 12-16, 2011, Lecture Notes in Computer Science 6876, 561-575 doi.
  67. S. Ordyniak, D. Paulusma and S. Szeider, Satisfiability of acyclic and almost acyclic CNF formulas (II), Proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing (SAT 2011), Ann Arbor, USA, June 19-22, 2011, Lecture Notes in Computer Science 6695, 47-60 doi.
  68. P.A. Golovach, D. Paulusma and J. Song, Computing vertex-surjective homomorphisms to partially reflexive trees, Proceedings of the 6th International Computer Science Symposium in Russia (CSR 2011), St. Petersburg, Russia, June 14-18, 2011, Lecture Notes in Computer Science 6651, 261-274 doi.
  69. S. Ordyniak, D. Paulusma and S. Szeider, Satisfiability of acyclic and almost acyclic CNF formulas, Proceedings of the 30th International Conference of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), Chennai, India, December 15-18, 2010, Leibniz International Proceedings in Informatics 8, 84-95 doi.
  70. H.J. Broersma, P.A. Golovach, D. Paulusma and J. Song, On coloring graphs without induced forests, Proceedings of the 21th International Symposium on Algorithms and Computation (ISAAC 2010), Jeju, Korea, December 15-17, 2010, Lecture Notes in Computer Science 6507, 156-167 doi.
  71. P. Heggernes, P. van 't Hof and D. Paulusma, Computing role assignments of proper interval graphs in polynomial time, Proceedings of the 21st International Workshop on Combinatorial Algorithms (IWOCA 2010), London, UK, July 26-28, 2010, Lecture Notes in Computer Science 6460, 167-180 doi.
  72. H.J. Broersma, P.A. Golovach, D. Paulusma and J. Song, Narrowing down the gap on the complexity of coloring Pk-free graphs, Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2010), Zaros, Crete, Greece, June 28-30, 2010, Lecture Notes in Computer Science 6410, 63-74 doi.
  73. M. Kaminski, D. Paulusma and D.M. Thilikos, Contractions of planar graphs in polynomial time, Proceedings of the 18th Annual European Symposium on Algorithms (ESA 2010), Liverpool, UK, September 6-8, 2010, Lecture Notes in Computer Science 6346, 122-133 doi.
  74. P. Biro, W. Kern and D. Paulusma, On solution concepts for matching games, Proceedings of the 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), Prague, Czech Republic, June 7-11, 2010, Lecture Notes in Computer Science 6108, 117-127 doi.
  75. P.A. Golovach, B. Lidicky and D. Paulusma, L(2,1,1)-labeling is NP-complete for trees, Proceedings of the 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), Prague, Czech Republic, June 7-11, 2010, Lecture Notes in Computer Science 6108, 211-221 doi.
  76. J. Chalopin and D. Paulusma, Packing bipartite graphs with covers of complete bipartite graphs, Proceedings of the 7th International Conference on Algorithms and Complexity (CIAC 2010), Rome, Italy, May 26-28, 2010, Lecture Notes in Computer Science 6078, 276-287 doi.
  77. M. Johnson, V. Patel, D. Paulusma and T. Trunck, Obtaining online ecological colourings by generalizing first-fit, Proceedings of the 5th International Computer Science Symposium in Russia (CSR 2010), Kazan, Russia, June 16-20, 2010, Lecture Notes in Computer Science 6072, 240-251 doi.
  78. J. Fiala, M. Kaminski, B. Lidicky and D. Paulusma, The k-in-a-path problem for claw-free graphs, Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), Nancy, France, March 4-6, 2010, Leibniz International Proceedings in Informatics 5, 371-382 doi.
  79. P. van 't Hof, M. Kaminski, D. Paulusma, S. Szeider and D.M. Thilikos, On contracting graphs to fixed pattern graphs, Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2010), Spindleruv Mlyn, Czech Republic, January 23-29, 2010, Lecture Notes in Computer Science 5901, 503-514 doi.
  80. H.J. Broersma, F.V. Fomin, P. van 't Hof and D. Paulusma, Fast exact algorithms for hamiltonicity in claw-free graphs, Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009), Montpellier, France, June 24-26, 2009, Lecture Notes in Computer Science 5911, 44-53 doi.
  81. P. van 't Hof, M. Kaminski and D. Paulusma, Finding induced paths of given parity in claw-free graphs, Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009), Montpellier, France, June 24-26, 2009, Lecture Notes in Computer Science 5911, 341-352 doi.
  82. P.A. Golovach, M. Kaminski, D. Paulusma and D.M. Thilikos, Induced packing of odd cycles in a planar graph, Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009), Honolulu, Hawaii, USA, December 16-18, 2009, Lecture Notes in Computer Science 5878, 514-523 doi.
  83. T. Ito, M. Kaminski, D. Paulusma and D.M. Thilikos, Parameterizing cut sets in a graph by the number of their components, Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009), Honolulu, Hawaii, USA, December 16-18, 2009, Lecture Notes in Computer Science 5878, 605-615 doi.
  84. D. Paulusma and J.M.M. van Rooij, On partitioning a graph into two connected subgraphs, Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009), Honolulu, Hawaii, USA, December 16-18, 2009, Lecture Notes in Computer Science 5878, 1215-1224 doi.
  85. H.J. Broersma, F.V. Fomin, P.A. Golovach and D. Paulusma, Three complexity results on coloring Pk-free graphs, Proceedings of the 20th International Workshop on Combinatorial Algorithms (IWOCA 2009), Hradec nad Moravici, Czech Republic, June 28-July 2, 2009, Lecture Notes in Computer Science 5874, 95-104 doi.
  86. P. van 't Hof, D. Paulusma and J.M.M. van Rooij, Computing role assignments of chordal graphs, Proceedings of the 17th International Symposium on Fundamentals of Computation Theory (FCT 2009), Wroclaw, Poland, September 2-4, 2009, Lecture Notes in Computer Science 5699, 193-204 doi.
  87. P. van 't Hof, D. Paulusma and G.J. Woeginger, Partitioning graphs into connected parts, Proceedings of the 4th International Computer Science Symposium in Russia (CSR 2009), Novosibirsk, Russia, August 18-23, 2009, Lecture Notes in Computer Science 5675, 143-154 doi.
  88. M. Johnson, D. Paulusma and C. Wood, Path factors and parallel knock-out schemes of almost claw-free graphs, Proceedings of the 19th International Workshop on Combinatorial Algorithms (IWOCA 2008), Nagoya, Japan, September 13-15, 2008, 27-41.
  89. H.J. Broersma and D. Paulusma, Computing sharp 2-factors in claw-free graphs, Proceedings of the 33th International Symposium on Mathematical Foundations of Computer Science (MFCS 2008), Torun, Poland, August 25-29, 2008, Lecture Notes in Computer Science 5162, 193-204 doi.
  90. P. van 't Hof and D. Paulusma, A new characterization of P6-free graphs, Proceedings of the 14th Annual International Computing and Combinatorics Conference (COCOON 2008), Dalian, China, June 27-29, 2008, Lecture Notes in Computer Science 5092, 415-424 doi.
  91. J. Fiala and D. Paulusma, Comparing universal covers in polynomial time, Proceedings of the 3rd International Computer Science Symposium in Russia (CSR 2008), Moscow, Russia, June 7-12, 2008, Lecture Notes in Computer Science 5010, 158-167 doi.
  92. H. Fleischner, E. Mujuni, D. Paulusma and S. Szeider, Covering graphs with few complete bipartite subgraphs, Proceedings of the 27th International Conference of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2007), New Delhi, India, December 12-14, 2007, Lecture Notes in Computer Science 4855, 340-351 doi.
  93. H.J. Broersma, D. Paulusma and K. Yoshimoto, On components of 2-factors in claw-free graphs, Proceedings of the 4th European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2007), Seville, Spain, September 11-15, 2007, Electronic Notes in Discrete Mathematics 29, 289-293 doi.
  94. H.J. Broersma, M. Johnson and D. Paulusma, Upper bounds and algorithms for parallel knock-out numbers, Proceedings of the 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2007), Castiglioncello, Italy, June 5-8, 2007, Lecture Notes in Computer Science 4474, 328-340 doi.
  95. H.J. Broersma, L. Marchal, D. Paulusma and A.N.M. Salman, Improved upper bounds for l-backbone colorings along matchings and stars, Proceedings of the 33rd Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2007), Harrachov, Czech Republic, January 20-26, 2007, Lecture Notes in Computer Science 4362, 188-199 doi.
  96. J. Chalopin and D. Paulusma, Graph labelings derived from models in distributed computing, Proceedings of the 32st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006), Bergen, Norway, June 22-24, 2006, Lecture Notes in Computer Science 4271, 301-312 doi.
  97. H.J. Broersma, A. Capponi and D. Paulusma, On-line coloring of H-free bipartite graphs, Proceedings of the 6th International Conference on Algorithms and Complexity (CIAC 2006), Rome, Italy, May 29-31, 2006, Lecture Notes in Computer Science 3998, 284-295 doi.
  98. H.J. Broersma, M. Johnson, D. Paulusma and I.A. Stewart, The computational complexity of the parallel knock-out problem, Proceedings of the 7th Latin American Theoretical Informatics Symposium (LATIN 2006), Valdivia, Chile, March 20-24, 2006, Lecture Notes in Computer Science 3887, 250-261 doi.
  99. J. Fiala, D. Paulusma and J.A. Telle, Algorithms for comparability of matrices in partial orders imposed by graph homomorphisms, Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), Metz, France, June 23-25, 2005, Lecture Notes in Computer Science 3787, 115-226 doi.
  100. J. Fiala, D. Paulusma and J.A. Telle, Matrix and graph orders derived from locally constrained graph homomorphisms, Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), Gdansk, Poland, August 29-September 2, 2005, Lecture Notes in Computer Science 3618, 340-351 doi.
  101. L.T. Smit, G.J.M. Smit, J.L. Hurink, H.J. Broersma, D. Paulusma and P.T. Wolkotte, Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture, Proceedings of the 3rd IEEE International Conference on Field-Programmable Technology (FPT 2004), Brisbane, Australia, December 6-8, 2004, 421-424 doi.
  102. L.T. Smit, G.J.M. Smit, J.L. Hurink, H.J. Broersma, D. Paulusma and P.T. Wolkotte, Run-time assignment of tasks to multiple heterogeneous processors. Proceedings of the 5th PROGRESS Symposium on Embedded Systems, Nieuwegein, The Netherlands, October 20, 2004, 185-192.
  103. H.J. Broersma, D. Paulusma, G.J.M. Smit, F. Vlaardingerbroek and G.J. Woeginger, The computational complexity of the minimum weight processor assignment problem, Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004), Bad Honnef, Germany, June 21-23, 2004, Lecture Notes in Computer Science 3353, 189-200 doi.
  104. A. Levin, D. Paulusma and G.J. Woeginger, The complexity of graph contractions, Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2003), Elspeet, the Netherlands, June 19-21, 2003, Lecture Notes in Computer Science 2880, 322-333 doi.
  105. J. Fiala and D. Paulusma, The computational complexity of the role assignment problem, Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), Eindhoven, The Netherlands, June 30-July 4, 2003, Lecture Notes in Computer Science 2719, 817-828 doi.

Submitted Journal Papers

  1. A. Blanche, K.K. Dabrowski, M. Johnson, V.V. Lozin, D. Paulusma and V. Zamaraev, Clique-width for graph classes closed under complementation.
  2. A. Blanche, K.K. Dabrowski, M. Johnson and D. Paulusma, Hereditary graph classes: when the complexities of colouring and clique cover coincide.
  3. M. Bonamy, K.K. Dabrowski, C. Feghali, M. Johnson and D. Paulusma, Independent feedback vertex set for P5-free graphs.
  4. M. Bonamy, K.K. Dabrowski, C. Feghali, M. Johnson and D. Paulusma, Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration.
  5. P. Bonsma and D. Paulusma, Using contracted solution graphs for solving reconfiguration problems.
  6. K.K. Dabrowski, F. Dross, M. Johnson and D. Paulusma, Filling the complexity gaps for colouring planar and bounded degree graphs.
  7. K.K. Dabrowski, V.V. Lozin and D. Paulusma, Clique-width and well-quasi ordering of triangle-free graph classes.
  8. O. Diner, D. Paulusma, C. Picouleau and B. Ries, Contraction and deletion blockers for perfect graphs and H-free graphs.
  9. P.A. Golovach, M. Johnson, B. Martin, D. Paulusma and A. Stewart, Surjective H-Colouring: new hardness results.
  10. M. Johnson, D. Paulusma and E.J. van Leeuwen, What graphs are 2-dot product graphs?
  11. D. Paulusma, C. Picouleau and B. Ries, Critical vertices and edges in H-free graphs.

Other Manuscripts

  1. D. Allison and D. Paulusma, New bounds for the Snake-in-the-Box problem.
  2. K.K. Dabrowski, F. Dross, J. Jeong, M.M. Kante, O. Kwon, S. Oum and D. Paulusma, Recognizing small pivot-minors.
  3. S. Gaspers, S. Huang and D. Paulusma, Colouring square-free graphs without long induced paths.
  4. B. Larose, B. Martin and D. Paulusma, Surjective H-Colouring over reflexive digraphs.

For preprints see here.