J. Fiala
The Computational Complexity of the Role Assignment Problem
Fiala, J.; Paulusma, D.
Citation
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
| Presentation Conference Type | Conference Paper (published) |
|---|---|
| Conference Name | ICALP 2003: Automata, Languages and Programming |
| Start Date | Jun 30, 2003 |
| End Date | Jul 4, 2003 |
| Publication Date | 2003 |
| Deposit Date | Dec 20, 2014 |
| Print ISSN | 0302-9743 |
| Publisher | Springer |
| Peer Reviewed | Peer Reviewed |
| Volume | 2719 |
| Pages | 817-828 |
| Series ISSN | 0302-9743 |
| Book Title | Automata, Languages and Programming |
| ISBN | 978-3-540-40493-4 |
| DOI | https://doi.org/10.1007/3-540-45061-0_64 |
| Public URL | https://durham-repository.worktribe.com/output/1154462 |
You might also like
Computing balanced solutions for large international kidney exchange schemes
(2024)
Journal Article
An Algorithmic Framework for Locally Constrained Homomorphisms
(2024)
Journal Article
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
The Complexity of Matching Games: A Survey
(2023)
Journal Article
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
(2023)
Journal Article