20 citations · 21 across the 2 of their papers we have counts for
2 papers
cs.DS2012★ 1 cited
How to Attack the NP-complete Dag Realization Problem in Practice
Annabell Berger, Matthias Müller-Hannemann
We study the following fundamental realization problem of directed acyclic graphs (dags). Given a sequence S:=(a_1,b_1),...,(a_n, b_n) with a_i, b_i in Z_0^+, does there exist a da…
cs.DS2010★ 20 cited
Phase Synchronization in Railway Timetables
Christoph Fretter, Lachezar Krumov, Karsten Weihe +2
Timetable construction belongs to the most important optimization problems in public transport. Finding optimal or near-optimal timetables under the subsidiary conditions of minimi…