Christian Kudahl

Publication Activity (10 Years)

Years Active: 2014-2018
Publications (10 Years): 10

Top Topics

Polynomial Hierarchy

Computationally Hard

Top Venues

Theory Comput. Syst.

Publications

Joan Boyar, Christian Kudahl
Adding isolated vertices makes some greedy online algorithms optimal. Discret. Appl. Math. 246 (2018)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
Weighted Online Problems with Advice. Theory Comput. Syst. 62 (6) (2018)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
Online Algorithms with Advice: A Survey. ACM Comput. Surv. 50 (2) (2017)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
The Advice Complexity of a Class of Hard Online Problems. Theory Comput. Syst. 61 (4) (2017)
Jhoirene B. Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl
Advice Complexity of the Online Search Problem. IWOCA (2016)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
Weighted Online Problems with Advice. CoRR (2016)
Jhoirene B. Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl
Advice Complexity of the Online Search Problem. CoRR (2016)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
Weighted Online Problems with Advice. IWOCA (2016)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
Online Algorithms with Advice: A Survey. SIGACT News 47 (3) (2016)
Dennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl
Advice Complexity of the Online Induced Subgraph Problem. MFCS (2016)
Joan Boyar, Christian Kudahl
Adding Isolated Vertices Makes Some Online Algorithms Optimal. IWOCA (2015)
Joan Boyar, Christian Kudahl
Adding Isolated Vertices Makes some Online Algorithms Optimal. CoRR (2015)
Dennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl
Advice Complexity of the Online Induced Subgraph Problem. CoRR (2015)
Christian Kudahl
Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete. CIAC (2015)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
Advice Complexity for a Class of Online Problems. STACS (2015)
Christian Kudahl
Deciding the On-line Chromatic Number of a Graph with Pre-Coloring is PSPACE-Complete. CoRR (2014)
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
The Advice Complexity of a Class of Hard Online Problems. CoRR (2014)