| , , , : A simple and optimal algorithm for strict circular seriation. SIAM Journal on Mathematics of Data Science, 5, 201 -- 221. Society for Industrial and Applied Mathematics University City, Philadelphia, (2023). |
| , , , : Two Simple but Efficient Algorithms to Recognize Robinson Dissimilarities. Journal of Classification, 1 -- 25. Springer US New York, (2023). |
| , , : Packing and covering with balls on Busemann surfaces. Discrete & Computational Geometry, 57, 985 -- 1011. Springer US, (2017). |
| , , : Isometric embedding of Busemann surfaces into Discrete & Computational Geometry, 53, 16 -- 37. Springer US, (2015). |
| , , : Maximum Edge-Disjoint Paths in k-sums of Graphs. In: ICALP 2013: The 40th International Colloquium on Automata, Languages and Programming, LNCS 7965. Editor: F.V.Fomin et als., 328 -- 339. Springer, Heidelberg, (2013). |
| , , : Non-redistributive second welfare theorem. In: Wine 2012: The 8th Workshop on Internet & Network Economics. (2012). |
| , , , : Approximating Rooted Steiner Network. In: SODA 2012: Symposium On Discrete Algorithms. (2012). |
| : The hardness of routing two pairs on one face. Mathematical Programming, 131, 49 -- 69. Springer, (2012). |
| : Optimal Routings: tours, flows and paths. PhD. thesis, Joseph Fourier University, Grenoble, (2010). |
| , , : Maximum Flows on Disjoint Paths. In: APPROX 2010: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. , 326 -- 337. Lecture Notes in Computer Science, (2010). |