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 “approximate dynamic programming” 1

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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

1 result