2012

2012a
A note on exact algorithms for vertex ordering problems on graphs
H. L. Bodlaender and F. V. Fomin and A. M. C. A. Koster and D. Kratsch and D. M. Thilikos
Theory Comput. Syst.  50  420--432  (2012)
link
2012b
Catalan structures and dynamic programming in H-minor-free graphs
F. Dorn and F. V. Fomin and D. M. Thilikos
J. Comput. System Sci.  78  1606--1622  (2012)
link
2012c
Connected graph searching
L. Barrière and P. Flocchini and F. V. Fomin and P. Fraigniaud and N. Nisse and N. Santoro and D. M. Thilikos
Inform. and Comput.  219  1--16  (2012)
link
2012d
Cops and robber game without recharging
F. V. Fomin and P. A. Golovach and D. Lokshtanov
Theory Comput. Syst.  50  611--620  (2012)
link
2012e
Cops and Robber with Constraints
F. V. Fomin and P. A. Golovach and P. Pralat
SIAM J. Discrete Math.  26  571-590  (2012)
link
2012f
Counting Subgraphs via Homomorphisms
O. Amini and F. V. Fomin and S. Saurabh
SIAM J. Discrete Math.  26  695-717  (2012)
link
2012g
Fast minor testing in planar graphs
I. Adler and F. Dorn and F. V. Fomin and I. Sau and D. M. Thilikos
Algorithmica  64  69--84  (2012)
link
2012h
Faster algorithms for finding and counting subgraphs
F. V. Fomin and D. Lokshtanov and V. Raman and S. Saurabh and B. V. R. Rao
J. Comput. System Sci.  78  698--706  (2012)
link
2012i
Kernel(s) for problems with no kernel: On out-trees with many leaves
D. Binkele-Raible and H. Fernau and F. V. Fomin and D. Lokshtanov and S. Saurabh and Y. Villanger
ACM Transactions on Algorithms  8  38  (2012)
link
2012j
Local search: is brute-force avoidable?
M. R. Fellows and F. V. Fomin and D. Lokshtanov and F. Rosamond and S. Saurabh and Y. Villanger
J. Comput. System Sci.  78  707--719  (2012)
link
2012k
On exact algorithms for treewidth
H. L. Bodlaender and F. V. Fomin and A. M. C. A. Koster and D. Kratsch and D. M. Thilikos
ACM Transactions on Algorithms  9  12  (2012)
link
2012l
Parameterized complexity of the spanning tree congestion problem
H. L. Bodlaender and F. V. Fomin and P. A. Golovach and Y. Otachi and E. J. van Leeuwen
Algorithmica  64  85--111  (2012)
link
2012m
Sharp separation and applications to exact and parameterized algorithms
F. V. Fomin and F. Grandoni and D. Lokshtanov and S. Saurabh
Algorithmica  63  692--706  (2012)
link
2012n
Treewidth computation and extremal combinatorics
F. V. Fomin and Y. Villanger
Combinatorica  32  289--308  (2012)
link