|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 22 occurrences of 18 keywords
|
|
|
|
|
Results
Found 127 publication records. Showing 127 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Fedor V. Fomin, Fabrizio Grandoni, Daniel Lokshtanov, Saket Saurabh |
Sharp Separation and Applications to Exact and Parameterized Algorithms.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh |
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Saket Saurabh, Yngve Villanger |
A Polynomial kernel for Proper Interval Vertex Deletion |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
Faster Parameterized Algorithms using Linear Programming |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
Planar F-Deletion: Approximation and Optimal FPT Algorithms |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao |
Faster algorithms for finding and counting subgraphs. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger |
Local search: Is brute-force avoidable? |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Ignasi Sau, Saket Saurabh |
Parameterized complexity of finding small degree-constrained subgraphs. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
Linear kernels for (connected) dominating set on H-minor-free graphs. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
Bidimensionality and geometric graphs. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Archontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh |
New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh |
Parameterized Complexity of MaxSat above Average. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
LP can be a cure for Parameterized Problems. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Venkatesh Raman, Saket Saurabh |
Lower bounds on kernelization. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
On the directed Full Degree Spanning Tree problem. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Subexponential algorithms for partial cover problems. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
Bandwidth on AT-free graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh |
A linear kernel for a planar connected dominating set. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
An exact algorithm for minimum distortion embedding. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian |
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé |
Hitting and Harvesting Pumpkins |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh |
Parameterized Complexity of MaxSat Above Average |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
Bidimensionality and Geometric Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström |
On Problems as Hard as CNFSAT |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Dániel Marx, Saket Saurabh |
Lower bounds based on the Exponential Time Hypothesis. |
Bulletin of the EATCS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos |
Strengthening Erdös-Pósa property for minor-closed graph classes. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé |
Kernels for feedback arc set in tournaments. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Fedor V. Fomin, Saket Saurabh |
Implicit branching and parameterized partial cover problems. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh |
Planar k-Path in Subexponential Time and Polynomial Space. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé |
Hitting and Harvesting Pumpkins. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
Paths, Flowers and Vertex Cover. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Dániel Marx, Saket Saurabh |
Slightly Superexponential Parameterized Problems. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Dániel Marx, Saket Saurabh |
Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Bidimensionality and EPTAS. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
Tight Bounds for Linkages in Planar Graphs. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
On the Hardness of Losing Width. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh |
On Cutwidth Parameterized by Vertex Cover. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
Hitting forbidden minors: Approximation and Kernelization. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh |
Approximation Algorithms for Minimum Chain Vertex Deletion. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh |
On Parameterized Independent Feedback Vertex Set. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
Algorithmic Aspects of Dominator Colorings in Graphs. |
IWOCA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh |
Parameterized algorithm for eternal vertex cover. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh |
Iterative compression and exact algorithms. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
Hitting forbidden minors: Approximation and Kernelization |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Dániel Marx, Saket Saurabh |
Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Bidimensionality and EPTAS |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
Intractability of Clique-Width Parameterizations. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos |
Bidimensionality and Kernels. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh |
Sharp Separation and Applications to Exact and Parameterized Algorithms. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh (eds.) |
Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings |
IPEC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
FPT Algorithms for Connected Feedback Vertex Set. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh |
The Curse of Connectivity: t-Total Vertex (Edge) Cover. |
COCOON |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
Imbalance Is Fixed Parameter Tractable. |
COCOON |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhijin Adiga, Rajesh Hemant Chitnis, Saket Saurabh |
Parameterized Algorithms for Boxicity. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh |
Ranking and Drawing in Subexponential Time. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh |
The effect of girth on the kernelization complexity of Connected Dominating Set. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh |
Determining the Winner of a Dodgson Election is Hard. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments. |
AAAI |
2010 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov |
On Two Techniques of Combining Branching and Treewidth. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Exact exponential time algorithms, #3-Coloring, #Minimum dominating set, Minimum maximal matching, k-Weighted vertex cover, NP hard problems, Treewidth, Parameterized algorithms |
| 1 | Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé |
A Linear Vertex Kernel for Maximum Internal Spanning Tree |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, B. V. Raghavendra Rao, Saket Saurabh |
Faster Algorithms for Finding and Counting Subgraphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé |
Kernels for Feedback Arc Set In Tournaments |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos |
(Meta) Kernelization |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
FPT Algorithms for Connected Feedback Vertex Set |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh |
Spanning Directed Trees with Many Leaves. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh |
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Max-leaf, Well-quasiordering, Bandwidth, Kernelization, Parameterized complexity |
| 1 | Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
The Budgeted Unique Coverage Problem and Color-Coding. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
An Exact Algorithm for Minimum Distortion Embedding. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
Clique-width: on the price of generality. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger |
Local Search: Is Brute-Force Avoidable? |
IJCAI |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael Dom, Daniel Lokshtanov, Saket Saurabh |
Incompressibility through Colors and IDs. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh |
Distortion Is Fixed Parameter Tractable. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Daniel Lokshtanov, Saket Saurabh |
Fast FAST. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Fedor V. Fomin, Saket Saurabh |
Counting Subgraphs via Homomorphisms. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh |
Linear Kernel for Planar Connected Dominating Set. |
TAMC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
On the Directed Degree-Preserving Spanning Tree Problem. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Saket Saurabh |
Even Faster Algorithm for Set Splitting! |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos |
(Meta) Kernelization. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Polynonial Time Preprocessing, Counting Monadic Second Order Logic, Finite Integer Index, Graphs of Bounded Genus, Planar Graphs, Kernelization, Parameterized Algorithms, Finite State |
| 1 | Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh |
Bandwidth on AT-Free Graphs. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé |
A Linear Vertex Kernel for Maximum Internal Spanning Tree. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Saket Saurabh, Somnath Sikdar |
Simpler Parameterized Algorithm for OCT. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé |
Kernels for Feedback Arc Set In Tournaments. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh |
Subexponential Algorithms for Partial Cover Problems. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh |
Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
t-vertex cover, Dominating set, Set cover, Independent set, Parameterized complexity |
| 1 | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh |
Spanning directed trees with many leaves |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2008 |
DBLP BibTeX RDF |
|
| 1 | Omid Amini, Fedor V. Fomin, Saket Saurabh |
Parameterized Algorithms for Partial Cover Problems |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Saket Saurabh, Alexey A. Stepanov |
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh |
Iterative Compression and Exact Algorithms. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 127 (100 per page; Change: ) Pages: [ 1][ 2][ >>] |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")