( en | de | ru )

 

Disambiguation of "Duron, Julien"

Author of the publication

copydeleteadd this publication to your clipboard
Small But Unwieldy.

, , , , and . CoRR, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Chalit Durongphan

Julien Köhrle

Julien Ndinga

Julien Bonnamour

Julien Coignet

 

Other publications of authors with the same name

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes., , , , and . SODA, page 1147-1165. SIAM, (2024)Small But Unwieldy., , , , and . CoRR, (2023)Cutting Barnette Graphs Perfectly is Hard., , and . WG, volume 14093 of Lecture Notes in Computer Science, page 116-129. Springer, (2023)On the minimum number of inversions to make a digraph k-(arc-)strong., , , and . CoRR, (2023)Maximum Independent Set when excluding an induced minor: K1 + tK2 and tC3 ⊎ C4., , , , and . CoRR, (2023)Tight bounds on adjacency labels for monotone graph classes., , , , and . CoRR, (2023)Stretch-Width., and . IPEC, volume 285 of LIPIcs, page 8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄., , , , and . ESA, volume 274 of LIPIcs, page 23:1-23:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)PACE Solver Description: RedAlert - Heuristic Track., and . IPEC, volume 285 of LIPIcs, page 40:1-40:5. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)