A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

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

Papers matching “combinatorial complexity” 5

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Computational complexity of problems in robust, bilevel and online optimization
2025 RWTH Publications (RWTH Aachen) dissertation Computer Science Complexity and Algorithms in Graphs Open access

0

citations
Precedence constraints in combinatorial optimization
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Advanced Graph Theory Research Open access

Corinna Mathwieser

0

citations
Computational complexity of graph orientation, bilevel and robust optimization problems
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Advanced Graph Theory Research Open access

Komal Muluk

0

citations
Robust optimization and variants of the scheduling problem
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Complexity and Algorithms in Graphs Open access

Jenny Segschneider

0

citations
Stärken und Grenzen des Weisfeiler-Leman-Algorithmus
2020 RWTH Publications (RWTH Aachen) dissertation Computer Science Advanced Graph Theory Research Open access

Sandra Kiefer

7

citations

5 results