1. Computing and sampling minimum (s,t)-cuts in weighted planar graphs in polynomial time;Bezáková;Theor. Comput. Sci.,2012
2. On counting oracles for path problems;Bezáková,2018
3. Subquadratic algorithms for diameter and sum of pairwise distances in planar graphs;Cabello,2017
4. Almost optimal distance oracles for planar graphs;Charalampopoulos,2019
5. Efficient algorithm for finding k shortest paths based on re-optimization technique;Chen;Transp. Res., Part E, Logist. Transp. Rev.,2020