dblp.uni-trier.dewww.uni-trier.de

Saket Saurabh Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
50EENathann 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. COCOON 2009: 37-46
49EENeeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: The Budgeted Unique Coverage Problem and Color-Coding. CSR 2009: 310-321
48EEMichael Dom, Daniel Lokshtanov, Saket Saurabh: Incompressibility through Colors and IDs. ICALP (1) 2009: 378-389
47EEMichael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh: Distortion Is Fixed Parameter Tractable. ICALP (1) 2009: 463-474
46EENoga Alon, Daniel Lokshtanov, Saket Saurabh: Fast FAST. ICALP (1) 2009: 49-58
45EEOmid Amini, Fedor V. Fomin, Saket Saurabh: Counting Subgraphs via Homomorphisms. ICALP (1) 2009: 71-82
44EEMichael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger: Local Search: Is Brute-Force Avoidable? IJCAI 2009: 486-491
43EEFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh: Clique-width: on the price of generality. SODA 2009: 825-834
42EEHenning 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
41EEDaniel Lokshtanov, Matthias Mnich, Saket Saurabh: Linear Kernel for Planar Connected Dominating Set. TAMC 2009: 281-290
40EEFedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov: On Two Techniques of Combining Branching and Treewidth. Algorithmica 54(2): 181-207 (2009)
39EENathann 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)
38EEHans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos: (Meta) Kernelization CoRR abs/0904.0727: (2009)
37EEStéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé: Kernels for Feedback Arc Set In Tournaments CoRR abs/0907.2165: (2009)
36EEFedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé: A Linear Vertex Kernel for Maximum Internal Spanning Tree CoRR abs/0907.3208: (2009)
35EENeeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: FPT Algorithms for Connected Feedback Vertex Set CoRR abs/0909.3180: (2009)
2008
34EEVenkatesh 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
32EEOmid Amini, Fedor V. Fomin, Saket Saurabh: Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). FSTTCS 2008
31EEMichael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh: Graph Layout Problems Parameterized by Vertex Cover. ISAAC 2008: 294-305
30EESounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: König Deletion Sets and Vertex Covers above the Matching Size. ISAAC 2008: 836-847
29EEOmid Amini, Ignasi Sau, Saket Saurabh: Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. IWPEC 2008: 13-29
28EEMichael Dom, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger: Capacitated Domination and Covering: A Parameterized Perspective. IWPEC 2008: 78-90
27EEFedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh: Iterative Compression and Exact Algorithms. MFCS 2008: 335-346
26EESerge Gaspers, Saket Saurabh, Alexey A. Stepanov: A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. TAMC 2008: 479-489
25EEOmid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh: Degree-Constrained Subgraph Problems: Hardness and Approximation Results. WAOA 2008: 29-42
24EEVenkatesh 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)
23EEOmid Amini, Fedor V. Fomin, Saket Saurabh: Parameterized Algorithms for Partial Cover Problems CoRR abs/0802.1722: (2008)
22EENoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Spanning directed trees with many leaves CoRR abs/0803.0701: (2008)
21EEMichael 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)
20EEHenning 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
19EEMichael 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
18EEFedor V. Fomin, Serge Gaspers, Saket Saurabh: Improved Exact Algorithms for Counting 3- and 4-Colorings. COCOON 2007: 65-74
17EENoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Better Algorithms and Bounds for Directed Maximum Leaf Problems. FSTTCS 2007: 316-327
16EENoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP 2007: 352-362
15EESounaka 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
14EENoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Better Algorithms and Bounds for Directed Maximum Leaf Problems CoRR abs/0707.1095: (2007)
13EENoga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems CoRR abs/cs/0702049: (2007)
12EEVenkatesh Raman, Saket Saurabh: Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG. Inf. Process. Lett. 104(2): 65-72 (2007)
11EEVenkatesh 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
10EESushmita Gupta, Venkatesh Raman, Saket Saurabh: Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems. FSTTCS 2006: 139-151
9EEFedor V. Fomin, Serge Gaspers, Saket Saurabh: Branching and Treewidth Based Exact Algorithms. ISAAC 2006: 16-25
8EEVenkatesh Raman, Saket Saurabh: Triangles, 4-Cycles and Parameterized (In-)Tractability. SWAT 2006: 304-315
7EEVenkatesh 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)
6EEVenkatesh Raman, Saket Saurabh: Parameterized algorithms for feedback set problems and their duals in tournaments. Theor. Comput. Sci. 351(3): 446-458 (2006)
2005
5EEVenkatesh Raman, Saket Saurabh, Somnath Sikdar: Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. ICTCS 2005: 375-389
4EEVenkatesh Raman, Saket Saurabh, C. R. Subramanian: Faster algorithms for feedback vertex set. Electronic Notes in Discrete Mathematics 19: 273-279 (2005)
2004
3EEVenkatesh Raman, Saket Saurabh: Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments. IWPEC 2004: 260-270
2003
2EEVenkatesh Raman, Saket Saurabh: Parameterized Complexity of Directed Feedback Set Problems in Tournaments. WADS 2003: 484-492
2002
1EEVenkatesh Raman, Saket Saurabh, C. R. Subramanian: Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. ISAAC 2002: 241-248

Coauthor Index

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

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)