Julien Portier

MaRDI QIDQ2092401zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Reconstructing almost all of a point set in \(\mathbb{R}^d\) from randomly revealed pairwise distances SIAM Journal on Discrete Mathematics	2026-04-01	Paper
A proof of the 3/4-conjecture for the total domination game SIAM Journal on Discrete Mathematics	2025-01-22	Paper
The asymptotic of off-diagonal online Ramsey numbers for paths European Journal of Combinatorics	2024-09-30	Paper
A note on interval colourings of graphs European Journal of Combinatorics	2024-07-08	Paper
On the number of minimum dominating sets and total dominating sets in forests Journal of Graph Theory	2024-07-02	Paper
Bounds for the competition-independence game on trees Discrete Mathematics	2024-01-17	Paper
Tight lower bounds for anti-concentration of Rademacher sums and Tomaszewski's counterpart problem	2023-06-13	Paper
The complexity of decomposing a graph into a matching and a bounded linear forest	2023-04-06	Paper
The odd chromatic number of a planar graph is at most 8 Graphs and Combinatorics	2023-03-09	Paper
On interval colourings of graphs	2023-03-09	Paper
A note on interval colourings of graphs	2023-03-08	Paper
Progress towards the 1/2-Conjecture for the domination game	2023-01-12	Paper
A proof of the 3/4 conjecture for the total domination game	2022-11-29	Paper
A new lower bound on the optimal pebbling number of the grid Discrete Mathematics	2022-11-02	Paper
A note on cops and robbers, independence number, domination number and diameter Discrete Mathematics	2022-11-02	Paper
A faster algorithm for cops and robbers Discrete Applied Mathematics	2022-08-24	Paper
Ternary Egyptian fractions with prime denominator Research in Number Theory	2022-07-13	Paper
On the number of minimum dominating sets and total dominating sets in forests	2022-06-27	Paper
The odd chromatic number of a planar graph is at most 8 (available as arXiv preprint)	2022-01-28	Paper
The asymptotic of off-diagonal online Ramsey numbers for paths (available as arXiv preprint)	N/A	Paper
Reconstructing almost all of a point set in $\mathbb{R}^d$ from randomly revealed pairwise distances (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: Julien Portier