Assoc. Prof. RNDr. Petr Hliněný, Ph.D.
|
HLINĚNÝ, Petr - CHIMANI, Markus - MUTZEL, Petra.
Vertex insertion approximates the crossing number of apex graphs. European Journal of Combinatorics, Elsevier, The Nederlands. ISSN 0195-6698, 2012, p. to appear.
HLINĚNÝ, Petr - CHIMANI, Markus - MUTZEL, Petra.
Vertex insertion approximates the crossing number of apex graphs. European Journal of Combinatorics, Elsevier, The Nederlands. ISSN 0195-6698, 2012, vol. 33, no. 3, pp. 326-335.
CHIMANI, Markus - HLINĚNÝ, Petr.
A Tighter Insertion-based Approximation of the Crossing Number. In Automata, Languages and Programming 38th International Colloquium, ICALP 2011. Gremany : Springer, 2011. ISBN 978-3-642-22005-0, pp. 122-134. 2011, Zurich, Switzerland.
HLINĚNÝ, Petr - CHIMANI, Markus.
A Tighter Insertion-based Approximation of the Graph Crossing Number. 2011.
GANIAN, Robert - HLINĚNÝ, Petr - OBDRŽÁLEK, Jan.
Clique-width: When Hard Does Not Mean Impossible. In 28th International Symposium on Theoretical Aspects of Computer Science STACS2011. Vyd. 2011. Dagstuhl, Germany : Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2011. ISBN 978-3-939897-25-5, pp. 404-415. 2011, Dortmund, Germany.
HLINĚNÝ, Petr - MORIŠ, Ondrej.
Generalized Maneuvers in Route Planning. In MEMICS 2011 Proceedings LNCS. Berlin Heidelberg : Springer-Verlag, 2011. to appear pp. 14.10.2011, Lednice.
HLINĚNÝ, Petr - DERKA, Martin - CHIMANI, Markus - KLUSÁČEK, Matěj.
How Not to Characterize Planar-emulable Graphs. In IWOCA 2011, Lecture Notes in Computer Science 7056. Německo : Springer Verlag, 2011. ISBN 978-3-642-25010-1, pp. 106-120. 2011, Victoria, Canada.
HLINĚNÝ, Petr - DERKA, Martin - CHIMANI, Markus - KLUSÁČEK, Matěj.
New Development in Planar Emulators. 2011.
HLINĚNÝ, Petr - JELÍNKOVÁ, Eva - KRATOCHVÍL, Jan - SUCHÝ, Ondřej.
Parameterized Problems Related to Seidel's Switching. Discrete Mathematics & Theoretical Computer Science, France, DMTCS, France. ISSN 1365-8050, 2011, vol. 13, no. 2, pp. 19-42.
HLINĚNÝ, Petr - MORIŠ, Ondrej.
Scope-Based Route Planning. In ESA’11: Proceedings of the 19th conference on Annual European Symposium. Berlin Heidelberg : LNCS 6942, Springer-Verlag, 2011. ISBN 978-3-642-23718-8, pp. 445-456. 5.9.2011, Saarbrücken.
HLINĚNÝ, Petr.
20 years of Negami's planar cover conjecture. Graphs and Combinatorics, Tokyo, Springer Japan, Japan. ISSN 0911-0119, 2010, vol. 26, no. 4, pp. 525-536.
HLINĚNÝ, Petr - KUČERA, Antonín.
35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010). 2010. CZE, Brno, Czech Republic. 23.8.2010 - 27.8.2010, Worldwide Activity.
HLINĚNÝ, Petr - CHIMANI, Markus.
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. In ACM-SIAM Symposium on Discrete Algorithms (SODA 2010). USA, internet : SIAM / ACM, 2010. ISBN 978-0-89871-698-6, pp. 918-927. 17.1.2010, Austin, Texas.
GANIAN, Robert - HLINĚNÝ, Petr - OBDRŽÁLEK, Jan - KNEIS, Joachim - MEISTER, Daniel - SIKDAR, Somnath - ROSSMANITH, Peter.
Are there any good digraph width measures?. In Parameterized and exact computation, IPEC 2010. Vyd. 6478. India : Lecture Notes in Computer Science, Springer-Verlag, 2010. ISBN 978-3-642-17492-6, pp. 135-146. 2010, Chennai, India.
GANIAN, Robert - HLINĚNÝ, Petr - OBDRŽÁLEK, Jan.
Better algorithms for satisfiability problems for formulas of bounded rank-width. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). Vyd. 2010. Dagstuhl, Germany : Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2010. ISBN 978-3-939897-23-1, pp. 73-83. 2010, Chennai, India.
HLINĚNÝ, Petr.
Canonical generation of matroids. 2010. Invited talk.
HLINĚNÝ, Petr - VETCHÝ, Vladimír.
Česko-Slovenská Konference GRAFY 2010. 2010. CZE, Lednice. 31.5.2010 - 4.6.2010, European Activity.
HLINĚNÝ, Petr - KUČERA, Antonín (Eds.).
Mathematical Foundations of Computer Science 2010. Berlin Heidelberg New York : Spriger, 2010. 714 pp. ISBN 3-642-15154-X.
GANIAN, Robert - HLINĚNÝ, Petr.
New results on the complexity of oriented colouring on restricted digraph classes. In SOFSEM 2010, Lecture Notes in Computer Science 5901. Vyd. 5901. Berlin : Springer, 2010. ISBN 978-3-642-11265-2, pp. 428-439. 2010, Špindlerův mlýn.
GANIAN, Robert - HLINĚNÝ, Petr.
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Discrete Applied Mathematics, Amsterdam, Elsevier B.V., USA. ISSN 0166-218X, 2010, vol. 158, no. 1, pp. 851-867.
HLINĚNÝ, Petr - SALAZAR, Gelasio.
Stars and Bonds in Crossing-Critical Graphs. Journal of Graph Theory, New York, John Wiley & Sons, USA. ISSN 0364-9024, 2010, vol. 65, no. 3, pp. 198-215.
HLINĚNÝ, Petr.
Úvod do informatiky. Elportál, Brno, Masarykova univerzita. ISSN 1802-128X, 2010.
HLINĚNÝ, Petr.
Úvod do informatiky. Brno : Masarykova univerzita, 2010. 82 pp. Elportál MU.
HLINĚNÝ, Petr.
Základy teorie grafů. Elportál, Brno, Masarykova univerzita. ISSN 1802-128X, 2010.
HLINĚNÝ, Petr.
Základy teorie grafů. Brno : Masarykova univerzita, 2010. 135 pp. Elportál MU.
HLINĚNÝ, Petr.
21 years of Negami's planar cover conjecture. 2009. Invited talk.
HLINĚNÝ, Petr - WHITTLE, Geoff.
Addendum to Matroid Tree-Width. European Journal of Combinatorics, Elsevier, The Nederlands. ISSN 0195-6698, 2009, vol. 30, no. 4, pp. 1036-1044.
HLINĚNÝ, Petr - CHIMANI, Markus - MUTZEL, Petra.
Approximating the Crossing Number of Apex Graphs (poster). In Symposium Graph Drawing 2008, Lecture Notes in Computer Science. Vyd. 5417. Berlin : Springer Verlag, 2009. ISBN 978-3-642-00218-2, pp. 432-434. 21.10.2008, Heraklion, Greece.
GANIAN, Robert - HLINĚNÝ, Petr.
Better Polynomial Algorithms on Graphs of Bounded Rank-width. 2009.
GANIAN, Robert - HLINĚNÝ, Petr.
Better Polynomial Algorithms on Graphs of Bounded Rank-width. In IWOCA 2009: International Workshop On Combinatorial Algorithms, Lecture Notes in Computer Science 5874. Vyd. 5874. Berlin : Springer, 2009. ISBN 978-3-642-10216-5, pp. 266-277. 2009, Hradec nad Moravicí.
GANIAN, Robert - HLINĚNÝ, Petr.
Better Polynomial Algorithms on Graphs of~Bounded Rank-width. 2009. ISBN 978-80-227-3084-6.
VOJNAR, Tomáš - HLINĚNÝ, Petr - MATYÁŠ, Václav - ANTOŠ, David (Eds.).
MEMICS 2009, Fifth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Vyd. first. Brno : NOVPRESS s.r.o., nám. Republiky 725/15, 614 00 Brno, 2009. 258 pp. ISBN 978-80-87342-04-6.
HLINĚNÝ, Petr - MATYÁŠ, Václav - VOJNAR, Tomáš (Eds.).
MEMICS 2009, Fifth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, selected papers. Dagstuhl : Schloss Dagstuhl Leibniz-Zentrum fur Informatik, 2009. 250 pp. ISBN 978-3-939897-15-6.
GANIAN, Robert - HLINĚNÝ, Petr - OBDRŽÁLEK, Jan - LANGER, Alexander - KNEIS, Joachim - ROSSMANITH, Peter.
On Digraph Width Measures in Parameterized Algorithmics. In IWPEC 2009: International Workshop on Parameterized and Exact Computation, Lecture Notes in Computer Science. Vyd. 5917. Berlin : Springer Verlag, 2009. ISBN 978-3-642-11268-3, pp. 185-197. 10.9.2009, Copenhagen, Denmark.
HLINĚNÝ, Petr.
20 years of Negami's planar cover conjecture. In 20th Workshop on topological graph theory in Yokohama. Yokohama, Japan : YNU Yokohama, 2008. pp. 50-59. 22.11.2008, Yokohama National University, Japan.
HLINĚNÝ, Petr.
20 years of Negami's planar cover conjecture. 2008. Invited talk.
HLINĚNÝ, Petr.
20 years of Negami's planar cover conjecture. 2008.
HLINĚNÝ, Petr.
Approaching tree-width of graphs from matroidal perspective. 2008. Invited talk.
HLINĚNÝ, Petr - GANIAN, Robert.
Automata Approach to Graphs of Bounded Rank-width. In International Workshop on Combinatorial Algorithms IWOCA 2008. United Kingdom : Proceedings of the International Workshop on Combinatorial Algorithms 2008, College Publications, 2008. ISBN 978-1-904987-74-1, pp. 4-15. 13.9.2008, Nagoya, Japan.
HLINĚNÝ, Petr - GANIAN, Robert.
Automata Approach to Graphs of Bounded Rank-width. In Workshop MEMICS 2008. Brno : FI MU, 2008. ISBN 978-80-7355-082-0, p. 257-257. 17.11.2008, Znojmo.
GANIAN, Robert - HLINĚNÝ, Petr.
Automata formalization for graphs of bounded rank-width. 2008. ISBN 80-7378-044-9.
HLINĚNÝ, Petr - OUM, Sang-il.
Finding branch-decomposition and rank-decomposition. SIAM Journal on Computing, USA, SIAM, USA. ISSN 0097-5397, 2008, vol. 38, no. 3, pp. 1012-1032.
HLINĚNÝ, Petr.
New infinite families of almost-planar crossing-critical graphs. Electronic Journal of Combinatorics, internet, -, USA. ISSN 1077-8926, 2008, vol. 15, no. 1, R102-12 pp.
HLINĚNÝ, Petr - SALAZAR, Gelasio.
Stars and Bonds in Crossing-Critical Graphs. Electronic Notes in Discrete Mathematics, Elsevier, The Nederlands. ISSN 1571-0653, 2008, vol. 31, no. 1, pp. 271-275.
HLINĚNÝ, Petr - SALAZAR, Gelasio - GITLER, Isidoro - LEANOS, Jesus.
The crossing number of a projective graph is quadratic in the face--width. Electronic Journal of Combinatorics, internet, -, USA. ISSN 1077-8926, 2008, vol. 15, no. 1, R46-8 pp.
HLINĚNÝ, Petr.
Approximating the Crossing Number for Graphs close to "Planarity". In Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. Abstracts collection, Dagstuhl Seminar 07281. Dagstuhl, Germany : Schloss Dagstuhl GmbH, 2007. pp. 6-7. 2007, Dagstuhl, Germany.
HLINĚNÝ, Petr - SALAZAR, Gelasio.
Approximating the Crossing Number of Toroidal Graphs. In International Symposium on Algorithms and Computation (ISAAC 2007). Berlin : Springer Verlag, 2007. ISBN 978-3-540-77118-0, pp. 148-159. 17.12.2007, Sendai, Japan.
HLINĚNÝ, Petr.
Combinatorial Generation of Matroid Representations: Theory and Practice. In Innovative Applications of Information Technology for the Developing World. Singapore : World Scientific Publishing, 2007. ISBN 978-1-86094-827-5, pp. 3-7. 2005, Kathmandu, Nepal.
HLINĚNÝ, Petr - OUM, Sang-il.
Finding branch-decomposition and rank-decomposition (Extended abstract). In European Symposium on Algorithms (ESA 2007). Berlin : Springer Verlag, 2007. ISBN 978-3-540-75519-7, pp. 163-174. 8.10.2007, Eilat, Israel.
HLINĚNÝ, Petr - OUM, Sang il.
Finding Branch-decompositions and Rank-decompositions. 2007.
MATYSKA, Luděk - ANTOŠ, David - ČEŠKA, Milan - KŘETÍNSKÝ, Mojmír - HLINĚNÝ, Petr (Eds.).
MEMICS 2007: Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Vyd. 1. Brno : Ing. Zdeněk Novotný CSc., Ondráčkova 105, 62800 Brno, 2007. 290 pp. ISBN 978-80-7355-077-6.
MATYSKA, Luděk - ANTOŠ, David - ČEŠKA, Milan - KŘETÍNSKÝ, Mojmír - HLINĚNÝ, Petr.
MEMICS 2007: Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. 2007. CZE, Znojmo. 26.10.2007 - 28.10.2007, Worldwide Activity.
HLINĚNÝ, Petr.
New almost-planar crossing-critical graph families. 2007. ISBN 978-961-212-198-3.
HLINĚNÝ, Petr - SALAZAR, Gelasio.
On the Crossing Number of Almost Planar Graphs. In Graph Drawing, Symposium GD2006. Vyd. 4372. Berlin : Springer Verlag, 2007. ISBN 3-540-70903-7, pp. 162-173. 17.9.2006, TH Karlsruhe, Germany.
HLINĚNÝ, Petr.
Optimalizační Úlohy. Vyd. verze 0.99. FI MU : 2007. 101 pp.
HLINĚNÝ, Petr.
Some Hard Problems on Matroid Spikes. Theory of Computing Systems, New York, Springer, USA. ISSN 1432-4350, 2007, vol. 41, no. 1, pp. 551-562.
HLINĚNÝ, Petr.
Teorie Grafů. Vyd. verze 0.99. FI MU : 2007. 110 pp.
HLINĚNÝ, Petr - SALAZAR, Gelasio - GITLER, Isidoro - LEANOS, Jesus.
The crossing number of a projective graph is quadratic in the face--width (Extended abstract). Electronic Notes in Discrete Mathematics, Elsevier, The Nederlands. ISSN 1571-0653, 2007, vol. 29, no. C, pp. 219-223.
HLINĚNÝ, Petr - GITLER, Isidoro - SALAZAR, Gelasio - LEANOS, Jesus.
The crossing number of a projective graph is quadratic in the face-width. 2007. ISBN 978-80-248-1445-2.
HLINĚNÝ, Petr.
Úvod do Informatiky. Vyd. verze 0.999. FI MU : 2007. 73 pp.
HLINĚNÝ, Petr - GOTTLOB, Georg - SEESE, Detlef - OUM, Sang-il.
Width Parameters Beyond Tree-width and Their Applications. Computer Journal, UK, Oxford University Press, Great Britain. ISSN 0010-4620, 2007, vol. 51, no. 3, pp. 326-362.
HLINĚNÝ, Petr - HLINĚNÁ, Dana - VOJTÁŠ, Peter.
A note on multicriteria decision making. 2006.
HLINĚNÝ, Petr - HOCHSTATTLER, Winfried - GODDYN, Luis.
Balanced Signings and the Chromatic Number of Oriented Matroids. Combin. Prob. Computing, UK, Cambridge Univ. Press, Great Britain. ISSN 0963-5483, 2006, vol. 15, no. 4, pp. 523-539.
HLINĚNÝ, Petr.
Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. Journal of Combinatorial Theory, Ser B, Amsterdam, Elsevier B.V., USA. ISSN 0095-8956, 2006, vol. 96, no. 3, pp. 325-351.
HLINĚNÝ, Petr.
Combinatorial Generation of Matroid Representations: Theory and Practice. Acta Universitatis Matthiae Belii, Series Mathematics, Banska Bystrica, Slovakia, Matej Bel University, Great Britain. 2006, vol. 12, no. 1, pp. 31-41.
GIMENEZ, Omer - HLINĚNÝ, Petr - NOY, Marc.
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. SIAM Journal on Discrete Mathematics, Philadelphia, SIAM, USA. ISSN 0895-4801, 2006, vol. 20, no. 4, pp. 932-946.
HLINĚNÝ, Petr.
Crossing Number is Hard for Cubic Graphs. Journal of Combinatorial Theory, Ser B, Amsterdam, Elsevier B.V., USA. ISSN 0095-8956, 2006, vol. 96, no. 4, pp. 455-471.
HLINĚNÝ, Petr.
Equivalence-free exhaustive generation of matroid representations. Discrete Applied Mathematics, Amsterdam, Elsevier B.V., USA. ISSN 0166-218X, 2006, vol. 154, no. 8, pp. 1210-1222.
HLINĚNÝ, Petr - OBDRŽÁLEK, Jan.
Escape-width: Measuring "width" of digraphs. 2006.
HLINĚNÝ, Petr.
MACEK - Real Structural Computations with Representable Matroids. 2006.
HLINĚNÝ, Petr - WHITTLE, Geoff.
Matroid Tree-Width. European Journal of Combinatorics, Elsevier, The Nederlands. ISSN 0195-6698, 2006, vol. 27, no. 7, pp. 1117-1128.
HLINĚNÝ, Petr.
On decidability of MSO theories of combinatorial structures: Towards general matroids?. 2006.
HLINĚNÝ, Petr.
On Matroid Representability and Minor Problems. In 31st International Symposium, MFCS 2006. Vyd. 4162. Berlin : Springer Verlag, 2006. ISBN 3-540-37791-3, pp. 505-516. 28.8.2006, Stará Lesná, Slovakia.
HLINĚNÝ, Petr - SALAZAR, Gelasio.
On the Crossing Number of Almost Planar Graphs. 2006.
HLINĚNÝ, Petr.
The Tutte Polynomial for Matroids of Bounded Branch-Width. Combin. Prob. Computing, UK, Cambridge Univ. Press, Great Britain. ISSN 0963-5483, 2006, vol. 15, no. 3, pp. 397-409.
HLINĚNÝ, Petr - SEESE, Detlef.
Trees, grids, and MSO decidability: From graphs to matroids. Theoretical Computer Science, Amsterdam, Elsevier, The Nederlands. ISSN 0304-3975, 2006, vol. 351, no. 3, pp. 372-393.
HLINĚNÝ, Petr.
A Parametrized Algorithm for Matroid Branch-Width. SIAM Journal on Computing, USA, SIAM, USA. ISSN 0097-5397, 2005, vol. 35, no. 2, pp. 259 - 277.
HLINĚNÝ, Petr - GEELEN, Jim - WHITTLE, Geoff.
Bridging Separations in Matroids. SIAM Journal on Discrete Mathematics, Philadelphia, SIAM, USA. ISSN 0895-4801, 2005, vol. 18, no. 3, pp. 638-646.
GIMENEZ, Omer - HLINĚNÝ, Petr - NOY, Marc.
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width (extended abstract). In WG 2005. Berlin : Springer Verlag, 2005. ISBN 978-3-540-31000-6, pp. 59-68. 2005, Metz, France.
HLINĚNÝ, Petr - GIMENEZ, Omer - NOY, Marc.
Computing the Tutte Polynomial with Restricted “Width”. 2005.
HLINĚNÝ, Petr.
Diskrétní Matematika (text pro distanční a kombinované studium). Vyd. verze 1.01. FEI VŠB - TU Ostrava : 2005. 166 pp.
HLINĚNÝ, Petr.
MACEK: A software package for real structural computations with representable matroids. Vyd. verze 1.2. 2005. 
WWW
HLINĚNÝ, Petr - WHITTLE, Geoff.
Matroid Tree-Width and Chordality. 2005.
HLINĚNÝ, Petr.
On crossing-critical graphs. 2005.
HLINĚNÝ, Petr.
On Crossing-Critical Graphs. 2005.
HLINĚNÝ, Petr.
Úvod do Teoretické Informatiky (text pro distanční a kombinované studium). Vyd. verze 1.02. FEI VŠB - TU Ostrava : 2005. 154 pp.
HLINĚNÝ, Petr.
Width Parameters of Matroids. 2005.
HLINĚNÝ, Petr.
Are Matroids Interesting Combinatorial Structures?. 2004.
HLINĚNÝ, Petr.
Crossing Number is Hard for Cubic Graphs (extended abstract). Lecture Notes in Computer Science, Berlin, Heidelberg, Springer-Verlag, Germany. ISSN 0302-9743, 2004, vol. 3153, pp. 772-781.
HLINĚNÝ, Petr.
Matroid decompositions. 2004.
HLINĚNÝ, Petr - SEESE, Detlef.
On Decidability of MSO Theories of Representable Matroids. Lecture Notes in Computer Science, Berlin, Heidelberg, Springer-Verlag, Germany. ISSN 0302-9743, 2004, vol. 3162, pp. 96-107.
HLINĚNÝ, Petr - THOMAS, Robin.
On possible counterexamples to Negami's planar cover conjecture. Journal of Graph Theory, New York, John Wiley & Sons, USA. ISSN 0364-9024, 2004, vol. 46, no. 3, pp. 183-206.
HLINĚNÝ, Petr.
Using a Computer in Matroid Theory Research. Acta Math. Univ. M. Belii, Slovensko, UMB BB, Slovakia. 2004, vol. 11, no. 1, pp. 27-44.
HLINĚNÝ, Petr.
A new proof for chordal graphs. Acta Math. Univ. M. Belii, Slovensko, UMB BB, Slovakia. 2003, vol. 10, no. 1, pp. 17-19.
HLINĚNÝ, Petr.
Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids (Extended Abstract). Lecture Notes in Computer Science, Berlin, Heidelberg, Springer-Verlag, Germany. ISSN 0302-9743, 2003, vol. 2607, pp. 319-330.
HLINĚNÝ, Petr.
Crossing-Number Critical Graphs have Bounded Pathwidth. Journal of Combinatorial Theory, Ser B., Elsevier B.V., USA. ISSN 0095-8956, 2003, vol. 88, no. 3, pp. 347-367.
HLINĚNÝ, Petr - WHITTLE, Geoff.
Matroid Tree-Width. 2003.
HLINĚNÝ, Petr.
On Matroid Properties Definable in the MSO Logic. Lecture Notes in Computer Science, Berlin, Heidelberg, Springer-Verlag, Germany. ISSN 0302-9743, 2003, vol. 2747, pp. 470-479.
HLINĚNÝ, Petr.
Crossing-Critical Graphs and Path-Width. Lecture Notes in Computer Science, Berlin, Heidelberg, Springer-Verlag, Germany. ISSN 0302-9743, 2002, vol. 2265, no. 2265, pp. 102-113.
HLINĚNÝ, Petr.
On the Excluded Minors for Matroids of Branch-Width Three. Electronic Journal of Combinatorics, internet, -, USA. ISSN 1077-8926, 2002, vol. 9, no. R32, pp. 0-11.
