From

Institution

Field

Type

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

Reset

Papers matching “polynomial complexity” 195

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Cylindrical algebraic decomposition based methods in satisfiability modulo non-linear real arithmetic
2025 RWTH Publications (RWTH Aachen) dissertation Computer Science Polynomial and algebraic computation Open access

Jasper Nalbach

0

citations
Reoptimization of parameterized problems
2022 Acta Informatica article Computer Science Advanced Graph Theory Research Open access

Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith

9

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
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 subset sum game revisited
2021 Theory of Computing Systems article Engineering Optimization and Packing Problems Open access

Astrid Pieterse, Gerhard J. Woeginger

1

citations
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
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
Learning One-Clock Timed Automata
2020 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Jie An, Mingshuai Chen, Bohua Zhan, Naijun Zhan, Miaomiao Zhang

33

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
Randomized least-squares with minimal oversampling and interpolation in general spaces
2023 arXiv (Cornell University) preprint Mathematics Mathematical Approximation and Integration Open access

Abdellah Chkifa, Matthieu Dolbeault

1

citations
Computing f-Divergences and Distances of High-Dimensional Probability Density Functions -- Low-Rank Tensor Approximations
2021 arXiv (Cornell University) preprint Mathematics Tensor decomposition and applications Open access

Alexander Litvinenko, Youssef Marzouk, Hermann Georg Matthies, Marco Scavino, Alessio Spantini

0

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
Komplexitätstheorie: Komplex oder Kompliziert?
2022 Studienbücher Informatik book-chapter Computer Science Complexity and Algorithms in Graphs

Bastian Küppers

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
On Projective Delineability
2024 International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) conference-paper Computer Science Polynomial and algebraic computation Open access

Lucas Michel, Jasper Nalbach, Pierre Mathonet, Naïm Zénaïdi, Christopher W. Brown, Erika Ábrahám, +2 more

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
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
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
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
Footprint-Based Conformance Checking for Object-Centric Process Trees
2026 Lecture notes in computer science conference-paper Business, Management and Accounting Business Process Modeling and Analysis

Jan Niklas van Detten, Christian Rennert, Aaron Küsters, van Der Aalst, Wil, M.P., Sander J. J. Leemans

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
An Investigation of the Recoverable Robust Assignment Problem
2020 RWTH Publications (RWTH Aachen) conference-paper Computer Science Complexity and Algorithms in Graphs Open access

Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger

6

citations