activity
20162026
most citedProgress on the adjacent vertex distinguishing edge colouring conjecture

21 citations · 28 across the 15 of their papers we have counts for

collaborators
Showing 2024 · cs.DSShow all

2 papers · 2 filters

cs.DS2024

Robust Contraction Decomposition for Minor-Free Graphs and its Applications

Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov +6

We prove a robust contraction decomposition theorem for -minor-free graphs, which states that given an -minor-free graph and an integer , one can partition in polynomi…

cs.DS2024

Packing Short Cycles

Matthias Bentert, Fedor V. Fomin, Petr A. Golovach +6

Cycle packing is a fundamental problem in optimization, graph theory, and algorithms. Motivated by recent advancements in finding vertex-disjoint paths between a specified set of v…