default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurent Viennot
Person information
- affiliation: INRIA, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c48]Filippo Brunelli
, Pierluigi Crescenzi, Laurent Viennot:
Making Temporal Betweenness Computation Faster and Restless. KDD 2024: 163-174- [c47]Stéphane Bessy, Stéphan Thomassé, Laurent Viennot:
Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. STACS 2024: 13:1-13:12 - [c46]David Coudert, Mónika Csikós, Guillaume Ducoffe, Laurent Viennot:
Practical Computation of Graph VC-Dimension. SEA 2024: 8:1-8:20 - [i28]David Coudert, Mónika Csikós, Guillaume Ducoffe, Laurent Viennot:
Practical Computation of Graph VC-Dimension. CoRR abs/2405.07588 (2024) - 2023
- [j17]Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot:
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks. Networks 81(2): 177-203 (2023) - [c45]Arthur Carvalho Walraven da Cunha, Francesco D'Amore, Frédéric Giroire, Hicham Lesfari, Emanuele Natale, Laurent Viennot:
Revisiting the Random Subset Sum Problem. ESA 2023: 37:1-37:11 - [c44]Arthur Carvalho Walraven da Cunha, Emanuele Natale, Laurent Viennot:
Neural Network Information Leakage Through Hidden Learning. OLA 2023: 117-128 - [c43]Romain Cosson, Laurent Massoulié, Laurent Viennot:
Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next. PODC 2023: 24-27 - [c42]Filippo Brunelli, Laurent Viennot:
Computing Temporal Reachability Under Waiting-Time Constraints in Linear Time. SAND 2023: 4:1-4:11 - [c41]Michel Habib, Minh-Hang Nguyen, Mikaël Rabie, Laurent Viennot:
Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor. SSS 2023: 344-358 - [c40]Romain Cosson, Laurent Massoulié, Laurent Viennot:
Efficient Collaborative Tree Exploration with Breadth-First Depth-Next. DISC 2023: 14:1-14:21 - [i27]Romain Cosson, Laurent Massoulié, Laurent Viennot:
Breadth-First Depth-Next: Optimal Collaborative Exploration of Trees with Low Diameter. CoRR abs/2301.13307 (2023) - [i26]Michel Habib, Minh-Hang Nguyen, Mikaël Rabie, Laurent Viennot:
Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor. CoRR abs/2302.07666 (2023) - [i25]Alkida Balliu, Filippo Brunelli, Pierluigi Crescenzi, Dennis Olivetti, Laurent Viennot:
A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs. CoRR abs/2304.00817 (2023) - [i24]Stéphane Bessy, Stéphan Thomassé, Laurent Viennot:
Temporalizing digraphs via linear-size balanced bi-trees. CoRR abs/2304.03567 (2023) - 2022
- [j16]David Coudert, André Nusser, Laurent Viennot:
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation. ACM J. Exp. Algorithmics 27: 1.15:1-1.15:29 (2022) - [j15]Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik-Chervonenkis Dimension. SIAM J. Comput. 51(5): 1506-1534 (2022) - [c39]David Coudert, André Nusser, Laurent Viennot:
Computing Graph Hyperbolicity Using Dominating Sets. ALENEX 2022: 78-90 - [c38]Arthur C. W. da Cunha, Emanuele Natale, Laurent Viennot:
Proving the Lottery Ticket Hypothesis for Convolutional Neural Networks. ICLR 2022 - [i23]Filippo Brunelli, Laurent Viennot:
Minimum-Cost Temporal Walks under Waiting-Time Constraints in Linear Time. CoRR abs/2211.12136 (2022) - 2021
- [j14]Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Fast Diameter Computation within Split Graphs. Discret. Math. Theor. Comput. Sci. 23(3) (2021) - [j13]Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot:
On computing Pareto optimal paths in weighted time-dependent networks. Inf. Process. Lett. 168: 106086 (2021) - [j12]Simon Mauras, Vincent Cohen-Addad, Guillaume Duboc, Max Dupré la Tour, Paolo Frasca, Claire Mathieu, Lulla Opatowski, Laurent Viennot:
Mitigating COVID-19 outbreaks in workplaces and schools by hybrid telecommuting. PLoS Comput. Biol. 17(8) (2021) - [i22]Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot:
On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks. CoRR abs/2101.02086 (2021) - [i21]David Coudert, André Nusser, Laurent Viennot:
Enumeration of Far-Apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation. CoRR abs/2104.12523 (2021) - [i20]Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot:
On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation. CoRR abs/2111.08328 (2021) - [i19]David Coudert, André Nusser, Laurent Viennot:
Hyperbolicity Computation through Dominating Sets. CoRR abs/2111.08520 (2021) - 2020
- [j11]Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot:
Decomposing a graph into shortest paths with bounded eccentricity. Discret. Appl. Math. 284: 353-374 (2020) - [c37]Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. SODA 2020: 1905-1922
2010 – 2019
- 2019
- [c36]Paolo Penna, Laurent Viennot:
Independent Lazy Better-Response Dynamics on Network Games. CIAC 2019: 352-364 - [c35]Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Fast Diameter Computation Within Split Graphs. COCOA 2019: 155-167 - [c34]Siddharth Gupta, Adrian Kosowski, Laurent Viennot:
Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond. ICALP 2019: 143:1-143:15 - [c33]Adrian Kosowski, Przemyslaw Uznanski, Laurent Viennot:
Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling. PODC 2019: 272-279 - [c32]Duc-Minh Phan, Laurent Viennot:
Fast Public Transit Routing with Unrestricted Walking Through Hub Labeling. SEA² 2019: 237-247 - [i18]Adrian Kosowski, Przemyslaw Uznanski, Laurent Viennot:
Hardness of exact distance queries in sparse graphs through hub labeling. CoRR abs/1902.07055 (2019) - [i17]Duc-Minh Phan, Laurent Viennot:
Fast Public Transit Routing with Unrestricted Walking through Hub Labeling. CoRR abs/1906.08971 (2019) - [i16]Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. CoRR abs/1907.04385 (2019) - [i15]Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Fast Diameter Computation within Split Graphs. CoRR abs/1910.03438 (2019) - [i14]Hossein Baktash, Emanuele Natale, Laurent Viennot:
A Comparative Study of Neural Network Compression. CoRR abs/1910.11144 (2019) - 2018
- [i13]Feodor F. Dragan, Michel Habib, Laurent Viennot:
Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates. CoRR abs/1803.04660 (2018) - [i12]Siddharth Gupta, Adrian Kosowski, Laurent Viennot:
Exact Distance Oracles Using Hopsets. CoRR abs/1803.06977 (2018) - [i11]Laurent Viennot, Yacine Boufkhad, Leonardo Linguaglossa, Fabien Mathieu, Diego Perino:
Efficient Loop Detection in Forwarding Networks and Representing Atoms in a Field of Sets. CoRR abs/1809.01896 (2018) - 2017
- [c31]Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot:
Decomposing a Graph into Shortest Paths with Bounded Eccentricity. ISAAC 2017: 15:1-15:13 - [c30]Adrian Kosowski, Laurent Viennot:
Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons. SODA 2017: 1462-1478 - 2016
- [j10]The Dang Huynh, Fabien Mathieu, Laurent Viennot:
LiveRank: How to Refresh Old Datasets. Internet Math. 12(1-2): 68-84 (2016) - [i10]The Dang Huynh, Fabien Mathieu, Laurent Viennot:
LiveRank: How to Refresh Old Datasets. CoRR abs/1601.01191 (2016) - [i9]Yacine Boufkhad, Ricardo De La Paz, Leonardo Linguaglossa, Fabien Mathieu, Diego Perino, Laurent Viennot:
Forwarding Tables Verification through Representative Header Sets. CoRR abs/1601.07002 (2016) - [i8]Adrian Kosowski, Laurent Viennot:
Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons. CoRR abs/1609.00512 (2016) - [i7]Paolo Penna, Laurent Viennot:
Independent lazy better-response dynamics on network games. CoRR abs/1609.08953 (2016) - 2015
- [j9]Nidhi Hegde, Laurent Massoulié, Laurent Viennot:
Self-organizing flows in social networks. Theor. Comput. Sci. 584: 3-18 (2015) - [i6]Amos Korman, Jean-Sébastien Sereni, Laurent Viennot:
Toward more localized local algorithms: removing assumptions concerning global knowledge. CoRR abs/1512.03306 (2015) - 2014
- [c29]The Dang Huynh, Fabien Mathieu, Laurent Viennot:
LiveRank: How to Refresh Old Crawls. WAW 2014: 148-160 - 2013
- [j8]Amos Korman, Jean-Sébastien Sereni, Laurent Viennot:
Toward more localized local algorithms: removing assumptions concerning global knowledge. Distributed Comput. 26(5-6): 289-308 (2013) - [c28]Nidhi Hegde, Laurent Massoulié, Laurent Viennot:
Self-organizing Flows in Social Networks. SIROCCO 2013: 116-128 - 2012
- [i5]Nidhi Hegde, Laurent Massoulié, Laurent Viennot:
Self-Organizing Flows in Social Networks. CoRR abs/1212.0952 (2012) - 2011
- [c27]Fabien de Montgolfier, Mauricio Soto, Laurent Viennot:
Asymptotic Modularity of Some Graph Classes. ISAAC 2011: 435-444 - [c26]Fabien de Montgolfier, Mauricio Soto, Laurent Viennot:
Treewidth and Hyperbolicity of the Internet. NCA 2011: 25-32 - [c25]Cyril Gavoille, Quentin Godfroy, Laurent Viennot:
Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners. OPODIS 2011: 143-158 - [c24]Amos Korman, Jean-Sébastien Sereni, Laurent Viennot:
Toward more localized local algorithms: removing assumptions concerning global knowledge. PODC 2011: 49-58 - [i4]Cyril Gavoille, Quentin Godfroy, Laurent Viennot:
Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners. CoRR abs/1109.2696 (2011) - 2010
- [c23]Fabien Mathieu, Laurent Viennot:
Local Aspects of the Global Ranking of Web Pages. IICS 2010: 493-506 - [c22]Cyril Gavoille, Quentin Godfroy, Laurent Viennot:
Multipath Spanners. SIROCCO 2010: 211-223
2000 – 2009
- 2009
- [c21]Philippe Jacquet, Laurent Viennot:
Average Size of Unstretched Remote-Spanners. ANALCO 2009: 23-33 - [c20]Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot:
Fine Tuning of a Distributed VoD System. ICCCN 2009: 1-7 - [c19]Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot:
An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability. IPDPS 2009: 1-10 - [c18]Philippe Jacquet, Laurent Viennot:
Remote-spanners: What to know beyond neighbors. IPDPS 2009: 1-10 - [c17]Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot:
Local Computation of Nearly Additive Spanners. DISC 2009: 176-190 - 2008
- [c16]Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Viennot:
The Inframetric Model for the Internet. INFOCOM 2008: 1085-1093 - [c15]Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino, Laurent Viennot:
Achievable catalog size in peer-to-peer video-on-demand systems. IPTPS 2008: 4 - [c14]Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot:
On the locality of distributed sparse spanner construction. PODC 2008: 273-282 - [i3]Laurent Viennot, Yacine Boufkhad, Fabien Mathieu, Fabien de Montgolfier, Diego Perino:
Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms. CoRR abs/0804.0743 (2008) - 2007
- [c13]Anh-Tuan Gai, Dmitry Lebedev, Fabien Mathieu, Fabien de Montgolfier, Julien Reynier, Laurent Viennot:
Acyclic Preference Systems in P2P Networks. Euro-Par 2007: 825-834 - [i2]Anh-Tuan Gai, Dmitry Lebedev, Fabien Mathieu, Fabien de Montgolfier, Julien Reynier, Laurent Viennot:
Acyclic Preference Systems in P2P Networks. CoRR abs/0704.3904 (2007) - 2006
- [c12]Anh-Tuan Gai, Laurent Viennot:
Optimizing and Balancing Load in Fully Distributed P2P File Sharing Systems. AICT/ICIW 2006: 111 - [i1]Dmitry Lebedev, Fabien Mathieu, Laurent Viennot, Anh-Tuan Gai, Julien Reynier, Fabien de Montgolfier:
On Using Matching Theory to Understand P2P Network Design. CoRR abs/cs/0612108 (2006) - 2005
- [b2]Laurent Viennot:
Autour des graphes et du routage. (About graphs and routing). Paris Diderot University, France, 2005 - [j7]Cédric Adjih, Philippe Jacquet, Laurent Viennot:
Computing Connected Dominated Sets with Multipoint Relays. Ad Hoc Sens. Wirel. Networks 1(1-2): 27-39 (2005) - 2004
- [j6]Laurent Viennot, Philippe Jacquet, Thomas Heide Clausen:
Analyzing Control Traffic Overhead versus Mobility and Data Traffic Activity in Mobile Ad-Hoc Network Protocols. Wirel. Networks 10(4): 447-455 (2004) - [c11]Anh-Tuan Gai, Laurent Viennot:
Broose: A Practical Distributed Hashtable Based on the De-Bruijn Topology. Peer-to-Peer Computing 2004: 167-174 - 2003
- [c10]Fabien Mathieu, Laurent Viennot:
Local Structure in the Web. WWW (Posters) 2003 - 2002
- [c9]Amir Qayyum, Laurent Viennot, Anis Laouiti:
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks. HICSS 2002: 298 - [c8]Philippe Jacquet, Anis Laouiti, Pascale Minet, Laurent Viennot:
Performance of Multipoint Relaying in Ad Hoc Mobile Routing Protocols. NETWORKING 2002: 387-398 - [c7]Jean-Loup Guillaume, Matthieu Latapy, Laurent Viennot:
Efficient and Simple Encodings for the Web Graph. WAIM 2002: 328-337 - 2001
- [j5]Michel Habib, Christophe Paul, Laurent Viennot:
Linear time recognition of P4-indifference graphs. Discret. Math. Theor. Comput. Sci. 4(2): 173-178 (2001) - [j4]Jean-Louis Dornstetter, Daniel Krob, Michel Morvan, Laurent Viennot:
Some Algorithms for Synchronizing Clocks of Base Transceiver Stations in a Cellular Network. J. Parallel Distributed Comput. 61(7): 855-867 (2001) - [c6]Karell Bertet, Claude Chaudet, Isabelle Guérin Lassous, Laurent Viennot:
Impact of interferences on bandwidth reservation for ad hoc networks: a first theoretical study. GLOBECOM 2001: 2907-2910 - [c5]Khaldoun Al Agha, Laurent Viennot:
Spatial Reuse in Wireless LAN Networks. PWC 2001: 209-219 - 2000
- [j3]Michel Habib, Ross M. McConnell, Christophe Paul, Laurent Viennot:
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comput. Sci. 234(1-2): 59-84 (2000) - [c4]Cédric Adjih, Khaldoun Al Agha, François Dumontet, Philippe Jacquet, Alberto López, Laurent Viennot:
Quality of service aspect for BRAIN architecture. PIMRC 2000: 458-462
1990 – 1999
- 1999
- [j2]Michel Habib, Christophe Paul, Laurent Viennot:
Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. Int. J. Found. Comput. Sci. 10(2): 147-170 (1999) - 1998
- [c3]Michel Habib, Christophe Paul, Laurent Viennot:
A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata. STACS 1998: 25-38 - 1997
- [j1]Laurent Viennot:
Parallel N-Free Order Recognition. Theor. Comput. Sci. 175(2): 393-406 (1997) - 1996
- [b1]Laurent Viennot:
Quelques algorithmes parallèles et séquentiels de traitement des graphes et applications. (Parallel and sequential algorithms for graphs). Paris Diderot University, France, 1996 - [c2]Michel Morvan, Laurent Viennot:
Parallel Comparability Graph Recognition and Modular Decomposition. STACS 1996: 169-180 - 1995
- [c1]Jens Gustedt, Michel Morvan, Laurent Viennot:
A Compact Data Structure and Parallel Algorithms for Permutation Graphs. WG 1995: 372-380
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
