The SCEAS System
| |||||||

## Search the dblp DataBase
Serge Gaspers:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Fedor V. Fomin, Serge Gaspers, Saket Saurabh
**Branching and Treewidth Based Exact Algorithms.**[Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:16-25 [Conf] - Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin
**Finding a Minimum Feedback Vertex Set in Time**[Citation Graph (0, 0)][DBLP]*O*(1.7548^{n}). IWPEC, 2006, pp:184-191 [Conf] - Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
**Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes.**[Citation Graph (0, 0)][DBLP] SWAT, 2006, pp:148-159 [Conf] - Serge Gaspers, Mathieu Liedloff
**A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs.**[Citation Graph (0, 0)][DBLP] WG, 2006, pp:78-89 [Conf] - 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] **Feedback Vertex Sets in Tournaments.**[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]**An Exponential Time 2-Approximation Algorithm for Bandwidth.**[Citation Graph (, )][DBLP]**Iterative Compression and Exact Algorithms.**[Citation Graph (, )][DBLP]**A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between.**[Citation Graph (, )][DBLP]**A Moderately Exponential Time Algorithm for Full Degree Spanning Tree.**[Citation Graph (, )][DBLP]**Exact and Parameterized Algorithms for Max Internal Spanning Tree.**[Citation Graph (, )][DBLP]**On Independent Sets and Bicliques in Graphs.**[Citation Graph (, )][DBLP]**Exact Exponential-Time Algorithms for Finding Bicliques in a Graph.**[Citation Graph (, )][DBLP]**On Two Techniques of Combining Branching and Treewidth.**[Citation Graph (, )][DBLP]**On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms.**[Citation Graph (, )][DBLP]**Exact Exponential Time Algorithms for Max Internal Spanning Tree**[Citation Graph (, )][DBLP]**On Feedback Vertex Sets in Tournaments**[Citation Graph (, )][DBLP]**An Exponential Time 2-Approximation Algorithm for Bandwidth**[Citation Graph (, )][DBLP]**A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between**[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]**Complexity of Splits Reconstruction for Low-Degree Trees**[Citation Graph (, )][DBLP]**Parameterizing by the Number of Numbers**[Citation Graph (, )][DBLP]**Parallel cleaning of a network with brushes.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

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