From

Institution

Field

Type

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

Reset

Papers matching “computational hardness” 283

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Thermodynamic-Complexity Duality: Embedding Computational Hardness as a Thermodynamic Coordinate
2025 SSRN Electronic Journal preprint Physics and Astronomy Advanced Thermodynamics and Statistical Mechanics Open access

Florian Neukart

1

citations
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
Insights into the computational complexity of the single-source capacitated facility location problem with customer preferences
2026 Annals of Operations Research article Business, Management and Accounting Facility Location and Emergency Management Open access

Christina Büsing, Timo Gersing, Sophia Wrede

0

citations
The Intricacies of Computational Electrochemistry
2025 ACS Energy Letters article Physics and Astronomy Advanced Chemical Physics Studies Open access

Nitish Govindarajan, Georg Kastlunger, Joseph A. Gauthier, Jun Jie Cheng, Ivo A. W. Filot, Arthur Hagopian, +17 more

28

citations
Ensemble-based stochastic permeability and flow simulation of a sparsely sampled hard-rock aquifer supported by high performance computing
2020 Hydrogeology Journal article Environmental Science Groundwater flow and contamination studies Open access

Johanna Bruckmann, Christoph Clauser

9

citations
Algorithms for information and contract design in multi-agent network settings
2026 RWTH Publications (RWTH Aachen) dissertation Decision Sciences Game Theory and Applications Open access

Tim Koglin

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
Flow Chart for Reconstructive Head and Neck Surgery in Composite Soft and Hard Tissue Defects
2020 Journal of Craniofacial Surgery article Medicine Reconstructive Surgery and Microvascular Techniques

Bernd Lethaus, Mohammad Kamal, Franziska Kettner, Anita Kloss‐Brandstätter, Dirk Halama, Frank Hölzle, +1 more

3

citations
An expectation–maximization algorithm for spectral reconstruction under the spectral hard model
2025 Chemometrics and Intelligent Laboratory Systems article Chemistry Spectroscopy and Chemometric Analyses Open access

Marvin Kasterke, Lea Kaufmann, Maria Kateri, Thorsten Brands

3

citations
A universal free energy relationship for both hard and soft radical addition in water
2022 Journal of Physical Organic Chemistry article Chemistry Free Radicals and Antioxidants Open access

Tom M. Nolte, A. Jan Hendriks, Laurie A. Novák, Willie J.G.M. Peijnenburg

4

citations
Improved ab initio molecular dynamics–based vibrational spectroscopy for indirect hard modeling for bulk-phase vibrational spectroscopy using vibrational scaling and sampling diagnostics
2026 The Journal of Chemical Physics article Physics and Astronomy Spectroscopy and Quantum Chemical Studies

Akshdeep Singh, Marvin Kasterke, Mansi Aliveli, Thorsten Brands, Hans-Jürgen Koß, Jörn Viell, +1 more

1

citations
Local modifications of TiO2 and SrTiO3 properties intentionally induced by hard X-ray nanobeams (Conference Presentation)
2023 conference-abstract Physics and Astronomy Advanced X-ray Imaging Techniques

Andrea Alessio, Kalle Goß, Valentina Bonino, Vanessa Hinojosa, Santanu Kumar Padhi, Federico Picollo, +5 more

0

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