19 citations · 58 across the 26 of their papers we have counts for
4 papers · 1 filter
Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
Given a simple connected undirected graph G = (V, E), a set X \subseteq V(G), and integers k and p, STEINER SUBGRAPH EXTENSION problem asks if there exists a set S \supseteq X with…
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu +2
For numerous graph problems in the realm of parameterized algorithms, using the size of a smallest deletion set (called a modulator) into well-understood graph families as paramete…
Meta-theorems for Parameterized Streaming Algorithms
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan +3
The streaming model was introduced to parameterized complexity independently by Fafianie and Kratsch [MFCS14] and by Chitnis, Cormode, Hajiaghayi and Monemizadeh [SODA15]. Subseque…
Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
Christian Komusiewicz, Diptapriyo Majumdar
Enumeration kernelization was first proposed by Creignou et al. [TOCS 2017] and was later refined by Golovach et al. [JCSS 2022] into two different variants: fully-polynomial enume…