Christian Kudahl

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