Metric Graph Theory and Related Topics
Théorie métrique des graphes et interactions
6 – 10 December 2021
|
Scientific Committee
Comité scientifique Hans-Jürgen Bandelt (University of Hamburg) |
Organizing Committee
Comité d’organisation Cristina Bazgan (Université Paris-Dauphine) contact: mgt-2021@lis-lab.fr |
|
This conference project aims at connecting quite distant areas of mathematics and computer science via common or similar distance and discrete models. The objective is to bring together researchers interested in the study of combinatorial, algorithmic, geometric, and topological structure of graphs occurring in metric graph theory and related fields such as geometric group theory, concurrency theory, or combinatorial optimization. Sharing knowledge arising from these different fields will be very useful to solve questions in computer science, discrete mathematics, and combinatorial optimization. We would also like to stimulate the conception of efficient algorithms for distance problems related to data analysis, network analysis, distributed computing, and seriation.
The conference will also be an opportunity to celebrate Victor Chepoi’s contributions to the field of metric graph theory. |
Cette conférence vise à regrouper des chercheurs issus de plusieurs domaines des mathématiques et de l’informatique qui travaillent sur des modèles discrets ou basés sur la notion de distance. L’objectif est de regrouper des chercheurs interessés par les structures combinatoires, algorithmiques, métriques et topologiques qui apparaissent en théorie métrique des graphes et dans des domaines connexes tels que la théorie géométrique des groupes, la théorie de la concurrence ou l’optimisation combinatoire. Mettre en commun les connaissances issues de ces différents domaines devrait s’avérer fructueux pour résoudre des questions d’informatique, de mathématiques discrètes et d’optimisation com-binatoire. Nous souhaitons également contribuer à la conception d’algorithmes efficaces pour des problèmes de distance apparaissant en analyse de données, en analyse de réseaux,en algorithmique distribuée et en sériation.
Cette conférence sera également l’occasion de célébrer les contributions de Victor Chepoi dans le domaine de la théorie métrique des graphes. |
Laurine Bénéteau (LIS, Aix-Marseille Université) Medians in median graphs and their cube complexes in linear time
Oussama Bensaid (Université de Paris) Coarse Embeddings of Symmetric Spaces and Euclidean Buildings
Pierre Bergé (LIP, ENS Lyon) All eccentricities on median graphs in subquadratic time
Daniel Berlyne (University of Bristol) Non-positive curvature in graph braid groups
Brian Bowditch (University of Warwick) A Cartan-Hadamard theorem for median metric spaces
Nicolas Bousquet (CNRS, Grenoble INP) Local certification of/on sparse graph classes
Boštjan Brešar (University of Maribor) On the prefiber function and betweenness
Sergio Cabello (University of Ljubljana) Distance-related problems in planar graphs and graphs of bounded treewidth
Jérémie Chalopin (CNRS, Aix-Marseille Université) Event Structures, Median Graphs, and CAT(0) Cube Complexes
Indira Chatterji (Université Côte d’Azur) Horospherical random graphs
Dibyayan Chakraborty (ENS Lyon) Recent advances on algorithms for geodetic sets
Vašek Chvátal (University of Concordia) A De Bruijn – Erdős Theorem in Graphs?
Feodor Dragan (Kent State University) 30+ years of collaboration with Victor
Cornelia Drutu (University of Oxford) Median geometry, non-positive curvature and actions on Banach spaces
Guillaume Ducoffe (University of Bucharest) The diameter problem on graphs: a geometric point of view
Andrei Eliseev (Higher School of Economics) Lower bounds for ε-saturation time of star graphs
Louis Esperet (CNRS, Grenoble INP) Isometric universal graphs
Ugo Giocanti (Laboratoire Paul Cézanne) Graphs with convex balls and groups acting on them
Hiroshi Hirai (University of Tokyo) Metric Graph Theory in Combinatorial Optimization
Nima Hoda (ENS Paris) Strongly shortcut spaces
Jeni Jacob (University of Kerala) Segment transit function of the interval function and the induced path function of graphs and their first-order definability
Jingyin Huang (The Ohio State University) Artin groups, hyperplane arrangement complements and Helly groups
Lekshmi Kamal (University of Kerala) The axiomatic characterization of the interval function of Ptolemaic and bridged graphs
Kolja Knauer (University of Barcelona) sAMPle COMpression
Urs Lang (ETH Zürich) A combinatorial higher rank hyperbolicity condition
Ioana-Claudia Lazar (University of Timisoara) 8-located complexes and 5/9-complexes
Khandoker Mohammed Mominul Haque (University of Shahjalal Science and Technology) On Full Friendly index sets of generalized Petersen graphs P(n, 2)
Nabil Mustafa (LIPN, Université Paris 13) Efficient Constructions of Matchings for the Crossing Metric
Damian Osajda (Wroclaw University) Weakly modular graphs in group theory
Harry Petyt (University of Bristol) Mapping class groups and CAT(0) cube complexes
Pascal Préa (LIS, Ecole Centrale Marseille) Recognition Algorithms for Triadic and Multiway Distances, with an Application to Approximation into a Distance, an Ultrametric or a Robinson Dissimilarity
Piotr Przytycki (McGill University) Subgraphs of diameter 1 in graphs of girth 2
Yuri Rabinovich (University of Haïfa) Online embeddings of metrics
Yaar Solomon (Unversity of Ben-Gurion) Multiscale substitution tilings
Laurent Viennot (INRIA, Université Paris Diderot) Compact representation of distances in a graph: a tour around 2-hop labelings
José Zamora (University of Andres Bello) Lines in quasi-metric spaces
 |
 |
 |
 |
 |