From

Institution

Field

Type

Topic: Optimization and Search Problems ×

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

Reset

Papers matching “lower bounds” in Optimization and Search Problems 24

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Upper and Lower Bounds for Competitive Group Testing
2020 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Robert Scheidweiler, Eberhard Triesch

0

citations
Upper and lower bounds for competitive group testing
2023 Discrete Applied Mathematics article Computer Science Optimization and Search Problems

Robert Scheidweiler, Eberhard Triesch

1

citations
Delaying Decisions and Reservation Costs
2023 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith

0

citations
Online knapsack with removal and recourse
2025 Journal of Computer and System Sciences article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner

1

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
Online Simple Knapsack with Reservation Costs
2021 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic̆, Henri Lotze, Peter Rossmanith

4

citations
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
Removable Online Knapsack and Advice
2020 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith

1

citations
Online Node- and Edge-Deletion Problems with Advice
2021 Algorithmica article Computer Science Optimization and Search Problems Open access

Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith

7

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
Online General Knapsack with Reservation Costs
2025 RWTH Publications (RWTH Aachen) conference-paper Computer Science Optimization and Search Problems Open access

Matthias Gehnen

0

citations
Prophet Inequalities over Time
2023 ACM Conference on Economics and Computation (EC) conference-paper Computer Science Optimization and Search Problems Open access

Andreas Abels, Elias Pitschmann, Daniel Schmand

1

citations
Graph Exploration with Edge Weight Estimates
2025 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Matthias Gehnen, Ralf Klasing, Émile Naquin

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
The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs
2022 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems

Elisabet Burjons, Janosch Fuchs, Henri Lotze

1

citations
Delaying Decisions and Reservation Costs
2023 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems Open access

Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith

1

citations
Tree Coloring: Random Order and Predictions
2024 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

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

1

citations
Online Knapsack with Removal and Recourse
2023 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner

6

citations
Further Results on Online Node- and Edge-Deletion Problems with Advice
2020 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems Open access

Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith

1

citations
Online General Knapsack with Reservation Costs
2025 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems Open access

Matthias Gehnen

0

citations
Cow Path by Finite Agent: Time vs Pebbles
2026 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems

Stefan Dobrev, Rastislav Kráľovič, Richard Královič, Dana Pardubská, Peter Rossmanith

0

citations
Online Unbounded Knapsack
2024 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

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

0

citations
Semi online problems
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Optimization and Search Problems Open access

Matthias Gehnen

0

citations

24 results