Julien Duron

According to our database, Julien Duron authored at least 19 papers between 2023 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Moderately beyond clique-width: reduced component max-leaf and related parameters.

Édouard Bonnet, Yeonsu Chang, Julien Duron, Colin Geniet, O-joung Kwon

CoRR, April, 2026

On the Minimum Number of Inversions to Make a Digraph k -(Arc-)Strong.

Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud

J. Graph Theory, February, 2026

Maximum Independent Set when Excluding an Induced Minor: K₁ + tK₂ and $tC_3 \uplus C_4$.

Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek

Algorithmica, February, 2026

Long Induced Paths and Forbidden Patterns: Polylogarithmic Bounds.

Julien Duron, Louis Esperet, Jean-Florent Raymond

SIAM J. Discret. Math., 2026

2025

Planar induced paths via a decomposition into non-crossing ordered graphs.

Julien Duron, Hugo Jacob

CoRR, September, 2025

Algorithms and Structures: Graphs equipped with an Order. (Algorithmes et Structures: Graphes munis d'un Ordre).

Julien Duron

PhD thesis, 2025

Adjacency Labeling Schemes for Small Classes.

Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

Mim-Width Is paraNP-Complete.

Benjamin Bergougnoux, Édouard Bonnet, Julien Duron

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Long induced paths in sparse graphs and graphs with forbidden patterns.

Julien Duron, Louis Esperet, Jean-Florent Raymond

CoRR, 2024

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes.

Edouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Symmetric-Difference (Degeneracy) and Signed Tree Models.

Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Tight Bounds on Adjacency Labels for Monotone Graph Classes.

Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

RedAlert.

Édouard Bonnet, Julien Duron

Dataset, June, 2023

Small But Unwieldy.

Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii

CoRR, 2023

Maximum Independent Set when excluding an induced minor: K₁ + tK₂ and tC₃ ⊎ C₄.

Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek

CoRR, 2023

Cutting Barnette Graphs Perfectly is Hard.

Édouard Bonnet, Dibyayan Chakraborty, Julien Duron

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

PACE Solver Description: RedAlert - Heuristic Track.

Édouard Bonnet, Julien Duron

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Stretch-Width.

Édouard Bonnet, Julien Duron

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄.

Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek

Proceedings of the 31st Annual European Symposium on Algorithms, 2023