doc. Mgr. Jan Obdržálek, PhD.
Associate professor, Department of Computer Science
Office: C413
Botanická 554/68a
602 00 Brno
Phone: | +420 549 49 4225 |
---|---|
E‑mail: |
Total number of publications: 44
2024
-
Minuska: Towards a Formally Verified Programming Language Framework
22nd International Conference on Software Engineering and Formal Methods, year: 2024
2023
-
Cartesian Reachability Logic: A Language-parametric Logic for Verifying k-Safety Properties
Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, year: 2023
2020
-
A New Perspective on FO Model Checking of Dense Graph Classes
ACM Transactions on Computational Logic, year: 2020, volume: 21, edition: 4, DOI
2019
-
Shrub-depth: Capturing Height of Dense Graphs
Logical Methods in Computer Science, year: 2019, volume: 15, edition: 1, DOI
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
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
-
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