 | 2009 |
|---|
| 7 |       | Fedor V. Fomin,
Serge Gaspers,
Saket Saurabh,
Alexey A. Stepanov:
On Two Techniques of Combining Branching and Treewidth.
Algorithmica 54(2): 181-207 (2009) |
| 2008 |
|---|
| 6 | | Serge Gaspers,
Saket Saurabh,
Alexey A. Stepanov:
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree.
TAMC 2008: 479-489 |
| 5 | | Fedor V. Fomin,
Fabrizio Grandoni,
Artem V. Pyatkin,
Alexey A. Stepanov:
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications.
ACM Transactions on Algorithms 5(1): (2008) |
| 4 | | Henning Fernau,
Daniel Raible,
Serge Gaspers,
Alexey A. Stepanov:
Exact Exponential Time Algorithms for Max Internal Spanning Tree
CoRR abs/0811.1875: (2008) |
| 2007 |
|---|
| 3 | | Fedor V. Fomin,
Alexey A. Stepanov:
Counting Minimum Weighted Dominating Sets.
COCOON 2007: 165-175 |
| 2005 |
|---|
| 2 | | Fedor V. Fomin,
Fabrizio Grandoni,
Artem V. Pyatkin,
Alexey A. Stepanov:
Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach.
ISAAC 2005: 573-582 |
| 1 | | Fedor V. Fomin,
Fabrizio Grandoni,
Artem V. Pyatkin,
Alexey A. Stepanov:
On maximum number of minimal dominating sets in graphs.
Electronic Notes in Discrete Mathematics 22: 157-162 (2005) |
