Christian Kudahl

According to our database, Christian Kudahl authored at least 9 papers between 2015 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Weighted Online Problems with Advice.

Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen

Theory Comput. Syst., 2018

Adding isolated vertices makes some greedy online algorithms optimal.

Joan Boyar, Christian Kudahl

Discret. Appl. Math., 2018

2017

The Advice Complexity of a Class of Hard Online Problems.

Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen

Theory Comput. Syst., 2017

2016

Online Algorithms with Advice: A Survey.

Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen

SIGACT News, 2016

Advice Complexity of the Online Induced Subgraph Problem.

Dennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Advice Complexity of the Online Search Problem.

Jhoirene B. Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015

Advice Complexity for a Class of Online Problems.

Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Adding Isolated Vertices Makes Some Online Algorithms Optimal.

Joan Boyar, Christian Kudahl

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete.

Christian Kudahl

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015