Výpis publikací

TUŠIL, Jan, Traian SERBANUTA a Jan OBDRŽÁLEK. Cartesian Reachability Logic: A Language-parametric Logic for Verifying k-Safety Properties. Online. In Ruzica Piskac and Andrei Voronkov. Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Manchester: EasyChair, 2023, s. 405-456. ISSN 2398-7340. Dostupné z: https://dx.doi.org/10.29007/1874.

GAJARSKÝ, Jakub, Petr HLINĚNÝ, Daniel LOKSHTANOV, Jan OBDRŽÁLEK a M S RAMANUJAN. A New Perspective on FO Model Checking of Dense Graph Classes. ACM Transactions on Computational Logic. New York, NY, USA: Association for Computing Machinery, 2020, roč. 21, č. 4, s. "28:1"-"28:23", 23 s. ISSN 1529-3785. Dostupné z: https://dx.doi.org/10.1145/3383206.

GANIAN, Robert, Petr HLINĚNÝ, Jaroslav NEŠETŘIL, Jan OBDRŽÁLEK a Patrice OSSONA DE MENDEZ. Shrub-depth: Capturing Height of Dense Graphs. Logical Methods in Computer Science. BRAUNSCHWEIG: LOGICAL METHODS COMPUTER SCIENCE E V, 2019, roč. 15, č. 1, s. "7:1"-"7:25", 25 s. ISSN 1860-5974. Dostupné z: https://dx.doi.org/10.23638/LMCS-15(1:7)2019.

GAJARSKÝ, Jakub, Petr HLINĚNÝ, Tomáš KAISER, Daniel KRÁĽ, Martin KUPEC, Jan OBDRŽÁLEK, Sebastian ORDYNIAK a Vojtěch TŮMA. First order limits of sparse graphs: Plane trees and path-width. Random Structures & Algorithms. Wiley, 2017, roč. 50, č. 4, s. 612-635. ISSN 1042-9832. Dostupné z: https://dx.doi.org/10.1002/rsa.20676.

GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Sebastian ORDYNIAK, Felix REIDL, Peter ROSSMANITH, Fernando VILLAAMIL a Somnath SIKDAR. Kernelization using structural parameters on sparse graph classes. Journal of Computer and System Sciences. SAN DIEGO: Elsevier, 2017, roč. 84, č. 1, s. 219-242. ISSN 0022-0000. Dostupné z: https://dx.doi.org/10.1016/j.jcss.2016.09.002.

GAJARSKÝ, Jakub, Petr HLINĚNÝ, Daniel LOKSHTANOV, Jan OBDRŽÁLEK a M S RAMANUJAN. A New Perspective on FO Model Checking of Dense Graph Classes. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science LICS2016. New York, NY, USA: ACM, 2016, s. 176-184. ISBN 978-1-4503-4391-6. Dostupné z: https://dx.doi.org/10.1145/2933575.2935314.

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Joachim KNEIS, Daniel MEISTER, Somnath SIKDAR a Peter ROSSMANITH. Are there any good digraph width measures? Journal of Combinatorial Theory, Ser B. Academic Press, 2016, roč. 116, č. 1, s. 250-286. ISSN 0095-8956. Dostupné z: https://dx.doi.org/10.1016/j.jctb.2015.09.001.

HLINĚNÝ, Petr, O-joung KWON, Jan OBDRŽÁLEK a Sebastian ORDYNIAK. Tree-depth and Vertex-minors. European Journal of Combinatorics. Elsevier, 2016, roč. 56, č. 1, s. 46-56. ISSN 0195-6698. Dostupné z: https://dx.doi.org/10.1016/j.ejc.2016.03.001.

GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK a Sebastian ORDYNIAK. Faster Existential FO Model Checking on Posets. Logical Methods in Computer Science. Německo: Logical Methods in Computer Science e.V., 2015, roč. 11, č. 4, s. 1-13. ISSN 1860-5974. Dostupné z: https://dx.doi.org/10.2168/LMCS-11(4:8)2015.

