1. On dynamic approximate shortest paths for planar graphs with worst-case costs;Abraham I.;Proceedings of SODA. SIAM,2016
2. A depth-first algorithm to reduce graphs in linear time;Bartha M.;Proceedings of SYNASC. IEEE,2009
3. Bast, H. et al. Route planning in transportation networks. Algorithm Engineering---Selected Results and Surveys 9220. LNCS, Springer, 2016, 19--80; (2016).
4. Finding Hamiltonian circuits in proper interval graphs
5. Solving Real-World Linear Programs: A Decade and More of Progress