The SCEAS System
| |||||||

## Search the dblp DataBase
Saket Saurabh:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Sushmita Gupta, Venkatesh Raman, Saket Saurabh
**Fast Exponential Algorithms for Maximum**[Citation Graph (0, 0)][DBLP]*r*-Regular Induced Subgraph Problems. FSTTCS, 2006, pp:139-151 [Conf] - Venkatesh Raman, Saket Saurabh, Somnath Sikdar
**Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems.**[Citation Graph (0, 0)][DBLP] ICTCS, 2005, pp:375-389 [Conf] - Fedor V. Fomin, Serge Gaspers, Saket Saurabh
**Branching and Treewidth Based Exact Algorithms.**[Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:16-25 [Conf] - Venkatesh Raman, Saket Saurabh, C. R. Subramanian
**Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set.**[Citation Graph (0, 0)][DBLP] ISAAC, 2002, pp:241-248 [Conf] - Venkatesh Raman, Saket Saurabh
**Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments.**[Citation Graph (0, 0)][DBLP] IWPEC, 2004, pp:260-270 [Conf] - Venkatesh Raman, Saket Saurabh
**Triangles, 4-Cycles and Parameterized (In-)Tractability.**[Citation Graph (0, 0)][DBLP] SWAT, 2006, pp:304-315 [Conf] - Venkatesh Raman, Saket Saurabh
**Parameterized Complexity of Directed Feedback Set Problems in Tournaments.**[Citation Graph (0, 0)][DBLP] WADS, 2003, pp:484-492 [Conf] - Venkatesh Raman, Saket Saurabh, C. R. Subramanian
**Faster fixed parameter tractable algorithms for finding feedback vertex sets.**[Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2006, v:2, n:3, pp:403-415 [Journal] - Venkatesh Raman, Saket Saurabh
**Parameterized algorithms for feedback set problems and their duals in tournaments.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:351, n:3, pp:446-458 [Journal] - Fedor V. Fomin, Serge Gaspers, Saket Saurabh
**Improved Exact Algorithms for Counting 3- and 4-Colorings.**[Citation Graph (0, 0)][DBLP] COCOON, 2007, pp:65-74 [Conf] - Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
**Parameterized Algorithms for Directed Maximum Leaf Problems.**[Citation Graph (0, 0)][DBLP] ICALP, 2007, pp:352-362 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] COCOA, 2007, pp:366-377 [Conf] - Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
**Parameterized Algorithms for Directed Maximum Leaf Problems**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh
**Better Algorithms and Bounds for Directed Maximum Leaf Problems**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Venkatesh Raman, Saket Saurabh
**Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:104, n:2, pp:65-72 [Journal] **Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments.**[Citation Graph (, )][DBLP]**Algorithm for Finding**[Citation Graph (, )][DBLP]*k*-Vertex Out-trees and Its Application to*k*-Internal Out-branching Problem.**The Curse of Connectivity:**[Citation Graph (, )][DBLP]*t*-Total Vertex (Edge) Cover.**Imbalance Is Fixed Parameter Tractable.**[Citation Graph (, )][DBLP]**The Budgeted Unique Coverage Problem and Color-Coding.**[Citation Graph (, )][DBLP]**(Meta) Kernelization.**[Citation Graph (, )][DBLP]**Better Algorithms and Bounds for Directed Maximum Leaf Problems.**[Citation Graph (, )][DBLP]**Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract).**[Citation Graph (, )][DBLP]**Subexponential Algorithms for Partial Cover Problems.**[Citation Graph (, )][DBLP]**Kernels for Feedback Arc Set In Tournaments.**[Citation Graph (, )][DBLP]**Incompressibility through Colors and IDs.**[Citation Graph (, )][DBLP]**Distortion Is Fixed Parameter Tractable.**[Citation Graph (, )][DBLP]**Fast FAST.**[Citation Graph (, )][DBLP]**Counting Subgraphs via Homomorphisms.**[Citation Graph (, )][DBLP]**Local Search: Is Brute-Force Avoidable?**[Citation Graph (, )][DBLP]**A Linear Vertex Kernel for Maximum Internal Spanning Tree.**[Citation Graph (, )][DBLP]**Bandwidth on AT-Free Graphs.**[Citation Graph (, )][DBLP]**The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.**[Citation Graph (, )][DBLP]**Graph Layout Problems Parameterized by Vertex Cover.**[Citation Graph (, )][DBLP]**König Deletion Sets and Vertex Covers above the Matching Size.**[Citation Graph (, )][DBLP]**Even Faster Algorithm for Set Splitting!**[Citation Graph (, )][DBLP]**Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem.**[Citation Graph (, )][DBLP]**Capacitated Domination and Covering: A Parameterized Perspective.**[Citation Graph (, )][DBLP]**On the Directed Degree-Preserving Spanning Tree Problem.**[Citation Graph (, )][DBLP]**Sharp Separation and Applications to Exact and Parameterized Algorithms.**[Citation Graph (, )][DBLP]**Iterative Compression and Exact Algorithms.**[Citation Graph (, )][DBLP]**Clique-width: on the price of generality.**[Citation Graph (, )][DBLP]**Bidimensionality and Kernels.**[Citation Graph (, )][DBLP]**Algorithmic Lower Bounds for Problems Parameterized with Clique-Width.**[Citation Graph (, )][DBLP]**Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves.**[Citation Graph (, )][DBLP]**Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs.**[Citation Graph (, )][DBLP]**Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing.**[Citation Graph (, )][DBLP]**A Moderately Exponential Time Algorithm for Full Degree Spanning Tree.**[Citation Graph (, )][DBLP]**Linear Kernel for Planar Connected Dominating Set.**[Citation Graph (, )][DBLP]**Degree-Constrained Subgraph Problems: Hardness and Approximation Results.**[Citation Graph (, )][DBLP]**An Exact Algorithm for Minimum Distortion Embedding.**[Citation Graph (, )][DBLP]**FPT Algorithms for Connected Feedback Vertex Set.**[Citation Graph (, )][DBLP]**Parameterized Algorithms for Generalized Domination.**[Citation Graph (, )][DBLP]**Improving the gap of Erdös-Pósa property for minor-closed graph classes.**[Citation Graph (, )][DBLP]**Simpler Parameterized Algorithm for OCT.**[Citation Graph (, )][DBLP]**On Two Techniques of Combining Branching and Treewidth.**[Citation Graph (, )][DBLP]**Short Cycles Make**[Citation Graph (, )][DBLP]*W*-hard Problems Hard: FPT Algorithms for*W*-hard Problems in Graphs with no Short Cycles.**Parameterized Algorithms for Partial Cover Problems**[Citation Graph (, )][DBLP]**Spanning directed trees with many leaves**[Citation Graph (, )][DBLP]**Parameterized Low-distortion Embeddings - Graph metrics into lines and trees**[Citation Graph (, )][DBLP]**Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves**[Citation Graph (, )][DBLP]**Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem**[Citation Graph (, )][DBLP]**(Meta) Kernelization**[Citation Graph (, )][DBLP]**Kernels for Feedback Arc Set In Tournaments**[Citation Graph (, )][DBLP]**A Linear Vertex Kernel for Maximum Internal Spanning Tree**[Citation Graph (, )][DBLP]**FPT Algorithms for Connected Feedback Vertex Set**[Citation Graph (, )][DBLP]**Faster Algorithms for Finding and Counting Subgraphs**[Citation Graph (, )][DBLP]**Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs**[Citation Graph (, )][DBLP]**Bidimensionality and EPTAS**[Citation Graph (, )][DBLP]**Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal**[Citation Graph (, )][DBLP]
Search in 1.755secs, Finished in 1.760secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |