Julien Duron

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

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Cutting Barnette graphs perfectly is hard.

[BibT_eX]

[DOI]

Édouard Bonnet

Dibyayan Chakraborty

Julien Duron

Theor. Comput. Sci., 2024

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

[BibT_eX]

[DOI]

SIAM J. Comput., 2024

Adjacency Labeling Schemes for Small Classes.

[BibT_eX]

[DOI]

CoRR, 2024

Symmetric-Difference (Degeneracy) and Signed Tree Models.

[BibT_eX]

[DOI]

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

Tight Bounds on Adjacency Labels for Monotone Graph Classes.

[BibT_eX]

[DOI]

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

2023

Small But Unwieldy.

[BibT_eX]

[DOI]

CoRR, 2023

On the minimum number of inversions to make a digraph k-(arc-)strong.

[BibT_eX]

[DOI]

CoRR, 2023

Maximum Independent Set when excluding an induced minor: K1 + tK2 and tC3 ⊎ C4.

[BibT_eX]

[DOI]

CoRR, 2023

PACE Solver Description: RedAlert - Heuristic Track.

[BibT_eX]

[DOI]

Édouard Bonnet

Julien Duron

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

Stretch-Width.

[BibT_eX]

[DOI]

É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₄.

[BibT_eX]

[DOI]

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

Julien Duron

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...