scholarly journals Advice Complexity of Online Coloring for Paths

2012 ◽  
pp. 228-239 ◽  
Author(s):  
Michal Forišek ◽  
Lucia Keller ◽  
Monika Steinová
Keyword(s):  
Advice Complexity ◽  
Online Coloring

On the Advice Complexity of Online Problems

2009 ◽  
pp. 331-340 ◽  
Author(s):  
Hans-Joachim Böckenhauer ◽  
Dennis Komm ◽  
Rastislav Královič ◽  
Richard Královič ◽  
Tobias Mömke
Keyword(s):  
Advice Complexity ◽  
Online Problems

Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs

2014 ◽  
Vol 56 (1) ◽  
pp. 197-219 ◽  
Author(s):  
Stefan Dobrev ◽  
Rastislav Královič ◽  
Richard Královič
Keyword(s):  
Independent Set ◽  
Bipartite Graphs ◽  
Maximum Independent Set ◽  
Advice Complexity

Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs

2018 ◽  
Vol 32 (2) ◽  
pp. 1335-1350 ◽  
Author(s):  
Konstanty Junosza-Szaniawski ◽  
Paweł Rzaͅżewski ◽  
Joanna Sokół ◽  
Krzysztof Weͅsek
Keyword(s):  
Unit Disk ◽  
Intersection Graphs ◽  
Online Coloring

scholarly journals The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity

2013 ◽  
pp. 493-505 ◽  
Author(s):  
Hans-Joachim Böckenhauer ◽  
Juraj Hromkovič ◽  
Dennis Komm ◽  
Sacha Krug ◽  
Jasmin Smula ◽  
...  
Keyword(s):  
Lower Bounds ◽  
Advice Complexity

scholarly journals Advice Complexity of Priority Algorithms

2018 ◽  
pp. 69-86 ◽  
Author(s):  
Allan Borodin ◽  
Joan Boyar ◽  
Kim S. Larsen ◽  
Denis Pankratov
Keyword(s):  
Advice Complexity ◽  
Priority Algorithms

scholarly journals Advice Complexity and Barely Random Algorithms

2011 ◽  
Vol 45 (2) ◽  
pp. 249-267 ◽  
Author(s):  
Dennis Komm ◽  
Richard Královič
Keyword(s):  
Advice Complexity

scholarly journals On the Advice Complexity of the Knapsack Problem

2012 ◽  
pp. 61-72 ◽  
Author(s):  
Hans-Joachim Böckenhauer ◽  
Dennis Komm ◽  
Richard Královič ◽  
Peter Rossmanith
Keyword(s):  
Knapsack Problem ◽  
Advice Complexity
Sign in / Sign up

Export Citation Format

Share Document