Daniël Paulusma

	2009
31		Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger: Partitioning Graphs into Connected Parts. CSR 2009: 143-154
30		Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij: Computing Role Assignments of Chordal Graphs. FCT 2009: 193-204
29		Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma: Three Complexity Results on Coloring Pk-Free Graphs. IWOCA 2009: 95-104
28		Hajo Broersma, Matthew Johnson, Daniël Paulusma: Upper bounds and algorithms for parallel knock-out numbers. Theor. Comput. Sci. 410(14): 1319-1327 (2009)
27		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)
	2008
26		Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers WG 2008
25		Pim van 't Hof, Daniël Paulusma: A New Characterization of P6-Free Graphs. COCOON 2008: 415-424
24		Jirí Fiala, Daniël Paulusma: Comparing Universal Covers in Polynomial Time. CSR 2008: 158-167
23		Hajo Broersma, Daniël Paulusma: Computing Sharp 2-Factors in Claw-Free Graphs. MFCS 2008: 193-204
22		Daniël Paulusma, Kiyoshi Yoshimoto: Relative length of longest paths and longest cycles in triangle-free graphs. Discrete Mathematics 308(7): 1222-1229 (2008)
21		Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Locally constrained graph homomorphisms and equitable partitions. Eur. J. Comb. 29(4): 850-880 (2008)
20		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)
19		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)
18		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)
17		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)
	2007
16		Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider: Covering Graphs with Few Complete Bipartite Subgraphs. FSTTCS 2007: 340-351
15		Hajo Broersma, Matthew Johnson, Daniël Paulusma: Upper Bounds and Algorithms for Parallel Knock-Out Numbers. SIROCCO 2007: 328-340
14		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
13		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)
	2006
12		Hajo Broersma, Agostino Capponi, Daniël Paulusma: On-Line Coloring of H-Free Bipartite Graphs. CIAC 2006: 284-295
11		Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart: The Computational Complexity of the Parallel Knock-Out Problem. LATIN 2006: 250-261
10		Jérémie Chalopin, Daniël Paulusma: Graph Labelings Derived from Models in Distributed Computing. WG 2006: 301-312
	2005
9		Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. MFCS 2005: 340-351
8		Jirí Fiala, Daniël Paulusma, Jan Arne Telle: Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. WG 2005: 115-126
7		Jirí Fiala, Daniël Paulusma: A complete complexity classification of the role assignment problem. Theor. Comput. Sci. 349(1): 67-81 (2005)
	2004
6		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
5		Walter Kern, Daniël Paulusma: The computational complexity of the elimination problem in generalized sports competitions. Discrete Optimization 1(2): 205-214 (2004)
	2003
4		Jirí Fiala, Daniël Paulusma: The Computational Complexity of the Role Assignment Problem. ICALP 2003: 817-828
3		Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger: The Complexity of Graph Contractions. WG 2003: 322-333
2		Walter Kern, Daniël Paulusma: Matching Games: The Least Core and the Nucleolus. Math. Oper. Res. 28(2): 294-308 (2003)
	2001
1		Walter Kern, Daniël Paulusma: The new FIFA rules are hard: complexity aspects of sports competitions. Discrete Applied Mathematics 108(3): 317-323 (2001)

Coauthor Index

1	Hajo Broersma (H. J. Broersma)	[6] [11] [12] [13] [14] [15] [17] [18] [23] [26] [28] [29]
2	Agostino Capponi	[12] [18]
3	Jérémie Chalopin	[10]
4	Thomas Erlebach	[26]
5	Jirí Fiala	[4] [7] [8] [9] [21] [24]
6	Herbert Fleischner	[16] [27]
7	Fedor V. Fomin	[29]
8	Tom Friedetzky	[26]
9	Petr A. Golovach	[29]
10	Pim van 't Hof	[25] [30] [31]
11	Matt Johnson (Matthew Johnson)	[17] [28]
12	Matthew Johnson	[11] [15]
13	Walter Kern	[1] [2] [5]
14	Asaf Levin	[3] [19] [20]
15	Bert Marchal	[14]
16	Egbert Mujuni	[16] [27]
17	Johan M. M. van Rooij	[30]
18	A. N. M. Salman	[14]
19	Gerard J. M. Smit	[6]
20	Iain A. Stewart	[11] [17]
21	Stefan Szeider	[16] [27]
22	Jan Arne Telle	[8] [9] [21]
23	Frank Vlaardingerbroek	[6]
24	Gerhard J. Woeginger	[3] [6] [19] [20] [31]
25	Kiyoshi Yoshimoto (Kiyoshi Yoshiomoto)	[13] [22]

Colors in the list of coauthors