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 “computational hardness” 6

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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
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
Cylindrical algebraic decomposition for nonlinear arithmetic problems
2020 RWTH Publications (RWTH Aachen) dissertation Computer Science Polynomial and algebraic computation Open access

Gereon Kremer

5

citations
Heuristic circuit mapping strategies for the SpinBus architecture
2025 RWTH Publications (RWTH Aachen) dissertation Computer Science Quantum Computing Algorithms and Architecture Open access

Martin Baum

0

citations
Exascale-ready molecular dynamics simulations with efficient algorithms for extreme core counts
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Parallel Computing and Optimization Techniques Open access

Nitin Malapally

0

citations

6 results