From

Institution

Field

Type

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

Reset

Papers matching “online algorithms” 238

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Online Process Monitoring Using Incremental State-Space Expansion: An Exact Algorithm
2020 Lecture notes in computer science conference-paper Business, Management and Accounting Business Process Modeling and Analysis Open access

9

citations
A survey of online knapsack problems
2025 Discrete Applied Mathematics article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Juraj Hromkovic̆, Dennis Komm, Peter Rossmanith, Moritz Stocker

3

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
Semi online problems
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Optimization and Search Problems Open access

Matthias Gehnen

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
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
Online proportional apportionment
2026 Mathematical Programming article Economics, Econometrics and Finance Game Theory and Voting Systems Open access

Javier Cembrano, José Correa, Svenja M. Griesbach, Víctor Verdugo

0

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 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
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
The Complexity of Online Graph Games
2022 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Janosch Fuchs, Christoph Grüne, Tom Janßen

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

Matthias Gehnen, Andreas Usdenski

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
Privacy-Preserving Fully Online Matching with Deadlines
2023 conference-paper Computer Science Cryptography and Data Security Open access

Andreas Klinger, Ulrike Meyer

1

citations
Advice Complexity bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Advanced Graph Theory Research Open access

Niklas Berndt, Henri Lotze

1

citations
Delegated online search
2024 Artificial Intelligence article Computer Science Optimization and Search Problems Open access

Pirmin Braun, Niklas Hahn, Martin Hoefer, Conrad Schecker

1

citations
Exploiting the Surrogate Gap in Online Multiclass Classification
2020 arXiv (Cornell University) preprint Decision Sciences Advanced Bandit Algorithms Research Open access

Dirk van der Hoeven

4

citations
Online-Extractability in the Quantum Random-Oracle Model
2021 arXiv (Cornell University) preprint Computer Science Quantum Information and Cryptography Open access

Jelle Don, Serge Fehr, Christian Majenz, Christian Schaffner

3

citations
Out-of-sample estimation for a branch-and-bound algorithm with growing datasets
2025 RWTH Publications (RWTH Aachen) article Mathematics Advanced Optimization Algorithms Research Open access

0

citations
Influence of the algorithm's reliability and transparency in the user's decision-making process
2023 arXiv (Cornell University) preprint Computer Science Explainable Artificial Intelligence (XAI) Open access

Sourabh Zanwar

0

citations
Soft tissue tumor imaging in adults: whole-body staging in sarcoma, non-malignant entities requiring special algorithms, pitfalls and special imaging aspects. Guidelines 2024 from the European Society of Musculoskeletal Radiology (ESSR)
2024 European Radiology article Medicine Sarcoma Diagnosis and Treatment Open access

Iris-Melanie Nöebauer-Huhmann, Filip M. H. M. Vanhoenacker, Joan Carles Vilanova, Alberto Stefano Tagliafico, Radhesh Krishna Lalam, Thomas Grieser, +41 more

15

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
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