Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz. Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. ACM Transactions on Algorithms, 15(2), 2019. [doi]

The following publications are possibly variants of this publication:

Polynomial Kernels and Wideness Properties of Nowhere Dense Graph ClassesStephan Kreutzer, Roman Rabinovich, Sebastian Siebertz. soda 2017: 1533-1545 [doi]

Neighborhood Complexity and Kernelization for Nowhere Dense Classes of GraphsKord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz. icalp 2017: [doi]

Directed nowhere dense classes of graphsStephan Kreutzer, Siamak Tazari. soda 2012: 1552-1562 [doi]

Reconfiguration on Nowhere Dense Graph ClassesSebastian Siebertz. combinatorics, 25(3):3, 2018. [doi]

Deciding first-order properties of nowhere dense graphsMartin Grohe, Stephan Kreutzer, Sebastian Siebertz. stoc 2014: 89-98 [doi]

Deciding First-Order Properties of Nowhere Dense GraphsMartin Grohe, Stephan Kreutzer, Sebastian Siebertz. JACM, 64(3), 2017. [doi]

Kernelization and approximation of distance-r independent sets on nowhere dense graphsMichal Pilipczuk, Sebastian Siebertz. ejc, 94:103309, 2021. [doi]

runs on WebDSL