"0"^^ . . "Byly dosaz\u030Ceny nove\u0301 teoreticke\u0301 vy\u0301sledky na svetove urovni."@cs . "Many important algorithmic problems are known to be NP-hard and thus it is unlikely that they could be solved efficiently on all possible inputs. One approach to cope with such problems is the use of parameterized complexity theory: the difficulty of inputs is classified by an additional parameter and algorithms are designed to efficiently solve problems on inputs with a bounded parameter. Our goal is to obtain new structural results on classes of (sparse) combinatorial objects, particularly on objects with bounded width parameters, and apply these new results in the design of parameterized algorithms."@en . "Well-structured combinatorial classes, width parameters, and design of efficient algorithms"@en . "1"^^ . . . "structural graph theory parameterized algorithm width parameter"@en . "1"^^ . . . . . . . . . . . "20"^^ . . . . "2014-07-01+02:00"^^ . "20"^^ . "Je zn\u00E1mo, \u017Ee \u0159ada d\u016Fle\u017Eit\u00FDch algoritmick\u00FDch probl\u00E9m\u016F je NP-\u00FApln\u00E1, a neo\u010Dek\u00E1v\u00E1 se, \u017Ee takov\u00E9to probl\u00E9my by byly \u0159e\u0161iteln\u00E9 efektivn\u00EDmi algoritmy pro v\u0161echny mo\u017En\u00E9 vstupy. Jedna z oblast\u00ED, kter\u00E1 studuje mo\u017Enosti \u0159e\u0161en\u00ED takov\u00FDch algoritmick\u00FDch probl\u00E9m\u016F, je teorie parametrizovan\u00E9 slo\u017Eitosti: obt\u00ED\u017Enost vstup\u016F je pops\u00E1na nov\u00FDm parametrem a hledaj\u00ED se algoritmy, kter\u00E9 efektivn\u011B vy\u0159e\u0161\u00ED vstupy, jejich\u017E obt\u00ED\u017Enost je parametrem omezena. C\u00EDlem p\u0159edkl\u00E1dan\u00E9ho projektu je nalezen\u00ED nov\u00FDch struktur\u00E1ln\u00EDch v\u00FDsledk\u016F o t\u0159\u00EDd\u00E1ch (\u0159\u00EDdk\u00FDch) kombinatorick\u00FDch struktur, zejm\u00E9na objekt\u016F s omezen\u00FDmi \u0161\u00ED\u0159kov\u00FDmi parametry, a vyu\u017Eit\u00ED nov\u011B z\u00EDskan\u00FDch poznatk\u016F v n\u00E1vrhu parametrizovan\u00FDch algoritm\u016F." . "2011-01-01+01:00"^^ . "T\u0159\u00EDdy dob\u0159e strukturovan\u00FDch kombinatorick\u00FDch objekt\u016F, \u0161\u00ED\u0159kov\u00E9 parametry a n\u00E1vrh efektivn\u00EDch algoritm\u016F" . . "2013-12-31+01:00"^^ . "2013-06-07+02:00"^^ . "http://www.isvav.cz/projectDetail.do?rowId=GAP202/11/0196"^^ . . "GAP202/11/0196" . . "The project obtained new structural results of cutting edge quality on classes of (sparse) combinatorial objects, particularly on objects with bounded width parameters, and applied these new results in the design of parameterized algorithms."@en .