| Multiflow feasibility: an annotated tableau G Naves, A Sebő Research Trends in Combinatorial Optimization, 261-283, 2009 | 39 | 2009 |
| Approximating rooted Steiner networks J Cheriyan, B Laekhanukit, G Naves, A Vetta ACM Transactions on Algorithms (TALG) 11 (2), 8, 2014 | 29 | 2014 |
| Maximum Edge-Disjoint Paths in k-Sums of Graphs C Chekuri, G Naves, FB Shepherd Automata, Languages, and Programming: 40th International Colloquium, ICALP …, 2013 | 14 | 2013 |
| The graphs with the max-Mader-flow-min-multiway-cut property G Naves, V Jost Arxiv preprint arXiv:1101.2061, 2011 | 6 | 2011 |
| The hardness of routing two pairs on one face G Naves Mathematical Programming, 1-21, 2010 | 6 | 2010 |
| Maximum flows on disjoint paths G Naves, N Sonnerat, A Vetta Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2010 | 6 | 2010 |
| A simple and optimal algorithm for strict circular seriation M Carmona, V Chepoi, G Naves, P Préa SIAM Journal on Mathematics of Data Science 5 (1), 201-221, 2023 | 5 | 2023 |
| When Do Gomory--Hu Subtrees Exist? G Naves, B Shepherd SIAM Journal on Discrete Mathematics 36 (3), 1567-1585, 2022 | 5 | 2022 |
| Isometric Embedding of Busemann Surfaces into L_1 J Chalopin, V Chepoi, G Naves Discrete & Computational Geometry 53 (1), 16-37, 2015 | 5 | 2015 |
| Modules in Robinson spaces M Carmona, V Chepoi, G Naves, P Préa SIAM Journal on Discrete Mathematics 38 (1), 190-224, 2024 | 4 | 2024 |
| Packing and covering with balls on Busemann surfaces V Chepoi, B Estellon, G Naves Discrete & Computational Geometry 57 (4), 985-1011, 2017 | 4 | 2017 |
| Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators G Naves, FB Shepherd, H Xia Mathematical Programming 197 (2), 1049-1067, 2023 | 3 | 2023 |
| Two Simple but Efficient Algorithms to Recognize Robinson Dissimilarities M Carmona, V Chepoi, G Naves, P Préa Journal of Classification, 1-25, 2023 | 2 | 2023 |
| Non-redistributive second welfare theorems B Laekhanukit, G Naves, A Vetta International Workshop on Internet and Network Economics, 227-243, 2012 | 2 | 2012 |
| Balancing lists: A proof pearl G Naves, A Spiwack Interactive Theorem Proving: 5th International Conference, ITP 2014, Held as …, 2014 | 1 | 2014 |
| Congestion in planar graphs with demands on faces G Naves, C Weibel Arxiv preprint arXiv:1008.3653, 2010 | 1 | 2010 |
| The steady-states of splitter networks B Couëtoux, B Gastaldi, G Naves arXiv preprint arXiv:2404.05472, 2024 | | 2024 |
| Integer Multiflows in Acyclic Planar Digraphs G Naves Combinatorica 43 (5), 1031-1043, 2023 | | 2023 |
| Modules and PQ-trees in Robinson spaces M Carmona, V Chepoi, G Naves, P Préa arXiv preprint arXiv:2306.08800, 2023 | | 2023 |
| Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators G Naves, B Shepherd, H Xia Integer Programming and Combinatorial Optimization: 22nd International …, 2021 | | 2021 |
Victor ChepoiLIS, Aix-Marseille UniversitéVerified email at lis-lab.fr
