Laurent Viennot

Orcid: 0000-0003-3657-6979

Affiliations:
  • INRIA, France


According to our database1, Laurent Viennot authored at least 76 papers between 1995 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Practical Computation of Graph VC-Dimension.
Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

Temporalizing Digraphs via Linear-Size Balanced Bi-Trees.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Making Temporal Betweenness Computation Faster and Restless.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

2023
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks.
Networks, March, 2023

A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs.
CoRR, 2023

Breadth-First Depth-Next: Optimal Collaborative Exploration of Trees with Low Diameter.
CoRR, 2023

Efficient Collaborative Tree Exploration with Breadth-First Depth-Next.
Proceedings of the 37th International Symposium on Distributed Computing, 2023

Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Computing Temporal Reachability Under Waiting-Time Constraints in Linear Time.
Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Neural Network Information Leakage Through Hidden Learning.
Proceedings of the Optimization and Learning - 6th International Conference, 2023

Revisiting the Random Subset Sum Problem.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik-Chervonenkis Dimension.
SIAM J. Comput., 2022

Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation.
ACM J. Exp. Algorithmics, 2022

Minimum-Cost Temporal Walks under Waiting-Time Constraints in Linear Time.
CoRR, 2022

Proving the Lottery Ticket Hypothesis for Convolutional Neural Networks.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Computing Graph Hyperbolicity Using Dominating Sets.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021
Mitigating COVID-19 outbreaks in workplaces and schools by hybrid telecommuting.
PLoS Comput. Biol., 2021

On computing Pareto optimal paths in weighted time-dependent networks.
Inf. Process. Lett., 2021

Fast Diameter Computation within Split Graphs.
Discret. Math. Theor. Comput. Sci., 2021

Hyperbolicity Computation through Dominating Sets.
CoRR, 2021

On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation.
CoRR, 2021

2020
Decomposing a graph into shortest paths with bounded eccentricity.
Discret. Appl. Math., 2020

Diameter computation on <i>H</i>-minor free graphs and graphs of bounded (distance) VC-dimension.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
A Comparative Study of Neural Network Compression.
CoRR, 2019

Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension.
CoRR, 2019

Fast Public Transit Routing with Unrestricted Walking Through Hub Labeling.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Independent Lazy Better-Response Dynamics on Network Games.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018
Efficient Loop Detection in Forwarding Networks and Representing Atoms in a Field of Sets.
CoRR, 2018

Exact Distance Oracles Using Hopsets.
CoRR, 2018

Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates.
CoRR, 2018

2017
Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
LiveRank: How to Refresh Old Datasets.
Internet Math., 2016

Forwarding Tables Verification through Representative Header Sets.
CoRR, 2016

2015
Self-organizing flows in social networks.
Theor. Comput. Sci., 2015

2014
LiveRank: How to Refresh Old Crawls.
Proceedings of the Algorithms and Models for the Web Graph - 11th International Workshop, 2014

2013
Toward more localized local algorithms: removing assumptions concerning global knowledge.
Distributed Comput., 2013

2011
Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

Treewidth and Hyperbolicity of the Internet.
Proceedings of The Tenth IEEE International Symposium on Networking Computing and Applications, 2011

Asymptotic Modularity of Some Graph Classes.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Multipath Spanners.
Proceedings of the Structural Information and Communication Complexity, 2010

Local Aspects of the Global Ranking of Web Pages.
Proceedings of the 10th International Conference on Innovative Internet Community Services (I<sup>2</sup>CS), 2010

2009
Local Computation of Nearly Additive Spanners.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Remote-spanners: What to know beyond neighbors.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Fine Tuning of a Distributed VoD System.
Proceedings of the 18th International Conference on Computer Communications and Networks, 2009

Average Size of Unstretched Remote-Spanners.
Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009

2008
Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms
CoRR, 2008

On the locality of distributed sparse spanner construction.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Achievable catalog size in peer-to-peer video-on-demand systems.
Proceedings of the 7th international conference on Peer-to-peer systems, 2008

The Inframetric Model for the Internet.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007
Acyclic Preference Systems in P2P Networks.
Proceedings of the Euro-Par 2007, 2007

2006
On Using Matching Theory to Understand P2P Network Design
CoRR, 2006

Optimizing and Balancing Load in Fully Distributed P2P File Sharing Systems.
Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT/ICIW 2006), 2006

2005
Computing Connected Dominated Sets with Multipoint Relays.
Ad Hoc Sens. Wirel. Networks, 2005

Autour des graphes et du routage. (About graphs and routing).
, 2005

2004
Analyzing Control Traffic Overhead versus Mobility and Data Traffic Activity in Mobile Ad-Hoc Network Protocols.
Wirel. Networks, 2004

Broose: A Practical Distributed Hashtable Based on the De-Bruijn Topology.
Proceedings of the 4th International Conference on Peer-to-Peer Computing (P2P 2004), 2004

2003
Local Structure in the Web.
Proceedings of the Twelfth International World Wide Web Conference - Posters, 2003

2002
Efficient and Simple Encodings for the Web Graph.
Proceedings of the Advances in Web-Age Information Management, 2002

Performance of Multipoint Relaying in Ad Hoc Mobile Routing Protocols.
Proceedings of the NETWORKING 2002, 2002

Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks.
Proceedings of the 35th Hawaii International Conference on System Sciences (HICSS-35 2002), 2002

2001
Some Algorithms for Synchronizing Clocks of Base Transceiver Stations in a Cellular Network.
J. Parallel Distributed Comput., 2001

Linear time recognition of P4-indifference graphs.
Discret. Math. Theor. Comput. Sci., 2001

Spatial Reuse in Wireless LAN Networks.
Proceedings of the Emerging Personal Wireless Communications, 2001

Impact of interferences on bandwidth reservation for ad hoc networks: a first theoretical study.
Proceedings of the Global Telecommunications Conference, 2001

2000
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing.
Theor. Comput. Sci., 2000

Quality of service aspect for BRAIN architecture.
Proceedings of the 11th IEEE International Symposium on Personal, 2000

1999
Partition Refinement Techniques: An Interesting Algorithmic Tool Kit.
Int. J. Found. Comput. Sci., 1999

1998
A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata.
Proceedings of the STACS 98, 1998

1997
Parallel N-Free Order Recognition.
Theor. Comput. Sci., 1997

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

Parallel Comparability Graph Recognition and Modular Decomposition.
Proceedings of the STACS 96, 1996

1995
A Compact Data Structure and Parallel Algorithms for Permutation Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995


  Loading...