460 - Katedra informatiky / Department of Computer Science: Nedávno přidané
Zobrazují se záznamy 551-560 z 562
-
Efficient searching in large inheritance hierarchies
(Database and Expert Systems Applications : 16th International Conference, DEXA 2005, Copenhagen, Denmark, August 22-26, 2005. Proceedings. 2005, p. 940-952.) -
Strategy and communication in robotic soccer game
(Computer Aided Systems Theory – EUROCAST 2005 : 10th International Conference on Computer Aided Systems Theory, Las Palmas de Gran Canaria, Spain, February 7 – 11, 2005. Revised selected papers. 2005, p. 565-570.) -
Computing the Tutte polynomial on graphs of bounded clique-width
(Graph-theoretic concepts in computer science : 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005. Revised selected papers. 2005, p. 59-68.) -
A parametrized algorithm for matroid branch-width
(SIAM Journal on Computing. 2005, vol. 35, issue 2, p. 259-277.) -
Undecidability results for bisimilarity on prefix rewrite systems
(Foundations of software science and computation structures : 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006. Proceedings. 2006, p. 277-291.) -
The Tutte polynomial for matroids of bounded branch-width
(Combinatorics, Probability and Computing. 2006, vol. 15, issue 3, p. 397-409.) -
Trees, grids, and MSO decidability: From graphs to matroids
(Theoretical Computer Science. 2006, vol. 351, issue 3, p. 372-393.) -
Equivalence-free exhaustive generation of matroid representations
(Discrete Applied Mathematics. 2006, vol. 154, issue 8, p. 1210-1222.) -
Branch-width, parse trees, and monadic second-order logic for matroids
(Journal of Combinatorial Theory, Series B. 2006, vol. 96, issue 3, p. 325-351.) -
Equivalence-checking on infinite-state systems: Techniques and results
(Theory and Practice of Logic Programming. 2006, vol. 6, issue 3.)