A Compact Data Structure and Parallel Algorithms for Permutation Graphs. - Jens Gustedt; Michel Morvan; Laurent Viennot (WG, 1995)

Parallel Comparability Graph Recognition and Modular Decomposition. - Michel Morvan; Laurent Viennot (STACS, 1996)

Quelques algorithmes parallèles et séquentiels de traitement des graphes et applications. (Parallel and sequential algorithms for graphs). - Laurent Viennot (1996)

Parallel N-Free Order Recognition. - Laurent Viennot (Theor. Comput. Sci., 1997)

A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata. - Michel Habib; Christophe Paul; Laurent Viennot (STACS, 1998)

Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. - Michel Habib; Christophe Paul; Laurent Viennot (Int. J. Found. Comput. Sci., 1999)

Quality of service aspect for BRAIN architecture. - Cédric Adjih; Khaldoun Al Agha; François Dumontet; Philippe Jacquet; Alberto López; Laurent Viennot (PIMRC, 2000)

Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. - Michel Habib; Ross M. McConnell; Christophe Paul; Laurent Viennot (Theor. Comput. Sci., 2000)

Impact of interferences on bandwidth reservation for ad hoc networks: a first theoretical study. - Karell Bertet; Claude Chaudet; Isabelle Guérin Lassous; Laurent Viennot (GLOBECOM, 2001)

Spatial Reuse in Wireless LAN Networks. - Khaldoun Al Agha; Laurent Viennot (PWC, 2001)

Linear time recognition of P4-indifference graphs. - Michel Habib; Christophe Paul; Laurent Viennot (Discret. Math. Theor. Comput. Sci., 2001)

Some Algorithms for Synchronizing Clocks of Base Transceiver Stations in a Cellular Network. - Jean-Louis Dornstetter; Daniel Krob; Michel Morvan; Laurent Viennot (J. Parallel Distributed Comput., 2001)

Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks. - Amir Qayyum; Laurent Viennot; Anis Laouiti (HICSS, 2002)

Performance of Multipoint Relaying in Ad Hoc Mobile Routing Protocols. - Philippe Jacquet; Anis Laouiti; Pascale Minet; Laurent Viennot (NETWORKING, 2002)

Efficient and Simple Encodings for the Web Graph. - Jean-Loup Guillaume; Matthieu Latapy; Laurent Viennot (WAIM, 2002)

Local Structure in the Web. - Fabien Mathieu; Laurent Viennot (WWW (Posters), 2003)

Broose: A Practical Distributed Hashtable Based on the De-Bruijn Topology. - Anh-Tuan Gai; Laurent Viennot (Peer-to-Peer Computing, 2004)

Analyzing Control Traffic Overhead versus Mobility and Data Traffic Activity in Mobile Ad-Hoc Network Protocols. - Laurent Viennot; Philippe Jacquet; Thomas Heide Clausen (Wirel. Networks, 2004)

Autour des graphes et du routage. (About graphs and routing). - Laurent Viennot (2005)

Computing Connected Dominated Sets with Multipoint Relays. - Cédric Adjih; Philippe Jacquet; Laurent Viennot (Ad Hoc Sens. Wirel. Networks, 2005)

Optimizing and Balancing Load in Fully Distributed P2P File Sharing Systems. - Anh-Tuan Gai; Laurent Viennot (AICT/ICIW, 2006)

On Using Matching Theory to Understand P2P Network Design - Dmitry Lebedev; Fabien Mathieu; Laurent Viennot; Anh-Tuan Gai; Julien Reynier; Fabien de Montgolfier (CoRR, 2006)

Acyclic Preference Systems in P2P Networks. - Anh-Tuan Gai; Dmitry Lebedev; Fabien Mathieu; Fabien de Montgolfier; Julien Reynier; Laurent Viennot (Euro-Par, 2007)

The Inframetric Model for the Internet. - Pierre Fraigniaud; Emmanuelle Lebhar; Laurent Viennot (INFOCOM, 2008)

Achievable catalog size in peer-to-peer video-on-demand systems. - Yacine Boufkhad; Fabien Mathieu; Fabien de Montgolfier; Diego Perino; Laurent Viennot (IPTPS, 2008)

