On the Approximation Ratio of the Path Matching Christofides Algorithm. - Sacha Krug (SOFSEM, 2012)

On the Advice Complexity of the Online L(2, 1)-Coloring Problem on Paths and Cycles. - Maria Paola Bianchi; Hans-Joachim Böckenhauer; Juraj Hromkovic; Sacha Krug; Björn Steffen (COCOON, 2013)

Analysis of a near-metric TSP approximation algorithm. - Sacha Krug (RAIRO Theor. Informatics Appl., 2013)

On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. - Kfir Barhum; Hans-Joachim Böckenhauer; Michal Forisek; Heidi Gebauer; Juraj Hromkovic; Sacha Krug; Jasmin Smula; Björn Steffen (SOFSEM, 2014)

On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles. - Maria Paola Bianchi; Hans-Joachim Böckenhauer; Juraj Hromkovic; Sacha Krug; Björn Steffen (Theor. Comput. Sci., 2014)

The string guessing problem as a method to prove lower bounds on the advice complexity. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Dennis Komm; Sacha Krug; Jasmin Smula; Andreas Sprock (Theor. Comput. Sci., 2014)

On Energy-Efficient Computations With Advice. - Hans-Joachim Böckenhauer; Richard J. B. Dobson; Sacha Krug; Kathleen Steinhöfel (COCOON, 2015)

Towards using the history in online computation with advice. - Sacha Krug (RAIRO Theor. Informatics Appl., 2015)

Improved analysis of the online set cover problem with advice. - Stefan Dobrev; Jeff Edmonds; Dennis Komm; Rastislav Královic; Richard Královic; Sacha Krug; Tobias Mömke (Theor. Comput. Sci., 2017)

On the advice complexity of the online dominating set problem. - Hans-Joachim Böckenhauer; Juraj Hromkovic; Sacha Krug; Walter Unger (Theor. Comput. Sci., 2021)