From

Institution

Field

Type

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

Reset

Papers matching “graphs” 886

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults
2022 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access

David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt

2

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
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
The Complexity of Stackelberg Pricing Games
2025 IT University Of Copenhagen (IT University of Copenhagen) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Dorothee Henke, Eva Rotenberg, Lasse Wulf

2

citations
Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Michael Emmerich, Ksenia Pereverdieva, Andre H. Deutz

2

citations
Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems
2024 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Moritz Lichter, Benedikt Pago

2

citations
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access

2

citations
Uniformity Within Parameterized Circuit Classes
2025 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Steef Hegeman, Jan Martens, Alfons Laarman

1

citations
BendersNetworkDesign.jl
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access

Tim Donkiewicz

1

citations
Fast maximal clique enumeration in weighted temporal networks
2026 Social Network Analysis and Mining article Computer Science Graph Theory and Algorithms Open access

Hanjo D. Boekhout, Frank W. Takes

1

citations
The Complexity Classes of Hamming Distance Recoverable Robust Problems
2024 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs

Christoph Grüne

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
Approximating $$\delta $$-Covering
2025 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs Open access

Tim A. Hartmann, Tom Janßen

1

citations
Seven open problems in applied combinatorics
2023 Journal of Combinatorics article Computer Science Complexity and Algorithms in Graphs Open access

Sinan G. Aksoy, Ryan S. Bennink, Yuzhou Chen, Yulia R. Gel, Bill Kay, Uwe Naumann, +6 more

1

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

Uwe Naumann, Shubhaditya Burela

1

citations
Travelling salesman paths on Demidenko matrices
2024 Warwick Research Archive Portal (University of Warwick) article Computer Science Complexity and Algorithms in Graphs Open access

Eranda Çela, Vladimir G. Deı̌neko, Gerhard J. Woeginger

1

citations
Thermodynamic Perspectives on Computational Complexity
2024 SSRN Electronic Journal preprint Computer Science Complexity and Algorithms in Graphs Open access

Florian Neukart

1

citations
Spanning acyclic subdigraphs and strong t -panconnectivity of tournaments
2022 Discrete Applied Mathematics article Computer Science Advanced Graph Theory Research

Lan Xiao, Yubao Guo

1

citations
A Faster Parametric Search for the Integral Quickest Transshipment Problem
2025 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Mariia Anapolska, Dario van den Boom, Christina Büsing, Timo Gersing

1

citations
Travelling salesman paths on Demidenko matrices
2021 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs Open access

Eranda Çela, Vladimir G. Deı̌neko, Gerhard J. Woeginger

1

citations
Robust transshipment problem under consistent flow constraints
2023 Networks article Computer Science Complexity and Algorithms in Graphs Open access

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

1

citations
Selecting Walk Schemes for Database Embedding
2023 ACM International Conference on Information and Knowledge Management (CIKM) conference-paper Computer Science Advanced Graph Neural Networks Open access

Yuval Lev Lubarsky, Jan Tönshof, Martin Grohe, Benny Kimelfeld

1

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
On the Parameterized Complexity of Learning First-Order Logic
2021 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem, Martin Grohe, Martin Ritzert

0

citations
Precedence constraints in combinatorial optimization
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Advanced Graph Theory Research Open access

Corinna Mathwieser

0

citations