Author Publications

Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type
Jump to: 2013 | 2012 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999
Number of items: 36.

2013

Broersma, Hajo and Fiala, Jiri and Golovach, Petr A. and Kaiser, Tomas and Paulusma, Daniël and Proskurowski, Andrzej (2013) Linear-time algorithms for scattering number and hamilton-connectivity of interval graphs. In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2013, 19-21 June 2013, Lübeck, Germany (pp. pp. 127-138).

Broersma, Hajo and Fomin, Fedor V. and Hof, Pim van 't and Paulusma, Daniël (2013) Exact algorithms for finding longest cycles in claw-free graphs. Algorithmica, 65 (1). pp. 129-145. ISSN 0178-4617

Broersma, Hajo and Fomin, Vedor V. and Golovach, Petr A. and Paulusma, Daniël (2013) Three complexity results on coloring $P_k$-free graphs. European journal of combinatorics, 34 (3). pp. 609-619. ISSN 0195-6698

2012

Biró, Péter and Kern, Walter and Paulusma, Daniël (2012) Computing solutions for matching games. International journal of game theory, 41 (1). pp. 75-90. ISSN 0020-7276

Broersma, H.J. and Golovach, P.A. and Paulusma, D. and Song, Jian (2012) Updating the complexity status of coloring graphs without a fixed induced linear forest. Theoretical Computer Science, 414 (1). pp. 9-19. ISSN 0304-3975

Broersma, Hajo and Golovach, Petr A. and Paulusma, Daniël and Song, Jian (2012) Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time. Theoretical computer science, 423 . pp. 1-10. ISSN 0304-3975

2010

Biro, Peter and Kern, Walter and Paulusma, Daniël (2010) On solution concepts for matching games. In: 7th Annual Conference on Theory and Applications of Models of Computation, TAMC 2010, 7-11 June, 2010, Prague, Czech Republic (pp. pp. 117-127).

Broersma, Hajo and Fomin, Fedor V. and Hof, Pim van 't and Paulusma, Daniël (2010) Fast exact algorithms for hamiltonicity in claw-free graphs. In: 35th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2009, 24-26 June 2009, Montpellier, France (pp. pp. 44-53).

Broersma, Hajo and Paulusma, Daniël (2010) Computing sharp 2-factors in claw-free graphs. Journal of Discrete Algorithms, 8 (3). pp. 321-329. ISSN 1570-8667

2009

Broersma, H.J. and Marchal, L. and Paulusma, D. and Salman, A.N.M. (2009) Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Discussiones Mathematicae Graph Theory, 29 (1). pp. 143-162. ISSN 1234-3099

Broersma, Hajo and Fomin, Fedor V. and Golovach, Petr A. and Paulusma, Daniël (2009) Three complexity results on coloring $P_k$-free graphs. In: 20th International Workshop on Combinatorial Algorithms, IWOCA 2009, June 28 - July 2 2009, Hradec nad Moravicí, Czech Republic (pp. pp. 95-104).

Broersma, H.J. and Fujisawa, J. and Marchal, L. and Paulusma, D. and Salman, A.N.M. and Yoshimoto, K. (2009) λ-backbone colorings along pairwise disjoint stars and matchings. Discrete Mathematics, 309 (18). pp. 5596-5609. ISSN 0012-365X

Broersma, Hajo and Johnson, Matthew and Paulusma, Daniël and Stewart, Iain A. (2009) Upper bounds and algorithms for parallel knock-out numbers. Theoretical Computer Science, 410 (14). pp. 1319-1327. ISSN 0304-3975

Broersma, Hajo and Paulusma, Daniël and Yoshimoto, Kiyoshi (2009) Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs. Graphs and Combinatorics, 25 (4). pp. 427-460. ISSN 0911-0119

Kern, Walter and Paulusma, Daniël (2009) On the core and f-nucleolus of flow games. Mathematics of Operations Research, 34 (4). pp. 981-991. ISSN 0364-765X

2008

Broersma, H.J. and Paulusma, D. (2008) Computing sharp 2-factors in claw-free graphs. In: 33rd International Symposium on Mathematical Foundations of Computer Science, August 27-31, 2008, Torun, Poland (pp. pp. 193-204).

