BORA - UiB

Bergen Open Research Archive

Browsing Department of Informatics by Author "Fomin, Fedor V."

Bergen Open Research Archive

Browsing Department of Informatics by Author "Fomin, Fedor V."

Sort by: Order: Results:

  • Fomin, Fedor V.; Todinca, Ioan; Kratsch, Dieter; Villanger, Yngve (Journal article, SIAM Journals, 2006)
  • Drange, Pål Grønås; Fomin, Fedor V.; Pilipczuk, Michal Pawel; Villanger, Yngve (Journal article, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014-02-19)
    Let F be a family of graphs. In the F-Completion problem, we are given an n-vertex graph G and an integer k as input, and asked whether at most k edges can be added to G so that the resulting graph does not contain a ...
  • Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M.C.A.; Kratsch, Dieter; Thilikos, Dimitrios M. (Peer reviewed; Journal article, Springer, 2011-01-21)
    In this note, we give a proof that several vertex ordering problems can be solved in O ∗(2 n ) time and O ∗(2 n ) space, or in O ∗(4 n ) time and polynomial space. The algorithms generalize algorithms for the Travelling ...

Search BORA


Browse

My Account