
Laurent Viennot
135
Documents
Présentation
Publications
Publications
|
On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs2025
Pré-publication, Document de travail
hal-04863343
v1
|
|
Minimum-Cost Temporal Walks under Waiting-Time Constraints in Linear Time2023
Pré-publication, Document de travail
hal-03864725
v2
|
|
A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs2023
Pré-publication, Document de travail
hal-04054527
v1
|
|
Accurate programmable resistances from few inaccurate resistors2022
Pré-publication, Document de travail
hal-05094371
v1
|
|
Efficient Loop Detection in Forwarding Networks and Representing Atoms in a Field of Sets2018
Pré-publication, Document de travail
hal-01868778
v1
|
|
Decomposing a Graph into Shortest Paths with Bounded Eccentricity2017
Pré-publication, Document de travail
hal-01511357
v2
|
|
Parameterized Restless Temporal PathFCT 2025 - 25th International Symposium on Fundamentals of Computation Theory, Sep 2025, Wroclaw, Poland
Communication dans un congrès
hal-05144137
v1
|
|
Making Temporal Betweenness Computation Faster and RestlessKDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Aug 2024, Barcelona, Spain. pp.163-174, ⟨10.1145/3637528.3671825⟩
Communication dans un congrès
hal-04901946
v1
|
|
Temporalizing Digraphs via Linear-Size Balanced Bi-TreesSTACS 2024 - 41st International Symposium on Theoretical Aspects of Computer Science, Mar 2024, Clermont-Ferrand, France. pp.13:1-13:12, ⟨10.4230/LIPIcs.STACS.2024.13⟩
Communication dans un congrès
hal-04531675
v1
|
|
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in GraphsProceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan 2025, New Orleans (LA), United States. pp.2157--2193, ⟨10.1137/1.9781611978322.70⟩
Communication dans un congrès
hal-01729748
v4
|
|
Practical Computation of Graph VC-DimensionSEA 2024 - Symposium on Experimental Algorithms, Jul 2024, Vienne, Austria. pp.20, ⟨10.4230/LIPIcs.SEA.2024.8⟩
Communication dans un congrès
hal-04553784
v1
|
|
Efficient Collaborative Tree Exploration with Breadth-First Depth-NextInternational Symposium on Distributed Computing (DISC 2023), Oct 2023, L'aquila, Italy. ⟨10.4230/LIPIcs.DISC.2023.14⟩
Communication dans un congrès
hal-04427770
v2
|
|
Revisiting the Random Subset Sum problem31st Annual European Symposium on Algorithms (ESA 2023), Sep 2023, Amsterdam, Netherlands. pp.37:1--37:11, ⟨10.4230/LIPIcs.ESA.2023.37⟩
Communication dans un congrès
hal-03654720
v2
|
|
Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-NextPODC '23: 2023 ACM Symposium on Principles of Distributed Computing, Jun 2023, Orlando FL, United States. pp.24-27, ⟨10.1145/3583668.3594568⟩
Communication dans un congrès
hal-04429961
v1
|
|
Neural Network Information Leakage through Hidden LearningOLA2023 - International Conference on Optimization and Learning, May 2023, Malaga, Spain. pp.117-128, ⟨10.1007/978-3-031-34020-8_8⟩
Communication dans un congrès
hal-03157141
v4
|
|
Hyperbolicity Computation through Dominating SetsALENEX 2022 - SIAM Symposium on Algorithm Engineering and Experiments, Jan 2022, Alexandria, VA, United States. pp.78-90, ⟨10.1137/1.9781611977042.7⟩
Communication dans un congrès
hal-03431155
v2
|
|
Proving the Strong Lottery Ticket Hypothesis for Convolutional Neural NetworksICLR 2022 - 10th International Conference on Learning Representations, Apr 2022, Virtual, France
Communication dans un congrès
hal-03548226
v1
|
|
Dominer pour calculer l'hyperbolicité des graphesAlgoTel 2022 - 24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2022, Saint-Rémy-Lès-Chevreuse, France
Communication dans un congrès
hal-03648264
v2
|
|
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimensionSODA 2020 - ACM-SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, United States
Communication dans un congrès
hal-02340382
v1
|
|
Fast Public Transit Routing with Unrestricted Walking through Hub LabelingSpecial Event on Analysis of Experimental Algorithms (SEA2), Jun 2019, Kalamata, Greece
Communication dans un congrès
hal-02161283
v1
|
|
Fast Diameter Computation within Split GraphsCOCOA 2019 - 13th Annual International Conference on Combinatorial Optimization and Applications, Dec 2019, Xiamen, China
Communication dans un congrès
hal-03373614
v1
|
|
Hardness of Exact Distance Queries in Sparse Graphs Through Hub LabelingPODC '19 - ACM Symposium on Principles of Distributed Computing, Jul 2019, Toronto, Canada. pp.272-279, ⟨10.1145/3293611.3331625⟩
Communication dans un congrès
hal-02429930
v1
|
|
Independent Lazy Better-Response Dynamics on Network GamesCIAC 2019 2019 : 11th International Conference on Algorithms and Complexity, May 2019, Rome, Italy
Communication dans un congrès
hal-01373411
v3
|
|
Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and BeyondICALP 2019 - 46th International Colloquium on Automata, Languages, and Programming, Jul 2019, Patras, Greece
Communication dans un congrès
hal-01737210
v2
|
|
Beyond Highway Dimension: Small Distance Labels Using Tree SkeletonsSODA 2017 - 28th ACM-SIAM Symposium on Discrete Algorithms, Jan 2017, Barcelona, Spain
Communication dans un congrès
hal-01359084
v2
|
Decomposing a Graph into Shortest Paths with Bounded Eccentricity28th International Symposium on Algorithms and Computation (ISAAC 2017), Dec 2017, Phuket, Thailand. ⟨10.4230/LIPIcs.ISAAC.2017.15⟩
Communication dans un congrès
hal-01671718
v1
|
|
|
Vérification de tables de routage par utilisation d'un ensemble représentatif d'en-têtesALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France
Communication dans un congrès
hal-01148595
v1
|
|
LiveRank: How to Refresh Old CrawlsAlgorithms and Models for the Web Graph - 11th International Workshop (WAW 2014), Dec 2014, Beijing, China. pp.148 - 160, ⟨10.1007/978-3-319-13123-8_12⟩
Communication dans un congrès
hal-01093188
v1
|
|
LiveRank : comment faire du neuf avec du vieux ?ALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le Bois-Plage-en-Ré, France. pp.1-4
Communication dans un congrès
hal-00986031
v1
|
Self-organizing Flows in Social NetworksStructural Information AND Communication Complexity - 20th International Colloquium, SIROCCO, Jul 2013, Ischia, Italy. pp.116-128
Communication dans un congrès
hal-00909718
v1
|
|
|
Modularité asymptotique de quelques classes de graphes14èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2012, La grande motte, France. pp.1-4
Communication dans un congrès
hal-00688935
v1
|
|
Asymptotic Modularity of some Graph Classes22nd International Symposium on Algorithms and Computation (ISAAC), Dec 2011, Yokohama, Japan. pp.435-444
Communication dans un congrès
hal-00909733
v1
|
|
Treewidth and Hyperbolicity of the Internet10th IEEE International Symposium on Network Computing and Applications (IEEE NCA), Aug 2011, Boston, United States. pp.25-32
Communication dans un congrès
hal-00909736
v1
|
|
Clustering de métrique et clustering de graphe13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), May 2011, Cap Estérel, France
Communication dans un congrès
inria-00583844
v1
|
|
Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant SpannersOPODIS'11 - 15th International Conference on Principles of Distributed Systems, Dec 2011, Toulouse, France. pp.143-158, ⟨10.1007/978-3-642-25873-2_11⟩
Communication dans un congrès
hal-00651825
v1
|
|
Graphes de recouvrement multichemins12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Maria Gradinariu Potop-Butucaru and Hervé Rivano, 2010, Belle Dune, France
Communication dans un congrès
inria-00475970
v1
|
|
Multipath SpannersStructural Information and Communication Complexity, 17th International Colloquium (SIROCCO), Jun 2010, Sirince, Turkey. pp.211-223, ⟨10.1007/978-3-642-13284-1_17⟩
Communication dans un congrès
inria-00547869
v1
|
Spanners additifs de taille sous-quadratique pour les graphes orientés12e Journées Graphes et Algorithmes, Oct 2010, Marseille, France. pp.9
Communication dans un congrès
hal-00984933
v1
|
|
|
Average Size of Unstretched Remote-Spanners5th ACM Workshop on Analytic Algorithmics and Combinatorics (ANALCO), 2009, New York, United States. pp.23--33
Communication dans un congrès
inria-00471727
v1
|
|
Fine Tuning of a Distributed VoD System18th IEEE International Conference on Computer Communications and Networks (ICCCN), Aug 2009, San Francisco, United States. pp.1--7, ⟨10.1109/ICCCN.2009.5235272⟩
Communication dans un congrès
inria-00471730
v1
|
|
An Upload Bandwidth Threshold for Peer-to-Peer Video-on-Demand Scalability23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), May 2009, Rome, Italy. pp.1--10, ⟨10.1109/IPDPS.2009.5161047⟩
Communication dans un congrès
inria-00471728
v1
|
|
Remote spanners: what to know beyond neighbors23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), May 2009, Rome, Italy. pp.1--10, ⟨10.1109/IPDPS.2009.5161041⟩
Communication dans un congrès
inria-00471726
v1
|
Local Computation of Nearly Additive SpannersDISC, Sep 2009, Elche/Elx, Spain. pp.176-190
Communication dans un congrès
hal-00408725
v1
|
|
|
Le modèle Inframétrique pour Internet10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), 2008, Saint-Malo, France. pp.73-76
Communication dans un congrès
inria-00374460
v1
|
On the Locality of Distributed Sparse Spanner Construction27th Annual ACM Symposium on Principles of Distributed Computing (PODC), Aug 2008, Toronto, Canada. pp.273-282, ⟨10.1145/1400751.1400788⟩
Communication dans un congrès
hal-00343001
v1
|
|
Construction locale de sous-graphes couvrants peu denses10ièmes Rencontres francophones sur les aspects algorithmiques des télécommunications (AlgoTel), Saint-Malo, France, 2008, May 2008, France. pp.105-108
Communication dans un congrès
hal-00368035
v1
|
|
|
The Inframetric Model for the Internet27th IEEE International Conference on Computer Communications (INFOCOM), Apr 2008, Phoenix, United States. pp.1085-1093, ⟨10.1109/INFOCOM.2008.163⟩
Communication dans un congrès
inria-00471723
v1
|
|
Achievable Catalog Size in Peer-to-Peer Video-on-Demand SystemsProceedings of the 7th Internnational Workshop on Peer-to-Peer Systems (IPTPS), Feb 2008, Tampa Bay, United States. pp.1-6
Communication dans un congrès
inria-00471724
v1
|
|
Automatic Optimisation of Reliable Collaborative Services in OLSR Mobile Ad Hoc NetworksProceedings of IEEE MILCOM: Military Commununications Conference, Oct 2007, Orlando, United States. pp.1-7, ⟨10.1109/MILCOM.2007.4454993⟩
Communication dans un congrès
inria-00471721
v1
|
|
Acyclic Preference Systems in P2P NetworksProceedings of the 13th International Euro-Par Conference - Euro-Par 2007, Aug 2007, Rennes, France. pp.825-834, ⟨10.1007/978-3-540-74466-5_88⟩
Communication dans un congrès
inria-00471720
v1
|
|
On Using Matching Theory to Understand P2P Network DesignINOC 2007, International Network Optimization Conference, 2007, Spa, Belgium
Communication dans un congrès
hal-00159678
v1
|
|
Bi-connexité, k-connexité et multipoints relais9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.9-12
Communication dans un congrès
inria-00176939
v1
|
|
Incentive, Resilience and Load Balancing in Multicasting through Clustered de Bruijn Overlay Network (PrefixStream)14th IEEE International Conference on Networks (ICON), Sep 2006, Singapore, Singapore. pp.1-6, ⟨10.1109/ICON.2006.302673⟩
Communication dans un congrès
inria-00471718
v1
|
|
Local Aspects of the Global Ranking of Web Pages6th International Workshop on Innovative Internet Community Systems (I2CS), Jun 2006, Neuchâtel, Switzerland. pp.493-506
Communication dans un congrès
inria-00160799
v1
|
|
Optimizing and Balancing Load in Fully Distributed P2P File Sharing SystemsProceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT-ICIW), Feb 2006, Guadeloupe, France. pp.111-115, ⟨10.1109/AICT-ICIW.2006.145⟩
Communication dans un congrès
inria-00471717
v1
|
|
Ad hoc communication between intelligent vehicles5th International Conference on ITS Telecommunications - ITST 2005, Jun 2005, Brest, France
Communication dans un congrès
inria-00126674
v1
|
|
Broose: A Practical Distributed Hashtable Based on the De-Bruijn TopologyProceedings of the 4th International Conference on Peer-to-Peer Computing (P2P), 2004, Zurich, Switzerland. pp.167-174
Communication dans un congrès
inria-00471714
v1
|
|
Aspects locaux de l'importance globale des pages web5es rencontres francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL'2003), May 2003, Banyuls-sur-mer, France
Communication dans un congrès
inria-00471708
v1
|
|
Ad hoc routing protocols with multipoint relaying5es rencontres francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL), May 2003, Banyuls-sur-mer, France
Communication dans un congrès
inria-00471709
v1
|
|
Optimizing Route Length in Reactive Protocols for Ad Hoc NetworksMed-hoc-Net, Sep 2002, Sardegna, Italy
Communication dans un congrès
inria-00471701
v1
|
|
Performance Analysis of OLSR Multipoint Relay Flooding in Two Ad Hoc Wireless Network ModelsThe second IFIP-TC6 NETWORKING Conference, 2002, Pisa, Italy
Communication dans un congrès
inria-00471700
v1
|
|
Efficient and Simple Encodings for the Web GraphThe Third International Conference on Web-Age Information Management (WAIM), Aug 2002, Beijing, China. ⟨10.1007/3-540-45703-8_30⟩
Communication dans un congrès
inria-00471704
v1
|
|
Investigating Data Broadcast Performance in Mobile Ad Hoc NetworksThe 5th International Symposium on Wireless Personal Multimedia Communications (WPMC), Oct 2002, Honolulu, United States. pp.1-5, ⟨10.1109/WPMC.2002.1088283⟩
Communication dans un congrès
inria-00471705
v1
|
|
Comparative Study of Routing Protocols for Mobile Ad Hoc NetworksMed-hoc-Net, Sep 2002, Sardegna, Italy
Communication dans un congrès
inria-00471702
v1
|
|
Investigating the Impact of Partial Topology in Proactive MANET Routing ProtocolsThe 5th International Symposium on Wireless Personal Multimedia Communications (WPMC), Oct 2002, Honolulu, United States. ⟨10.1109/WPMC.2002.1088405⟩
Communication dans un congrès
inria-00471706
v1
|
|
Comparative Study of CBR and TCP Performance of MANET Routing ProtocolsWorkshop on Broadband Wireless Ad-Hoc Networks and Services, Sep 2002, Sophia-Antipolis, France
Communication dans un congrès
inria-00471707
v1
|
|
Spatial reuse in wireless LAN networksPersonal Wireless Communications (IFIP PWC'2001), Aug 2001, Lappeenranta, Finland. pp.209-222
Communication dans un congrès
inria-00471698
v1
|
|
Impact of Interferences on Bandwidth Reservation for Ad Hoc Networks: a First Theoretical StudyIEEE Conference and Exhibition on Global Telecommunications (GLOBECOM), Nov 2001, San Antonio, United States. pp.2907 - 2910, ⟨10.1109/GLOCOM.2001.965960⟩
Communication dans un congrès
inria-00471697
v1
|
|
Multipoint relaying for flooding broadcast messages in mobile wireless networks35th Annual Hawaii International Conference on System Sciences (HICSS'2002), Jan 2002, Maui, United States. pp.3866 - 3875
Communication dans un congrès
inria-00471699
v1
|
|
Optimized Link State Routing Protocol for Ad Hoc NetworksMulti Topic Conference, 2001. IEEE INMIC 2001, 2001, Lahore, Pakistan. pp.62 - 68, ⟨10.1109/INMIC.2001.995315⟩
Communication dans un congrès
inria-00471622
v1
|
|
Quality of service aspect for BRAIN architecture11th IEEE International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC), 2000, London, United Kingdom. pp.1-5
Communication dans un congrès
inria-00471696
v1
|
|
Un premier pas vers la réservation de bande passante dans les réseaux radio2es rencontres francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL), 2000, La Rochelle, France. pp.25-30
Communication dans un congrès
inria-00471695
v1
|
|
Partition refinement and graph decompositionSymposium on Discrete Algorithms (SODA), 1999, Baltimore, United States. pp.1-2
Communication dans un congrès
inria-00471612
v1
|
|
A Synthesis on Partition Refinement: a Usefull Routine for Strings, Graphs, Boolean Matrices and AutomataSTACS: Symposium on Theoretical Aspects of Computer Science, Feb 1998, Paris, France. pp.25-38, ⟨10.1007/BFb0028546⟩
Communication dans un congrès
istex
inria-00471611
v1
|
|
From parallel comparability graph recognition and modular decomposition13th Symposium on Theoretical Aspects of Computer Science (STACS), 1996, Grenoble, France. pp.169-180, ⟨10.1007/3-540-60922-9_15⟩
Communication dans un congrès
inria-00471608
v1
|
|
A compact data structure and parallel algorithms for permutation graphs21st Workshop on Graph-Theoretic Concepts in computer Science (WG), 1995, Aachen, Germany. pp.372-380, ⟨10.1007/3-540-60618-1⟩
Communication dans un congrès
inria-00471607
v1
|
|
Jouez avec les neurones de la machine2017, pp.1-3
Article de blog scientifique
hal-01620451
v1
|
On the Locality of Distributed Sparse Spanner Construction2008
Autre publication scientifique
hal-00400407
v1
|
|
|
Optimized Link State Routing Protocol (OLSR)2003
Autre publication scientifique
inria-00471712
v1
|
|
Algorithmes des graphes et des réseauxJacky Akoka, Isabelle Comyn-Wattiau. Encyclopédie de l'informatique et des systèmes d'information, Vuibert, pp.936-945, 2006
Chapitre d'ouvrage
inria-00471716
v1
|
|
Autour des graphes et du routageAlgorithme et structure de données [cs.DS]. Université Paris-Diderot - Paris VII, 2005
HDR
tel-00471731
v1
|
|
Local Structure in the Web12th international conference on the World Wide Web, May 2003, Budapest, Hungary. 2003
Poster de conférence
inria-00471711
v1
|
Quatrièmes Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel)Thomas Noel AND Laurent Viennot. INRIA, 165 p, 2002
Ouvrages
inria-00471627
v1
|
|
Quelques algorithmes parallèles et séquentiels de traitement des graphes et applicationsAlgorithme et structure de données [cs.DS]. Université Paris-Diderot - Paris VII, 1996. Français. ⟨NNT : ⟩
Thèse
tel-00471691
v1
|
Chargement...
Chargement...