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
2023
-
Twin-width of Planar Graphs; a Short Proof
European Conference on Combinatorics, Graph Theory and Applications EUROCOMB’23, year: 2023
2022
-
Bounded degree conjecture holds precisely for c-crossing-critical graphs with c<=12
COMBINATORICA, year: 2022, volume: 42, edition: 5, DOI
-
Graph Product Structure for h-Framed Graphs
33rd International Symposium on Algorithms and Computation (ISAAC 2022), year: 2022
-
Isomorphism Testing for T-graphs in FPT
WALCOM: Algorithms and Computation, year: 2022
-
Parameterised Partially-Predrawn Crossing Number
38th International Symposium on Computational Geometry (SoCG 2022), year: 2022
-
Twin-Width and Transductions of Proper k-Mixed-Thin Graphs
WG 2022: Graph-Theoretic Concepts in Computer Science, year: 2022
2021
-
A Short Proof of Euler–Poincaré Formula
Extended Abstracts EuroComb 2021. Trends in Mathematics, year: 2021
-
Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases
46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), year: 2021
-
On 13-Crossing-Critical Graphs with Arbitrarily Large Degrees
Extended Abstracts EuroComb 2021. Trends in Mathematics, year: 2021
-
Twin-Width is Linear in the Poset Width
International Symposium on Parameterized and Exact Computation (IPEC), year: 2021