The following pages link to Christian Liebchen (Q458495):
Displayed 19 items.
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Classes of cycle bases (Q868389) (← links)
- Integral cycle bases for cyclic timetabling (Q1013300) (← links)
- A greedy approach to compute a minimum cycle basis of a directed graph (Q1041731) (← links)
- Computing delay resistant railway timetables (Q1046699) (← links)
- New length bounds for cycle bases (Q2380021) (← links)
- The zoo of tree spanner problems (Q2476246) (← links)
- (Q2847383) (← links)
- The Second Chvatal Closure Can Yield Better Railway Timetables (Q2917362) (← links)
- (Q3525416) (← links)
- (Q3525417) (← links)
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications (Q3649157) (← links)
- On the Benefit of Preprocessing and Heuristics for Periodic Timetabling (Q4685851) (← links)
- Lower bounds for strictly fundamental cycle bases in grid graphs (Q5191140) (← links)
- Periodic Timetable Optimization in Public Transport (Q5391727) (← links)
- When Periodic Timetables Are Suboptimal (Q5391963) (← links)
- Benchmarks for Strictly Fundamental Cycle Bases (Q5432326) (← links)
- Experimental and Efficient Algorithms (Q5710035) (← links)
- Algorithms - ESA 2003 (Q5897288) (← links)