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
2017
-
First order limits of sparse graphs: Plane trees and path-width
Random Structures & Algorithms, year: 2017, volume: 50, edition: 4, DOI
-
Kernelization using structural parameters on sparse graph classes
Journal of Computer and System Sciences, year: 2017, volume: 84, edition: 1, DOI
-
Parameterized Shifted Combinatorial Optimization
International Computing and Combinatorics Conference COCOON 2017 (LNCS, volume 10392), year: 2017
2016
-
A New Perspective on FO Model Checking of Dense Graph Classes
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science LICS2016, year: 2016
-
Are there any good digraph width measures?
Journal of Combinatorial Theory, Ser B, year: 2016, volume: 116, edition: 1, DOI
-
Crossing Number is Hard for Kernelization
32nd International Symposium on Computational Geometry (SoCG 2016), year: 2016
-
Inserting Multiple Edges into a Planar Graph
32nd International Symposium on Computational Geometry (SoCG 2016), year: 2016
-
Practical Exhaustive Generation of Small Multiway Cuts in Sparse Graphs
Mathematical and Engineering Methods in Computer Science, Lecture Notes in Computer Science 9548, year: 2016
-
Tree-depth and Vertex-minors
European Journal of Combinatorics, year: 2016, volume: 56, edition: 1, DOI
2015
-
Faster Existential FO Model Checking on Posets
Logical Methods in Computer Science, year: 2015, volume: 11, edition: 4, DOI