The following pages link to Algorithms - ESA 2003 (Q5897288):
Displaying 18 items.
- An experimental comparison of periodic timetabling models (Q336491) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Railway track allocation: Models and methods (Q657061) (← links)
- Properties of Gomory-Hu co-cycle bases (Q764362) (← links)
- Cyclic matrices of weighted digraphs (Q765371) (← links)
- Classes of cycle bases (Q868389) (← links)
- Integral cycle bases for cyclic timetabling (Q1013300) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- A combinatorial proof of the removal lemma for groups (Q1024351) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- A greedy approach to compute a minimum cycle basis of a directed graph (Q1041731) (← links)
- A characterization of circle graphs in terms of total unimodularity (Q2122669) (← links)
- Minimizing the waiting time for a one-way shuttle service (Q2305017) (← links)
- New length bounds for cycle bases (Q2380021) (← links)
- Minimum cycle bases of graphs over different fields (Q3439388) (← links)
- On a Special Co-cycle Basis of Graphs (Q3512471) (← links)
- Minimum Cycle Bases and Their Applications (Q3637310) (← links)
- Integrating Passengers' Routes in Periodic Timetabling: A SAT approach. (Q5240221) (← links)
