Polynomial Kernels for Hard Problems on Disk Graphs

DOI10.1007/978-3-642-13731-0_30zbMath1285.68123OpenAlexW1487121862MaRDI QIDQ3569901

Bart M. P. Jansen

Publication date: 22 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13731-0_30

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Parameterized algorithms for stable matching with ties and incomplete lists ⋮ A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs ⋮ A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs ⋮ Finding, hitting and packing cycles in subexponential time on unit disk graphs ⋮ Unnamed Item

This page was built for publication: Polynomial Kernels for Hard Problems on Disk Graphs