From

Institution

Field

Type

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

Reset

Papers matching “polynomial complexity” 104

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Free algebras of modular forms on ball quotients
2025 Research in the Mathematical Sciences article Mathematics Advanced Algebra and Geometry Open access

Haowu Wang, Brandon Williams

0

citations
Efficient and robust estimation of many-qubit Hamiltonians
2024 Nature Communications article Computer Science Quantum Computing Algorithms and Architecture Open access

Daniel Stilck França, Liubov A. Markovich, V. V. Dobrovitski, Albert H. Werner, Johannes Borregaard

31

citations
Randomized Least-Squares with Minimal Oversampling and Interpolation in General Spaces
2024 SIAM Journal on Numerical Analysis article Mathematics Mathematical Approximation and Integration Open access

Matthieu Dolbeault, Abdellah Chkifa

10

citations
Expressing and Exploiting Subgoal Structure in Classical Planning Using Sketches
2024 Journal of Artificial Intelligence Research article Computer Science AI-based Problem Solving and Planning Open access

Dominik Drexler, Jendrik Seipp, Héctor Geffner

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
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
Algorithms for Claims Trading
2026 ACM Transactions on Computation Theory article Economics, Econometrics and Finance Banking stability, regulation, efficiency Open access

Carmine Ventre, Lisa Wilhelmi

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
Showcasing straight-line programs with memory via matrix Bruhat decomposition
2024 International Journal of Algebra and Computation article Computer Science Polynomial and algebraic computation Open access

Alice C. Niemeyer, Tomasz Popiel, Cheryl E. Praeger, Daniel Rademacher

0

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
Hermitian and Unitary Almost-Companion Matrices of Polynomials on Demand
2023 Entropy article Computer Science Matrix Theory and Algorithms Open access

Liubov A. Markovich, Agostino Migliore, ANTONINO MESSINA

0

citations
Efficiently and Effectively Recognizing Toricity of Steady State Varieties
2020 Mathematics in Computer Science article Computer Science Polynomial and algebraic computation Open access

10

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
Robust minimum cost flow problem under consistent flow constraints
2021 Annals of Operations Research article Computer Science Complexity and Algorithms in Graphs Open access

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

10

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
Stackelberg Max Closure with Multiple Followers
2022 Mathematics of Operations Research article Computer Science Complexity and Algorithms in Graphs Open access

Karsten Jungnitsch, Britta Peis, Marc Schröder

3

citations
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization
2022 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

René Beier, Heiko Röglin, Clemens Rösner, Berthold Vöcking

2

citations
Digital quantum simulations of the nonresonant open Tavis-Cummings model
2025 Physical Review Research article Computer Science Quantum Computing Algorithms and Architecture Open access

Aby Philip, Alex H. Rubin, Rahul Bandyopadhyay, Marina Radulaski, Mark M. Wilde

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
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
Robust two-dose vaccination schemes and the directed b -matching problem
2024 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs Open access

Jenny Segschneider, Arie M. C. A. Koster

1

citations
The norm of the saturation of a binomial ideal, with applications to Markov bases
2020 Algebraic Statistics article Computer Science Polynomial and algebraic computation Open access

David Holmes

0

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

Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior

0

citations
Symmetric Proofs in the Ideal Proof System
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access

Benedikt Pago

0

citations
Dynamic debt swapping in financial networks
2026 Theoretical Computer Science article Computer Science Complexity and Algorithms in Graphs Open access

Henri Froese, Martin Hoefer, Lisa Wilhelmi

0

citations