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

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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 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
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
Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
2024 Discrete Applied Mathematics article Computer Science Complexity and Algorithms in Graphs

Christina Büsing, Sabrina Schmitz

5

citations

5 results