Laurent Viennot

Available identifiers

zbMath Open viennot.laurentMaRDI QIDQ216238

List of research outcomes

Publication	Date of Publication	Type
Revisiting the random subset sum problem	2025-01-06	Paper
Computing graph hyperbolicity using dominating sets	2024-05-24	Paper
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation	2024-04-14	Paper
Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next	2024-03-26	Paper
A compact data structure and parallel algorithms for permutation graphs	2024-02-28	Paper
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks	2023-12-18	Paper
A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs	2023-04-03	Paper
Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension	2022-11-15	Paper
https://portal.mardi4nfdi.de/entity/Q5092347	2022-07-21	Paper
Fast Diameter Computation within Split Graphs	2022-01-27	Paper
LiveRank: How to Refresh Old Datasets	2021-03-26	Paper
On computing Pareto optimal paths in weighted time-dependent networks	2021-03-11	Paper
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension	2021-02-02	Paper
Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling	2021-01-20	Paper
https://portal.mardi4nfdi.de/entity/Q5136231	2020-11-25	Paper
Decomposing a graph into shortest paths with bounded eccentricity	2020-07-07	Paper
Fast diameter computation within split graphs	2020-05-13	Paper
Independent lazy better-response dynamics on network games	2020-02-06	Paper
Average size of unstretched Remote-Spanners	2019-09-16	Paper
Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons	2018-07-16	Paper
Parallel comparability graph recognition and modular decomposition	2017-11-16	Paper
Toward more localized local algorithms	2015-09-11	Paper
LiveRank: How to Refresh Old Crawls	2015-09-09	Paper
Self-organizing flows in social networks	2015-05-22	Paper
PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT	2015-04-29	Paper
On the locality of distributed sparse spanner construction	2014-12-12	Paper
Toward more localized local algorithms: removing assumptions concerning global knowledge	2014-03-28	Paper
Self-organizing Flows in Social Networks	2013-12-17	Paper
Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners	2012-07-27	Paper
Asymptotic Modularity of Some Graph Classes	2011-12-16	Paper
Multipath Spanners	2010-06-17	Paper
Local Computation of Nearly Additive Spanners	2009-11-19	Paper
https://portal.mardi4nfdi.de/entity/Q3045077	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4708654	2003-06-18	Paper
Some algorithms for synchronizing clocks of base transceiver stations in a cellular network	2002-10-09	Paper
Linear time recognition of \(P_4\)-indifference graphs	2002-01-07	Paper
Parallel \(N\)-free order recognition	1998-07-23	Paper
Revisiting the Random Subset Sum problem	N/A	Paper
Temporalizing digraphs via linear-size balanced bi-trees	N/A	Paper

Research outcomes over time

This page was built for person: Laurent Viennot