Saket Saurabh

2009
38	EE	Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Clique-width: on the price of generality. SODA 2009: 825-834
37	EE	Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger: Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. STACS 2009: 421-432
36	EE	Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo: Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem CoRR abs/0903.0938: (2009)
35	EE	Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos: (Meta) Kernelization CoRR abs/0904.0727: (2009)
2008
34	EE	Venkatesh Raman, Saket Saurabh, Sriganesh Srihari: Parameterized Algorithms for Generalized Domination. COCOA 2008: 116-126
33		Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos: Improving the gap of Erdös-Pósa property for minor-closed graph classes. CTW 2008: 2-6
32	EE	Omid Amini, Fedor V. Fomin, Saket Saurabh: Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). FSTTCS 2008
31	EE	Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh: Graph Layout Problems Parameterized by Vertex Cover. ISAAC 2008: 294-305
30	EE	Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: König Deletion Sets and Vertex Covers above the Matching Size. ISAAC 2008: 836-847
29	EE	Omid Amini, Ignasi Sau, Saket Saurabh: Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. IWPEC 2008: 13-29
28	EE	Michael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger: Capacitated Domination and Covering: A Parameterized Perspective. IWPEC 2008: 78-90
27	EE	Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh: Iterative Compression and Exact Algorithms. MFCS 2008: 335-346
26	EE	Serge Gaspers, Saket Saurabh, Alexey A. Stepanov: A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. TAMC 2008: 479-489
25	EE	Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh: Degree-Constrained Subgraph Problems: Hardness and Approximation Results. WAOA 2008: 29-42
24	EE	Venkatesh Raman, Saket Saurabh: Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles. Algorithmica 52(2): 203-225 (2008)
23	EE	Omid Amini, Fedor V. Fomin, Saket Saurabh: Parameterized Algorithms for Partial Cover Problems CoRR abs/0802.1722: (2008)
22	EE	Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Spanning directed trees with many leaves CoRR abs/0803.0701: (2008)
21	EE	Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh: Parameterized Low-distortion Embeddings - Graph metrics into lines and trees CoRR abs/0804.3028: (2008)
20	EE	Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger: Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves CoRR abs/0810.4796: (2008)
2007
19	EE	Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen: On the Complexity of Some Colorful Problems Parameterized by Treewidth. COCOA 2007: 366-377
18	EE	Fedor V. Fomin, Serge Gaspers, Saket Saurabh: Improved Exact Algorithms for Counting 3- and 4-Colorings. COCOON 2007: 65-74
17	EE	Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Better Algorithms and Bounds for Directed Maximum Leaf Problems. FSTTCS 2007: 316-327
16	EE	Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP 2007: 352-362
15	EE	Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian: The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. ISAAC 2007: 268-279
14	EE	Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Better Algorithms and Bounds for Directed Maximum Leaf Problems CoRR abs/0707.1095: (2007)
13	EE	Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems CoRR abs/cs/0702049: (2007)
12	EE	Venkatesh Raman, Saket Saurabh: Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG. Inf. Process. Lett. 104(2): 65-72 (2007)
11	EE	Venkatesh Raman, Saket Saurabh, Somnath Sikdar: Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques. Theory Comput. Syst. 41(3): 563-587 (2007)
2006
10	EE	Sushmita Gupta, Venkatesh Raman, Saket Saurabh: Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems. FSTTCS 2006: 139-151
9	EE	Fedor V. Fomin, Serge Gaspers, Saket Saurabh: Branching and Treewidth Based Exact Algorithms. ISAAC 2006: 16-25
8	EE	Venkatesh Raman, Saket Saurabh: Triangles, 4-Cycles and Parameterized (In-)Tractability. SWAT 2006: 304-315
7	EE	Venkatesh Raman, Saket Saurabh, C. R. Subramanian: Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Transactions on Algorithms 2(3): 403-415 (2006)
6	EE	Venkatesh Raman, Saket Saurabh: Parameterized algorithms for feedback set problems and their duals in tournaments. Theor. Comput. Sci. 351(3): 446-458 (2006)
2005
5	EE	Venkatesh Raman, Saket Saurabh, Somnath Sikdar: Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. ICTCS 2005: 375-389
4	EE	Venkatesh Raman, Saket Saurabh, C. R. Subramanian: Faster algorithms for feedback vertex set. Electronic Notes in Discrete Mathematics 19: 273-279 (2005)
2004
3	EE	Venkatesh Raman, Saket Saurabh: Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. IWPEC 2004: 260-270
2003
2	EE	Venkatesh Raman, Saket Saurabh: Parameterized Complexity of Directed Feedback Set Problems in Tournaments. WADS 2003: 484-492
2002
1	EE	Venkatesh Raman, Saket Saurabh, C. R. Subramanian: Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. ISAAC 2002: 241-248

Coauthor Index

1	Noga Alon	[13] [14] [16] [17] [22]
2	Omid Amini	[23] [25] [29] [32]
3	Hans L. Bodlaender	[35]
4	Nathann Cohen	[36]
5	Michael Dom	[28]
6	Michael R. Fellows (Mike Fellows)	[19] [21] [31]
7	Henning Fernau	[20] [37]
8	Fedor V. Fomin	[9] [13] [14] [16] [17] [18] [19] [20] [21] [22] [23] [27] [32] [33] [35] [36] [37] [38]
9	Serge Gaspers	[9] [18] [26] [27]
10	Petr A. Golovach	[38]
11	Sushmita Gupta	[10]
12	Gregory Gutin	[13] [14] [16] [17] [22] [36]
13	Eun Jung Kim	[36]
14	Dieter Kratsch	[27]
15	Michael Krivelevich	[13] [14] [16] [17] [22]
16	Mathieu Liedloff	[27]
17	Daniel Lokshtanov	[19] [20] [21] [28] [31] [35] [37] [38]
18	Elena Losievskaja	[21]
19	Sounaka Mishra	[15] [30]
20	Neeldhara Misra	[31]
21	David Peleg	[25]
22	Eelko Penninkx	[35]
23	Stéphane Pérennes (Stephane Perennes)	[25]
24	Daniel Raible	[20] [37]
25	Venkatesh Raman	[1] [2] [3] [4] [5] [6] [7] [8] [10] [11] [12] [15] [24] [30] [34]
26	Frances A. Rosamond	[19] [21] [31]
27	Ignasi Sau	[25] [29]
28	Somnath Sikdar	[5] [11] [15] [30]
29	Sriganesh Srihari	[34]
30	Alexey A. Stepanov	[26]
31	C. R. Subramanian	[1] [4] [7] [15]
32	Stefan Szeider	[19]
33	Dimitrios M. Thilikos	[33] [35]
34	Carsten Thomassen	[19]
35	Yngve Villanger	[20] [28] [37]
36	Anders Yeo	[36]