From

Institution

Field

Type

Topic: Complexity and Algorithms in Graphs ×

Journal / venue: Networks ×

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

Reset

Papers in Complexity and Algorithms in Graphs 8

Sort: Cited Newest Oldest Fwci Patents ⇩ CSV

Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
2024 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Corinna Mathwieser, Eranda Çela

2

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
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
Complexity of the Directed Robust b‐Matching Problem and Its Variants on Different Graph Classes
2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Jenny Segschneider, Arie M. C. A. Koster

0

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
Minimum‐Peak‐Cost Flows Over Time
2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Mariia Anapolska, Emma Ahrens, Christina Büsing, Felix Engelhardt, Timo Gersing, Corinna Mathwieser, +2 more

0

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
Perfect Matching Under Precedence Constraints
2025 Networks article Computer Science Complexity and Algorithms in Graphs Open access

0

citations

8 results