Julien Duron

According to our database, Julien Duron authored at least 9 papers between 2023 and 2024.

Collaborative distances:

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

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

2023

Tight bounds on adjacency labels for monotone graph classes.

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

CoRR, 2023

Small But Unwieldy.

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

CoRR, 2023

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

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