# LATIN2018

Our paper on “Efficient Algorithms for Listing K Disjoint st-Paths in Graphs” has been accepted for LATIN 2018, which will be held in Buenos Aires. Thanks to my coauthors Roberto Grossi and Luca Versari. Given a connected graph G of m edges and n vertices, we consider the basic problem of listing all the choices[…]