3 citations · 3 across the 11 of their papers we have counts for
11 papers
Improved exploration of temporal graphs
Paul Bastide, Carla Groenland, Lukas Michel +2
A temporal graph is a sequence of graphs on the same vertex set of size . The \emph{temporal exploration problem} asks for the length of the shortest seque…
Covering graphs by isometric trees
Paul Bastide, Julien Duron, Jędrzej Hodor +2
A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied.…
Circular sorting, strong complete mappings and wreath product constructions
Paul Bastide, Anurag Bishnoi, Carla Groenland +2
We continue the study of Adin, Alon and Roichman [arXiv:2502.14398, 2025] on the number of steps required to sort labelled points on a circle by transpositions. Imagine that th…
Cube Height, Cube Width and Related Extremal Problems for Posets
Paul Bastide, Jędrzej Hodor, Hoang La +1
Given a poset , a family of sets indexed by the elements of is called an inclusion representation of if in if and only if…
Smaller universal posets
Paul Bastide, Carla Groenland, Rajko Nenadov
We show that there is a constant such that for each integer , there is a poset on at most elements that contains each -element poset as an (i…
Faithful universal graphs for minor-closed classes
Paul Bastide, Louis Esperet, Carla Groenland +3
It was proved by Huynh, Mohar, Šámal, Thomassen and Wood in 2021 that any countable graph containing every countable planar graph as a subgraph has an infinite clique minor. We pro…
Quasi-linear distance query reconstruction for graphs of bounded treelength
Paul Bastide, Carla Groenland
In distance query reconstruction, we wish to reconstruct the edge set of a hidden graph by asking as few distance queries as possible to an oracle. Given two vertices and ,…
Random embeddings of bounded degree trees with optimal spread
Paul Bastide, Clément Legrand-Duchesne, Alp Müyesser
A seminal result of Komlós, Sárközy, and Szemerédi states that any n-vertex graph G with minimum degree at least (1/2 + α)n contains every n-vertex tree T of bounded degree. Recent…
Distance Reconstruction of Sparse Random Graphs
Paul Bastide
In the distance query model, we are given access to the vertex set of a -vertex graph , and an oracle that takes as input two vertices and returns the distance between these…
Path eccentricity of -AT-free graphs and application on graphs with the consecutive ones property
Paul Bastide, Claire Hilaire, Eileen Robinson
The central path problem is a variation on the single facility location problem. The aim is to find, in a given connected graph , a path minimizing its eccentricity, which i…
A Polynomial Upper Bound for Poset Saturation
Paul Bastide, Carla Groenland, Maria-Romina Ivan +1
Given a finite poset , we say that a family of subsets of is -saturated if does not contain an induced copy of ,…