Clik here to view.
A parallel java grande benchmark suite.
L. A. Smith, J. Mark Bull, Jan Obdrzálek: A parallel java grande benchmark suite. SC 2001: 8
View ArticleClik here to view.
An OpenMP-like interface for parallel programming in Java.
Mark E. Kambites, Jan Obdrzálek, J. Mark Bull: An OpenMP-like interface for parallel programming in Java. Concurr. Comput. Pract. Exp. 13(8-9): 793-814 (2001)
View ArticleClik here to view.
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded.
Jan Obdrzálek: Fast Mu-Calculus Model Checking when Tree-Width Is Bounded. CAV 2003: 80-92
View ArticleClik here to view.
DAG-width: connectivity measure for directed graphs.
Jan Obdrzálek: DAG-width: connectivity measure for directed graphs. SODA 2006: 814-821
View ArticleClik here to view.
Clique-Width and Parity Games.
Jan Obdrzálek: Clique-Width and Parity Games. CSL 2007: 54-68
View ArticleClik here to view.
Qualitative Reachability in Stochastic BPA Games.
Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek: Qualitative Reachability in Stochastic BPA Games. STACS 2009: 207-218
View ArticleClik here to view.
On Digraph Width Measures in Parameterized Algorithmics.
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith: On Digraph Width Measures in Parameterized Algorithmics. IWPEC 2009: 185-197
View ArticleClik here to view.
Better algorithms for satisfiability problems for formulas of bounded...
Robert Ganian, Petr Hlinený, Jan Obdrzálek: Better algorithms for satisfiability problems for formulas of bounded rank-width. CoRR abs/1006.5621 (2010)
View ArticleClik here to view.
Are there any good digraph width measures?
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Are there any good digraph width measures? CoRR abs/1004.1485 (2010)
View ArticleClik here to view.
Qualitative Reachability in Stochastic BPA Games.
Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek: Qualitative Reachability in Stochastic BPA Games. CoRR abs/1003.0118 (2010)
View ArticleClik here to view.
Are There Any Good Digraph Width Measures?
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Are There Any Good Digraph Width Measures? IPEC 2010: 135-146
View ArticleClik here to view.
Better Algorithms for Satisfiability Problems for Formulas of Bounded...
Robert Ganian, Petr Hlinený, Jan Obdrzálek: Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. FSTTCS 2010: 73-83
View ArticleClik here to view.
Lower Bounds on the Complexity of MSO1 Model-Checking.
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Lower Bounds on the Complexity of MSO1 Model-Checking. CoRR abs/1109.5804 (2011)
View ArticleClik here to view.
Efficient Loop Navigation for Symbolic Execution.
Jan Obdrzálek, Marek Trtík: Efficient Loop Navigation for Symbolic Execution. CoRR abs/1107.1398 (2011)
View ArticleClik here to view.
Clique-width: When Hard Does Not Mean Impossible.
Robert Ganian, Petr Hlinený, Jan Obdrzálek: Clique-width: When Hard Does Not Mean Impossible. STACS 2011: 404-415
View ArticleClik here to view.
STANSE: Bug-Finding Framework for C Programs.
Jan Obdrzálek, Jiri Slaby, Marek Trtík: STANSE: Bug-Finding Framework for C Programs. MEMICS 2011: 167-178
View ArticleClik here to view.
Efficient Loop Navigation for Symbolic Execution.
Jan Obdrzálek, Marek Trtík: Efficient Loop Navigation for Symbolic Execution. ATVA 2011: 453-462
View ArticleClik here to view.
Qualitative reachability in stochastic BPA games.
Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek: Qualitative reachability in stochastic BPA games. Inf. Comput. 209(8): 1160-1183 (2011)
View ArticleClik here to view.
STANSE: Bug-finding Framework for C Programs.
Jan Obdrzálek, Jiri Slaby, Marek Trtík: STANSE: Bug-finding Framework for C Programs. CoRR abs/1202.0788 (2012)
View ArticleClik here to view.
Lower Bounds on the Complexity of MSO_1 Model-Checking.
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Lower Bounds on the Complexity of MSO_1 Model-Checking. STACS 2012: 326-337
View ArticleClik here to view.
When Trees Grow Low: Shrubs and Fast MSO1.
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai: When Trees Grow Low: Shrubs and Fast MSO1. MFCS 2012: 419-430
View ArticleClik here to view.
The dag-width of directed graphs.
Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek: The dag-width of directed graphs. J. Comb. Theory, Ser. B 102(4): 900-923 (2012)
View ArticleClik here to view.
Expanding the expressive power of Monadic Second-Order logic on restricted...
Robert Ganian, Jan Obdrzálek: Expanding the expressive power of Monadic Second-Order logic on restricted graph classes. CoRR abs/1306.5571 (2013)
View ArticleClik here to view.
Kernelization Using Structural Parameters on Sparse Graph Classes.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar: Kernelization Using Structural Parameters on Sparse Graph...
View ArticleClik here to view.
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted...
Robert Ganian, Jan Obdrzálek: Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. IWOCA 2013: 164-177
View ArticleClik here to view.
FO Model Checking of Interval Graphs.
Robert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska: FO Model Checking of Interval Graphs. ICALP (2) 2013: 250-262
View ArticleClik here to view.
Kernelization Using Structural Parameters on Sparse Graph Classes.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar: Kernelization Using Structural Parameters on Sparse Graph...
View ArticleClik here to view.
Better Algorithms for Satisfiability Problems for Formulas of Bounded...
Robert Ganian, Petr Hlinený, Jan Obdrzálek: Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. Fundam. Informaticae 123(1): 59-76 (2013)
View ArticleClik here to view.
A unified approach to polynomial algorithms on graphs of bounded...
Robert Ganian, Petr Hlinený, Jan Obdrzálek: A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width. Eur. J. Comb. 34(3): 680-701 (2013)
View ArticleClik here to view.
Tree-depth and Vertex-minors.
Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak: Tree-depth and Vertex-minors. CoRR abs/1403.7024 (2014)
View ArticleClik here to view.
Finite Integer Index of Pathwidth and Treewidth.
Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar: Finite Integer Index of Pathwidth and Treewidth. IPEC 2014: 258-269
View ArticleClik here to view.
Faster Existential FO Model Checking on Posets.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak: Faster Existential FO Model Checking on Posets. ISAAC 2014: 441-451
View ArticleClik here to view.
Lower bounds on the complexity of MSO1 model-checking.
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Lower bounds on the complexity of MSO1 model-checking. J. Comput. Syst. Sci. 80(1): 180-194 (2014)
View ArticleClik here to view.
Digraph width measures in parameterized algorithmics.
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith: Digraph width measures in parameterized algorithmics. Discret. Appl. Math. 168: 88-107 (2014)
View ArticleClik here to view.
FO Model Checking on Posets of Bounded Width.
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh: FO Model Checking on Posets of Bounded Width. CoRR abs/1504.04115 (2015)
View ArticleClik here to view.
FO Model Checking on Posets of Bounded Width.
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh: FO Model Checking on Posets of Bounded Width. FOCS 2015: 963-974
View ArticleClik here to view.
FO Model Checking of Interval Graphs.
Robert Ganian, Petr Hlinený, Daniel Král, Jan Obdrzálek, Jarett Schwartz, Jakub Teska: FO Model Checking of Interval Graphs. Log. Methods Comput. Sci. 11(4) (2015)
View ArticleClik here to view.
Faster Existential FO Model Checking on Posets.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak: Faster Existential FO Model Checking on Posets. Log. Methods Comput. Sci. 11(4) (2015)
View ArticleClik here to view.
A New Perspective on FO Model Checking of Dense Graph Classes.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan: A New Perspective on FO Model Checking of Dense Graph Classes. LICS 2016: 176-184
View ArticleClik here to view.
Are there any good digraph width measures?
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar: Are there any good digraph width measures? J. Comb. Theory, Ser. B 116: 250-286 (2016)
View ArticleClik here to view.
Tree-depth and vertex-minors.
Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak: Tree-depth and vertex-minors. Eur. J. Comb. 56: 46-56 (2016)
View ArticleClik here to view.
Shrub-depth: Capturing Height of Dense Graphs.
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez: Shrub-depth: Capturing Height of Dense Graphs. CoRR abs/1707.00359 (2017)
View ArticleClik here to view.
First order limits of sparse graphs: Plane trees and path-width.
Jakub Gajarský, Petr Hlinený, Tomás Kaiser, Daniel Král', Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak, Vojtech Tuma: First order limits of sparse graphs: Plane trees and path-width. Random Struct....
View ArticleClik here to view.
Kernelization using structural parameters on sparse graph classes.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar: Kernelization using structural parameters on sparse graph...
View ArticleClik here to view.
A New Perspective on FO Model Checking of Dense Graph Classes.
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, M. S. Ramanujan: A New Perspective on FO Model Checking of Dense Graph Classes. CoRR abs/1805.01823 (2018)
View ArticleClik here to view.
Shrub-depth: Capturing Height of Dense Graphs.
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez: Shrub-depth: Capturing Height of Dense Graphs. Log. Methods Comput. Sci. 15(1) (2019)
View ArticleClik here to view.
A New Perspective on FO Model Checking of Dense Graph Classes.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan: A New Perspective on FO Model Checking of Dense Graph Classes. ACM Trans. Comput. Log. 21(4): 28:1-28:23 (2020)
View ArticleClik here to view.
Cartesian Reachability Logic: A Language-parametric Logic for Verifying...
Jan Tusil, Traian Serbanuta, Jan Obdrzálek: Cartesian Reachability Logic: A Language-parametric Logic for Verifying k-Safety Properties. LPAR 2023: 405-456
View Article
