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: | hlineny@fi.muni.cz |
social and academic networks: |
---|
Total number of publications: 192
2023
-
Clique-Width of Point Configurations
Journal of Combinatorial Theory, Ser B, year: 2023, volume: 158, edition: 1, DOI
-
Efficient Isomorphism for Sd-Graphs and T-Graphs
ALGORITHMICA, year: 2023, volume: 85, edition: 2, DOI
-
Inserting Multiple Edges into a Planar Graph
Journal of Graph Algorithms and Applications, year: 2023, volume: 27, edition: 6, DOI
-
Minimizing an Uncrossed Collection of Drawings
Graph Drawing 2023, year: 2023
-
Recognizing H-Graphs - Beyond Circular-Arc Graphs
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), year: 2023
-
Sparse Graphs of Twin-width 2 Have Bounded Tree-width
ISAAC 2023, year: 2023
-
Stack and Queue Numbers of Graphs Revisited
European Conference on Combinatorics, Graph Theory and Applications EUROCOMB’23, year: 2023
-
Twin-width of Planar Graphs is at most 8, and at most 6 when Bipartite Planar
50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), year: 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