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

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

The Complexity of Graph Exploration Games
2023 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

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

1

citations
The Complexity of Graph Exploration Games
2025 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems

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

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
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
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
Exploring sparse graphs with advice
2022 Information and Computation article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Janosch Fuchs

7

citations

6 results