GANIAN, Robert, Petr HLINĚNÝ, Daniel KRÁĽ, Jan OBDRŽÁLEK, Jarett SCHWARTZ a Jakub TESKA. FO Model Checking of Interval Graphs. Logical Methods in Computer Science. Německo: Logical Methods in Computer Science e.V., 2015, roč. 11, 4:11, s. 1-20. ISSN 1860-5974. Dostupné z: https://dx.doi.org/10.2168/LMCS-11(4:11)2015.

GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Sebastian ORDYNIAK, M.S. RAMANUJAN, Daniel LOKSHTANOV a Saket SAURABH. FO Model Checking on Posets of Bounded Width. Online. In Venkatesan Guruswami. 56th Annual Symposium on Foundations of Computer Science, FOCS 2015. Berkeley, CA, USA: IEEE Computer Society, 2015, s. 963-974. ISBN 978-1-4673-8191-8. Dostupné z: https://dx.doi.org/10.1109/FOCS.2015.63.

GANIAN, Robert, Petr HLINĚNÝ, Joachim KNEIS, Alexander LANGER, Jan OBDRŽÁLEK a Peter ROSSMANITH. Digraph width measures in parameterized algorithmics. Discrete Applied Mathematics. Elsevier B.V., 2014, roč. 168, č. 1, s. 88-107. ISSN 0166-218X. Dostupné z: https://dx.doi.org/10.1016/j.dam.2013.10.038.

GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK a Sebastian ORDYNIAK. Faster Existential FO Model Checking on Posets. In Hee-Kap Ahn, Chan-Su Shin. ISAAC 2014, LNCS 8889. Berlin: Springer International Publishing, 2014, s. 441-451. ISBN 978-3-319-13074-3. Dostupné z: https://dx.doi.org/10.1007/978-3-319-13075-0_35.

ORDYNIAK, Sebastian, Jakub GAJARSKÝ, Felix REIDL, Peter ROSSMANITH, Jan OBDRŽÁLEK a Fernando SÁNCHEZ VILAAMIL. Finite Integer Index of Pathwidth and Treewidth. In Marek Cygan and Pinar Heggernes. IPEC 2014, LNCS 8246. Wroclaw: Springer, 2014, s. 258-269. ISBN 978-3-319-13523-6. Dostupné z: https://dx.doi.org/10.1007/978-3-319-13524-3_22.

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Alexander LANGER, Peter ROSSMANITH a Somnath SIKDAR. Lower Bounds on the Complexity of MSO_1 Model-Checking. Journal of Computer and System Sciences. Elsevier, 2014, roč. 80, č. 1, s. 180-194. ISSN 0022-0000. Dostupné z: https://dx.doi.org/10.1016/j.jcss.2013.07.005.

GANIAN, Robert, Petr HLINĚNÝ a Jan OBDRŽÁLEK. Better algorithms for satisfiability problems for formulas of bounded rank-width. Fundamenta Informaticae. Poland: IOS Press, The Netherlands, 2013, roč. 123, č. 1, s. 59-76. ISSN 0169-2968. Dostupné z: https://dx.doi.org/10.3233/FI-2013-800.

OBDRŽÁLEK, Jan a Robert GANIAN. Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. In Thierry Lecroq, Laurent Mouchard. Combinatorial Algorithms 24th International Workshop, IWOCA 2013. Berlin Heidelberg: Springer, 2013, s. 164-177. ISBN 978-3-642-45277-2. Dostupné z: https://dx.doi.org/10.1007/978-3-642-45278-9_15.

GANIAN, Robert, Petr HLINĚNÝ, Daniel KRÁĽ, Jan OBDRŽÁLEK, Jarett SCHWARTZ a Jakub TESKA. FO Model Checking of Interval Graphs. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg. ICALP (2) 2013. Berlin Heidelberg: Springer, 2013, s. 250-262. ISBN 978-3-642-39211-5. Dostupné z: https://dx.doi.org/10.1007/978-3-642-39212-2_24.

GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Sebastian ORDYNIAK, Felix REIDL, Peter ROSSMANITH, Fernando Sanchez VILLAAMIL a Somnath SIKDAR. Kernelization Using Structural Parameters on Sparse Graph Classes. In Hans L. Bodlaender a Giuseppe F. Italiano. ESA 2013. Berlin Heidelberg: Springer, 2013, s. 529-540. ISBN 978-3-642-40449-8. Dostupné z: https://dx.doi.org/10.1007/978-3-642-40450-4_45.

GANIAN, Robert, Petr HLINĚNÝ a Jan OBDRŽÁLEK. Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width. European Journal of Combinatorics. Elsevier, 2013, roč. 34, č. 3, s. 680-701. ISSN 0195-6698. Dostupné z: https://dx.doi.org/10.1016/j.ejc.2012.07.024.

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Jaroslav NEŠETŘIL, Patrice OSSONA DE MENDEZ a Reshma RAMADURAI. Can dense graphs be "sparse"? In Third Workshop on Graphs and Matroids; Maastricht, The Netherlands. 2012.

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Alexander LANGER, Peter ROSSMANITH a Somnath SIKDAR. Lower Bounds on the Complexity of MSO_1 Model-Checking. Online. In 29th International Symposium on Theoretical Aspects of Computer Science STACS2012. 2012. vyd. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2012, s. 326-337. ISBN 978-3-939897-35-4. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2012.326.

OBDRŽÁLEK, Jan, Jiří SLABÝ a Marek TRTÍK. STANSE: Bug-finding Framework for C Programs. In LNCS Proceeding of Memics 2011. Brno: Springer, 2012, s. 167-178. ISBN 978-3-642-25928-9. Dostupné z: https://dx.doi.org/10.1007/978-3-642-25929-6_16.

BERWANGER, Dietmar, Anuj DAWAR, Paul HUNTER, Stephan KREUTZER a Jan OBDRŽÁLEK. The DAG-width of directed graphs. Journal of Combinatorial Theory, Ser B. Amsterdam: Elsevier B.V., 2012, roč. 102, č. 4, s. 900-923. ISSN 0095-8956. Dostupné z: https://dx.doi.org/10.1016/j.jctb.2012.04.004.

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Jaroslav NEŠETŘIL, Patrice OSSONA DE MENDEZ a Reshma RAMADURAI. When Trees Grow Low: Shrubs and Fast MSO1. In Math Foundations of Computer Science MFCS 2012. 7464. vyd. Německo: Lecture Notes in Computer Science, Springer-Verlag, 2012, s. 419-430. ISBN 978-3-642-32588-5. Dostupné z: https://dx.doi.org/10.1007/978-3-642-32589-2_38.

GANIAN, Robert, Petr HLINĚNÝ a Jan OBDRŽÁLEK. Clique-width: When Hard Does Not Mean Impossible. Online. In Thomas Schwentick and Christoph D{\"u}rr. 28th International Symposium on Theoretical Aspects of Computer Science STACS2011. 2011. vyd. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2011, s. 404-415. ISBN 978-3-939897-25-5. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2011.404.

OBDRŽÁLEK, Jan a Marek TRTÍK. Efficient Loop Navigation for Symbolic Execution. In Tevfik Bultan and Pao-Ann Hsiung. Automated Technology for Verification and Analysis, 9th International Symposium, ATVA 2011. Heidelberg: Springer-Verlag, 2011, s. 453-462. ISBN 978-3-642-24371-4. Dostupné z: https://dx.doi.org/10.1007/978-3-642-24372-1_34.

BRÁZDIL, Tomáš, Václav BROŽEK, Antonín KUČERA a Jan OBDRŽÁLEK. Qualitative Reachability in Stochastic BPA Games. Information and Computation. Elsevier, 2011, roč. 209, č. 8, s. 1160-1183. ISSN 0890-5401.

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Joachim KNEIS, Daniel MEISTER, Somnath SIKDAR a Peter ROSSMANITH. Are there any good digraph width measures? In Parameterized and exact computation, IPEC 2010. 6478. vyd. India: Lecture Notes in Computer Science, Springer-Verlag, 2010, s. 135-146. ISBN 978-3-642-17492-6. Dostupné z: https://dx.doi.org/10.1007/978-3-642-17493-3_14.

GANIAN, Robert, Petr HLINĚNÝ a Jan OBDRŽÁLEK. Better algorithms for satisfiability problems for formulas of bounded rank-width. Online. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). 2010. vyd. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2010, s. 73-83. ISBN 978-3-939897-23-1. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.73.

