Owner only: item control page
A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem
Canzar, Stefan, Elbassioni, Khaled and Mestre, Julián (2013) A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem. ACM Journal of Experimental Algorithmics 18, 2.1-2.19.Date of publication of this fulltext: 08 Jul 2026 05:24
Article
Alternative links to fulltext
Involved Institutions
Details
| Item type | Article | ||||
| Journal or Publication Title | ACM Journal of Experimental Algorithmics | ||||
| Publisher: | Association for Computing Machinery (ACM) | ||||
|---|---|---|---|---|---|
| Volume: | 18 | ||||
| Page Range: | 2.1-2.19 | ||||
| Date | 2013 | ||||
| Institutions | Informatics and Data Science > Department Computational Life Science > Algorithmische Bioinformatik (Prof. Dr. Stefan Canzar) | ||||
| Identification Number |
| ||||
| Dewey Decimal Classification | 000 Computer science, information & general works > 004 Computer science 500 Science > 570 Life sciences | ||||
| Status | Published | ||||
| Refereed | Yes, this version has been refereed | ||||
| Created at the University of Regensburg | No | ||||
| Item ID | 79633 |
Export bibliographical data
Owner only: item control page
Altmetric
Altmetric