On the locality of distributed sparse spanner construction. - Bilel Derbel; Cyril Gavoille; David Peleg; Laurent Viennot (PODC, 2008)

Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms - Laurent Viennot; Yacine Boufkhad; Fabien Mathieu; Fabien de Montgolfier; Diego Perino (CoRR, 2008)

Average Size of Unstretched Remote-Spanners. - Philippe Jacquet; Laurent Viennot (ANALCO, 2009)

Fine Tuning of a Distributed VoD System. - Yacine Boufkhad; Fabien Mathieu; Fabien de Montgolfier; Diego Perino; Laurent Viennot (ICCCN, 2009)

An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability. - Yacine Boufkhad; Fabien Mathieu; Fabien de Montgolfier; Diego Perino; Laurent Viennot (IPDPS, 2009)

Remote-spanners: What to know beyond neighbors. - Philippe Jacquet; Laurent Viennot (IPDPS, 2009)

Local Computation of Nearly Additive Spanners. - Bilel Derbel; Cyril Gavoille; David Peleg; Laurent Viennot (DISC, 2009)

Local Aspects of the Global Ranking of Web Pages. - Fabien Mathieu; Laurent Viennot (IICS, 2010)

Multipath Spanners. - Cyril Gavoille; Quentin Godfroy; Laurent Viennot (SIROCCO, 2010)

Asymptotic Modularity of Some Graph Classes. - Fabien de Montgolfier; Mauricio Soto; Laurent Viennot (ISAAC, 2011)

Treewidth and Hyperbolicity of the Internet. - Fabien de Montgolfier; Mauricio Soto; Laurent Viennot (NCA, 2011)

Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners. - Cyril Gavoille; Quentin Godfroy; Laurent Viennot (OPODIS, 2011)

Toward more localized local algorithms: removing assumptions concerning global knowledge. - Amos Korman; Jean-Sébastien Sereni; Laurent Viennot (Distributed Comput., 2013)

LiveRank: How to Refresh Old Crawls. - The Dang Huynh; Fabien Mathieu; Laurent Viennot (WAW, 2014)

Self-organizing flows in social networks. - Nidhi Hegde 001; Laurent Massoulié; Laurent Viennot (Theor. Comput. Sci., 2015)

Forwarding Tables Verification through Representative Header Sets. - Yacine Boufkhad; Ricardo De La Paz; Leonardo Linguaglossa; Fabien Mathieu; Diego Perino; Laurent Viennot (CoRR, 2016)

LiveRank: How to Refresh Old Datasets. - The Dang Huynh; Fabien Mathieu; Laurent Viennot (Internet Math., 2016)

Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons. - Adrian Kosowski; Laurent Viennot (SODA, 2017)

Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates. - Feodor F. Dragan; Michel Habib; Laurent Viennot (CoRR, 2018)

Exact Distance Oracles Using Hopsets. - Siddharth Gupta 002; Adrian Kosowski; Laurent Viennot (CoRR, 2018)

Efficient Loop Detection in Forwarding Networks and Representing Atoms in a Field of Sets. - Laurent Viennot; Yacine Boufkhad; Leonardo Linguaglossa; Fabien Mathieu; Diego Perino (CoRR, 2018)

Independent Lazy Better-Response Dynamics on Network Games. - Paolo Penna; Laurent Viennot (CIAC, 2019)

Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond. - Siddharth Gupta 002; Adrian Kosowski; Laurent Viennot (ICALP, 2019)

Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling. - Adrian Kosowski; Przemyslaw Uznanski; Laurent Viennot (PODC, 2019)

Fast Public Transit Routing with Unrestricted Walking Through Hub Labeling. - Duc-Minh Phan; Laurent Viennot (SEA², 2019)

Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. - Guillaume Ducoffe; Michel Habib; Laurent Viennot (CoRR, 2019)

A Comparative Study of Neural Network Compression. - Hossein Baktash; Emanuele Natale; Laurent Viennot (CoRR, 2019)

Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. - Guillaume Ducoffe; Michel Habib; Laurent Viennot (SODA, 2020)

Decomposing a graph into shortest paths with bounded eccentricity. - Etienne Birmelé; Fabien de Montgolfier; Léo Planche; Laurent Viennot (Discret. Appl. Math., 2020)

On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation. - Filippo Brunelli; Pierluigi Crescenzi; Laurent Viennot (CoRR, 2021)

