Jan Obdrzálek

53 papers A* 4A 5B 8C 1Journal 30Unranked 5
YearRankTypeTitle / Venue / Authors
2025 — conf
Beyond Occlusion: In Search for Near Real-Time Explainability of CNN-Based Prostate Cancer Classification.
ISBI
Martin Krebs, Jan Obdrzálek, Vít Musil, Tomás Brázdil
2025 J jnl
Beyond Occlusion: In Search for Near Real-Time Explainability of CNN-Based Prostate Cancer Classification.
CoRR
Martin Krebs, Jan Obdrzálek, Vít Musil, Tomás Brázdil
2025 J jnl
Explaining Digital Pathology Models via Clustering Activations.
CoRR
Adam Bajger, Jan Obdrzálek, Vojtech Kur, Rudolf Nenutil, Petr Holub, Vít Musil, Tomás Brázdil
2024 B conf
Minuska: Towards a Formally Verified Programming Language Framework.
SEFM
Jan Tusil, Jan Obdrzálek
2024 J jnl
Minuska: Towards a Formally Verified Programming Language Framework.
CoRR
Jan Tusil, Jan Obdrzálek
2023 B conf
Cartesian Reachability Logic: A Language-parametric Logic for Verifying k-Safety Properties.
LPAR
Jan Tusil, Traian Serbanuta, Jan Obdrzálek
2020 J jnl
A New Perspective on FO Model Checking of Dense Graph Classes.
ACM Trans. Comput. Log.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
2019 J jnl
Shrub-depth: Capturing Height of Dense Graphs.
Log. Methods Comput. Sci.
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez
2018 J jnl
A New Perspective on FO Model Checking of Dense Graph Classes.
CoRR
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, M. S. Ramanujan
2017 J jnl
First order limits of sparse graphs: Plane trees and path-width.
Random Struct. Algorithms
Jakub Gajarský, Petr Hlinený, Tomás Kaiser, Daniel Král', Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak, Vojtech Tuma
2017 J jnl
Kernelization using structural parameters on sparse graph classes.
J. Comput. Syst. Sci.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2017 J jnl
Shrub-depth: Capturing Height of Dense Graphs.
CoRR
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez
2016 A* conf
A New Perspective on FO Model Checking of Dense Graph Classes.
LICS
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
2016 J jnl
Are there any good digraph width measures?
J. Comb. Theory B
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2016 J jnl
Tree-depth and vertex-minors.
Eur. J. Comb.
Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak
2015 J jnl
FO Model Checking of Interval Graphs
Log. Methods Comput. Sci.
Robert Ganian, Petr Hlinený, Daniel Král, Jan Obdrzálek, Jarett Schwartz, Jakub Teska
2015 A* conf
FO Model Checking on Posets of Bounded Width.
FOCS
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
2015 J jnl
FO Model Checking on Posets of Bounded Width.
CoRR
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
2015 J jnl
Faster Existential FO Model Checking on Posets.
Log. Methods Comput. Sci.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak
2014 J jnl
Digraph width measures in parameterized algorithmics.
Discret. Appl. Math.
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
2014 B conf
Faster Existential FO Model Checking on Posets.
ISAAC
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak
2014 B conf
Finite Integer Index of Pathwidth and Treewidth.
IPEC
Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2014 J jnl
Lower bounds on the complexity of MSO
J. Comput. Syst. Sci.
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2014 J jnl
Tree-depth and Vertex-minors.
CoRR
Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak
2013 J jnl
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width.
Eur. J. Comb.
Robert Ganian, Petr Hlinený, Jan Obdrzálek
2013 J jnl
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width.
Fundam. Informaticae
Robert Ganian, Petr Hlinený, Jan Obdrzálek
2013 C conf
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes.
IWOCA
Robert Ganian, Jan Obdrzálek
2013 J jnl
Expanding the expressive power of Monadic Second-Order logic on restricted graph classes.
CoRR
Robert Ganian, Jan Obdrzálek
2013 — conf
FO Model Checking of Interval Graphs.
ICALP (2)
Robert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska
2013 J jnl
Kernelization Using Structural Parameters on Sparse Graph Classes
CoRR
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2013 A conf
Kernelization Using Structural Parameters on Sparse Graph Classes.
ESA
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2012 A conf
Lower Bounds on the Complexity of MSO_1 Model-Checking.
STACS
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2012 J jnl
STANSE: Bug-finding Framework for C Programs
CoRR
Jan Obdrzálek, Jiri Slaby, Marek Trtík
2012 J jnl
The dag-width of directed graphs.
J. Comb. Theory B
Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek
2012 B conf
When Trees Grow Low: Shrubs and Fast MSO1.
MFCS
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai
2011 A conf
Clique-width: When Hard Does Not Mean Impossible.
STACS
Robert Ganian, Petr Hlinený, Jan Obdrzálek
2011 J jnl
Efficient Loop Navigation for Symbolic Execution
CoRR
Jan Obdrzálek, Marek Trtík
2011 B conf
Efficient Loop Navigation for Symbolic Execution.
ATVA
Jan Obdrzálek, Marek Trtík
2011 J jnl
Lower Bounds on the Complexity of MSO1 Model-Checking
CoRR
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2011 J jnl
Qualitative reachability in stochastic BPA games.
Inf. Comput.
Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek
2011 — conf
STANSE: Bug-Finding Framework for C Programs.
MEMICS
Jan Obdrzálek, Jiri Slaby, Marek Trtík
2010 B conf
Are There Any Good Digraph Width Measures?
IPEC
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2010 J jnl
Are there any good digraph width measures?
CoRR
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2010 — conf
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width.
FSTTCS
Robert Ganian, Petr Hlinený, Jan Obdrzálek
2010 J jnl
Better algorithms for satisfiability problems for formulas of bounded rank-width
CoRR
Robert Ganian, Petr Hlinený, Jan Obdrzálek
2010 J jnl
Qualitative Reachability in Stochastic BPA Games
CoRR
Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek
2009 — conf
On Digraph Width Measures in Parameterized Algorithmics.
IWPEC
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
2009 A conf
Qualitative Reachability in Stochastic BPA Games.
STACS
Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek
2007 B conf
Clique-Width and Parity Games.
CSL
Jan Obdrzálek
2006 A* conf
DAG-width: connectivity measure for directed graphs.
SODA
Jan Obdrzálek
2003 A* conf
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded.
CAV
Jan Obdrzálek
2001 A conf
A parallel java grande benchmark suite.
SC
L. A. Smith, J. Mark Bull, Jan Obdrzálek
2001 J jnl
An OpenMP-like interface for parallel programming in Java.
Concurr. Comput. Pract. Exp.
Mark E. Kambites, Jan Obdrzálek, J. Mark Bull