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
2020
-
A New Perspective on FO Model Checking of Dense Graph Classes
ACM Transactions on Computational Logic, year: 2020, volume: 21, edition: 4, DOI
-
Clique-Width of Point Configurations
Graph-Theoretic Concepts in Computer Science, WG 2020, year: 2020
-
Isomorphism Problem for Sd-Graphs
45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), year: 2020
-
Toroidal grid minors and stretch in embedded graphs
JOURNAL OF COMBINATORIAL THEORY SERIES B, year: 2020, volume: 140, edition: 1, DOI
2019
-
A deterministic approach for rapid identification of the critical links in networks
PLOS ONE, year: 2019, volume: 14, edition: 7, DOI
-
Bounded degree conjecture holds precisely for c-crossing-critical graphs with c<=12
35th International Symposium on Computational Geometry, SoCG 2019, year: 2019
-
Exact Crossing Number Parameterized by Vertex Cover
GD 2019: Graph Drawing and Network Visualization, year: 2019
-
FO model checking on geometric graphs
Computational geometry, year: 2019, volume: 78, edition: 1, DOI
-
On conflict-free chromatic guarding of simple polygons
13th Annual International Conference on Combinatorial Optimization and Applications (COCOA'19), year: 2019
-
On Degree Properties of Crossing-Critical Families of Graphs
Electronic Journal of Combinatorics, year: 2019, volume: 26, edition: 1, DOI