Professor Daniel Paulusma's Outputs (3)

The complexity of graph contractions (2003)
Presentation / Conference Contribution
Levin, A., Paulusma, D., & Woeginger, G. (2003, June). The complexity of graph contractions. Presented at WG 2003: Graph-Theoretic Concepts in Computer Science, Elspeet, The Netherlands

The Computational Complexity of the Role Assignment Problem (2003)
Presentation / Conference Contribution
Fiala, J., & Paulusma, D. (2003, June). The Computational Complexity of the Role Assignment Problem. Presented at ICALP 2003: Automata, Languages and Programming, Eindhoven, The Netherlands

Matching games : the least core and the nucleolus (2003)
Journal Article
Kern, W., & Paulusma, D. (2003). Matching games : the least core and the nucleolus. Mathematics of Operations Research, 28(2), 294-308. https://doi.org/10.1287/moor.28.2.294.14477

A matching game is a cooperative game defined by a graph G = (V, E). The player set is V and the value of a coalition S # V is defined as the size of a maximum matching in the subgraph induced by S. We show that the nucleolus of such games can be com... Read More about Matching games : the least core and the nucleolus.