From

Institution

Field

Type

Topic: Complexity and Algorithms in Graphs ×

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

Reset

Papers matching “polynomial-time algorithms” in Complexity and Algorithms in Graphs 22

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

A linear time algorithm for the robust recoverable selection problem
2020 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs Open access

Thomas Lachmann, Stefan Lendl, Gerhard J. Woeginger

9

citations
Improved Approximation Algorithms for the Expanding Search Problem
2026 SIAM Journal on Discrete Mathematics article Computer Science Complexity and Algorithms in Graphs

0

citations
Approximation Algorithms for Discounted Graph Search with Norm Objectives
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Svenja M. Griesbach, Felix Hommelsheim, Max Klimm

0

citations
Approximation Algorithms for Discounted Graph Search with Norm Objectives
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Svenja M. Griesbach, Felix Hommelsheim, Max Klimm

0

citations
Non-Preemptive Tree Packing
2022 Algorithmica article Computer Science Complexity and Algorithms in Graphs Open access

Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf

1

citations
Non-preemptive Tree Packing
2021 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs Open access

Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf

0

citations
Recoverable robust optimization with commitment
2026 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Komal Muluk, Britta Peis

3

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
Minimum color‐degree perfect b‐matchings
2020 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Mariia Anapolska, Christina Büsing, Martin Comis, Tabea Krabs

1

citations
A Faster Isomorphism Test for Graphs of Small Degree
2020 SIAM Journal on Computing article Computer Science Complexity and Algorithms in Graphs Open access

Martin Grohe, Daniel Neuen, Pascal Schweitzer

11

citations
Matroid bases with cardinality constraints on the intersection
2021 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Stefan Lendl, Britta Peis, Veerle Timmermans

9

citations
Dispersing Obnoxious Facilities on a Graph
2021 Algorithmica article Computer Science Complexity and Algorithms in Graphs Open access

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

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
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 blocking all solutions
2026 Theoretical Computer Science article Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

0

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

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
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
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
Perfect Matching Under Precedence Constraints
2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Christina Büsing, Corinna Mathwieser

0

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
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

22 results