![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Laurent Viennot
INRIA, France
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 94 matches
- 2024
- Stéphane Bessy, Stéphan Thomassé, Laurent Viennot:
Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. STACS 2024: 13:1-13:12 - David Coudert, Mónika Csikós, Guillaume Ducoffe, Laurent Viennot:
Practical Computation of Graph VC-Dimension. SEA 2024: 8:1-8:20 - David Coudert, Mónika Csikós, Guillaume Ducoffe, Laurent Viennot:
Practical Computation of Graph VC-Dimension. CoRR abs/2405.07588 (2024) - 2023
- 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) - 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 - Arthur Carvalho Walraven da Cunha
, Emanuele Natale
, Laurent Viennot
:
Neural Network Information Leakage Through Hidden Learning. OLA 2023: 117-128 - Romain Cosson
, Laurent Massoulié
, Laurent Viennot
:
Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next. PODC 2023: 24-27 - Filippo Brunelli, Laurent Viennot:
Computing Temporal Reachability Under Waiting-Time Constraints in Linear Time. SAND 2023: 4:1-4:11 - 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 - Romain Cosson, Laurent Massoulié, Laurent Viennot:
Efficient Collaborative Tree Exploration with Breadth-First Depth-Next. DISC 2023: 14:1-14:21 - Romain Cosson, Laurent Massoulié, Laurent Viennot:
Breadth-First Depth-Next: Optimal Collaborative Exploration of Trees with Low Diameter. CoRR abs/2301.13307 (2023) - 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) - 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) - Stéphane Bessy, Stéphan Thomassé, Laurent Viennot:
Temporalizing digraphs via linear-size balanced bi-trees. CoRR abs/2304.03567 (2023) - 2022
- 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) - 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) - David Coudert, André Nusser, Laurent Viennot:
Computing Graph Hyperbolicity Using Dominating Sets. ALENEX 2022: 78-90 - Arthur C. W. da Cunha, Emanuele Natale, Laurent Viennot:
Proving the Lottery Ticket Hypothesis for Convolutional Neural Networks. ICLR 2022 - Filippo Brunelli, Laurent Viennot:
Minimum-Cost Temporal Walks under Waiting-Time Constraints in Linear Time. CoRR abs/2211.12136 (2022) - 2021
- Guillaume Ducoffe, Michel Habib
, Laurent Viennot:
Fast Diameter Computation within Split Graphs. Discret. Math. Theor. Comput. Sci. 23(3) (2021) - Filippo Brunelli, Pierluigi Crescenzi
, Laurent Viennot
:
On computing Pareto optimal paths in weighted time-dependent networks. Inf. Process. Lett. 168: 106086 (2021) - 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) - Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot:
On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks. CoRR abs/2101.02086 (2021) - David Coudert, André Nusser, Laurent Viennot:
Enumeration of Far-Apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation. CoRR abs/2104.12523 (2021) - Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot:
On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation. CoRR abs/2111.08328 (2021) - David Coudert, André Nusser, Laurent Viennot:
Hyperbolicity Computation through Dominating Sets. CoRR abs/2111.08520 (2021) - 2020
- 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) - Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. SODA 2020: 1905-1922 - 2019
- Paolo Penna, Laurent Viennot:
Independent Lazy Better-Response Dynamics on Network Games. CIAC 2019: 352-364 - Guillaume Ducoffe, Michel Habib, Laurent Viennot:
Fast Diameter Computation Within Split Graphs. COCOA 2019: 155-167
skipping 64 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 02:52 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint