Current Research Information SysTem In Norway
 
 

 English version


 
Hovedside
Forskningsresultater/NVI
Forskere
Prosjekter
Forskningsenheter
Logg inn
Om Cristin
 
 
   
Eksporter til


Viser treff 1-8 av 8

2019
1 Stepanov, Alexey; Buhaug, Håvard.
KOPROD: Mot automatisk produksjon av komplekse produkter. NFEA Forum for Automatisk Produksjon 2019; 2019-08-28 - 2019-08-29
SINTEF Untitled
 
2009
2 Fomin, Fedor; Gaspers, Serge; Saurabh, Saket; Stepanov, Alexey.
On two techniques of combining branching and treewidth. Algorithmica 2009 ;Volum 54.(2) s. 181-207
UiB Untitled
 
2008
3 Fomin, Fedor; Grandoni, Fabrizio; Pyatkin, Artem V; Stepanov, Alexey.
Combinatorial Bounds via Measure and Conquer: Bounding Minimal Dominating Sets and Applications. ACM Transactions on Algorithms (TALG) 2008 ;Volum 5.(1) s. -
UiB Untitled
 
4 Gaspers, Serge; Saurabh, Saket; Stepanov, Alexey.
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. Lecture Notes in Computer Science (LNCS) 2008 ;Volum 4978. s. 479-489
UiB Untitled
 
5 Stepanov, Alexey.
Exact Algorithms for Hard Listing, Counting and Decision Problems. Universitetet i Bergen 2008
UiB Untitled
 
2007
6 Fomin, Fedor; Stepanov, Alexey.
Counting Minimum Weighted Dominating Sets. Springer 2007 (ISBN 3-540-73544-5) ;Volum 4598.11 s. Lecture Notes in Computer Science(1)
UiB Untitled
 
2005
7 Fomin, Fedor; Grandoni, Fabrizio; Pyatkin, Artem V; Stepanov, Alexey.
On maximum number of minimal dominating sets in graphs. Electronic Notes in Discrete Mathematics 2005 ;Volum 22. s. 157-162
UiB Untitled
 
8 Fomin, Fedor; Grandoni, Fabrizio; Pyatkin, Artem V; Stepanov, Alexey.
Bounding the number of minimal dominating sets: A measure and conquer approach. Lecture Notes in Computer Science (LNCS) 2005 ;Volum 3827. s. 573-582
UiB Untitled