A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

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

Papers matching “pseudo-polynomial time algorithm” 4

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
Robust Minimum Cost Flow Problem Under Consistent Flow Constraints
2020 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

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

0

citations
Optimal Refinement in Dynamic Discretisation Discovery for Continuous-Time Service Network Design
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Alexander Helber, Oliver Bachtler, Tom Wüllner

0

citations

4 results