A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

Topic: Optimization and Search Problems ×

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Papers matching “randomized algorithms” in Optimization and Search Problems 5

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Online Unbounded Knapsack
2025 Theory of Computing Systems article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic̆, Ralf Klasing, Dennis Komm, Henri Lotze, +3 more

2

citations
On the advice complexity of the online dominating set problem
2021 Theoretical Computer Science article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Juraj Hromkovic̆, Sacha Krug

3

citations
Stealing From the Dragon's Hoard: Online Unbounded Knapsack With Removal
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Optimization and Search Problems Open access

Matthias Gehnen, Kübra Güven, Moritz Stocker

0

citations
Improved Results for Knapsack with Removal
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Optimization and Search Problems Open access

Matthias Gehnen, Valentin Hächler, Dennis Komm, Richard Královič

0

citations
Tree coloring with predictions
2025 Discrete Applied Mathematics article Computer Science Optimization and Search Problems Open access

Fabian Frei, Matthias Gehnen, Dennis Komm, Rastislav Kráľovič, Richard Královič, Peter Rossmanith, +1 more

0

citations

5 results