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 “approximation algorithms” in Optimization and Search Problems 6

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

Matthias Gehnen

0

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

6 results