Laurent Viennot
Orcid: 0000-0003-3657-6979Affiliations:
- INRIA, France
According to our database1,
Laurent Viennot
authored at least 74 papers
between 1995 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 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
Proceedings of the 37th International Symposium on Distributed Computing, 2023
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023
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
Proceedings of the Optimization and Learning - 6th International Conference, 2023
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
CoRR, 2022
Proceedings of the Tenth International Conference on Learning Representations, 2022
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022
2021
PLoS Comput. Biol., 2021
Inf. Process. Lett., 2021
Discret. Math. Theor. Comput. Sci., 2021
CoRR, 2021
2020
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
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension.
CoRR, 2019
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019
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
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
Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates.
CoRR, 2018
2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
2016
2015
2014
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
Proceedings of The Tenth IEEE International Symposium on Networking Computing and Applications, 2011
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011
2010
Proceedings of the Structural Information and Communication Complexity, 2010
Proceedings of the 10th International Conference on Innovative Internet Community Services (I<sup>2</sup>CS), 2010
2009
Proceedings of the Distributed Computing, 23rd International Symposium, 2009
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009
Proceedings of the 18th International Conference on Computer Communications and Networks, 2009
Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009
2008
CoRR, 2008
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008
Proceedings of the 7th international conference on Peer-to-peer systems, 2008
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008
2007
2006
Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT/ICIW 2006), 2006
2005
Ad Hoc Sens. Wirel. Networks, 2005
2004
Analyzing Control Traffic Overhead versus Mobility and Data Traffic Activity in Mobile Ad-Hoc Network Protocols.
Wirel. Networks, 2004
Proceedings of the 4th International Conference on Peer-to-Peer Computing (P2P 2004), 2004
2003
Proceedings of the Twelfth International World Wide Web Conference - Posters, 2003
2002
Proceedings of the Advances in Web-Age Information Management, 2002
Proceedings of the NETWORKING 2002, 2002
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
Discret. Math. Theor. Comput. Sci., 2001
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
Proceedings of the 11th IEEE International Symposium on Personal, 2000
1999
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
1996
Quelques algorithmes parallèles et séquentiels de traitement des graphes et applications. (Parallel and sequential algorithms for graphs).
PhD thesis, 1996
Proceedings of the STACS 96, 1996
1995
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995