Author of the publication

Designing FPT Algorithms for Cut Problems Using Randomized Contractions.

, , , , and . FOCS, page 460-469. IEEE Computer Society, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset., , and . SODA, page 1713-1725. SIAM, (2012)Faster Exact Algorithms for Some Terminal Set Problems., , , , , and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 150-162. Springer, (2013)Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset., , and . SIAM J. Comput., 42 (4): 1674-1696 (2013)Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset, , and . CoRR, (2011)Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable., , , and . ACM Trans. Algorithms, 11 (4): 28:1-28:28 (2015)Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable., , , and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 230-241. Springer, (2012)Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs., , and . FSTTCS, volume 24 of LIPIcs, page 79-90. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)., , , and . SIAM J. Comput., 49 (2): 318-364 (2020)Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond., , , , and . SPAA, page 56-58. ACM, (2015)Parameterized Algorithms for Boxicity., , and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 366-377. Springer, (2010)