- D. Coudert, A. Nusser, L. Viennot, Enumeration of far-apart pairs by decreasing distance for faster hyperbolicity computation, ACM Journal of Experimental Algorithmics 2022.
- G. Ducoffe, M. Habib, L. Viennot, Diameter, eccentricities and distance oracle computations on H-minor free graphs and graphs of bounded (distance) VC-dimension, SIAM Journal on Computing 2022.
- F. Brunelli, P. Crescenzi, L. Viennot, On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation, Networks 2022.
- D. Coudert, A. Nusser, L. Viennot, Hyperbolicity Computation through Dominating Sets, ALENEX 2022.
- G. Ducoffe, M. Habib, L. Viennot, Fast Diameter Computation within Split Graphs, Discrete Mathematics and Theoretical Computer Science 2021.
- F. Brunelli, P. Crescenzi, L. Viennot, On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks, Information Processing Letters 2020.
- G. Ducoffe, M. Habib, L. Viennot, Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension, SODA 2020.
- M. Carmona, V. Chepoi, G. Naves, P. Préa, Modules in Robinson spaces, SIAM J. Discrete Mathematics (in revision).
- V. Chepoi, K. Kanuer, M. Philibert, Labeled sample compression schemes for complexes of oriented matroids, (submitted).
- J. Chalopin, V. Chepoi, U. Giocanti, Graphs with convex balls, Geometriae Dedicata (2023) https://doi.org/10.21203/rs.3.rs-2293810/v1.
- J. Chalopin, V. Chepoi, A. Genevois, H. Hirai, and D. Osajda, Helly groups, Geometry and Topology (to appear).
- M. Carmona, V. Chepoi, G. Naves, P. Préa, Modules and PQ-trees in Robinson spaces, (submitted)
- M. Carmona, V. Chepoi, G. Naves, P. Préa, A simple and optimal algorithm for strict circular seriation, SIAM J. on Mathematics of Data Science Vol. 5, Iss. 1 (2023) 10.1137/22M1495342
- J. Chalopin, M. Changat, V. Chepoi, J. Jacob, First-order logic axiomatization of metric graph theory, (submitted).
- J. Chalopin, V. Chepoi, F. McInerney, S. Ratel, Y. Vaxès, Sample compression schemes for balls in graphs, SIAM J. Discrete Mathematics (in revision) short version: MFCS 2022.
- G. Naves, F. B. Shepherd, When Do Gomory-Hu subtrees exist?, SIAM Journal on Discrete Mathematics Vol. 36, Iss. 3 (2022) 10.1137/20M1356968.
- L. Bénéteau, J. Chalopin, V. Chepoi, Y. Vaxès, ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G^2-connected medians, (submitted).
- L. Bénéteau, J. Chalopin, V. Chepoi, Y. Vaxès, Graphs with G^p-connected medians, Mathematical Programming, Ser B (2023) https://doi.org/10.1007/s10107-023-01939-3.
- G. Naves, B. Shepherd, H. Xia, Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators, Mathematical Programming 197 (2023), 1049–1067.
- H. La and P. Valicov, Computer assisted discharging procedure on planar graphs: application to 2-distance coloring, (submitted).
- M. Barbato, R. Grappe, M. Lacroix, E. Lancini, R. Wolfler Calvo, The Schrijver system of the flow cone in series–parallel graphs, Discrete Applied Mathematics 308 (2022), 162-167.
- M. Barbato, R. Grappe, M. Lacroix, E. Lancini, On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs, ISCO 2020: 27-41.
- M. Bonamy, B. Mohar, A. Wesolek, Limiting crossing numbers for geodesic drawings on the sphere, short version: Graph Drawing 2020.
- V. Bartier, L. Bénéteau, M. Bonamy, H. La, J. Narboni, A note on deterministic zombies, (submitted).
- V. Chepoi, K. Knauer, and M. Philibert, Ample completions of OMs and CUOMs, SIAM J. Discrete Mathematics, 36 (2022), 505--535.
- V. Dujmović, L. Esperet, G. Joret, C. Gavoille, P. Micek, P. Morin, Adjacency Labelling for Planar Graphs (and Beyond), J. of ACM 68 (2021), pp. 1--33, short version: FOCS 2020.
- M. Bonamy, M. Pilipczuk, J.S. Sereni, On the effect of symmetry requirement for rendezvous on the complete graph, (submitted).
- M. Bonamy, C. Gavoille, M. Pilipczuk, Shorter Labeling Schemes for Planar Graphs, short version: SODA 2020.
- M. Bonamy, P. Charbit, O. Defrain, G. Joret, A. Lagoutte, V. Limouzy, L. Pastor, J.-S. Sereni, Revisiting a theorem by Folkman on graph colouring, The Electronic Journal of Combinatorics (2020)
- M. Bonamy, N. Bousquet, L. Esperet, C. Groenland, F. Pirot, A. Scott, Surfaces have (asymptotic) dimension 2, (submitted).
- M. Bonamy, N. Morrison, A. Scott, Partitioning the vertices of a torus into isomorphic subgraphs, Journal of Combinatorial Theory, series A (2020).
- N. Bousquet, W. Cames van Batenburg, L. Esperet, G. Joret, W. Lochet, C. Muller, F. Pirot, Packing and covering balls in graphs excluding a minor, Combinatorica 41 (2021), 299–318.
- V. Chepoi, A. Labourel, and S. Ratel, Distance labeling schemes for K4-free bridged graphs, Information and Computation, 289 (2022), Part A, 104959, short version: SIROCCO 2020, pp.310-327.
- F. Foucaud, H. Hocquard, S. Mishra, N. Narayanan, R. Naserasr, É. Sopena, P. Valicov, Exact square coloring of subcubic planar graphs, (to appear in Discrete Applied Mathematics)
- S. Blind, K. Knauer, P. Valicov, Enumerating k-arc-connected orientations, Algorithmica 82 (2020), 3588-3603.
- P. Bergé, G. Ducoffe, M. Habib, Subquadratic-time algorithm for the diameter and all eccentricities on median graphs, STACS 2022, 9:1-9:21
- P. Bergé, M. Habib, Diameter, radius and all eccentricities in linear time for constant-dimension median graphs, LAGOS 2021, 97-107
- L. Bénéteau, J. Chalopin, V. Chepoi, Y. Vaxès, Medians in median graphs in linear time, Journal of Computer and System Science 126 (2022), 80-105, short version: ICALP 2020, pp.10:1-10:17.
- A. Kosowski, P. Uznanski, L. Viennot, Hardness of exact distance queries in sparse graphs through hub labeling, PODC 2019.
- L. Beaudou, G. Kahn, M. Rosenfeld, Bisplit graphs satisfy the Chen-Chvátal conjecture, DMTCS 21(1) (2019), #5
- L. Beaudou, R. Brewster, On the multipacking number of grid graphs, DMTCS 21(3) (2019), #23.
- S. Klavžar, K. Knauer, T. Marc On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs, (submitted).
- V. Chepoi, K. Knauer, and M. Philibert, Two-dimensional partial cubes, Electron. J. Combin. 27(3): P3.29 (2020).
- S. Felsner, W. Hochstättler, K. Knauer, R. Steiner Complete Acyclic Colorings, (submitted).
- O. Aichholzer, J. Cardinal, T. Huynh, K. Knauer, T. Mütze, R. Steiner, B. Vogtenhuber, Flip distances between graph orientations, WG 2019 (to appear).
- G. Guégan, K. Knauer, J. Rollin, T. Ueckerdt, The interval number of a planar graph is at most three, J. Combin. Th. Ser. B (to appear).
- S. Gupta, A. Kosowski, L. Viennot, Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond, short version: ICALP 2019, pp.143:1-143:15.
- J. Chalopin, V. Chepoi, S. Moran, and M. Warmuth, Unlabeled sample compression schemes and corner peelings for ample and maximum classes, Journal of Computer and System Science, 127 (2022), 1-28, short version: ICALP 2019, pp.34:1-34:15.
- F. Brucker, P. Préa, and C. Chatel, Totally balanced dissimilarities, J. Classification, 36 (2019), 1-20.
- É. Bonnet, N. Bousquet, P. Charbit, S. Thomassé, and R. Watrigant, Parameterized complexity of independent set in H-free graphs, short vestion: IPEC 2018, pp.17:1-17:13.
- M. Bonamy, E. Bonnet, N. Bousquet, P. Charbit, and S. Thomassé, EPTAS for max clique on disks and unit balls, short version: FOCS 2018, pp. 568-579.
- J. Chalopin and V. Chepoi, 1-Safe Petri nets and special cube complexes: equivalence and applications, ACM Transactions on Computational Logic, Vol. 20 (2019), No. 3, Article 17, 49 pages.
- J. Chalopin and V. Chepoi, A counterexample to Thiagarajan's conjecture, Journal of Computer and System Science 113 (2020), 76-100.
- J. Chalopin, V. Chepoi, F. Dragan, G. Ducoffe, A. Mohammed, and Y. Vaxès, Fast approximation and exact computation of negative curvature parameters of graphs, Discrete and Computational Geometry, 65 (2021), 856-892, short version: Symposium on Computational Geometry 2018, pp.22:1-22:15.
- V. Chepoi, F. F. Dragan, M. Habib, Y. Vaxès, and H. Al-Rasheed, Fast approximation of centrality and distances in hyperbolic graphs, Journal of Graph Algorithms and Applications 23 (2019), pp.393-433, short version: COCOA 2018, pp. 3-18.
- F. Dragan, M. Habib, and L. Viennot, Revisiting radius, diameter, and all eccentricity computation in graphs through certificates (submitted).
- M. Bonamy, P. Ouvrard, M. Rabie, J. Suomela, and J. Uitto, Distributed recoloring (submitted), short version: DISC 2018, pp.12:1-12:17.
- K. Knauer, P. Micek, and T. Ueckerdt, The queue-number of posets of bounded width or height, short version: Graph Drawing 2018, pp.200-212.
- K. Knauer and N. Nisse, Computing metric hulls in graphs, DMTCS (accepted).
- K. Knauer and T. Marc, On tope graphs of complexes of oriented matroids, Discrete & Computational Geometry 63 (2020), 377–417.
- I. García-Marco, K. Knauer, and L.P. Montejano, Chomp on generalized Kneser graphs and others, International Journal of Game Theory (accepted).
- S. Fujita, M. Furuya, R. Naserasr, K. Ozeki. A new approach towards a conjecture on intersecting three longest paths, Journal of Combinatorics, 10 (2019), 221-234.
- V. Chepoi, A. Labourel, and S. Ratel, Distance and routing labeling schemes for cube-free median graphs, Algorithmica, 83 (2021) 252-296, short version: MFCS 2019, pp.15:1-15:14.
- V. Chepoi, A. Labourel, and S. Ratel, On density of subgraphs of Cartesian products, J. Graph Theory 93 (2020), 64--87.
- V. Chepoi, A. Labourel, and S. Ratel, On density of subgraphs of halved cubes, European J. Combinatorics 80 (2019), 57-70 (memorial volume for Michel Deza).
- D. Cornaz, R. Grappe, and M. Lacroix, Trader multiflow and box-TDI systems in series-parallel graphs, Discrete Optimization 31 (2019), 103-114.
- M. Carmona, V. Chepoi, G. Naves, P. Préa, Two simple but efficient algorithms to recognize Robinson dissimilarities, (submitted)
- C. Châtel, F. Brucker and P. Préa, Binary set systems and totally balanced hypergraphs, Discrete Applied Mathematics 295 (2021), 120-133.