VLDB 2026 Research / reviewers in the wild / expert
Patrick Gemander
dblp:248/7376
· DBLP profile ↗
3ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-0784-6696ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 1 since 2021Computer networks · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph
Andreas Bärmann, Patrick Gemander, Maximilian Merkert, Ann-Kathrin Wiertz, Francisco Zaragoza 0001 |
Discret. Appl. Math. | 2 |
| 2023 | EETTlib - Energy-efficient train timetabling libraryabstractAbstract We introduce EETTlib, an instance library for the Energy‐Efficient Train Timetabling problem. The task in this problem is to adjust a given timetable draft such that the energy consumption of the resulting railway traffic is minimized. To this end, the departure times of the trains can be slightly, and their velocity profiles on each trip can be modified. We provide real‐world data originating from two research projects in this field, one with Deutsche Bahn AG, the most important railway company in Germany, the other with VAG Verkehrs‐Aktiengesellschaft, the operator of public transport in the city of Nürnberg, Germany. In both cases, our library contains representative data on the relevant operational constraints and supports various possible choices for the objective function with respect to energy‐efficiency. The resulting benchmark instances can be used by the scheduling and timetabling community to improve their models and algorithms. They are available under https://www.eettlib.fau.de . Andreas Bärmann, Patrick Gemander, Lukas Hager, Frederik Nöth, Oskar Schneider |
Networks | 2 |
| 2020 | The clique problem with multiple-choice constraints under a cycle-free dependency graph
Andreas Bärmann, Patrick Gemander, Maximilian Merkert |
Discret. Appl. Math. | 2 |