From

Institution

Field

Type

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

Reset

Papers matching “NP-completeness” 57

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 Alignments
2026 arXiv (Cornell University) preprint Business, Management and Accounting Business Process Modeling and Analysis Open access

Christopher T. Schwanen, Wied Pakusa, Wil M. P. van der Aalst

1

citations
The subset sum game revisited
2021 Theory of Computing Systems article Engineering Optimization and Packing Problems Open access

Astrid Pieterse, Gerhard J. Woeginger

1

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
Opinion Dynamics with Median Aggregation
2025 Adaptive Agents and Multi-Agents Systems conference-paper Physics and Astronomy Opinion Dynamics and Social Influence

Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Marten Maack, Malin Rau, Lisa Wilhelmi

0

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
Data-Driven Heuristic Assisted Memetic Algorithm for Efficient Inter-Satellite Link Scheduling in the BeiDou Navigation Satellite System
2021 IEEE/CAA Journal of Automatica Sinica article Engineering Satellite Communication Systems

Yonghao Du, Ling Wang, Lining Xing, Jungang Yan, Mengsi Cai

58

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
A Matrix-Free Exact Newton Method
2024 SIAM Journal on Scientific Computing article Mathematics Iterative Methods for Nonlinear Equations

Uwe Naumann

2

citations
Distribution-specific approximation guarantees for the random-parameters logit assortment problem
2025 European Journal of Operational Research article Business, Management and Accounting Supply Chain and Inventory Management Open access

Stefan Rogosinski, Sven Müller, Lorena Silvana Reyes-Rubiano

1

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
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
Hessian chain bracketing
2023 Journal of Combinatorics article Computer Science Complexity and Algorithms in Graphs

Uwe Naumann, Shubhaditya Burela

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
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
Algorithmic and practical aspects of appointment scheduling
2020 RWTH Publications (RWTH Aachen) dissertation Health Professions Healthcare Operations and Scheduling Optimization Open access

Sarah Roth

0

citations
Hessian Chain Bracketing
2021 arXiv (Cornell University) preprint Mathematics Advanced Optimization Algorithms Research Open access

Uwe Naumann, Shubhaditya Burela

0

citations
A Matrix-Free Newton Method
2023 arXiv (Cornell University) preprint Mathematics Iterative Methods for Nonlinear Equations Open access

Uwe Naumann

0

citations