Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. - Fedor V. Fomin; Fabrizio Grandoni 001; Artem V. Pyatkin; Alexey A. Stepanov (ISAAC, 2005)

On maximum number of minimal dominating sets in graphs. - Fedor V. Fomin; Fabrizio Grandoni 001; Artem V. Pyatkin; Alexey A. Stepanov (Electron. Notes Discret. Math., 2005)

Counting Minimum Weighted Dominating Sets. - Fedor V. Fomin; Alexey A. Stepanov (COCOON, 2007)

A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. - Serge Gaspers; Saket Saurabh 001; Alexey A. Stepanov (TAMC, 2008)

Exact Exponential Time Algorithms for Max Internal Spanning Tree - Henning Fernau; Daniel Raible 001; Serge Gaspers; Alexey A. Stepanov (CoRR, 2008)

Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. - Fedor V. Fomin; Fabrizio Grandoni 001; Artem V. Pyatkin; Alexey A. Stepanov (ACM Trans. Algorithms, 2008)

On Two Techniques of Combining Branching and Treewidth. - Fedor V. Fomin; Serge Gaspers; Saket Saurabh 001; Alexey A. Stepanov (Algorithmica, 2009)

Principal Feature Visualisation in Convolutional Neural Networks. - Marianne Bakken; Johannes Kvam; Alexey A. Stepanov; Asbjørn Berge (ECCV (23), 2020)