Двумерность: различия между версиями

Перейти к навигации Перейти к поиску
Строка 78: Строка 78:
1. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Bidimensional parameters and local treewidth. SIAM J. Discret. Math. 18(3), 501-511 (2004)
1. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Bidimensional parameters and local treewidth. SIAM J. Discret. Math. 18(3), 501-511 (2004)


2. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs. ACM Trans. Algorithms 1(1), 33^7 (2005)
2. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs. ACM Trans. Algorithms 1(1), 33-47 (2005)


3. Demaine, E.D., Fomin, F.V., Hajiaghayi, M.,Thilikos, D.M.: Subexponential parametrized algorithms on graphs of bounded genus and H-minor-free graphs. J. ACM 52(6), 866-893 (2005)
3. Demaine, E.D., Fomin, F.V., Hajiaghayi, M.,Thilikos, D.M.: Subexponential parametrized algorithms on graphs of bounded genus and H-minor-free graphs. J. ACM 52(6), 866-893 (2005)


4. Demaine, E.D., Hajiaghayi, M.:The bidimensionality theory and its algorithmic applications. Comput. J. To appear
4. Demaine, E.D., Hajiaghayi, M.:The bidimensionality theory and its algorithmic applications. Comput. J. 51(3) (2008)


5. Demaine, E.D., Hajiaghayi, M.: Diameter and treewidth  in minor-closed graph families, revisited. Algorithmica 40(3),211-215(2004)
5. Demaine, E.D., Hajiaghayi, M.: Diameter and treewidth  in minor-closed graph families, revisited. Algorithmica 40(3),211-215(2004)

Навигация