From

Institution

Field

Type

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

Reset

Papers matching “hardness” 120

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Symmetry-based quantum algorithms for open-shop scheduling with hard constraints
2025 Academia quantum. article Computer Science Quantum Computing Algorithms and Architecture Open access

Lennart Binkowski, Gereon Koßmann, Christian Tutschku, René Schwonnek

3

citations
Hard-to-Detect Fault Analysis in FinFET SRAMs
2021 IEEE Transactions on Very Large Scale Integration (VLSI) Systems article Computer Science VLSI and Analog Circuit Testing Open access

Guilherme Cardoso Medeiros, Moritz Fieback, Lizhou Wu, Mottaqiallah Taouil, L. M. Bolzani Poehls, Said Hamdioui

15

citations
Loop corrections for hard spheres in Hamming space
2025 Journal of Statistical Mechanics Theory and Experiment article Computer Science Error Correcting Code Techniques

Abolfazl Ramezanpour, Saman Moghimi-Araghi

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
Hard Problems on Random Graphs
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Henri Lotze, Peter Rossmanith

0

citations
Quantum annealing for hard 2-satisfiability problems: Distribution and scaling of minimum energy gap and success probability
2022 Physical Review A article Computer Science Quantum Computing Algorithms and Architecture Open access

Vrinda Mehta, Fengping Jin, Hans A. De Raedt, Kristel F. L. Michielsen

11

citations
On the hardness of quadratic unconstrained binary optimization problems
2022 Frontiers in Physics article Computer Science Quantum Computing Algorithms and Architecture Open access

Vrinda Mehta, Fengping Jin, Kristel F. L. Michielsen, Hans A. De Raedt

7

citations
Stackelberg Max Closure with Multiple Followers
2022 Mathematics of Operations Research article Computer Science Complexity and Algorithms in Graphs Open access

Karsten Jungnitsch, Britta Peis, Marc Schröder

3

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
Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting
2020 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Toni Böhnlein, Stefan Kratsch, Oliver Schaudt

11

citations
Continuous facility location on graphs
2021 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

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

6

citations
Robust two-dose vaccination schemes and the directed b -matching problem
2024 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs Open access

Jenny Segschneider, Arie M. C. A. Koster

1

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
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
Robust minimum cost flow problem under consistent flow constraints
2021 Annals of Operations Research article Computer Science Complexity and Algorithms in Graphs Open access

Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz

10

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
Robust transshipment problem under consistent flow constraints
2022 RWTH Publications (RWTH Aachen) article Computer Science Complexity and Algorithms in Graphs Open access

Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz

0

citations
Restrained double Roman domination of a graph
2022 RAIRO - Operations Research article Computer Science Advanced Graph Theory Research Open access

Doost Ali Mojdeh, İman Masoumi, Lutz Volkmann

13

citations
Stochastic games with lexicographic objectives
2023 Formal Methods in System Design article Computer Science Formal Methods in Verification Open access

Krishnendu Chatterjee, Joost-Pieter Katoen, Stefanie Mohr, Maximilian Weininger, Tobias Winkler

5

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
The bipartite travelling salesman problem: A pyramidally solvable case
2024 Operations Research Letters article Computer Science Complexity and Algorithms in Graphs Open access

Vladimir G. Deı̌neko, Bettina Klinz, Gerhard J. Woeginger

2

citations
A linear time algorithm for linearizing quadratic and higher-order shortest path problems
2024 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf

2

citations
Exact Separation of Forbidden-Set Cuts Associated With Redundant Parity Checks of Binary Linear Codes
2020 IEEE Communications Letters article Computer Science Coding theory and cryptography Open access

Christian Puchert, Andreas M. Tillmann

2

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
Upper bounds and approximation results for the k -slow burning problem
2024 Discrete Applied Mathematics article Computer Science Advanced Graph Theory Research Open access

Michaela Hiller, Arie M. C. A. Koster, Philipp Pabst

1

citations