Search the dblp DataBase

Publications of Author

1. Hajo Broersma, Agostino Capponi, Daniël Paulusma
   On-Line Coloring of H-Free Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
   CIAC, 2006, pp:284-295 [Conf]
   
2. Jirí Fiala, Daniël Paulusma
   The Computational Complexity of the Role Assignment Problem. [Citation Graph (0, 0)][DBLP]
   ICALP, 2003, pp:817-828 [Conf]
   
3. Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart
   The Computational Complexity of the Parallel Knock-Out Problem. [Citation Graph (0, 0)][DBLP]
   LATIN, 2006, pp:250-261 [Conf]
   
4. Jirí Fiala, Daniël Paulusma, Jan Arne Telle
   Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. [Citation Graph (0, 0)][DBLP]
   MFCS, 2005, pp:340-351 [Conf]
   
5. Jérémie Chalopin, Daniël Paulusma
   Graph Labelings Derived from Models in Distributed Computing. [Citation Graph (0, 0)][DBLP]
   WG, 2006, pp:301-312 [Conf]
   
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. [Citation Graph (0, 0)][DBLP]
   WG, 2004, pp:189-200 [Conf]
   
7. Jirí Fiala, Daniël Paulusma, Jan Arne Telle
   Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. [Citation Graph (0, 0)][DBLP]
   WG, 2005, pp:115-126 [Conf]
   
8. Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger
   The Complexity of Graph Contractions. [Citation Graph (0, 0)][DBLP]
   WG, 2003, pp:322-333 [Conf]
   
9. Walter Kern, Daniël Paulusma
   The new FIFA rules are hard: complexity aspects of sports competitions. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:108, n:3, pp:317-323 [Journal]
   
10. Walter Kern, Daniël Paulusma
    Matching Games: The Least Core and the Nucleolus. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2003, v:28, n:2, pp:294-308 [Journal]
    
11. Jirí Fiala, Daniël Paulusma
    A complete complexity classification of the role assignment problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:67-81 [Journal]
    
12. Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma
    Upper Bounds and Algorithms for Parallel Knock-Out Numbers. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:328-340 [Conf]
    
13. Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman
    Improved Upper Bounds for lambda -Backbone Colorings Along Matchings and Stars. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:188-199 [Conf]
    
14. 
    Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. [Citation Graph (, )][DBLP]
    
    
15. 
    A New Characterization of P6-Free Graphs. [Citation Graph (, )][DBLP]
    
    
16. 
    Comparing Universal Covers in Polynomial Time. [Citation Graph (, )][DBLP]
    
    
17. 
    Partitioning Graphs into Connected Parts. [Citation Graph (, )][DBLP]
    
    
18. 
    Obtaining Online Ecological Colourings by Generalizing First-Fit. [Citation Graph (, )][DBLP]
    
    
19. 
    Contractions of Planar Graphs in Polynomial Time. [Citation Graph (, )][DBLP]
    
    
20. 
    Computing Role Assignments of Chordal Graphs. [Citation Graph (, )][DBLP]
    
    
21. 
    Covering Graphs with Few Complete Bipartite Subgraphs. [Citation Graph (, )][DBLP]
    
    
22. 
    On Partitioning a Graph into Two Connected Subgraphs. [Citation Graph (, )][DBLP]
    
    
23. 
    Induced Packing of Odd Cycles in a Planar Graph. [Citation Graph (, )][DBLP]
    
    
24. 
    Parameterizing Cut Sets in a Graph by the Number of Their Components. [Citation Graph (, )][DBLP]
    
    
25. 
    Computing Sharp 2-Factors in Claw-Free Graphs. [Citation Graph (, )][DBLP]
    
    
26. 
    On Contracting Graphs to Fixed Pattern Graphs. [Citation Graph (, )][DBLP]
    
    
27. 
    The k-in-a-path Problem for Claw-free Graphs. [Citation Graph (, )][DBLP]
    
    
28. 
    On Solution Concepts for Matching Games. [Citation Graph (, )][DBLP]
    
    
29. 
    L(2, 1, 1)-Labeling Is NP-Complete for Trees. [Citation Graph (, )][DBLP]
    
    
30. 
    Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. [Citation Graph (, )][DBLP]
    
    
31. 
    Finding Induced Paths of Given Parity in Claw-Free Graphs. [Citation Graph (, )][DBLP]
    
    
32. 
    Three Complexity Results on Coloring P_k-Free Graphs. [Citation Graph (, )][DBLP]
    
    
33. 
    The k-in-a-path problem for claw-free graphs [Citation Graph (, )][DBLP]
    
    
34. 
    A new characterization of P₆-free graphs. [Citation Graph (, )][DBLP]
    
    
35. 
    Relative length of longest paths and longest cycles in triangle-free graphs. [Citation Graph (, )][DBLP]
    
    
36. 
    lambda-backbone colorings along pairwise disjoint stars and matchings. [Citation Graph (, )][DBLP]
    
    
37. 
    Path factors and parallel knock-out schemes of almost claw-free graphs. [Citation Graph (, )][DBLP]
    
    
38. 
    Locally constrained graph homomorphisms and equitable partitions. [Citation Graph (, )][DBLP]