From

Institution

Field

Type

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

Reset

Papers matching “NP-completeness” 43

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

The 2-Attractor Problem is NP-Complete
2023 arXiv (Cornell University) preprint Computer Science Algorithms and Data Compression Open access

Janosch Fuchs

0

citations
Deciding minimal distinguishing DFAs is NP-complete
2023 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

Jan Martens

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
Computing Subset Vertex Covers in $H$-Free Graphs
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma

0

citations
Recognizing Proper Tree-Graphs
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dušan Knop

2

citations
Recognizing Proper Tree-Graphs
2020 RWTH Publications (RWTH Aachen) conference-paper Computer Science Advanced Graph Theory Research Open access

Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dušan Knop

1

citations
Continuous Defensive Domination Problems
2026 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Christoph Grüne, Tom Janßen

0

citations
Make a graph singly connected by edge orientations
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Tim A. Hartmann, Komal Muluk

0

citations
Simple Strategies in Multi-Objective MDPs
2020 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Florent Delgrange, Joost-Pieter Katoen, Tim Quatmann, Mickaël Randour

29

citations
The Linear Algebra Mapping Problem. Current State of Linear Algebra Languages and Libraries
2022 ACM Transactions on Mathematical Software article Computer Science Parallel Computing and Optimization Techniques Open access

Christos Psarras, Henrik Barthels, Paolo Bientinesi

15

citations
A note on the complexity of the bilevel bottleneck assignment problem
2021 4OR article Computer Science Complexity and Algorithms in Graphs Open access

Dennis Fischer, Komal Muluk, Gerhard J. Woeginger

2

citations
Natural Strategic Ability in Stochastic Multi-Agent Systems
2024 Proceedings of the AAAI Conference on Artificial Intelligence conference-paper Computer Science Logic, Reasoning, and Knowledge Open access

Raphaël Berthon, Joost-Pieter Katoen, Munyque Mittelmann, Aniello Murano

1

citations
Hessian chain bracketing
2023 Journal of Combinatorics article Computer Science Complexity and Algorithms in Graphs

Uwe Naumann, Shubhaditya Burela

1

citations
Dispersing Obnoxious Facilities on Graphs by Rounding Distances
2022 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Tim A. Hartmann, Stefan Lendl

1

citations
On the Computational Complexity of the Chain Rule of Differential Calculus
2021 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Uwe Naumann

1

citations
Exploring Solver-Level Warmstarting for Neural Network Verification
2026 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Annelot W. Bosman, Minghao Liu, Marta Kwiatkowska, Holger H. Hoos, Jan van Rijn

0

citations
Natural Strategic Ability in Stochastic Multi-Agent Systems
2024 arXiv (Cornell University) preprint Computer Science Logic, Reasoning, and Knowledge Open access

Raphaël Berthon, Joost-Pieter Katoen, Munyque Mittelmann, Aniello Murano

0

citations
Multi-Valued Partial Order Plans in Numeric Planning
2023 arXiv (Cornell University) preprint Computer Science AI-based Problem Solving and Planning Open access

Hayyan Helal, Gerhard Lakemeyer

0

citations
A note on the computational complexity of chain rule differentiation
2023 Optimization methods & software article Computer Science Complexity and Algorithms in Graphs

Uwe Naumann

0

citations
Recursive querying of neural networks via weighted structures
2026 arXiv (Cornell University) preprint Computer Science Logic, Reasoning, and Knowledge Open access

Martin Grohe, Christoph Standke, Juno Steegmans, Jan Van den Bussche

0

citations
Recursive querying of neural networks via weighted structures
2026 arXiv (Cornell University) preprint Computer Science Logic, Reasoning, and Knowledge Open access

Martin Grohe, Christoph Standke, Juno Steegmans, Jan Van den Bussche

0

citations
Recursive Querying of Neural Networks via Weighted Structures
2026 Proceedings of the ACM on Management of Data article Computer Science Logic, Reasoning, and Knowledge

Martin Grohe, Christoph Standke, Juno Steegmans, Jan Van den Bussche

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
Signed Total Roman Domination and Domatic Numbers: Degree Three and Complete Multipartite Graphs
2026 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Arie M. C. A. Koster, Lutz Volkmann, Moritz Wehrmann

0

citations
Computing subset vertex covers in H-free graphs
2025 Theoretical Computer Science article Computer Science Advanced Graph Theory Research Open access

Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen

2

citations