From

Institution

Field

Type

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

Reset

Papers matching “computational hardness” 136

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Thermodynamic Perspectives on Computational Complexity: Exploring the P vs. NP Problem
2023 SSRN Electronic Journal preprint Computer Science Complexity and Algorithms in Graphs Open access

Florian Neukart

2

citations
Computational Complexity of the Weisfeiler-Leman Dimension
2024 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Moritz Lichter, Simon Raßmann, Pascal Schweitzer

0

citations
Computational Complexity of the Weisfeiler-Leman Dimension
2026 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research

Moritz Lichter, Simon Raßmann, Pascal Schweitzer

0

citations
Computational Complexity of the Weisfeiler-Leman Dimension
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Simon Raßmann, Pascal Schweitzer

1

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
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
Identifying online risk markers of hard-to-observe crimes through semi-inductive triangulation: The case of human trafficking in the United States
2021 The British Journal of Criminology article Computer Science Cybercrime and Law Enforcement Studies

Ieke de Vries, Jason Pilny Radford

16

citations
Efficiently Approximating Attention Is Hard
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Lukas Haverbeck, Carmen Amo Alonso, Andrés Felipe Posada-Moreno, Sebastian Trimpe, Marco Pavone

0

citations
Quantum Computational Complexity of Matrix Functions
2024 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Santiago Cifuentes, Samson Wang, Thais de Lima Silva, Mario Berta, Leandro Aolita

0

citations
Quantum Computational Complexity of Matrix Functions
2026 PRX Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Santiago Cifuentes, Samson Wang, Thais de Lima Silva, Mario Berta, Leandro Aolita

0

citations
The Complexity of Homomorphism Reconstructibility
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke

1

citations
Graph Similarity Based on Matrix Norms
2022 arXiv (Cornell University) preprint Computer Science Graph Theory and Algorithms Open access

Timo Gervens, Martin Grohe

3

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
An Investigation of the Recoverable Robust Assignment Problem
2020 RWTH Publications (RWTH Aachen) conference-paper Computer Science Complexity and Algorithms in Graphs Open access

Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger

6

citations
The Importance of Parameters in Ranking Functions
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Database Systems and Queries Open access

Christoph Standke, Nikolaos Tziavelis, Wolfgang Gatterbauer, Benny Kimelfeld

0

citations
Database Repairing with Soft Functional Dependencies
2024 ACM Transactions on Database Systems article Computer Science Advanced Database Systems and Queries Open access

Nofar Carmeli, Martin Grohe, Benny Kimelfeld, Ester Livshits, Muhammad Tibi

5

citations
Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries
2025 Proceedings of the ACM on Management of Data article Computer Science Advanced Database Systems and Queries Open access

Christoph Standke, Benny Kimelfeld

0

citations
Efficient Probabilistic Model Checking for Relational Reachability
2025 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Lina Gerlach, Tobias Winkler, Erika Ábrahám, Borzoo Bonakdarpour, Sebastian Junges

3

citations
The complexity of blocking all solutions
2026 Theoretical Computer Science article Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

1

citations
Database Repairing with Soft Functional Dependencies
2021 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Database Systems and Queries Open access

Nofar Carmeli, Martin Grohe, Benny Kimelfeld, Ester Livshits, Muhammad Tibi

0

citations
Tractable Hyperproperties for MDPs
2026 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Lina Gerlach, Tobias Winkler, Erika Ábrahám, Borzoo Bonakdarpour, Sebastian Junges

0

citations
Precedence‐Constrained Shortest Path
2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Christina Büsing, Dennis John, Corinna Mathwieser

0

citations
Minimum‐Peak‐Cost Flows Over Time
2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Mariia Anapolska, Emma Ahrens, Christina Büsing, Felix Engelhardt, Timo Gersing, Corinna Mathwieser, +2 more

0

citations
Structured discrete shape approximation: Theoretical complexity and practical algorithm
2021 Computational Geometry article Computer Science Computational Geometry and Mesh Generation Open access

Andreas M. Tillmann, Leif P. Kobbelt

2

citations
The Complexity Classes of Hamming Distance Recoverable Robust Problems
2022 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne

1

citations