
prof. RNDr. Petr Hliněný, Ph.D.
profesor – Katedra teorie programování
kancelář: C418
Botanická 554/68a
602 00 Brno
telefon: | 549 49 3775 |
---|---|
e‑mail: | hlineny@fi.muni.cz |
sociální a akademické sítě: |
---|
Počet publikací: 192
2022
-
Graph Product Structure for h-Framed Graphs
33rd International Symposium on Algorithms and Computation (ISAAC 2022), rok: 2022
-
Isomorphism Testing for T-graphs in FPT
WALCOM: Algorithms and Computation, rok: 2022
-
Parameterised Partially-Predrawn Crossing Number
38th International Symposium on Computational Geometry (SoCG 2022), rok: 2022
-
Twin-Width and Transductions of Proper k-Mixed-Thin Graphs
WG 2022: Graph-Theoretic Concepts in Computer Science, rok: 2022
2021
-
A Short Proof of Euler–Poincaré Formula
Extended Abstracts EuroComb 2021. Trends in Mathematics, rok: 2021
-
Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases
46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), rok: 2021
-
On 13-Crossing-Critical Graphs with Arbitrarily Large Degrees
Extended Abstracts EuroComb 2021. Trends in Mathematics, rok: 2021
-
Twin-Width is Linear in the Poset Width
International Symposium on Parameterized and Exact Computation (IPEC), rok: 2021
2020
-
A New Perspective on FO Model Checking of Dense Graph Classes
ACM Transactions on Computational Logic, rok: 2020, ročník: 21, vydání: 4, DOI
-
Clique-Width of Point Configurations
Graph-Theoretic Concepts in Computer Science, WG 2020, rok: 2020