From

Institution

Field

Type

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

Reset

Papers matching “competitive ratio” 67

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 Medicine SARS-CoV-2 detection and testing Open access

Robert Scheidweiler, Eberhard Triesch

0

citations
Upper and lower bounds for competitive group testing
2023 Discrete Applied Mathematics article Medicine SARS-CoV-2 detection and testing

Robert Scheidweiler, Eberhard Triesch

1

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
2024 arXiv (Cornell University) preprint Engineering Vehicle License Plate Recognition Open access

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

0

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
Knapsack Secretary Through Boosting
2022 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer

0

citations
Graph Exploration with Edge Weight Estimates
2025 arXiv (Cornell University) preprint Computer Science Graph Theory and Algorithms Open access

Matthias Gehnen, Ralf Klasing, Émile Naquin

0

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 Bin Packing with Item Size Estimates
2025 arXiv (Cornell University) preprint Engineering Advanced Manufacturing and Logistics Optimization Open access

Matthias Gehnen, Andreas Usdenski

0

citations
Interval-constrained bipartite matching over time
2026 Acta Informatica article Computer Science Data Management and Algorithms Open access

Andreas Abels, Mariia Anapolska

0

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

Hans-Joachim Boeckenhauer, Elisabet Burjons, Juraj Hromkovic̆, Henri Lotze, Peter Rossmanith

2

citations
Weighted programming: a programming paradigm for specifying mathematical models
2022 Proceedings of the ACM on Programming Languages article Computer Science Logic, Reasoning, and Knowledge Open access

Kevin Batz, Adrian Gallus, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Tobias Winkler

18

citations
Separation by Size Exclusion: Selective Liquid-Phase Adsorption of l -Lysine from Lysine–Glucose Mixtures on Zeolites
2022 ACS Sustainable Chemistry & Engineering article Environmental Science Adsorption and biosorption for pollutant removal

Jeff Deischter, Fabian Müller, Barbara Bong, Clemens Maurer, Sven Sören Hartmann, Regina Palkovits

11

citations
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
2024 Networks article Computer Science Optimization and Search Problems Open access

Corinna Mathwieser, Eranda Çela

2

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
Tree Coloring: Random Order and Predictions
2024 arXiv (Cornell University) preprint Physics and Astronomy Color Science and Applications Open access

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

1

citations
Prophet Inequalities over Time
2023 conference-paper Computer Science Optimization and Search Problems Open access

Andreas Abels, Elias Pitschmann, Daniel Schmand

1

citations
Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty
2022 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Corinna Mathwieser, Eranda Çela

0

citations
Weighted Programming
2022 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Kevin Batz, Adrian Gallus, Benjamin Lucien Kaminski, Joost-Pieter Katoen

0

citations
Tree coloring with predictions
2025 Discrete Applied Mathematics article Business, Management and Accounting Consumer Market Behavior and Pricing Open access

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

0

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
Knapsack Secretary Through Boosting
2022 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems

Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer

2

citations