Aditya Lonkar

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem 2012 Ken‐ichi Kawarabayashi
Yusuke Kobayashi
2
+ PDF Chat Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time 2011 Marek Cygan
Jesper Nederlof
Marcin Pilipczuk
Michał Pilipczuk
Joham M.M. van Rooij
Jakub Onufry Wojtaszczyk
2
+ PDF Chat Faster deterministic Feedback Vertex Set 2014 Tomasz Kociumaka
Marcin Pilipczuk
2
+ PDF Chat Powers of tensors and fast matrix multiplication 2014 François Le Gall
2
+ PDF Chat Subset Feedback Vertex Set Is Fixed-Parameter Tractable 2013 Marek Cygan
Marcin Pilipczuk
Michał Pilipczuk
Jakub Onufry Wojtaszczyk
2
+ PDF Chat Half-integrality, LP-branching, and FPT Algorithms 2016 Yoichi Iwata
Magnus Wahlström
Yuichi Yoshida
2
+ Bivariate complexity analysis of Almost Forest Deletion 2017 Ashutosh Rai
Saket Saurabh
2
+ PDF Chat Linear Time Parameterized Algorithms for S <scp>ubset</scp> F <scp>eedback</scp> V <scp>ertex</scp> S <scp>et</scp> 2018 Daniel Lokshtanov
M. S. Ramanujan
Saket Saurabh
2
+ PDF Chat 0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms 2018 Yoichi Iwata
Yutaro Yamaguchi
Yuichi Yoshida
2
+ Simultaneous Feedback Vertex Set 2018 Akanksha Agrawal
Daniel Lokshtanov
Amer E. Mouawad
Saket Saurabh
2
+ PDF Chat On Feedback Vertex Set: New Measure and New Structures 2014 Yixin Cao
Jianer Chen
Yang Liu
2
+ PDF Chat Randomized Algorithms for the Loop Cutset Problem 2000 A. Becker
Reuven Bar-Yehuda
Dan Geiger
1
+ PDF Chat Improved Analysis of Highest-Degree Branching for Feedback Vertex Set 2021 Yoichi Iwata
Yusuke Kobayashi
1