Hyperbolicity Computation through Dominating Sets. - David Coudert; André Nusser; Laurent Viennot (CoRR, 2021)

Fast Diameter Computation within Split Graphs. - Guillaume Ducoffe; Michel Habib; Laurent Viennot (Discret. Math. Theor. Comput. Sci., 2021)

On computing Pareto optimal paths in weighted time-dependent networks. - Filippo Brunelli; Pierluigi Crescenzi; Laurent Viennot (Inf. Process. Lett., 2021)

Mitigating COVID-19 outbreaks in workplaces and schools by hybrid telecommuting. - Simon Mauras; Vincent Cohen-Addad; Guillaume Duboc; Max Dupré la Tour; Paolo Frasca; Claire Mathieu; Lulla Opatowski; Laurent Viennot (PLoS Comput. Biol., 2021)

Computing Graph Hyperbolicity Using Dominating Sets. - David Coudert; André Nusser; Laurent Viennot (ALENEX, 2022)

Proving the Lottery Ticket Hypothesis for Convolutional Neural Networks. - Arthur da Cunha 001; Emanuele Natale; Laurent Viennot (ICLR, 2022)

Minimum-Cost Temporal Walks under Waiting-Time Constraints in Linear Time. - Filippo Brunelli; Laurent Viennot (CoRR, 2022)

Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation. - David Coudert; André Nusser; Laurent Viennot (ACM J. Exp. Algorithmics, 2022)

Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik-Chervonenkis Dimension. - Guillaume Ducoffe; Michel Habib; Laurent Viennot (SIAM J. Comput., 2022)

Revisiting the Random Subset Sum Problem. - Arthur Carvalho Walraven da Cunha; Francesco D'Amore 001; Frédéric Giroire; Hicham Lesfari; Emanuele Natale; Laurent Viennot (ESA, 2023)

Neural Network Information Leakage Through Hidden Learning. - Arthur Carvalho Walraven da Cunha; Emanuele Natale; Laurent Viennot (OLA, 2023)

Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next. - Romain Cosson; Laurent Massoulié; Laurent Viennot (PODC, 2023)

Computing Temporal Reachability Under Waiting-Time Constraints in Linear Time. - Filippo Brunelli; Laurent Viennot (SAND, 2023)

Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor. - Michel Habib; Minh-Hang Nguyen; Mikaël Rabie; Laurent Viennot (SSS, 2023)

Efficient Collaborative Tree Exploration with Breadth-First Depth-Next. - Romain Cosson; Laurent Massoulié; Laurent Viennot (DISC, 2023)

Breadth-First Depth-Next: Optimal Collaborative Exploration of Trees with Low Diameter. - Romain Cosson; Laurent Massoulié; Laurent Viennot (CoRR, 2023)

A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs. - Alkida Balliu; Filippo Brunelli; Pierluigi Crescenzi; Dennis Olivetti; Laurent Viennot (CoRR, 2023)

Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks. - Filippo Brunelli; Pierluigi Crescenzi; Laurent Viennot (Networks, 2023)

Making Temporal Betweenness Computation Faster and Restless. - Filippo Brunelli; Pierluigi Crescenzi; Laurent Viennot (KDD, 2024)

Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. - Stéphane Bessy; Stéphan Thomassé; Laurent Viennot (STACS, 2024)

Practical Computation of Graph VC-Dimension. - David Coudert; Mónika Csikós; Guillaume Ducoffe; Laurent Viennot (SEA, 2024)

Bow Metrics and Hyperbolicity. - Feodor F. Dragan; Guillaume Ducoffe; Michel Habib; Laurent Viennot (CoRR, 2024)

Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs. - Feodor F. Dragan; Guillaume Ducoffe; Michel Habib; Laurent Viennot (SODA, 2025)

Forbidden patterns in temporal graphs resulting from encounters in a corridor. - Mónika Csikós; Michel Habib; Minh-Hang Nguyen; Mikaël Rabie; Laurent Viennot (J. Comput. Syst. Sci., 2025)

On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs. - Guillaume Aubian; Filippo Brunelli; Feodor F. Dragan; Guillaume Ducoffe; Michel Habib; Allen Ibiapina; Laurent Viennot (CoRR, 2025)

Parameterized Restless Temporal Path. - Justine Cauvi; Laurent Viennot (CoRR, 2025)