List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Weighted online problems with advice Theory of Computing Systems | 2018-08-03 | Paper |
| Adding isolated vertices makes some greedy online algorithms optimal Discrete Applied Mathematics | 2018-06-27 | Paper |
| Advice complexity of the online induced subgraph problem (available as arXiv preprint) | 2018-03-21 | Paper |
| The advice complexity of a class of hard online problems Theory of Computing Systems | 2018-02-01 | Paper |
| Advice complexity for a class of online problems (available as arXiv preprint) | 2017-01-24 | Paper |
| Weighted Online Problems with Advice Lecture Notes in Computer Science | 2016-09-29 | Paper |
| Advice complexity of the online search problem Lecture Notes in Computer Science | 2016-09-29 | Paper |
| Adding isolated vertices makes some online algorithms optimal Lecture Notes in Computer Science | 2016-04-04 | Paper |
| Deciding the on-line chromatic number of a graph with pre-coloring is PSPACE-complete Lecture Notes in Computer Science | 2015-09-21 | Paper |
Research outcomes over time
This page was built for person: Christian Kudahl
