2 citations · 3 across the 8 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs
Dániel Marx, Pranabendu Misra, Daniel Neuen +1
Subexponential parameterized algorithms are known for a wide range of natural problems on planar graphs, but the techniques are usually highly problem specific. The goal of this pa…
cs.DS2021
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…
cs.GT2021
Improving EFX Guarantees through Rainbow Cycle Number
Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn +2
We study the problem of fairly allocating a set of indivisible goods among agents with additive valuations. Envy-freeness up to any good (EFX) is arguably the most compelling f…