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
2014
-
Vulnerability analysis methods for road networks
Year: 2014, type: Appeared in Conference without Proceedings
2013
-
Better algorithms for satisfiability problems for formulas of bounded rank-width
Fundamenta Informaticae, year: 2013, volume: 123, edition: 1, DOI
-
Computing the Stretch of an Embedded Graph
XV Spanish Meeting on Computational Geometry, year: 2013
-
FO Model Checking of Interval Graphs
ICALP (2) 2013, year: 2013
-
How Not to Characterize Planar-emulable Graphs
Advances in Applied Mathematics, year: 2013, volume: 50, edition: 1, DOI
-
Kernelization Using Structural Parameters on Sparse Graph Classes
ESA 2013, year: 2013
-
Planar Emulators Conjecture Is Nearly True for Cubic Graphs
The Seventh European Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013, year: 2013
-
Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width
European Journal of Combinatorics, year: 2013, volume: 34, edition: 3, DOI
2012
-
Can dense graphs be "sparse"?
Year: 2012, type: Conference abstract
-
Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), year: 2012