HLINĚNÝ, Petr a Vladimír VETCHÝ. Česko-Slovenská Konference GRAFY 2010. 2010.

OBDRŽÁLEK, Jan. Proceedings of the 45th Czech-Slovak Conference GRAFY 2010. In 45th CZech-Slovak Conference GRAFY 2010. Brno: University of Defence, Brno, 2010, 68 s. ISBN 978-80-7231-723-3.

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Alexander LANGER, Joachim KNEIS a Peter ROSSMANITH. On Digraph Width Measures in Parameterized Algorithmics. In IWPEC 2009: International Workshop on Parameterized and Exact Computation, Lecture Notes in Computer Science. 5917. vyd. Berlin: Springer Verlag, 2009, s. 185-197. ISBN 978-3-642-11268-3. Dostupné z: https://dx.doi.org/10.1007/978-3-642-11269-0_15.

BRÁZDIL, Tomáš, Václav BROŽEK, Antonín KUČERA a Jan OBDRŽÁLEK. Qualitative Reachability in Stochastic BPA Games. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science. Freiburg, Germany: IBFI Schloss Dagstuhl, 2009, s. 207-218. ISBN 978-3-939897-09-5.

OBDRŽÁLEK, Jan. Clique-Width and Parity Games. In Computer Science Logic 2007, proceedings. Berlin: Springer-Verlag, 2007, s. 54-68. ISBN 978-3-540-74914-1.

OBDRŽÁLEK, Jan. DAG-width - Connectivity Measure for Directed Graphs. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms. New York/Philadelphia: Association for Computing Machinery/Society for Industrial and Applied Mathematics, 2006, s. 814--821. ISBN 0-89871-605-5.

HLINĚNÝ, Petr a Jan OBDRŽÁLEK. Escape-width: Measuring "width" of digraphs. In Combinatorics, Graph Theory, Algorithms and Applications. Abstracts. 2006.

OBDRŽÁLEK, Jan. Fast Mu-calculus Model Checking when Tree-width is Bounded. In CAV 2003. Berlin Heidelberg: Springer-Verlag, 2003, s. 80-92. ISBN 3-540-40524-0.

OBDRŽÁLEK, Jan, J. M. BULL a L. A. SMITH. A Parallel Java Grande Benchmark Suite. In Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM). ACM Press, 2001, s. 8-8.

KAMBITES, M. E., J. M. BULL a Jan OBDRŽÁLEK. An OpenMP-like interface for parallel programming in Java. Concurrency and Computation: Practice and Experience. John Wiley & Sons, Inc, 2001, roč. 13, 8-9, s. 793-814. ISSN 1532-0626.

BULL, Mark a Jan OBDRŽÁLEK. JOMP Application Program Interface. Version 0.1 (draft). Edinburgh: EPCC Technical Report, 2000, 32 s.

OBDRŽÁLEK, Jan. OpenMP for Java. University of Edinburgh: EPCC Technical Report, 2000, 25 s.

BULL, Mark, Mark KAMBITES, Jan OBDRŽÁLEK a Martin WESTHEAD. Towards OpenMP for Java. In Proceedings of the Second European Workshop on OpenMP (EWOMP 2000). Edinburgh: University of Edinburgh, 2000, s. 98-105.