Browsing by Author "Hliněný, Petr"

DSpace/Manakin Repository

DSpace Home
Browsing by Author

Browsing by Author "Hliněný, Petr"

Now showing items 1-20 of 20

Branch-width, parse trees, and monadic second-order logic for matroids

Hliněný, Petr (Journal of combinatorial theory. Series B. 2006, vol. 96, issue 3, p. 325-351.)
Computing the Tutte polynomial on graphs of bounded clique-width

Giménez, Omer; Hliněný, Petr; Noy, Marc (Graph-theoretic concepts in computer science : 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005. Revised selected papers. 2005, p. 59-68. Lecture notes in computer science, vol. 3787.)
Computional aspects of representable matroids

Hliněný, Petr; (Habilitační práce, 2003)
Crossing number is hard for cubic graphs

Hliněný, Petr (Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004. Proceedings. 2004, p. 772-782. Lecture notes in computer science, vol. 3153.)
Crossing number is hard for cubic graphs

Hliněný, Petr (Journal of combinatorial theory. Series B. 2006, vol. 96, issue 4, p. 455-471.)
Equivalence-free exhaustive generation of matroid representations

Hliněný, Petr (Discrete applied mathematics. 2006, vol. 154, issue 8, p. 1210-1222.)
Java interface k programu MACEK

Krucina, Marian; Hliněný, Petr; (Bakalářská práce, 2005)
Mobilní počítačová podpora výuky UTI

Vašíček, Petr; Hliněný, Petr; (Bakalářská práce, 2005)
Objektový kreslící nástroj pro TEX

Jeseňák, Ondřej; Hliněný, Petr; (Diplomová práce, 2005)
On decidability of MSO theories of representable matroids

Hliněný, Petr; Seese, Detlef (Parameterized and exact computation : First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004. Proceedings. 2006, p. 96-107. Lecture notes in computer science, vol. 3162.)
On matroid properties definable in the MSO logic

Hliněný, Petr (Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003. Proceedings. 2003, p. 470-479. Lecture notes in computer science, vol. 2747.)
On matroid representability and minor problems

Hliněný, Petr (Mathematical foundations of computer science 2006 : 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006. Proceedings. 2006, p. 505-516. Lecture notes in computer science, vol. 4162.)
On possible counterexamples to Negami's planar cover conjecture

Hliněný, Petr; Thomas, Robin (Journal of graph theory. 2004, vol. 46, issue 3, p. 183-206.)
A parametrized algorithm for matroid branch-width

Hliněný, Petr (SIAM journal on computing. 2005, vol. 35, issue 2, p. 259-277.)
Počítačová podpora výuky optimalizačních úloh

Michalec, Vít; Hliněný, Petr; (Vysoká škola báňská - Technická univerzita Ostrava. Fakulta elektrotechniky a informatiky, Diplomová práce, 2007)
Some hard problems on matroid spikes

Hliněný, Petr (Theory of computing systems. 2007, vol. 41, no. 3, p. 551-562.)
Trees, grids, and MSO decidability: From graphs to matroids

Hliněný, Petr; Seese, Detlef (Theoretical computer science. 2006, vol. 351, issue 3, p. 372-393.)
The Tutte polynomial for matroids of bounded branch-width

Hliněný, Petr (Combinatorics, probability and computing. 2006, vol. 15, issue 3, p. 397-409.)
Výuková aplikace pro řešení úloh celočíselného programování

Ciprich, Nikola; Hliněný, Petr; (Bakalářská práce, 2005)
Width parameters beyond tree-width and their applications

Hliněný, Petr; Oum, Sang-il; Seese, Detlef; Gottlob, Georg (Computer journal. 2008. vol. 51, no. 3, p. 326-362.)

Now showing items 1-20 of 20

Search DSpace

Advanced Search

Navigation

Browse

All of DSpace

Browsing by Author "Hliněný, Petr"

DSpace/Manakin Repository

Browsing by Author "Hliněný, Petr"

Search DSpace

Navigation

Browse

All of DSpace

My Account