default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Obdrzálek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i13]Jan Tusil, Jan Obdrzálek:
Minuska: Towards a Formally Verified Programming Language Framework. CoRR abs/2409.11530 (2024)- 2023
- [c21]Jan Tusil, Traian Serbanuta, Jan Obdrzálek:
Cartesian Reachability Logic: A Language-parametric Logic for Verifying k-Safety Properties. LPAR 2023: 405-456 - 2020
- [j15]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)
2010 – 2019
- 2019
- [j14]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) - 2018
- [i12]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) - 2017
- [j13]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 classes. J. Comput. Syst. Sci. 84: 219-242 (2017) - [j12]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. Algorithms 50(4): 612-635 (2017) - [i11]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) - 2016
- [j11]Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak:
Tree-depth and vertex-minors. Eur. J. Comb. 56: 46-56 (2016) - [j10]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 B 116: 250-286 (2016) - [c20]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 - 2015
- [j9]Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak:
Faster Existential FO Model Checking on Posets. Log. Methods Comput. Sci. 11(4) (2015) - [j8]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) - [c19]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 - [i10]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) - 2014
- [j7]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) - [j6]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) - [c18]Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak:
Faster Existential FO Model Checking on Posets. ISAAC 2014: 441-451 - [c17]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 - [i9]Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak:
Tree-depth and Vertex-minors. CoRR abs/1403.7024 (2014) - 2013
- [j5]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) - [j4]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) - [c16]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 Classes. ESA 2013: 529-540 - [c15]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 - [c14]Robert Ganian, Jan Obdrzálek:
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. IWOCA 2013: 164-177 - [i8]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 Classes. CoRR abs/1302.6863 (2013) - [i7]Robert Ganian, Jan Obdrzálek:
Expanding the expressive power of Monadic Second-Order logic on restricted graph classes. CoRR abs/1306.5571 (2013) - 2012
- [j3]Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek:
The dag-width of directed graphs. J. Comb. Theory B 102(4): 900-923 (2012) - [c13]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 - [c12]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 - [i6]Jan Obdrzálek, Jiri Slaby, Marek Trtík:
STANSE: Bug-finding Framework for C Programs. CoRR abs/1202.0788 (2012) - 2011
- [j2]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) - [c11]Jan Obdrzálek, Marek Trtík:
Efficient Loop Navigation for Symbolic Execution. ATVA 2011: 453-462 - [c10]Jan Obdrzálek, Jiri Slaby, Marek Trtík:
STANSE: Bug-Finding Framework for C Programs. MEMICS 2011: 167-178 - [c9]Robert Ganian, Petr Hlinený, Jan Obdrzálek:
Clique-width: When Hard Does Not Mean Impossible. STACS 2011: 404-415 - [i5]Jan Obdrzálek, Marek Trtík:
Efficient Loop Navigation for Symbolic Execution. CoRR abs/1107.1398 (2011) - [i4]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) - 2010
- [c8]Robert Ganian, Petr Hlinený, Jan Obdrzálek:
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. FSTTCS 2010: 73-83 - [c7]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 - [i3]Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek:
Qualitative Reachability in Stochastic BPA Games. CoRR abs/1003.0118 (2010) - [i2]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) - [i1]Robert Ganian, Petr Hlinený, Jan Obdrzálek:
Better algorithms for satisfiability problems for formulas of bounded rank-width. CoRR abs/1006.5621 (2010)
2000 – 2009
- 2009
- [c6]Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith:
On Digraph Width Measures in Parameterized Algorithmics. IWPEC 2009: 185-197 - [c5]Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek:
Qualitative Reachability in Stochastic BPA Games. STACS 2009: 207-218 - 2007
- [c4]Jan Obdrzálek:
Clique-Width and Parity Games. CSL 2007: 54-68 - 2006
- [c3]Jan Obdrzálek:
DAG-width: connectivity measure for directed graphs. SODA 2006: 814-821 - 2003
- [c2]Jan Obdrzálek:
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded. CAV 2003: 80-92 - 2001
- [j1]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) - [c1]L. A. Smith, J. Mark Bull, Jan Obdrzálek:
A parallel java grande benchmark suite. SC 2001: 8
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 20:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
