460 - Katedra informatiky / Department of Computer Science: Nedávno přidané
Zobrazují se záznamy 561-562 z 562
-
Crossing number is hard for cubic graphs
(Journal of Combinatorial Theory, Series B. 2006, vol. 96, issue 4, p. 455-471.) -
A new range query algorithm for Universal B-trees
(Information Systems. 2006, vol. 31, issue 6, p. 489-511.)