From

Institution

Field

Type

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

Reset

Papers matching “polynomial-time algorithms” 68

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

A polynomial-time algorithm for user-based relocation in free-floating car sharing systems
2020 Transportation Research Part B Methodological article Engineering Transportation and Mobility Innovations Open access

Maximilian Schiffer, Gerhard Hiermann, Fabian Rüdel, Grit Walther

46

citations
Polynomial-Time Conformance Checking for Process Trees
2023 Lecture notes in computer science conference-paper Business, Management and Accounting Business Process Modeling and Analysis

Eduardo Goulart Rocha, Wil M. P. van der Aalst

6

citations
Polynomial-time quantum Gibbs sampling for the weak and strong coupling regime of the Fermi-Hubbard model at any temperature
2025 Nature Communications article Computer Science Quantum Computing Algorithms and Architecture Open access

Štěpán Šmíd, Mario Berta, Roberto Bondesan

6

citations
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
Polynomial-time quantum Gibbs sampling for the weak and strong coupling regime of the Fermi-Hubbard model at any temperature
2025 Nature Communications article Computer Science Quantum Computing Algorithms and Architecture Open access

Štěpán Šmíd, Mario Berta, Roberto Bondesan

0

citations
Algorithms for information and contract design in multi-agent network settings
2026 RWTH Publications (RWTH Aachen) dissertation Decision Sciences Game Theory and Applications Open access

Tim Koglin

0

citations
Polynomial Time Quantum Approximation Schemes for Constrained Optimisation
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Chinonso Onah, Kristel F. L. Michielsen

0

citations
Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms
2024 Discrete Applied Mathematics article Engineering Scheduling and Optimization Algorithms Open access

Mariia Anapolska, Tabea Brandt, Christina Büsing, Tobias Mömke

0

citations
Efficient Computation of the Waiting Time and Fidelity in Quantum Repeater Chains
2020 IEEE Journal on Selected Areas in Communications article Computer Science Quantum Information and Cryptography Open access

42

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
Efficient computation of the waiting time and fidelity in quantum repeater chains
2020 OSA Quantum 2.0 Conference conference-paper Computer Science Quantum Information and Cryptography

Sebastiaan Brand, Tim Coopmans, David Elkouss

9

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
Picker Routing in AGV-Assisted Order Picking Systems
2021 INFORMS journal on computing article Engineering Advanced Manufacturing and Logistics Optimization

Maximilian Löffler, Nils Boysen, Michael Schneider

91

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
Equilibrium computation in resource allocation games
2021 Mathematical Programming article Decision Sciences Game Theory and Applications Open access

Tobias Harks, Veerle Timmermans

3

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
Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Benedikt Pago

0

citations
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem
2025 Journal of Computer and System Sciences article Computer Science Advanced Graph Theory Research Open access

Hans L. Bodlaender, Matthew Johnson, Barnaby D. Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, +2 more

0

citations
Discretization-free exact recovery in geometric community detection
2026 arXiv (Cornell University) preprint Physics and Astronomy Complex Network Analysis Techniques Open access

Maarten Hoeneveld, Moritz Otto, Raphaël Sala

0

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
Over-the-Air Federated Learning Client Selection in Integrated Sensing, Computing and Communication
2024 IEEE International Conference on Communications workshops conference-paper Computer Science Privacy-Preserving Technologies in Data

Paul Zheng, Yao Pan Zhu, Anke Schmeink

2

citations
A Dynamic Programming Approach for Alignments on Process Trees
2025 Lecture notes in business information processing conference-paper Business, Management and Accounting Business Process Modeling and Analysis Open access

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

6

citations