Julien Portier

Orcid: 0000-0002-5360-6917

According to our database1, Julien Portier authored at least 13 papers between 2022 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Reconstructing Almost All of a Point Set in \(\boldsymbol{\mathbb{R}}\) <sup> <i>d</i> </sup> from Randomly Revealed Pairwise Distances.
SIAM J. Discret. Math., 2026

2025
A Proof of the 3/4-Conjecture for the Total Domination Game.
SIAM J. Discret. Math., 2025

The Complexity of Decomposing a Graph into a Matching and a Bounded Linear Forest.
J. Graph Theory, 2025

Exponential Odd-Distance Sets under the Manhattan Metric.
Electron. J. Comb., 2025

2024
Bounds for the competition-independence game on trees.
Discret. Math., March, 2024

On the number of minimum dominating sets and total dominating sets in forests.
J. Graph Theory, 2024

The asymptotic of off-diagonal online Ramsey numbers for paths.
Eur. J. Comb., 2024

A note on interval colourings of graphs.
Eur. J. Comb., 2024

Progress towards the 1/2-Conjecture for the domination game.
Discret. Appl. Math., 2024

2023
The Odd Chromatic Number of a Planar Graph is at Most 8.
Graphs Comb., April, 2023

A note on cops and robbers, independence number, domination number and diameter.
Discret. Math., 2023

A new lower bound on the optimal pebbling number of the grid.
Discret. Math., 2023

2022
A faster algorithm for Cops and Robbers.
Discret. Appl. Math., 2022


  Loading...