| 2009 |
|---|
| 11 | EE | Serge Gaspers,
Gregory B. Sorkin:
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between.
SODA 2009: 606-615 |
| 2008 |
|---|
| 10 | EE | Fedor V. Fomin,
Serge Gaspers,
Dieter Kratsch,
Mathieu Liedloff,
Saket Saurabh:
Iterative Compression and Exact Algorithms.
MFCS 2008: 335-346 |
| 9 | EE | Serge Gaspers,
Saket Saurabh,
Alexey A. Stepanov:
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree.
TAMC 2008: 479-489 |
| 8 | EE | Serge Gaspers,
Dieter Kratsch,
Mathieu Liedloff:
On Independent Sets and Bicliques in Graphs.
WG 2008: 171-182 |
| 7 | EE | Fedor V. Fomin,
Serge Gaspers,
Artem V. Pyatkin,
Igor Razgon:
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms.
Algorithmica 52(2): 293-307 (2008) |
| 6 | EE | Henning Fernau,
Daniel Raible,
Serge Gaspers,
Alexey A. Stepanov:
Exact Exponential Time Algorithms for Max Internal Spanning Tree
CoRR abs/0811.1875: (2008) |
| 2007 |
|---|
| 5 | EE | Fedor V. Fomin,
Serge Gaspers,
Saket Saurabh:
Improved Exact Algorithms for Counting 3- and 4-Colorings.
COCOON 2007: 65-74 |
| 2006 |
|---|
| 4 | EE | Fedor V. Fomin,
Serge Gaspers,
Saket Saurabh:
Branching and Treewidth Based Exact Algorithms.
ISAAC 2006: 16-25 |
| 3 | EE | Fedor V. Fomin,
Serge Gaspers,
Artem V. Pyatkin:
Finding a Minimum Feedback Vertex Set in Time O (1.7548n).
IWPEC 2006: 184-191 |
| 2 | EE | Serge Gaspers,
Dieter Kratsch,
Mathieu Liedloff:
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes.
SWAT 2006: 148-159 |
| 1 | EE | Serge Gaspers,
Mathieu Liedloff:
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs.
WG 2006: 78-89 |
