Alexey A. Stepanov

According to our database, Alexey A. Stepanov authored at least 8 papers between 2005 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Principal Feature Visualisation in Convolutional Neural Networks.

Marianne Bakken, Johannes Kvam, Alexey A. Stepanov, Asbjørn Berge

Proceedings of the Computer Vision - ECCV 2020, 2020

2009

On Two Techniques of Combining Branching and Treewidth.

Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov

Algorithmica, 2009

2008

Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications.

Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov

ACM Trans. Algorithms, 2008

Exact Exponential Time Algorithms for Max Internal Spanning Tree

Henning Fernau, Daniel Raible, Serge Gaspers, Alexey A. Stepanov

CoRR, 2008

A Moderately Exponential Time Algorithm for Full Degree Spanning Tree.

Serge Gaspers, Saket Saurabh, Alexey A. Stepanov

Proceedings of the Theory and Applications of Models of Computation, 2008

2007

Counting Minimum Weighted Dominating Sets.

Fedor V. Fomin, Alexey A. Stepanov

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2005

On maximum number of minimal dominating sets in graphs.

Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov

Electron. Notes Discret. Math., 2005

Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach.

Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005