Aachen papers per year

Papers 14

Routing electric vehicles with a single recharge per route
2020 Networks article Engineering Vehicle Routing Optimization Methods Open access

Maximilian Löffler, Guy Desaulniers, Stefan Irnich, Michael Schneider

17

citations
A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group
2023 Networks article Engineering Vehicle Routing Optimization Methods Open access

Rossana Cavagnini, Michael Schneider, Alina Theiß

4

citations
A tabu search with geometry‐based sparsification methods for angular traveling salesman problems
2023 Networks article Engineering Vehicle Routing Optimization Methods Open access

Rossana Cavagnini, Michael Schneider, Alina Theiß

3

citations
The complexity of the timetable‐based railway network design problem
2023 Networks article Engineering Railway Systems and Energy Efficiency Open access

Nadine Friesen, Tim Sander, Christina Büsing, Karl Nachtigall, Nils Nießen

3

citations
An A‐Priori‐Splitting‐Based Heuristic for the Split Delivery Vehicle Routing Problem With Time Windows
2025 Networks article Engineering Vehicle Routing Optimization Methods

Christian Becker

2

citations
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
A flow‐based ascending auction to compute buyer‐optimal Walrasian prices
2024 Networks article Economics, Econometrics and Finance Game Theory and Voting Systems Open access

Katharina Eickhoff, S. Thomas McCormick, Britta Peis, Niklas Rieken, Laura Vargas Koch

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

14 results

Most active Aachen authors

Christina Büsing 641 citations overall
6 papers
Corinna Mathwieser 2 citations overall
4 papers
Michael Schneider 4,939 citations overall
3 papers
Arie M. C. A. Koster 3,667 citations overall
2 papers
Rossana Cavagnini 97 citations overall
2 papers
Sabrina Schmitz 17 citations overall
2 papers
Alina Theiß 7 citations overall
2 papers
Mariia Anapolska 6 citations overall
2 papers
Britta Peis 492 citations overall
1 paper
Felix Engelhardt 345 citations overall
1 paper
Nils Nießen 327 citations overall
1 paper
Maximilian Löffler 217 citations overall
1 paper
Martin Comis 80 citations overall
1 paper
Timo Gersing 22 citations overall
1 paper
Christian Becker 14 citations overall
1 paper

Networks ▲ Sign in to save

Aachen papers per year

Papers 14

Most active Aachen authors

Networks Sign in to save