Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract). - Elisabet Burjons; Juraj Hromkovic; Xavier Muñoz; Walter Unger (SOFSEM, 2016)

Length-Weighted Disjoint Path Allocation - Advice and Parametrization. - Elisabet Burjons; Fabian Frei; Jasmin Smula; David Wehner (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Online Graph Coloring Against a Randomized Adversary. - Elisabet Burjons; Juraj Hromkovic; Rastislav Královic; Richard Královic; Xavier Muñoz; Walter Unger (Int. J. Found. Comput. Sci., 2018)

The k-Server Problem with Advice in d Dimensions and on the Sphere. - Elisabet Burjons; Dennis Komm; Marcel Schöngens (Algorithmica, 2019)

The Impact of Additional Information on Online and Parameterized Problems. - Elisabet Burjons (2019)

From Functional Nondeterministic Transducers to Deterministic Two-Tape Automata. - Elisabet Burjons; Fabian Frei; Martin Raszyk (CoRR, 2020)

The Secretary Problem with Reservation Costs. - Elisabet Burjons; Matthias Gehnen; Henri Lotze; Daniel Mock; Peter Rossmanith (COCOON, 2021)

Lower Bounds for Conjunctive and Disjunctive Turing Kernels. - Elisabet Burjons; Peter Rossmanith (IPEC, 2021)

From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata. - Elisabet Burjons; Fabian Frei; Martin Raszyk (LICS, 2021)

Online Simple Knapsack with Reservation Costs. - Hans-Joachim Böckenhauer; Elisabet Burjons; Juraj Hromkovic; Henri Lotze; Peter Rossmanith (STACS, 2021)

The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs. - Elisabet Burjons; Janosch Fuchs; Henri Lotze (IWOCA, 2022)

Reoptimization of parameterized problems. - Hans-Joachim Böckenhauer; Elisabet Burjons; Martin Raszyk; Peter Rossmanith (Acta Informatica, 2022)

Delaying Decisions and Reservation Costs. - Elisabet Burjons; Fabian Frei; Matthias Gehnen; Henri Lotze; Daniel Mock; Peter Rossmanith (COCOON (1), 2023)

The Online Simple Knapsack Problem with Reservation and Removability. - Elisabet Burjons; Matthias Gehnen; Henri Lotze; Daniel Mock; Peter Rossmanith (MFCS, 2023)

Finding Optimal Solutions with Neighborly Help. - Elisabet Burjons; Fabian Frei; Edith Hemaspaandra; Dennis Komm; David Wehner (Algorithmica, 2024)

Online General Knapsack with Reservation Costs. - Elisabet Burjons; Matthias Gehnen (CoRR, 2025)

Uniform Universal Sets, Splitters, and Bisectors. - Elisabet Burjons; Peter Rossmanith (CoRR, 2025)