121 citations · 373 across the 96 of their papers we have counts for
5 papers · 1 filter
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov +2
We design the first subexponential-time (parameterized) algorithms for several cut and cycle-hitting problems on -minor free graphs. In particular, we obtain the following resul…
DynamiQ: Planning for Dynamics in Network Streaming Analytics Systems
Rohan Bhatia, Arpit Gupta, Rob Harrison +2
The emergence of programmable data-plane targets has motivated a new hybrid design for network streaming analytics systems that combine these targets' fast packet processing speeds…
Diversity in Kemeny Rank Aggregation: A Parameterized Approach
Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov +2
In its most traditional setting, the main concern of optimization theory is the search for optimal solutions for instances of a given computational problem. A recent trend of resea…
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent
Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov +4
For a graph class , the graph parameters elimination distance to (denoted by ) [Bulian and Dawar, Algorithmica, 2016], and -treewi…
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths
Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk +2
In the Disjoint Paths problem, the input is an undirected graph on vertices and a set of vertex pairs, , and the task is to find pairwise verte…