( en | de | ru )

 

Disambiguation of "Chitnis, Rajesh Hemant"

Author of the publication

copydeleteadd this publication to your clipboard
List H-Coloring a Graph by Removing Few Vertices.

, , and . ESA, volume 8125 of Lecture Notes in Computer Science, page 313-324. Springer, (2013)

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.

Kumar Hemant

Rajesh Saiju

Hybrid Power System Modelling - Simulation and Energy Management Unit Development. Uni Kassel, (2008)

Rajesh Chitta

Hemant Patwardhan

Hemant Agrawal

 

Other publications of authors with the same name

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)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)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 . SODA, page 1713-1725. SIAM, (2012)Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)., , and . SODA, page 1782-1801. SIAM, (2014)Preventing Unraveling in Social Networks Gets Harder., , and . AAAI, page 1085-1091. AAAI Press, (2013)Review of: Fundamentals of Parameterized Complexity by Rodney G. Downey and Michael R. Fellows.. SIGACT News, 46 (1): 23-26 (2015)List H-Coloring a Graph by Removing Few Vertices., , and . ESA, volume 8125 of Lecture Notes in Computer Science, page 313-324. Springer, (2013)