Digital Repository

Browsing by Issue Date

Browsing by Issue Date

Sort by: Order: Results:

  • Robust Contraction Decomposition for Minor-Free Graphs and Its Applications 
    Bandyapadhyay, Sayan; Lochet, William; Lokshtanov, Daniel; Marx, Dániel; Misra, Pranabendu; Neuen, Daniel; Saurabh, Saket; TALE, PRAFULLKUMAR; Xue, Jie (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2026-06)
    We prove a robust contraction decomposition theorem for H-minor-free graphs, which states that given an H-minor-free graph G and an integer p, one can partition in polynomial time the vertices of G into p sets Z₁,… ,Z_p ...