Preprints

1. D. Allison and D. Paulusma, New bounds for the Snake-in-the-Box problem. [arXiv]
2. 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. [pdf-file]
3. R. Belmonte, P.A. Golovach, P. van 't Hof and D. Paulusma, Parameterized complexity of three edge contraction problems with degree constraints. [pdf-file]
4. R. Belmonte, P. van 't Hof, M. Kaminski and D. Paulusma, The price of connectivity for feedback vertex set. [arXiv]
5. R. Belmonte, P. van 't Hof, M. Kaminski, D. Paulusma and D.M. Thilikos, Characterizing graphs of small carving-width. [pdf-file]
6. M. Benedek, P. Biro, G. Csaji, M. Johnson, D. Paulusma and Xin Ye, Computing balanced solutions for large international kidney exchange schemes when cycle length is unbounded. [arXiv]
7. M. Benedek, P. Biro, D. Paulusma and X. Ye, Computing balanced solutions for large international kidney exchange schemes. [arXiv]
8. M. Benedek, P. Biro, M. Johnson, D. Paulusma and X. Ye, The complexity of matching games: A survey. [arXiv]
9. M. Benedek, P. Biro, W. Kern, D. Palvolgyi and D. Paulusma, Partitioned matching games for international kidney exchange. [arXiv]
10. G. Berthe, B. Martin, D. Paulusma and S. Smith, The complexity of L(p,q)-Edge-Labelling. [arXiv]
11. P. Biro, M. Bomhoff, P.A. Golovach, W Kern and D. Paulusma, Solutions for the stable roommates problem with payments. [pdf-file]
12. P. Biro, W. Kern and D. Paulusma, Computing solutions for matching games. [pdf-file]
13. P. Biro, W. Kern, D. Paulusma and P. Wojuteczky, The stable fixtures problem with payments. [arXiv]
14. A. Blanche, K.K. Dabrowski, M. Johnson, V.V. Lozin, D. Paulusma and V. Zamaraev, Clique-width for graph classes closed under complementation. [arXiv]
15. A. Blanche, K.K. Dabrowski, M. Johnson and D. Paulusma, Hereditary graph classes: When the complexities of Colouring and Clique Cover coincide. [arXiv]
16. H. Bodlaender, N. Brettell, M. Johnson, G. Paesani, D. Paulusma and E.J. van Leeuwen, Steiner trees for hereditary graph classes: A treewidth perspective. [arXiv]
17. H.L. Bodlaender, M. Johnson, B. Martin, J.J. Oostveen, S. Pandey, D. Paulusma, S. Smith and E. J. van Leeuwen, Complexity framework for forbidden subgraphs IV: The Steiner Forest problem. [arXiv]
18. J. Bok, N. Jedlickova, B. Martin, P. Ochem, D. Paulusma and S. Smith, Acyclic, star and injective colouring: A complexity picture for H-free graphs. [arXiv]
19. M. Bonamy, K.K. Dabrowski, C. Feghali, M. Johnson and D. Paulusma, Independent feedback vertex set for P5-free graphs. [arXiv]
20. M. Bonamy, K.K. Dabrowski, C. Feghali, M. Johnson and D. Paulusma, Independent feedback vertex sets for graphs of bounded diameter. [arXiv]
21. M. Bonamy, K.K. Dabrowski, C. Feghali, M. Johnson and D. Paulusma, Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. [arXiv]
22. M. Bonamy, N. Bousquet, K.K. Dabrowski, M. Johnson, D. Paulusma and T. Pierron, Graph isomorphism for (H1,H2)-free graphs: An almost complete dichotomy. [arXiv]
23. M. Bonamy, M. Johnson, I.M. Lignos, V. Patel and D. Paulusma, Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. [pdf-file]
24. F. Bonomo-Braberman, N. Brettell, A. Munaro and D. Paulusma, Solving problems on generalized convex graphs via mim-width. [arXiv]
25. P. Bonsma and D. Paulusma, Using contracted solution graphs for solving reconfiguration problems. [arXiv]
26. A. Brandstadt, K.K. Dabrowski, S. Huang and D. Paulusma, Bounding the clique-width of H-free chordal graphs. [arXiv]
27. A. Brandstadt, K.K. Dabrowski, S. Huang and D. Paulusma, Bounding the clique-width of H-free split graphs. [arXiv]
28. C. Brause, P.A. Golovach, B. Martin, P. Ochem, D. Paulusma and S. Smith, Acyclic, star and injective colouring: Bounding the diameter. [arXiv]
29. C. Brause, P.A. Golovach, B. Martin, D. Paulusma and S. Smith, Partitioning H-free graphs of bounded diameter. [arXiv]
30. N. Brettell, J. Horsfield, A. Munaro, G. Paesani and D. Paulusma, Bounding the mim-width of hereditary graph classes. [arXiv]
31. N. Brettell, J. Horsfield, A. Munaro and D. Paulusma, List k-Colouring Pt-free graphs: A mim-width perspective. [arXiv]
32. N. Brettell, M. Johnson, G. Paesani and D. Paulusma, Computing subset transversals in H-free graphs. [arXiv]
33. N. Brettell, M. Johnson and D. Paulusma, Computing weighted subset transversals in H-free graphs. [arXiv]
34. N. Brettell, A. Munaro, D. Paulusma and S. Yang, Comparing width parameters on graph classes. [arXiv]
35. N. Brettell, J.J. Oostveen, S. Pandey, D. Paulusma and E.J. van Leeuwen, Computing subset vertex covers in H-free graphs. [arXiv]
36. H.J. Broersma, A. Capponi and D. Paulusma, A new algorithm for on-line coloring bipartite graphs. [pdf-file]
37. 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. [pdf-file]
38. H.J. Broersma, F.V. Fomin, P.A. Golovach and D. Paulusma, Three complexity results on coloring Pk-free graphs. [pdf-file]
39. H.J. Broersma, F.V. Fomin, P. van 't Hof and D. Paulusma, Exact algorithms for finding longest cycles in claw-free graphs. [pdf-file]
40. 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. [pdf-file]
41. H.J. Broersma, P.A. Golovach, D. Paulusma and J. Song, Updating the complexity status of coloring graphs without a fixed induced linear forest. [pdf-file]
42. H.J. Broersma, P.A. Golovach, D. Paulusma and J. Song, Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time. [pdf-file]
43. H.J. Broersma, M. Johnson and D. Paulusma, Upper bounds and algorithms for parallel knock-out numbers. [pdf-file]
44. H.J. Broersma, M. Johnson, D. Paulusma and I.A. Stewart, The computational complexity of the parallel knock-out problem. [pdf-file]
45. 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. [pdf-file]
46. 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. [pdf-file]
47. H.J. Broersma and D. Paulusma, Computing sharp 2-factors in claw-free graphs. [pdf-file]
48. H.J. Broersma, D. Paulusma and K. Yoshimoto, Sharp upper bounds for the minimum number of components of 2-factors in claw-free graphs. [pdf-file]
49. L. Bulteau, K.K. Dabrowski, G. Fertin, M. Johnson, D. Paulusma and S. Vialette, Finding a small number of colourful components. [arXiv]
50. L. Bulteau, K.K. Dabrowski, N. Kohler, S. Ordyniak and D. Paulusma, An algorithmic framework for locally constrained homomorphisms. [arXiv]
51. J. Chalopin and D. Paulusma, Graph labelings derived from models in distributed computing: A complete complexity classification. [pdf-file]
52. J. Chalopin and D. Paulusma, Packing bipartite graphs with covers of complete bipartite graphs. [pdf-file]
53. S. Chaplick, J. Fiala, P. van 't Hof, D. Paulusma and M. Tesar, Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. [arXiv]
54. 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. [arXiv]
55. M. Cochefert, J.F. Couturier, P.A. Golovach, D. Kratsch and D. Paulusma, Parameterized algorithms for finding square roots. [pdf-file]
56. M. Cochefert, J.F. Couturier, P.A. Golovach, D. Kratsch, D. Paulusma and A. Stewart, Squares of low maximum degree. [arXiv]
57. J.F. Couturier, P.A. Golovach, D. Kratsch and D. Paulusma, List coloring in the absence of a linear forest. [pdf-file]
58. 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. [pdf-file]
59. K.K. Dabrowski, F. Dross, J. Jeong, M.M. Kante, O. Kwon, S. Oum and D. Paulusma, Computing pivot-minors. [arXiv].
60. K.K. Dabrowski, F. Dross, J. Jeong, M.M. Kante, O. Kwon, S. Oum and D. Paulusma, Tree pivot-minors and linear rank-width. [arXiv]
61. K.K. Dabrowski, F. Dross, M. Johnson and D. Paulusma, Filling the complexity gaps for colouring planar and bounded degree graphs. [arXiv]
62. K.K. Dabrowski, F. Dross and D. Paulusma, Colouring diamond-free graphs. [arXiv]
63. K.K. Dabrowski, C. Feghali, M. Johnson, G. Paesani, D. Paulusma and P. Rzazewski, On cycle transversals and their connected variants in the absence of a small linear forest. [arXiv]
64. K.K. Dabrowski, P.A. Golovach, P. van 't Hof and D. Paulusma, Editing to Eulerian graphs. [arXiv]
65. K.K. Dabrowski, P.A. Golovach, P. van 't Hof, D. Paulusma and D.M. Thilikos, Editing to a planar graph of given degrees. [arXiv]
66. K.K. Dabrowski, P.A. Golovach and D. Paulusma, Colouring of graphs with Ramsey-type forbidden subgraphs. [pdf-file]
67. K.K. Dabrowski, S. Huang and D. Paulusma, Bounding clique-width via perfect graphs. [arXiv]
68. K.K. Dabrowski, M. Johnson and D. Paulusma, Clique-width for hereditary graph classes. [arXiv]
69. K.K. Dabrowski, M. Johnson, G. Paesani, D. Paulusma and V. Zamaraev, On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. [arXiv]
70. K.K. Dabrowski, V. Lozin and D. Paulusma, Clique-width and well-quasi ordering of triangle-free graph classes. [arXiv]
71. K.K. Dabrowski, V. Lozin and D. Paulusma, Well-quasi-ordering versus clique-width: New results on bigenic classes. [arXiv]
72. K.K. Dabrowski, T. Masarik, J. Novotna, D. Paulusma and P. Rzazewski, Clique-width: Harnessing the power of atoms. [arXiv]
73. K.K. Dabrowski and D. Paulusma, Clique-width of graph classes defined by two forbidden induced subgraphs. [arXiv]
74. K.K. Dabrowski and D. Paulusma, Classifying the clique-width of H-free bipartite graphs. [pdf-file]
75. K.K. Dabrowski and D. Paulusma, Contracting bipartite graphs to paths and cycles. [arXiv]
76. K.K. Dabrowski and D. Paulusma, On colouring (2P2,H)-free and (P5,H)-free graphs. [arXiv]
77. O. Diner, D. Paulusma, C. Picouleau and B. Ries, Contraction and deletion blockers for perfect graphs and H-free graphs. [arXiv]
78. T.S.H. Driessen and D. Paulusma, Two extensions of the Shapley value for cooperative games. [pdf-file]
79. T. Eagling-Vose, B. Martin, D. Paulusma, M. Siggers and S. Smith, Graph homomorphism, monotone classes and bounded pathwidth. [arXiv]
80. U. Faigle, W. Kern and D. Paulusma, Note on the computational complexity of least core concepts for min-cost spanning tree games. [pdf-file]
81. C. Feghali, M. Johnson and D. Paulusma, A reconfigurations analogue of Brooks' Theorem and its consequences. [pdf-file]
82. C. Feghali, M. Johnson and D. Paulusma, Kempe equivalence of colourings of cubic graphs. [arXiv]
83. C. Feghali, F. Lucke, D. Paulusma and B. Ries, Matching cuts in graphs of high girth and H-free graphs. [arXiv]
84. J. Fiala, P.A. Golovach, J. Kratochvil, B. Lidicky ad D. Paulusma, Distance three labelings of trees. [pdf-file]
85. J. Fiala, M. Kaminski, B. Lidicky and D. Paulusma, The k-in-a-path problem for claw-free graphs. [pdf-file]
86. J. Fiala, M. Kaminski and D. Paulusma, A note on contracting claw-free graphs. [pdf-file]
87. J. Fiala, M. Kaminski and D. Paulusma, Detecting induced star-like minors in polynomial time. [pdf-file]
88. J. Fiala and D. Paulusma, A complete complexity classification of the role assignment problem. [pdf-file]
89. J. Fiala and D. Paulusma, Comparing universal covers in polynomial time. [pdf-file]
90. J. Fiala, D. Paulusma and J.A. Telle, Locally constrained graph homomorphisms and equitable partitions. [pdf-file]
91. H. Fleischner, E. Mujuni, D. Paulusma and S. Szeider, Covering graphs with few complete bipartite subgraphs. [pdf-file]
92. E. Galby, P.T. Lima, D. Paulusma and B. Ries, Classifying k-Edge Colouring for H-free graphs. [arXiv]
93. E. Galby, P.T. Lima, D. Paulusma and B. Ries, On the parametrized complexity of k-Edge Colouring. [arXiv]
94. S. Gaspers, S. Huang and D. Paulusma, Colouring square-free graphs without long induced paths. [arXiv]
95. P.A. Golovach, P. Heggernes, P. van 't Hof, F. Manne, D. Paulusma and M. Pilipczuk, Modifying a graph using vertex elimination. [pdf-file]
96. P.A. Golovach, P. Heggernes, P. van 't Hof and D. Paulusma, Choosability on H-free graphs. [pdf-file]
97. P.A. Golovach, P. Heggernes, D. Kratsch, P.T. Lima and D. Paulusma, Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. [arXiv]
98. P.A. Golovach, P. van 't Hof and D. Paulusma, Obtaining planarity by contracting few edges. [pdf-file]
99. P.A. Golovach, M. Johnson, B. Martin, D. Paulusma and A. Stewart, Surjective H-Colouring: New hardness results. [arXiv]
100. P.A. Golovach, M. Johnson, D. Paulusma and J. Song, A survey on the computational complexity of colouring graphs with forbidden subgraphs. [arXiv]
101. P.A. Golovach, M. Kaminski, D. Paulusma and D.M. Thilikos, Containment relations in split graphs. [pdf-file]
102. P.A. Golovach, M. Kaminski, D. Paulusma and D.M. Thilikos, Increasing the minimum degree of a graph by contractions. [pdf-file]
103. P.A. Golovach, M. Kaminski, D. Paulusma and D.M. Thilikos, Induced packing of odd cycles in planar graphs. [pdf-file]
104. P.A. Golovach, M. Kaminski, D. Paulusma and D.M. Thilikos, Lift-contractions. [pdf-file]
105. P.A. Golovach, D. Kratsch and D. Paulusma, Detecting induced minors in AT-free graphs. [pdf-file]
106. P.A. Golovach, D. Kratsch, D. Paulusma and A. Stewart, A linear kernel for finding square roots of almost planar graphs. [arXiv]
107. P.A. Golovach, D. Kratsch, D. Paulusma and A. Stewart, Finding cactus roots in polynomial time. [pdf-file]
108. P.A. Golovach, B. Lidicky, B. Martin and D. Paulusma, Finding vertex-surjective graph homomorphisms. [arXiv]
109. P.A. Golovach and D. Paulusma, List coloring in the absence of two subgraphs. [pdf-file]
110. P.A. Golovach, D. Paulusma and B. Ries, Coloring graphs characterized by a forbidden subgraph. [pdf-file]
111. P.A. Golovach, D. Paulusma and J. Song, Closing complexity gaps for coloring problems on H-free graphs. [pdf-file]
112. P.A. Golovach, D. Paulusma and J. Song, Coloring graphs without short cycles and long induced paths. [pdf-file]
113. P.A. Golovach, D. Paulusma and J. Song, Computing vertex-surjective homomorphisms to partially reflexive trees. [pdf-file]
114. P.A. Golovach, D. Paulusma and J. Song, 4-Coloring H-free graphs when H is small. [pdf-file]
115. P.A. Golovach, D. Paulusma and I.A. Stewart, Graph editing to a fixed target. [pdf-file]
116. P.A. Golovach, D. Paulusma and E.J. van Leeuwen, Induced disjoint paths in AT-free graphs. [arXiv]
117. P.A. Golovach, D. Paulusma and E.J. van Leeuwen, Induced disjoint paths in circular-arc graphs in linear time. [pdf-file]
118. P.A. Golovach, D. Paulusma and E.J. van Leeuwen, Induced disjoint paths in claw-free graphs. [arXiv]
119. T.R. Hartinger, M. Johnson, M. Milanic and D. Paulusma, The price of connectivity for cycle transversals. [pdf-file]
120. P. Heggernes, P. van 't Hof and D. Paulusma, Computing role assignments of proper interval graphs in polynomial time. [pdf-file]
121. F. Hof, W. Kern, S. Kurz, K. Pashkovich and D. Paulusma, Simple games versus weighted voting games: bounding the critical threshold value. [arXiv]
122. P. van 't Hof, M. Kaminski and D. Paulusma, Finding induced paths of given parity in claw-free graphs. [pdf-file]
123. P. van 't Hof, M. Kaminski, D. Paulusma, S. Szeider and D.M. Thilikos, On graph contractions and induced minors. [pdf-file]
124. P. van 't Hof and D. Paulusma, A new characterization of P6-free graphs. [pdf-file]
125. P. van 't Hof, D. Paulusma and J.M.M. van Rooij, Computing role assignments of chordal graphs. [pdf-file]
126. P. van 't Hof, D. Paulusma and G.J. Woeginger, Partitioning graphs into connected parts. [pdf-file]
127. S. Huang, M. Johnson and D. Paulusma, Narrowing the complexity gap for colouring (Cs,Pt)-free graphs. [arXiv]
128. T. Ito, M. Kaminski, D. Paulusma, and D.M. Thilikos, On disconnected cuts and separators. [pdf-file]
129. T. Ito, M. Kaminski, D. Paulusma, and D.M. Thilikos, Parameterizing cut sets in a graph by the number of their components. [pdf-file]
130. M. Johnson, V. Patel, D. Paulusma and T. Trunck, Obtaining online ecological colourings by generalizing first-fit. [pdf-file]
131. M. Johnson, D. Kratsch, S. Kratsch, V. Patel and D. Paulusma, Finding shortest paths between graph colourings. [arXiv]
132. M. Johnson, B. Martin, J.J. Oostveen, S. Pandey, D. Paulusma, S. Smith and E. J. van Leeuwen, Complexity framework for forbidden subgraphs I: The framework. [arXiv]
133. M. Johnson, B. Martin, S. Pandey, D. Paulusma, S. Smith and E. J. van Leeuwen, Complexity framework for forbidden subgraphs III: When problems are tractable on subcubic graphs. [arXiv]
134. M. Johnson, B. Martin, S. Pandey, D. Paulusma, S. Smith and E. J. van Leeuwen, Edge Multiway Cut and Node Multiway Cut are hard for planar subcubic graphs. [arXiv]
135. M. Johnson, G. Paesani and D. Paulusma, Connected vertex cover for (sP1+P5)-free graphs. [arXiv]
136. M. Johnson, D. Paulusma and A. Stewart, Knocking out Pk-free graphs. [pdf-file]
137. M. Johnson, D. Paulusma and E.J. van Leeuwen, Algorithms to measure diversity and clustering in social networks through dot product graphs. [pdf-file]
138. M. Johnson, D. Paulusma and E.J. van Leeuwen, What graphs are 2-dot product graphs? [arXiv]
139. M. Johnson, D. Paulusma and C. Wood, Path factors and parallel knock-out schemes of almost claw-free graphs. [pdf-file]
140. M. Kaminski, D. Paulusma, A. Stewart and D.M. Thilikos, Minimal disconnected cuts in planar graphs. [pdf-file]
141. M. Kaminski, D. Paulusma and D.M. Thilikos, Contractions of graphs on surfaces in polynomial time. [pdf-file]
142. M. Kaminski, D. Paulusma and D.M. Thilikos, Contracting planar graphs to contractions of triangulations. [pdf-file]
143. W. Kern, B. Martin, D. Paulusma, S. Smith and E.J. van Leeuwen, Disjoint paths and connected subgraphs for H-free graphs. [arXiv]
144. W. Kern and D. Paulusma, Contracting to a longest path in H-free graphs. [arXiv]
145. W. Kern and D. Paulusma, On the core and f-nucleolus of flow games. [pdf-file]
146. W. Kern and D. Paulusma, Matching games: The least core and the nucleolus. [pdf-file]
147. W. Kern and D. Paulusma, The computational complexity of the elimination problem in generalized sports competitions. [pdf-file]
148. W. Kern and D. Paulusma, The new FIFA rules are hard: Complexity aspects of sport competitions. [pdf-file]
149. T. Klimosova, J. Malik, T. Masarik, J. Novotna, D. Paulusma and V. Slivova, Colouring (Pr+Ps)-free graphs. [arXiv]
150. B. Larose, P. Markovic, B. Martin, D. Paulusma, S. Smith, and S. Zivny, QCSP on reflexive tournaments. [arXiv]
151. B. Larose, B. Martin and D. Paulusma, Surjective H-Colouring over reflexive digraphs. [arXiv]
152. V.B. Le, F. Lucke, D. Paulusma and B. Ries, Maximizing matching cuts. [arXiv]
153. A. Levin, D. Paulusma and G.J. Woeginger, The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases. [pdf-file]
154. A. Levin, D. Paulusma and G.J. Woeginger, The computational complexity of graph contractions II: Two tough polynomially solvable cases. [pdf-file]
155. V.V. Lozin, B. Martin, S. Pandey, D. Paulusma, M. Siggers, S. Smith and E. J. van Leeuwen, Complexity framework for forbidden subgraphs II: Edge subdivision and the "H"-graphs. [arXiv]
156. F. Lucke, A. Momeni, D. Paulusma, S. Smith, Finding d-cuts in graphs of bounded diameter, graphs of bounded radius and H-free graphs. [arXiv]
157. F. Lucke, D. Paulusma and B. Ries, Dichotomies for Maximum Matching Cut: H-Freeness, bounded diameter, bounded radius. [arXiv]
158. F. Lucke, D. Paulusma and B. Ries, Finding matching cuts in H-free graphs. [arXiv]
159. F. Lucke, D. Paulusma and B. Ries, On the complexity of Matching Cut for graphs of bounded radius and H-free graphs. [arXiv]
160. B. Martin and D. Paulusma, The computational complexity of Disconnected Cut and 2K2-Partition. [pdf-file]
161. B. Martin, D. Paulusma and S. Smith, Colouring graphs of bounded diameter in the absence of small cycles. [arXiv]
162. B. Martin, D. Paulusma and S. Smith, Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter. [arXiv]
163. B. Martin, D. Paulusma and S. Smith, Hard problems that quickly become very easy. [arXiv]
164. B. Martin, D. Paulusma, S. Smith and E.J. van Leeuwen, Few induced disjoint paths for H-free graphs. [arXiv]
165. B. Martin, D. Paulusma, S. Smith and E.J. van Leeuwen, Induced disjoint paths and connected subgraphs for H-free graphs. [arXiv]
166. B. Martin, D. Paulusma and E.J. van Leeuwen, Disconnected cuts in claw-free graphs. [arXiv]
167. J. Oostveen, D. Paulusma and E.J. van Leeuwen, The complexity of Diameter on H-free graphs. [pdf-file]
168. S. Ordyniak, D. Paulusma and S. Szeider, Satisfiability of acyclic and almost acyclic CNF formulas. [pdf-file]
169. G. Paesani, D. Paulusma and P. Rzazewski, Classifying Subset Feedback Vertex Set for H-free graphs. [arXiv]
170. G. Paesani, D. Paulusma and P. Rzazewski, Feedback Vertex Set and Even Cycle Transversal for H-free graphs: Finding large block graphs. [arXiv]
171. D. Paulusma, Complexity Aspects of Cooperative Games. [pdf-file]
172. D. Paulusma, On finding paths passing through specified vertices. [pdf-file]
173. D. Paulusma, Open problems on graph coloring for special graph classes. [pdf-file]
174. D. Paulusma, C. Picouleau and B. Ries, Critical vertices and edges in H-free graphs. [arXiv]
175. D. Paulusma and J.M.M. van Rooij, On partitioning a graph into two connected subgraphs. [pdf-file]
176. D. Paulusma, F. Slivovsky and S. Szeider, Model counting for CNF formulas of bounded modular treewidth. [pdf-file]
177. D. Paulusma and S. Szeider, On the parameterized complexity of (k,s)-SAT. [pdf-file]
178. D. Paulusma and K. Yoshimoto, Cycles through specified vertices in triangle-free graphs. [pdf-file]
179. D. Paulusma and K. Yoshimoto, Relative length of longest paths and longest cycles in triangle-free graphs. [pdf-file]
180. 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. [pdf-file]
181. 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. [pdf-file]