Julien Duron

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
(available as arXiv preprint)
N/APaper
Tight bounds on adjacency labels for monotone graph classes
(available as arXiv preprint)
N/APaper
Mim-width is paraNP-complete2026-09-10Paper
Symmetric-difference (degeneracy) and signed tree models2026-05-12Paper
Long induced paths and forbidden patterns: polylogarithmic bounds
SIAM Journal on Discrete Mathematics
2026-01-20Paper
Tight bounds on adjacency labels for monotone graph classes2026-01-14Paper
On the minimum number of inversions to make a digraph k-(arc-)strong
Journal of Graph Theory
2026-01-13Paper
Maximum independent set when excluding an induced minor: K₁ + tK₂ and tC₃ C₄
Algorithmica
2025-12-30Paper
PACE solver description: RedAlert -- heuristic track2025-09-24Paper
Stretch-width2025-09-24Paper
On the minimum number of inversions to make a digraph k-(arc-)strong (extended abstract)2025-04-08Paper
Maximum independent set when excluding an induced minor: K₁+tK₂ and tC₃ C₄2025-01-06Paper
Small but unwieldy: a lower bound on adjacency labels for small classes2024-11-28Paper
Small but unwieldy: a lower bound on adjacency labels for small classes
SIAM Journal on Computing
2024-11-01Paper
Cutting Barnette graphs perfectly is hard
Theoretical Computer Science
2024-08-20Paper
Stretch-width2023-05-19Paper
A tamed family of triangle-free graphs with unbounded chromatic number2023-04-09Paper
On the minimum number of inversions to make a digraph k-(arc-)strong2023-03-21Paper
Cutting Barnette graphs perfectly is hard2023-02-22Paper
Maximum Independent Set when excluding an induced minor: K₁ + tK₂ and tC₃ \uplus C₄2023-02-16Paper


Research outcomes over time


This page was built for person: Julien Duron