Laurent Viennot
|
Books And Theses
Articles
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs,
SODA 2025, New Orleans (LA), United States
SODA 2025, New Orleans (LA), United States
Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor,
Journal of Computer and System Sciences 2023
Journal of Computer and System Sciences 2023
Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next,
PODC 2023, Orlando FL, United States
PODC 2023, Orlando FL, United States
Dominer pour calculer l'hyperbolicité des graphes,
AlgoTel 2022 - 24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications 2022, Saint-Rémy-Lès-Chevreuse, France
AlgoTel 2022 - 24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications 2022, Saint-Rémy-Lès-Chevreuse, France
Proving the Strong Lottery Ticket Hypothesis for Convolutional Neural Networks,
ICLR 2022 - 10th International Conference on Learning Representations 2022, Virtual, France
ICLR 2022 - 10th International Conference on Learning Representations 2022, Virtual, France
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension,
SODA 2020, Salt Lake City, United States
SODA 2020, Salt Lake City, United States
Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling,
PODC 2019, Toronto, Canada
PODC 2019, Toronto, Canada
Fast Public Transit Routing with Unrestricted Walking Through Hub Labeling,
SEA² 2019, Kalamata, Greece
SEA² 2019, Kalamata, Greece
Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond,
ICALP 2019, Patras, Greece
ICALP 2019, Patras, Greece
Efficient Loop Detection in Forwarding Networks and Representing Atoms in a Field of Sets,
CoRR 2018
CoRR 2018
Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates,
CoRR 2018
CoRR 2018
Toward more localized local algorithms: removing assumptions concerning global knowledge,
Distributed Computing 2015
Distributed Computing 2015
Vérification de tables de routage par utilisation d'un ensemble représentatif d'en-têtes,
ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications 2015, Beaune, France
ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications 2015, Beaune, France
LiveRank : comment faire du neuf avec du vieux ?,
ALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications 2014, Le Bois-Plage-en-Ré, France
ALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications 2014, Le Bois-Plage-en-Ré, France
Modularité asymptotique de quelques classes de graphes,
14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel) 2012, La grande motte, France
14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel) 2012, La grande motte, France
Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners,
OPODIS 2011, Toulouse, France
OPODIS 2011, Toulouse, France
Clustering de métrique et clustering de graphe,
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel) 2011, Cap Estérel, France
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel) 2011, Cap Estérel, France
Spanners additifs de taille sous-quadratique pour les graphes orientés,
12e Journées Graphes et Algorithmes 2010, Marseille, France
12e Journées Graphes et Algorithmes 2010, Marseille, France
Graphes de recouvrement multichemins,
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel) 2010, Belle Dune, France
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel) 2010, Belle Dune, France
Achievable catalog size in peer-to-peer video-on-demand systems,
IPTPS 2008, Tampa Bay, United States
IPTPS 2008, Tampa Bay, United States
Le modèle Inframétrique pour Internet,
10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08) 2008, Saint-Malo, France
10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08) 2008, Saint-Malo, France
Construction locale de sous-graphes couvrants peu denses,
10ièmes Rencontres francophones sur les aspects algorithmiques des télécommunications (AlgoTel), Saint-Malo, France, 2008 2008, France
10ièmes Rencontres francophones sur les aspects algorithmiques des télécommunications (AlgoTel), Saint-Malo, France, 2008 2008, France
Automatic Optimisation of Reliable Collaborative Services in OLSR Mobile Ad Hoc Networks,
Proceedings of IEEE MILCOM: Military Commununications Conference 2007, Orlando, United States
Proceedings of IEEE MILCOM: Military Commununications Conference 2007, Orlando, United States
Bi-connexité, k-connexité et multipoints relais,
9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications 2007, Ile d'Oléron, France
9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications 2007, Ile d'Oléron, France
Incentive, Resilience and Load Balancing in Multicasting through Clustered de Bruijn Overlay Network (PrefixStream),
14th IEEE International Conference on Networks (ICON) 2006, Singapore, Singapore
14th IEEE International Conference on Networks (ICON) 2006, Singapore, Singapore
Optimizing and Balancing Load in Fully Distributed P2P File Sharing Systems,
AICT/ICIW 2006, Guadeloupe, France
AICT/ICIW 2006, Guadeloupe, France
Ad hoc communication between intelligent vehicles,
5th International Conference on ITS Telecommunications - ITST 2005 2005, Brest, France
5th International Conference on ITS Telecommunications - ITST 2005 2005, Brest, France
Broose: A Practical Distributed Hashtable Based on the De-Bruijn Topology,
Peer-to-Peer Computing 2004, Zurich, Switzerland
Peer-to-Peer Computing 2004, Zurich, Switzerland
Ad hoc routing protocols with multipoint relaying,
5es rencontres francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL) 2003, Banyuls-sur-mer, France
5es rencontres francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL) 2003, Banyuls-sur-mer, France
Aspects locaux de l'importance globale des pages web,
5es rencontres francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL'2003) 2003, Banyuls-sur-mer, France
5es rencontres francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL'2003) 2003, Banyuls-sur-mer, France
Investigating Data Broadcast Performance in Mobile Ad Hoc Networks,
The 5th International Symposium on Wireless Personal Multimedia Communications (WPMC) 2002, Honolulu, United States
The 5th International Symposium on Wireless Personal Multimedia Communications (WPMC) 2002, Honolulu, United States
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks,
HICSS 2002, Maui, United States
HICSS 2002, Maui, United States
Comparative Study of CBR and TCP Performance of MANET Routing Protocols,
Workshop on Broadband Wireless Ad-Hoc Networks and Services 2002, Sophia-Antipolis, France
Workshop on Broadband Wireless Ad-Hoc Networks and Services 2002, Sophia-Antipolis, France
Investigating the Impact of Partial Topology in Proactive MANET Routing Protocols,
The 5th International Symposium on Wireless Personal Multimedia Communications (WPMC) 2002, Honolulu, United States
The 5th International Symposium on Wireless Personal Multimedia Communications (WPMC) 2002, Honolulu, United States
Comparative Study of Routing Protocols for Mobile Ad Hoc Networks,
Med-hoc-Net 2002, Sardegna, Italy
Med-hoc-Net 2002, Sardegna, Italy
Optimizing Route Length in Reactive Protocols for Ad Hoc Networks,
Med-hoc-Net 2002, Sardegna, Italy
Med-hoc-Net 2002, Sardegna, Italy
Performance Analysis of OLSR Multipoint Relay Flooding in Two Ad Hoc Wireless Network Models,
The second IFIP-TC6 NETWORKING Conference 2002, Pisa, Italy
The second IFIP-TC6 NETWORKING Conference 2002, Pisa, Italy
Impact of interferences on bandwidth reservation for ad hoc networks: a first theoretical study,
GLOBECOM 2001
GLOBECOM 2001
Optimized Link State Routing Protocol for Ad Hoc Networks,
Multi Topic Conference, 2001. IEEE INMIC 2001 2001, Lahore, Pakistan
Multi Topic Conference, 2001. IEEE INMIC 2001 2001, Lahore, Pakistan
Un premier pas vers la réservation de bande passante dans les réseaux radio,
2es rencontres francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL) 2000, La Rochelle, France
2es rencontres francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL) 2000, La Rochelle, France
Partition refinement and graph decomposition,
Symposium on Discrete Algorithms (SODA) 1999, Baltimore, United States
Symposium on Discrete Algorithms (SODA) 1999, Baltimore, United States
A Synthesis on Partition Refinement: a Usefull Routine for Strings, Graphs, Boolean Matrices and Automata,
STACS: Symposium on Theoretical Aspects of Computer Science 1998, Paris, France
STACS: Symposium on Theoretical Aspects of Computer Science 1998, Paris, France
From parallel comparability graph recognition and modular decomposition,
13th Symposium on Theoretical Aspects of Computer Science (STACS) 1996, Grenoble, France
13th Symposium on Theoretical Aspects of Computer Science (STACS) 1996, Grenoble, France
Journal articles
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks,
Networks 2023
Networks 2023
Diameter, eccentricities and distance oracle computations on H-minor free graphs and graphs of bounded (distance) VC-dimension,
SIAM Journal on Computing 2022
SIAM Journal on Computing 2022
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation,
ACM Journal of Experimental Algorithmics 2022
ACM Journal of Experimental Algorithmics 2022
Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik-Chervonenkis Dimension,
SIAM J. Comput. 2022
SIAM J. Comput. 2022
Fast Diameter Computation within Split Graphs,
Discrete Mathematics and Theoretical Computer Science 2021
Discrete Mathematics and Theoretical Computer Science 2021
Mitigating COVID-19 outbreaks in workplaces and schools by hybrid telecommuting,
PLoS Computational Biology 2021
PLoS Computational Biology 2021
On computing Pareto optimal paths in weighted time-dependent networks,
Information Processing Letters 2021
Information Processing Letters 2021
Decomposing a graph into shortest paths with bounded eccentricity,
Discret. Appl. Math. 2020, Phuket, Thailand
Discret. Appl. Math. 2020, Phuket, Thailand
Analyzing Control Traffic Overhead versus Mobility and Data Traffic Activity in Mobile Ad-Hoc Network Protocols,
Wireless Networks 2004
Wireless Networks 2004
Linear time recognition of P4-indifference graphs,
Discrete Mathematics and Theoretical Computer Science 2001
Discrete Mathematics and Theoretical Computer Science 2001
Some Algorithms for Synchronizing Clocks of Base Transceiver Stations in a Cellular Network,
Journal of Parallel and Distributed Computing 2001
Journal of Parallel and Distributed Computing 2001
Lex-BFS a partition refining technique, application to transitive orientation and consecutive 1's testing,
Theoretical Computer Science 2000
Theoretical Computer Science 2000
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing,
Theor. Comput. Sci. 2000
Theor. Comput. Sci. 2000
Partition Refinement Techniques: An Interesting Algorithmic Tool Kit,
Int. J. Found. Comput. Sci. 1999
Int. J. Found. Comput. Sci. 1999
Reports
Hdr
Editorship
Miscs
Generated using
minifold
and minifold-lincs
at 2025-03-08 01:18.