doc. Mgr. Jan Obdržálek, PhD.

2025

• Beyond Occlusion: In Search for Near Real-Time Explainability of CNN-Based Prostate Cancer Classification

  KREBS Martin OBDRŽÁLEK Jan MUSIL Vít BRÁZDIL Tomáš

  Article in Proceedings

  2025 IEEE 22nd International Symposium on Biomedical Imaging, ISBI, year: 2025

• Minuska: Towards a Formally Verified Programming Language Framework

  TUŠIL Jan OBDRŽÁLEK Jan

  Article in Proceedings

  22nd International Conference on Software Engineering and Formal Methods, SEFM 2024, year: 2025

2023

• Cartesian Reachability Logic: A Language-parametric Logic for Verifying k-Safety Properties

  TUŠIL Jan SERBANUTA Traian OBDRŽÁLEK Jan

  Article in Proceedings

  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

  GAJARSKÝ Jakub HLINĚNÝ Petr LOKSHTANOV Daniel OBDRŽÁLEK Jan RAMANUJAN M S

  Article in Periodical

  ACM Transactions on Computational Logic, year: 2020, volume: 21, edition: 4, DOI

2019

• Shrub-depth: Capturing Height of Dense Graphs

  GANIAN Robert HLINĚNÝ Petr NEŠETŘIL Jaroslav OBDRŽÁLEK Jan OSSONA DE MENDEZ Patrice

  Article in Periodical

  Logical Methods in Computer Science, year: 2019, volume: 15, edition: 1, DOI

2017

• First order limits of sparse graphs: Plane trees and path-width

  GAJARSKÝ Jakub HLINĚNÝ Petr KAISER Tomáš KRÁĽ Daniel KUPEC Martin OBDRŽÁLEK Jan ORDYNIAK Sebastian TŮMA Vojtěch

  Article in Periodical

  Random Structures & Algorithms, year: 2017, volume: 50, edition: 4, DOI

• Kernelization using structural parameters on sparse graph classes

  GAJARSKÝ Jakub HLINĚNÝ Petr OBDRŽÁLEK Jan ORDYNIAK Sebastian REIDL Felix ROSSMANITH Peter VILLAAMIL Fernando SIKDAR Somnath

  Article in Periodical

  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

  GAJARSKÝ Jakub HLINĚNÝ Petr LOKSHTANOV Daniel OBDRŽÁLEK Jan RAMANUJAN M S

  Article in Proceedings

  Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science LICS2016, year: 2016

• Are there any good digraph width measures?

  GANIAN Robert HLINĚNÝ Petr OBDRŽÁLEK Jan KNEIS Joachim MEISTER Daniel SIKDAR Somnath ROSSMANITH Peter

  Article in Periodical

  Journal of Combinatorial Theory, Ser B, year: 2016, volume: 116, edition: 1, DOI

• Tree-depth and Vertex-minors

  HLINĚNÝ Petr KWON O-joung OBDRŽÁLEK Jan ORDYNIAK Sebastian

  Article in Periodical

  European Journal of Combinatorics, year: 2016, volume: 56, edition: 1, DOI