A. Mouawad

activity

20132026

most citedOn girth and the parameterized complexity of token sliding and token jumping

14 citations · 69 across the 31 of their papers we have counts for

collaborators

Showing 2017 · cs.DSShow all

2 papers · 2 filters

cs.DS2017

Packing Cycles Faster Than Erdős-Pósa

Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh +1

The Cycle Packing problem asks whether a given undirected graph $G = (V, E)$ contains $k$ vertex-disjoint cycles. Since the publication of the classic Erdős-Pósa theorem in 1965, this…

cs.DS2017

Lossy Kernels for Connected Dominating Set on Sparse Graphs

Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad +2

For $α > 1$ , an $α$ -approximate (bi-)kernel is a polynomial-time algorithm that takes as input an instance $(I, k)$ of a problem $Q$ and outputs an instance $(I^{'}, k^{'})$ (of…