Julien Duron - RankMe

27 papers A* 3A 2B 4Journal 17

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Long Induced Paths and Forbidden Patterns: Polylogarithmic Bounds. SIAM J. Discret. Math. Julien Duron, Louis Esperet, Jean-Florent Raymond
2026	J	`jnl`	Maximum Independent Set when Excluding an Induced Minor: K Algorithmica Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek
2026	J	`jnl`	On the Minimum Number of Inversions to Make a Digraph k -(Arc-)Strong. J. Graph Theory Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud
2025	A	`conf`	Adjacency Labeling Schemes for Small Classes. ITCS Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
2025	—	`—`	Algorithms and Structures: Graphs equipped with an Order. (Algorithmes et Structures: Graphes munis d'un Ordre). Julien Duron
2025	A*	`conf`	Mim-Width Is paraNP-Complete. ICALP Benjamin Bergougnoux, Édouard Bonnet, Julien Duron
2025	J	`jnl`	Mim-Width is paraNP-complete. CoRR Benjamin Bergougnoux, Édouard Bonnet, Julien Duron
2025	J	`jnl`	Planar induced paths via a decomposition into non-crossing ordered graphs. CoRR Julien Duron, Hugo Jacob
2024	J	`jnl`	Adjacency Labeling Schemes for Small Classes. CoRR Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
2024	J	`jnl`	Cutting Barnette graphs perfectly is hard. Theor. Comput. Sci. Édouard Bonnet, Dibyayan Chakraborty, Julien Duron
2024	J	`jnl`	Long induced paths and forbidden patterns: Polylogarithmic bounds. CoRR Julien Duron, Louis Esperet, Jean-Florent Raymond
2024	J	`jnl`	Long induced paths in sparse graphs and graphs with forbidden patterns. CoRR Julien Duron, Louis Esperet, Jean-Florent Raymond
2024	A*	`conf`	Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SODA Edouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2024	J	`jnl`	Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SIAM J. Comput. Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2024	B	`conf`	Symmetric-Difference (Degeneracy) and Signed Tree Models. MFCS Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
2024	J	`jnl`	Symmetric-Difference (Degeneracy) and Signed Tree Models. CoRR Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
2024	A*	`conf`	Tight Bounds on Adjacency Labels for Monotone Graph Classes. ICALP Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2023	B	`conf`	Cutting Barnette Graphs Perfectly is Hard. WG Édouard Bonnet, Dibyayan Chakraborty, Julien Duron
2023	J	`jnl`	Cutting Barnette graphs perfectly is hard. CoRR Édouard Bonnet, Dibyayan Chakraborty, Julien Duron
2023	A	`conf`	Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄. ESA Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek
2023	J	`jnl`	Maximum Independent Set when excluding an induced minor: K CoRR Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek
2023	J	`jnl`	On the minimum number of inversions to make a digraph k-(arc-)strong. CoRR Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud
2023	B	`conf`	PACE Solver Description: RedAlert - Heuristic Track. IPEC Édouard Bonnet, Julien Duron
2023	J	`jnl`	Small But Unwieldy. CoRR Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2023	B	`conf`	Stretch-Width. IPEC Édouard Bonnet, Julien Duron
2023	J	`jnl`	Stretch-width. CoRR Édouard Bonnet, Julien Duron
2023	J	`jnl`	Tight bounds on adjacency labels for monotone graph classes. CoRR Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii