List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Combinatorial bounds via measure and conquer ACM Transactions on Algorithms | 2018-11-05 | Paper |
| On two techniques of combining branching and treewidth Algorithmica | 2009-06-22 | Paper |
| Counting Minimum Weighted Dominating Sets Lecture Notes in Computer Science | 2009-03-06 | Paper |
| A Moderately Exponential Time Algorithm for Full Degree Spanning Tree Lecture Notes in Computer Science | 2008-05-27 | Paper |
| On maximum number of minimal dominating sets in graphs Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
| Algorithms and Computation Lecture Notes in Computer Science | 2006-11-14 | Paper |
Research outcomes over time
This page was built for person: Alexey A. Stepanov
