scientific article; zbMATH DE number 6784981
From MaRDI portal
Publication:5363786
DOI10.4230/LIPIcs.IPEC.2015.331zbMath1378.68089MaRDI QIDQ5363786
Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh
Publication date: 29 September 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
On the kernelization of split graph problems ⋮ Vertex Cover Structural Parameterization Revisited ⋮ What Is Known About Vertex Cover Kernelization? ⋮ Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. ⋮ Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization ⋮ Polynomial kernels for vertex cover parameterized by small degree modulators ⋮ How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? ⋮ How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs ⋮ Smaller Parameters for Vertex Cover Kernelization ⋮ A refined branching algorithm for the maximum satisfiability problem
This page was built for publication:
