prof. RNDr. Petr Hliněný, Ph.D.
Professor, Department of Computer Science
office: C418
Botanická 554/68a
602 00 Brno
phone: | +420 549 49 3775 |
---|---|
e‑mail: |
social and academic networks: |
---|
Total number of publications: 184
2011
-
Clique-width: When Hard Does Not Mean Impossible
28th International Symposium on Theoretical Aspects of Computer Science STACS2011, year: 2011
-
How Not to Characterize Planar-emulable Graphs
COMBINATORIAL ALGORITHMS, Lecture Notes in Computer Science 7056, year: 2011
-
New Development in Planar Emulators
Year: 2011, type:
-
Parameterized Problems Related to Seidel's Switching
Discrete Mathematics & Theoretical Computer Science, year: 2011, volume: 13, edition: 2
-
Scope-Based Route Planning
ESA’11: Proceedings of the 19th conference on Annual European Symposium, year: 2011
2010
-
20 years of Negami's planar cover conjecture
Graphs and Combinatorics, year: 2010, volume: 26, edition: 4, DOI
-
35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010)
Year: 2010, type: Conference
-
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), year: 2010
-
Are there any good digraph width measures?
Parameterized and exact computation, IPEC 2010, year: 2010
-
Better algorithms for satisfiability problems for formulas of bounded rank-width
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), year: 2010