Broersma, H.J. and Capponi, A. and Paulusma, D. (2008) A new algorithm for on-line coloring bipartite graphs. SIAM Journal on Discrete Mathematics, 22 (1). pp. 72-91. ISSN 0895-4801

Broersma, H.J. and Johnson, M. and Paulusma, D. and Stewart, I.A. (2008) The computational complexity of the parallel knock-out problem. Theoretical Computer Science, 393 (1-3). pp. 182-195. ISSN 0304-3975

2007

Broersma, H.J. and Marchal, L. and Paulusma, D. and Salman, A.N.M. (2007) Improved upper bounds for $\lambda$-backbone colorings along matchings and stars. In: Proceedings of SOFSEM 2007: Theory and Practice of Computer Science, 20-26 Jan 2007, Harrachov, Czech Republic (pp. pp. 188-199).

Broersma, H.J. and Paulusma, D. and Yoshimoto, K. (2007) On components of 2-factors in claw-free graphs. In: EuroComb 2007: European Conference on Combinatorics, Graph Theory and Applications, 11-15 September 2007, Seville, Spain (pp. pp. 289-293).

Broersma, Hajo and Johnson, Matthew and Paulusma, Daniël (2007) Upper bounds and algorithms for parallel knock-out numbers. In: 14th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2007, 5-8 June 2007, Castiglioncello, Italy (pp. pp. 328-340).

2006

Broersma, H.J. and Capponi, A. and Paulusma, D. (2006) On-line coloring of H-free bipartite graphs. In: Proceedings of the 6th Italian Conference on Algorithms and Complexity (CIAC 2006), 29-31 May 2006, Rome, Italy (pp. pp. 284-295).

Broersma, H.J. and Johnson, M. and Paulusma, D. and Stewart, I.A. (2006) The Computational Complexity of the Parallel Knock-Out Problem. In: Proceedings of the 7th Latin American Symposium (LATIN 2006), 20-24 March 2006, Valdivia, Chile (pp. pp. 250-261).

2005

Broersma, H.J. and Paulusma, D. and Smit, G.J.M. and Vlaardingerbroek, F. and Woeginger, G.J. (2005) The computational complexity of the minimum weight processor assignment problem. In: 30th International Workshop on Graph-Theoretic Concepts in Computer Science, June 21-23, 2004, Bad Honnef, Germany (pp. pp. 189-200).

2004

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

Smit, Lodewijk T. and Smit, Gerard J.M. and Hurink, Johann L. and Broersma, Hajo and Paulusma, Daniël and Wolkotte, Pascal T. (2004) Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture. In: IEEE International Conference on Field-Programmable Technology, FPT 2004, December 6-8, 2004, Brisbane, Australia (pp. pp. 421-424).

Smit, Lodewijk T. and Smit, Gerard J.M. and Hurink, Johann L. and Broersma, Hajo and Paulusma, Daniël and Wolkotte, Pascal T. (2004) Run-time assignment of tasks to multiple heterogeneous processors. In: 5TH PROGRESS Symposium on Embedded Systems, Oct. 30, 2004, Nieuwegein, the Netherlands (pp. pp. 185-192).

2003

Fiala, J. and Paulusma, D. (2003) The computational complexity of the role assignment problem. [Report]

2002

Kern, W. and Paulusma, D. (2002) The generalized sports competition problem. [Report]

2001

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

Paulusma, Daniël (2001) Complexity aspects of cooperative games. thesis.

2000

Faigle, Ulrich and Kern, Walter and Paulusma, Daniël (2000) Note on the computational complexity of least core concepts for min-cost spanning tree games. Mathematical methods of operations research, 52 (18). pp. 23-38. ISSN 1432-2994

Kern, W. and Paulusma, D. (2000) Matching games: the least core and the nucleolus. [Report]

1999

Driessen, T.S.H. and Paulusma, D. (1999) Two extensions of the Shapley value for cooperative games. [Report]

Faigle, U. and Kern, W. and Paulusma, D. (1999) Note on the computational complexity of least core concepts for min-cost spanning tree games. [Report]

Kern, W. and Paulusma, D. (1999) The new FIFA rules are hard: Complexity aspects of sports competitions. [Report]

This list was generated on Tue Sep 30 05:37:56 2014 CEST.