Masaryk University

Publication Records

česky | in English

Filter publications

    2023

    1. Cartesian Reachability Logic: A Language-parametric Logic for Verifying k-Safety Properties
      TUŠIL, Jan, Traian SERBANUTA and 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, p. 405-456. ISSN 2398-7340. Available from: https://dx.doi.org/10.29007/1874.
      URL
      RIV/00216224:14330/23:00131016 Proceedings paper. English. United Kingdom of Great Britain and Northern Ireland.
      Tušil, Jan (203 Czech Republic, belonging to the institution) -- Serbanuta, Traian (642 Romania) -- Obdržálek, Jan (203 Czech Republic, guarantor, belonging to the institution)
      Keywords in English: hyperproperties; k-safety; language-parametric; logic
      International impact: yes
      Reviewed: yes
      Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 7/4/2024 23:03.
      More: https://is.muni.cz/publication/2292879/en

    2020

    1. A New Perspective on FO Model Checking of Dense Graph Classes
      GAJARSKÝ, Jakub, Petr HLINĚNÝ, Daniel LOKSHTANOV, Jan OBDRŽÁLEK and 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, vol. 21, No 4, p. "28:1"-"28:23", 23 pp. ISSN 1529-3785. Available from: https://dx.doi.org/10.1145/3383206.
      URL
      RIV/00216224:14330/20:00114779 Article in a journal. English. United States of America.
      Gajarský, Jakub (703 Slovakia, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Lokshtanov, Daniel (578 Norway) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Ramanujan, M S (356 India)
      Keywords in English: FO Logic; Model-Checking; Logic Interpretations; Sparse Graph Classes; Parameterized Complexity
      International impact: yes
      Reviewed: yes
      Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 29/4/2021 08:15.
      More: https://is.muni.cz/publication/1759916/en

    2019

    1. Shrub-depth: Capturing Height of Dense Graphs
      GANIAN, Robert, Petr HLINĚNÝ, Jaroslav NEŠETŘIL, Jan OBDRŽÁLEK and Patrice OSSONA DE MENDEZ. Shrub-depth: Capturing Height of Dense Graphs. Logical Methods in Computer Science. BRAUNSCHWEIG: LOGICAL METHODS COMPUTER SCIENCE E V, 2019, vol. 15, No 1, p. "7:1"-"7:25", 25 pp. ISSN 1860-5974. Available from: https://dx.doi.org/10.23638/LMCS-15(1:7)2019.
      URL
      RIV/00216224:14330/19:00108273 Article in a journal. English. Germany.
      Ganian, Robert (203 Czech Republic) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Nešetřil, Jaroslav (203 Czech Republic) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Ossona de Mendez, Patrice (250 France)
      Keywords in English: tree-depth; clique-width; shrub-depth; MSO logic; transduction
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 16/4/2020 09:41.
      More: https://is.muni.cz/publication/1646045/en

    2017

    1. First order limits of sparse graphs: Plane trees and path-width
      GAJARSKÝ, Jakub, Petr HLINĚNÝ, Tomáš KAISER, Daniel KRÁĽ, Martin KUPEC, Jan OBDRŽÁLEK, Sebastian ORDYNIAK and Vojtěch TŮMA. First order limits of sparse graphs: Plane trees and path-width. Random Structures & Algorithms. Wiley, 2017, vol. 50, No 4, p. 612-635. ISSN 1042-9832. Available from: https://dx.doi.org/10.1002/rsa.20676.
      RIV/00216224:14330/17:00094633 Article in a journal. General mathematics. English. United States of America.
      Gajarský, Jakub (703 Slovakia, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Kaiser, Tomáš (203 Czech Republic) -- Kráľ, Daniel (203 Czech Republic) -- Kupec, Martin (203 Czech Republic) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Ordyniak, Sebastian (276 Germany, belonging to the institution) -- Tůma, Vojtěch (203 Czech Republic)
      Keywords in English: graph limits; graphs with bounded path-width; first order limits
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 17/4/2018 09:36.
      More: https://is.muni.cz/publication/1372353/en
    2. Kernelization using structural parameters on sparse graph classes
      GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Sebastian ORDYNIAK, Felix REIDL, Peter ROSSMANITH, Fernando VILLAAMIL and Somnath SIKDAR. Kernelization using structural parameters on sparse graph classes. Journal of Computer and System Sciences. SAN DIEGO: Elsevier, 2017, vol. 84, No 1, p. 219-242. ISSN 0022-0000. Available from: https://dx.doi.org/10.1016/j.jcss.2016.09.002.
      RIV/00216224:14330/17:00094632 Article in a journal. Informatics. English. United States of America.
      Gajarský, Jakub (703 Slovakia, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Ordyniak, Sebastian (276 Germany, belonging to the institution) -- Reidl, Felix (276 Germany) -- Rossmanith, Peter (276 Germany) -- Villaamil, Fernando (276 Germany) -- Sikdar, Somnath (356 India)
      Keywords in English: Parameterized complexity; Kernelization; Nowhere dense graphs; Finite integer index; Treedepth
      International impact: yes
      Reviewed: yes
      Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 27/4/2018 10:06.
      More: https://is.muni.cz/publication/1372352/en

    2016

    1. A New Perspective on FO Model Checking of Dense Graph Classes
      GAJARSKÝ, Jakub, Petr HLINĚNÝ, Daniel LOKSHTANOV, Jan OBDRŽÁLEK and 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, p. 176-184. ISBN 978-1-4503-4391-6. Available from: https://dx.doi.org/10.1145/2933575.2935314.
      URL
      RIV/00216224:14330/16:00088546 Proceedings paper. Informatics. English. United States of America.
      Gajarský, Jakub (703 Slovakia, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Lokshtanov, Daniel (578 Norway) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Ramanujan, M S (356 India)
      Keywords in English: FO Logic; Model-Checking; Logic Interpretations; Sparse Graph Classes; Parameterized Complexity
      Type of proceedings: pre-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 17/4/2018 09:51.
      More: https://is.muni.cz/publication/1367542/en
    2. Are there any good digraph width measures?
      GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Joachim KNEIS, Daniel MEISTER, Somnath SIKDAR and Peter ROSSMANITH. Are there any good digraph width measures? Journal of Combinatorial Theory, Ser B. Academic Press, 2016, vol. 116, No 1, p. 250-286. ISSN 0095-8956. Available from: https://dx.doi.org/10.1016/j.jctb.2015.09.001.
      RIV/00216224:14330/16:00087762 Article in a journal. Informatics. English. India.
      Ganian, Robert (203 Czech Republic) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Kneis, Joachim (276 Germany) -- Meister, Daniel (276 Germany) -- Sikdar, Somnath (356 India) -- Rossmanith, Peter (276 Germany)
      Keywords in English: Tree-width; Digraph width; Directed minor; Cops-and-robber game
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 17/4/2018 09:44.
      More: https://is.muni.cz/publication/1323142/en
    3. Tree-depth and Vertex-minors
      HLINĚNÝ, Petr, O-joung KWON, Jan OBDRŽÁLEK and Sebastian ORDYNIAK. Tree-depth and Vertex-minors. European Journal of Combinatorics. Elsevier, 2016, vol. 56, No 1, p. 46-56. ISSN 0195-6698. Available from: https://dx.doi.org/10.1016/j.ejc.2016.03.001.
      RIV/00216224:14330/16:00088544 Article in a journal. Informatics. English. Netherlands.
      Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Kwon, O-joung (410 Republic of Korea) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Ordyniak, Sebastian (276 Germany, belonging to the institution)
      Keywords in English: tree-depth; shrub-depth; vertex-minor; pivot-minor
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 17/4/2018 09:45.
      More: https://is.muni.cz/publication/1367539/en

    2015

    1. Faster Existential FO Model Checking on Posets
      GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK and Sebastian ORDYNIAK. Faster Existential FO Model Checking on Posets. Logical Methods in Computer Science. Německo: Logical Methods in Computer Science e.V., 2015, vol. 11, No 4, p. 1-13. ISSN 1860-5974. Available from: https://dx.doi.org/10.2168/LMCS-11(4:8)2015.
      URL
      RIV/00216224:14330/15:00081186 Article in a journal. Informatics. English. Germany.
      Gajarský, Jakub (703 Slovakia, guarantor, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, belonging to the institution) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Ordyniak, Sebastian (276 Germany, belonging to the institution)
      Keywords in English: rst-order logic; partially ordered sets; model checking; parameterized complexity
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 14/2/2017 09:05.
      More: https://is.muni.cz/publication/1316744/en
    2. FO Model Checking of Interval Graphs
      GANIAN, Robert, Petr HLINĚNÝ, Daniel KRÁĽ, Jan OBDRŽÁLEK, Jarett SCHWARTZ and Jakub TESKA. FO Model Checking of Interval Graphs. Logical Methods in Computer Science. Německo: Logical Methods in Computer Science e.V., 2015, vol. 11, 4:11, p. 1-20. ISSN 1860-5974. Available from: https://dx.doi.org/10.2168/LMCS-11(4:11)2015.
      URL
      RIV/00216224:14330/15:00081403 Article in a journal. Informatics. English. Germany.
      Ganian, Robert (203 Czech Republic) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Kráľ, Daniel (203 Czech Republic) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Schwartz, Jarett (840 United States of America) -- Teska, Jakub (203 Czech Republic)
      Keywords in English: rst-order model checking; parameterized complexity; interval graph; clique-width
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 14/2/2017 09:03.
      More: https://is.muni.cz/publication/1323000/en
    3. FO Model Checking on Posets of Bounded Width
      GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Sebastian ORDYNIAK, M.S. RAMANUJAN, Daniel LOKSHTANOV and 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, p. 963-974. ISBN 978-1-4673-8191-8. Available from: https://dx.doi.org/10.1109/FOCS.2015.63.
      sborník
      Name (in English): FO Model Checking on Posets of Bounded Width
      RIV/00216224:14330/15:00081183 Proceedings paper. Informatics. English. United States of America.
      Gajarský, Jakub (703 Slovakia, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Ordyniak, Sebastian (276 Germany, belonging to the institution) -- Ramanujan, M.S. (356 India) -- Lokshtanov, Daniel (578 Norway) -- Saurabh, Saket (356 India)
      Keywords in English: model checking; first-order logic; posets; width; metatheorem
      Type of proceedings: pre-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 27/8/2019 11:58.
      More: https://is.muni.cz/publication/1316736/en

    2014

    1. Digraph width measures in parameterized algorithmics
      GANIAN, Robert, Petr HLINĚNÝ, Joachim KNEIS, Alexander LANGER, Jan OBDRŽÁLEK and Peter ROSSMANITH. Digraph width measures in parameterized algorithmics. Discrete Applied Mathematics. Elsevier B.V., 2014, vol. 168, No 1, p. 88-107. ISSN 0166-218X. Available from: https://dx.doi.org/10.1016/j.dam.2013.10.038.
      RIV/00216224:14330/14:00073690 Article in a journal. Informatics. English. Netherlands.
      Ganian, Robert (840 United States of America, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, belonging to the institution) -- Kneis, Joachim (276 Germany) -- Langer, Alexander (276 Germany) -- Obdržálek, Jan (203 Czech Republic, guarantor, belonging to the institution) -- Rossmanith, Peter (276 Germany)
      Keywords in English: Digraph;Parameterized complexity;Tree-width;DAG-width;DAG-depth;Clique-width
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 1/4/2015 22:53.
      More: https://is.muni.cz/publication/1186160/en
    2. Faster Existential FO Model Checking on Posets
      GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK and 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, p. 441-451. ISBN 978-3-319-13074-3. Available from: https://dx.doi.org/10.1007/978-3-319-13075-0_35.
      RIV/00216224:14330/14:00074016 Proceedings paper. Informatics. English. Germany.
      Gajarský, Jakub (703 Slovakia, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Ordyniak, Sebastian (276 Germany, belonging to the institution)
      Keywords in English: existential first-order logic; parameterized complexity; kernelization; poset embedding
      Type of proceedings: pre-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 30/3/2016 10:02.
      More: https://is.muni.cz/publication/1204410/en
    3. Finite Integer Index of Pathwidth and Treewidth
      ORDYNIAK, Sebastian, Jakub GAJARSKÝ, Felix REIDL, Peter ROSSMANITH, Jan OBDRŽÁLEK and Fernando SÁNCHEZ VILAAMIL. Finite Integer Index of Pathwidth and Treewidth. In Marek Cygan and Pinar Heggernes. IPEC 2014, LNCS 8246. Wroclaw: Springer, 2014, p. 258-269. ISBN 978-3-319-13523-6. Available from: https://dx.doi.org/10.1007/978-3-319-13524-3_22.
      Name (in English): Finite Integer Index of Pathwidth and Treewidth
      RIV/00216224:14330/14:00077727 Proceedings paper. Informatics. English. United States of America.
      Ordyniak, Sebastian (276 Germany, guarantor, belonging to the institution) -- Gajarský, Jakub (703 Slovakia, belonging to the institution) -- Reidl, Felix (276 Germany) -- Rossmanith, Peter (276 Germany) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Sánchez Vilaamil, Fernando (724 Spain)
      Keywords in English: meta-kernalization; finite integer index; treewidth; pathwidth
      Type of proceedings: post-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: RNDr. Jakub Gajarský, Ph.D., učo 172462. Changed: 16/2/2016 15:37.
      More: https://is.muni.cz/publication/1212629/en
    4. Lower Bounds on the Complexity of MSO_1 Model-Checking
      GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Alexander LANGER, Peter ROSSMANITH and Somnath SIKDAR. Lower Bounds on the Complexity of MSO_1 Model-Checking. Journal of Computer and System Sciences. Elsevier, 2014, vol. 80, No 1, p. 180-194. ISSN 0022-0000. Available from: https://dx.doi.org/10.1016/j.jcss.2013.07.005.
      Name in Czech: Dolní meze složitosti MSO1 model checking
      RIV/00216224:14330/14:00073428 Article in a journal. Informatics. English. Netherlands.
      Ganian, Robert (840 United States of America, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Langer, Alexander (276 Germany) -- Rossmanith, Peter (276 Germany) -- Sikdar, Somnath (356 India)
      Keywords in English: Monadic Second-Order Logic; Treewidth; Lower Bounds; Exponential Time Hypothesis; Parameterized Complexity
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 1/4/2015 23:00.
      More: https://is.muni.cz/publication/1130258/en

    2013

    1. Better algorithms for satisfiability problems for formulas of bounded rank-width
      GANIAN, Robert, Petr HLINĚNÝ and Jan OBDRŽÁLEK. Better algorithms for satisfiability problems for formulas of bounded rank-width. Fundamenta Informaticae. Poland: IOS Press, The Netherlands, 2013, vol. 123, No 1, p. 59-76. ISSN 0169-2968. Available from: https://dx.doi.org/10.3233/FI-2013-800.
      RIV/00216224:14330/13:00066369 Article in a journal. Informatics. English. Netherlands.
      Ganian, Robert (840 United States of America, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution)
      Keywords in English: propositional model counting; satisfiability; rank-width; clique-width; parameterized complexity
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 31/3/2014 13:21.
      More: https://is.muni.cz/publication/1123106/en
    2. Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes
      OBDRŽÁLEK, Jan and 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, p. 164-177. ISBN 978-3-642-45277-2. Available from: https://dx.doi.org/10.1007/978-3-642-45278-9_15.
      RIV/00216224:14330/13:00066545 Proceedings paper. Informatics. English. Germany.
      Obdržálek, Jan (203 Czech Republic, guarantor, belonging to the institution) -- Ganian, Robert (840 United States of America)
      Keywords in English: MSO; model checking; vertex cover; meta-theorems; parameterized complexity
      Reviewed: yes
      Changed by: doc. Mgr. Jan Obdržálek, PhD., učo 1552. Changed: 30/9/2014 11:28.
      More: https://is.muni.cz/publication/1130962/en
    3. FO Model Checking of Interval Graphs
      GANIAN, Robert, Petr HLINĚNÝ, Daniel KRÁĽ, Jan OBDRŽÁLEK, Jarett SCHWARTZ and 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, p. 250-262. ISBN 978-3-642-39211-5. Available from: https://dx.doi.org/10.1007/978-3-642-39212-2_24.
      RIV/00216224:14330/13:00066379 Proceedings paper. Informatics. English. Germany.
      Ganian, Robert (840 United States of America) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Kráľ, Daniel (203 Czech Republic) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Schwartz, Jarett (840 United States of America) -- Teska, Jakub (203 Czech Republic)
      Keywords in English: interval graphs; first-order logic; parameterized complexity
      Type of proceedings: pre-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 14/11/2014 13:23.
      More: https://is.muni.cz/publication/1123297/en
    4. Kernelization Using Structural Parameters on Sparse Graph Classes
      GAJARSKÝ, Jakub, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Sebastian ORDYNIAK, Felix REIDL, Peter ROSSMANITH, Fernando Sanchez VILLAAMIL and Somnath SIKDAR. Kernelization Using Structural Parameters on Sparse Graph Classes. In Hans L. Bodlaender a Giuseppe F. Italiano. ESA 2013. Berlin Heidelberg: Springer, 2013, p. 529-540. ISBN 978-3-642-40449-8. Available from: https://dx.doi.org/10.1007/978-3-642-40450-4_45.
      RIV/00216224:14330/13:00066378 Proceedings paper. Informatics. English. Germany.
      Gajarský, Jakub (703 Slovakia, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Ordyniak, Sebastian (276 Germany, belonging to the institution) -- Reidl, Felix (276 Germany) -- Rossmanith, Peter (276 Germany) -- Villaamil, Fernando Sanchez (724 Spain) -- Sikdar, Somnath (356 India)
      Keywords in English: kernelization; parameterized complexity; sparse graphs
      Type of proceedings: pre-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 14/11/2014 13:21.
      More: https://is.muni.cz/publication/1123296/en
    5. Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width
      GANIAN, Robert, Petr HLINĚNÝ and Jan OBDRŽÁLEK. Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width. European Journal of Combinatorics. Elsevier, 2013, vol. 34, No 3, p. 680-701. ISSN 0195-6698. Available from: https://dx.doi.org/10.1016/j.ejc.2012.07.024.
      Name in Czech: Sjednocený přístup k polynomiálním algoritmům na grafech omezené rank-width
      RIV/00216224:14330/13:00065951 Article in a journal. Informatics. English. Netherlands.
      Ganian, Robert (840 United States of America, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution)
      Keywords in English: rank-width; XP algorithm; coloring
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 3/4/2013 14:54.
      More: https://is.muni.cz/publication/1075308/en

    2012

    1. Can dense graphs be "sparse"?
      GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Jaroslav NEŠETŘIL, Patrice OSSONA DE MENDEZ and Reshma RAMADURAI. Can dense graphs be "sparse"? In Third Workshop on Graphs and Matroids; Maastricht, The Netherlands. 2012.
      Informatics. English. Netherlands.
      Keywords in English: shrub-depth; sparsity; MSO model checking
      Type of participation: active participation (giving a lecture, organization, etc.)
      International impact: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 29/11/2012 15:23.
      More: https://is.muni.cz/publication/1075320/en
    2. Lower Bounds on the Complexity of MSO_1 Model-Checking
      GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Alexander LANGER, Peter ROSSMANITH and Somnath SIKDAR. Lower Bounds on the Complexity of MSO_1 Model-Checking. Online. In 29th International Symposium on Theoretical Aspects of Computer Science STACS2012. 2012th ed. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2012, p. 326-337. ISBN 978-3-939897-35-4. Available from: https://dx.doi.org/10.4230/LIPIcs.STACS.2012.326.
      STACS2012
      Name in Czech: Dolní meze složitosti MSO1 model checking
      RIV/00216224:14330/12:00057595 Proceedings paper. Informatics. English. France.
      Ganian, Robert (840 United States of America, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Langer, Alexander (276 Germany) -- Rossmanith, Peter (276 Germany) -- Sikdar, Somnath (356 India)
      Keywords in English: Monadic Second-Order Logic; Treewidth; Lower Bounds; Exponential Time Hypothesis; Parameterized Complexity
      Type of proceedings: pre-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 31/3/2013 13:29.
      More: https://is.muni.cz/publication/992001/en
    3. STANSE: Bug-finding Framework for C Programs
      OBDRŽÁLEK, Jan, Jiří SLABÝ and Marek TRTÍK. STANSE: Bug-finding Framework for C Programs. In LNCS Proceeding of Memics 2011. Brno: Springer, 2012, p. 167-178. ISBN 978-3-642-25928-9. Available from: https://dx.doi.org/10.1007/978-3-642-25929-6_16.
      RIV/00216224:14330/12:00067325 Proceedings paper. Computer hardware and software. English. Czech Republic.
      Obdržálek, Jan (203 Czech Republic, guarantor, belonging to the institution) -- Slabý, Jiří (203 Czech Republic, belonging to the institution) -- Trtík, Marek (203 Czech Republic, belonging to the institution)
      Keywords in English: Bug-finding; static analysis; framework; checker
      Type of proceedings: post-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 29/4/2014 12:57.
      More: https://is.muni.cz/publication/956059/en
    4. The DAG-width of directed graphs
      BERWANGER, Dietmar, Anuj DAWAR, Paul HUNTER, Stephan KREUTZER and Jan OBDRŽÁLEK. The DAG-width of directed graphs. Journal of Combinatorial Theory, Ser B. Amsterdam: Elsevier B.V., 2012, vol. 102, No 4, p. 900-923. ISSN 0095-8956. Available from: https://dx.doi.org/10.1016/j.jctb.2012.04.004.
      RIV/00216224:14330/12:00057892 Article in a journal. Informatics. English. Netherlands.
      Berwanger, Dietmar (276 Germany) -- Dawar, Anuj (826 United Kingdom of Great Britain and Northern Ireland) -- Hunter, Paul (36 Australia) -- Kreutzer, Stephan (276 Germany) -- Obdržálek, Jan (203 Czech Republic, guarantor, belonging to the institution)
      Keywords in English: tree-width; mu-calculus; model checking; parity games; decompositions; monotonicity; complexity; logic
      International impact: yes
      Reviewed: yes
      Changed by: doc. Mgr. Jan Obdržálek, PhD., učo 1552. Changed: 5/12/2012 10:31.
      More: https://is.muni.cz/publication/1076197/en
    5. When Trees Grow Low: Shrubs and Fast MSO1
      GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Jaroslav NEŠETŘIL, Patrice OSSONA DE MENDEZ and Reshma RAMADURAI. When Trees Grow Low: Shrubs and Fast MSO1. In Math Foundations of Computer Science MFCS 2012. 7464th ed. Německo: Lecture Notes in Computer Science, Springer-Verlag, 2012, p. 419-430. ISBN 978-3-642-32588-5. Available from: https://dx.doi.org/10.1007/978-3-642-32589-2_38.
      Name in Czech: Když stromy nízké: Keře a rychlá MSO1
      RIV/00216224:14330/12:00057596 Proceedings paper. Informatics. English. Slovakia.
      Ganian, Robert (840 United States of America, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Nešetřil, Jaroslav (203 Czech Republic) -- Ossona de Mendez, Patrice (250 France) -- Ramadurai, Reshma (356 India, belonging to the institution)
      Keywords in English: tree-depth; shrub-depth; MSO model checking
      Type of proceedings: post-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 23/4/2013 13:19.
      More: https://is.muni.cz/publication/992004/en

    2011

    1. Clique-width: When Hard Does Not Mean Impossible
      GANIAN, Robert, Petr HLINĚNÝ and 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. 2011th ed. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2011, p. 404-415. ISBN 978-3-939897-25-5. Available from: https://dx.doi.org/10.4230/LIPIcs.STACS.2011.404.
      DOI STACS2011
      Name in Czech: Clique-width: když těžké není nemožné
      RIV/00216224:14330/11:00049978 Proceedings paper. Informatics. English. Germany.
      Ganian, Robert (840 United States of America, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution)
      Keywords in English: clique-width; parameterized algorithm; XP
      Type of proceedings: pre-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 4/2/2013 12:26.
      More: https://is.muni.cz/publication/950101/en
    2. Efficient Loop Navigation for Symbolic Execution
      OBDRŽÁLEK, Jan and 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, p. 453-462. ISBN 978-3-642-24371-4. Available from: https://dx.doi.org/10.1007/978-3-642-24372-1_34.
      RIV/00216224:14330/11:00052855 Proceedings paper. Informatics. English. Czech Republic.
      Obdržálek, Jan (203 Czech Republic, guarantor, belonging to the institution) -- Trtík, Marek (203 Czech Republic, belonging to the institution)
      Keywords in English: symbolic execution; loops in programs; program verification; bug-finding
      Type of proceedings: post-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: doc. Mgr. Jan Obdržálek, PhD., učo 1552. Changed: 16/4/2012 11:02.
      More: https://is.muni.cz/publication/947610/en
    3. Qualitative Reachability in Stochastic BPA Games
      BRÁZDIL, Tomáš, Václav BROŽEK, Antonín KUČERA and Jan OBDRŽÁLEK. Qualitative Reachability in Stochastic BPA Games. Information and Computation. Elsevier, 2011, vol. 209, No 8, p. 1160-1183. ISSN 0890-5401.
      RIV/00216224:14330/11:00051537 Article in a journal. Informatics. English. Netherlands.
      Brázdil, Tomáš (203 Czech Republic, belonging to the institution) -- Brožek, Václav (276 Germany, belonging to the institution) -- Kučera, Antonín (203 Czech Republic, guarantor, belonging to the institution) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution)
      Keywords in English: pushdown automata; turn-based games
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 15/5/2011 20:14.
      More: https://is.muni.cz/publication/908976/en

    2010

    1. Are there any good digraph width measures?
      GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Joachim KNEIS, Daniel MEISTER, Somnath SIKDAR and Peter ROSSMANITH. Are there any good digraph width measures? In Parameterized and exact computation, IPEC 2010. 6478th ed. India: Lecture Notes in Computer Science, Springer-Verlag, 2010, p. 135-146. ISBN 978-3-642-17492-6. Available from: https://dx.doi.org/10.1007/978-3-642-17493-3_14.
      DOI
      RIV/00216224:14330/10:00065886 Proceedings paper. Informatics. English. India.
      Ganian, Robert (840 United States of America, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Kneis, Joachim (276 Germany) -- Meister, Daniel (276 Germany) -- Sikdar, Somnath (356 India) -- Rossmanith, Peter (276 Germany)
      Keywords in English: directed graphs; width measures; monadic second order logic; directed graph minors
      Type of proceedings: post-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 30/4/2014 04:22.
      More: https://is.muni.cz/publication/904649/en
    2. Better algorithms for satisfiability problems for formulas of bounded rank-width
      GANIAN, Robert, Petr HLINĚNÝ and 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). 2010th ed. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2010, p. 73-83. ISBN 978-3-939897-23-1. Available from: https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.73.
      DOI URL
      RIV/00216224:14330/10:00045217 Proceedings paper. Informatics. English. India.
      Ganian, Robert (840 United States of America, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution)
      Keywords in English: propositional model counting; satisfiability; rank-width; clique-width; parameterized complexity
      Type of proceedings: post-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 4/2/2013 12:24.
      More: https://is.muni.cz/publication/904650/en
    3. Česko-Slovenská Konference GRAFY 2010 (Czech-Slovak Conference GRAFY 2010)
      HLINĚNÝ, Petr and Vladimír VETCHÝ. Česko-Slovenská Konference GRAFY 2010 (Czech-Slovak Conference GRAFY 2010). 2010.
      konference
      Name (in English): Czech-Slovak Conference GRAFY 2010
      RIV/00216224:14330/10:00044261 Organization of a conference. General mathematics. Czech. Czech Republic.
      Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Vetchý, Vladimír (203 Czech Republic)
      Keywords in English: graph; combinatorics
      International impact: yes
      Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 15/12/2010 10:24.
      More: https://is.muni.cz/publication/889918/en
    4. Proceedings of the 45th Czech-Slovak Conference GRAFY 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 pp. ISBN 978-80-7231-723-3.
      Name in Czech: Sborník abstraktů 45. česko-slovenské konference GRAFY 2010
      RIV/00216224:14330/10:00050679 Editing of thematic compilation, editing of monothematic issue of professional journal. General mathematics. English. Czech Republic.
      Obdržálek, Jan (203 Czech Republic, guarantor, belonging to the institution)
      Keywords in English: graph theory; combinatorics; discrete mathematics
      Type of proceedings: pre-proceedings
      International impact: yes
      Changed by: doc. Mgr. Jan Obdržálek, PhD., učo 1552. Changed: 16/4/2012 11:37.
      More: https://is.muni.cz/publication/979768/en

    2009

    1. On Digraph Width Measures in Parameterized Algorithmics
      GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Alexander LANGER, Joachim KNEIS and Peter ROSSMANITH. On Digraph Width Measures in Parameterized Algorithmics. In IWPEC 2009: International Workshop on Parameterized and Exact Computation, Lecture Notes in Computer Science. 5917th ed. Berlin: Springer Verlag, 2009, p. 185-197. ISBN 978-3-642-11268-3. Available from: https://dx.doi.org/10.1007/978-3-642-11269-0_15.
      DOI Conference
      Name in Czech: O orientovaných šířkových parametrech v parametrizovaných algoritmech
      RIV/00216224:14330/09:00065869 Proceedings paper. Informatics. English. Denmark.
      Ganian, Robert (840 United States of America, belonging to the institution) -- Hliněný, Petr (203 Czech Republic, guarantor, belonging to the institution) -- Obdržálek, Jan (203 Czech Republic, belonging to the institution) -- Langer, Alexander (276 Germany) -- Kneis, Joachim (276 Germany) -- Rossmanith, Peter (276 Germany)
      Keywords in English: digraph; DAG-width; bi-rank-width; parameterized complexity
      Type of proceedings: post-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 30/4/2014 05:54.
      More: https://is.muni.cz/publication/863704/en
    2. Qualitative Reachability in Stochastic BPA Games
      BRÁZDIL, Tomáš, Václav BROŽEK, Antonín KUČERA and 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, p. 207-218. ISBN 978-3-939897-09-5.
      DOI
      Name in Czech: Kvalitativní dosažitelnost ve stochastických BPA hrách
      RIV/00216224:14330/09:00034252 Proceedings paper. Informatics. English. Germany.
      Brázdil, Tomáš (203 Czech Republic) -- Brožek, Václav (203 Czech Republic) -- Kučera, Antonín (203 Czech Republic, guarantor) -- Obdržálek, Jan (203 Czech Republic)
      Keywords in English: stochastic games; reachability; BPA
      Type of proceedings: post-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: doc. Mgr. Jan Obdržálek, PhD., učo 1552. Changed: 15/3/2010 09:09.
      More: https://is.muni.cz/publication/798476/en

    2007

    1. Clique-Width and Parity Games
      OBDRŽÁLEK, Jan. Clique-Width and Parity Games. In Computer Science Logic 2007, proceedings. Berlin: Springer-Verlag, 2007, p. 54-68. ISBN 978-3-540-74914-1.
      Name in Czech: Kliková šířka a paritní hry
      RIV/00216224:14330/07:00022579 Proceedings paper. Informatics. English. Germany.
      Obdržálek, Jan (203 Czech Republic, guarantor)
      Keywords in English: parity games; mu-calculus; clique-width
      Type of proceedings: post-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: doc. Mgr. Jan Obdržálek, PhD., učo 1552. Changed: 24/3/2010 15:19.
      More: https://is.muni.cz/publication/725120/en

    2006

    1. DAG-width - Connectivity Measure for Directed Graphs
      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, p. 814--821. ISBN 0-89871-605-5.
      Name in Czech: DAG-width - míra spojitosti pro orientované grafy
      RIV/00216224:14330/06:00016845 Proceedings paper. General mathematics. English. United States of America.
      Obdržálek, Jan (203 Czech Republic, guarantor)
      Keywords in English: tree-width; directed tree-width; DAG-width; digraph-searching
      Changed by: doc. Mgr. Jan Obdržálek, PhD., učo 1552. Changed: 15/3/2010 08:49.
      More: https://is.muni.cz/publication/635424/en
    2. Escape-width: Measuring "width" of digraphs
      HLINĚNÝ, Petr and Jan OBDRŽÁLEK. Escape-width: Measuring "width" of digraphs. In Combinatorics, Graph Theory, Algorithms and Applications. Abstracts. 2006.
      URL
      Name in Czech: Měření šířky orientovaných grafů
      General mathematics. English. Czech Republic.
      Type of proceedings: pre-proceedings
      Type of participation: active participation (giving a lecture, organization, etc.)
      International impact: yes
      Changed by: Ing. Dana Komárková, učo 1475. Changed: 27/6/2008 12:28.
      More: https://is.muni.cz/publication/706398/en

    2003

    1. Fast Mu-calculus Model Checking when Tree-width is Bounded
      OBDRŽÁLEK, Jan. Fast Mu-calculus Model Checking when Tree-width is Bounded. In CAV 2003. Berlin Heidelberg: Springer-Verlag, 2003, p. 80-92. ISBN 3-540-40524-0.
      RIV/00216224:14330/03:00008708 Proceedings paper. Informatics. English. Germany.
      Obdržálek, Jan (203 Czech Republic, guarantor)
      Keywords in English: parity games; mu-calculus; model-checking; tree-width
      Changed by: doc. Mgr. Jan Obdržálek, PhD., učo 1552. Changed: 26/5/2004 11:18.
      More: https://is.muni.cz/publication/555218/en

    2001

    1. A Parallel Java Grande Benchmark Suite
      OBDRŽÁLEK, Jan, J. M. BULL and L. A. SMITH. A Parallel Java Grande Benchmark Suite. In Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM). ACM Press, 2001, p. 8-8.
      Name in Czech: A Parallel Java Grande Benchmark Suite

      International impact: yes
      Reviewed: yes
      Changed by: doc. Mgr. Jan Obdržálek, PhD., učo 1552. Changed: 4/6/2007 16:32.
      More: https://is.muni.cz/publication/718890/en
    2. An OpenMP-like interface for parallel programming in Java
      KAMBITES, M. E., J. M. BULL and Jan OBDRŽÁLEK. An OpenMP-like interface for parallel programming in Java. Concurrency and Computation: Practice and Experience. John Wiley & Sons, Inc, 2001, vol. 13, 8-9, p. 793-814. ISSN 1532-0626.

      Keywords in English: Java; parallel programming; shared memory; directives; compiler
      Changed by: doc. Mgr. Jan Obdržálek, PhD., učo 1552. Changed: 4/6/2007 17:09.
      More: https://is.muni.cz/publication/718891/en

    2000

    1. JOMP Application Program Interface
      BULL, Mark and Jan OBDRŽÁLEK. JOMP Application Program Interface. Version 0.1 (draft). Edinburgh: EPCC Technical Report, 2000, 32 pp.
      Name (in English): JOMP Application Program Interface
      RIV/00216224:14330/00:00002357 Book on a specialized topic. Computer hardware and software. English. United Kingdom of Great Britain and Northern Ireland.
      Obdržálek, Jan (203 Czech Republic, guarantor)
      Keywords in English: OpenMP; Java; parallel programming
      Changed by: doc. Mgr. Jan Obdržálek, PhD., učo 1552. Changed: 4/6/2007 17:06.
      More: https://is.muni.cz/publication/333591/en
    2. OpenMP for Java
      OBDRŽÁLEK, Jan. OpenMP for Java. University of Edinburgh: EPCC Technical Report, 2000, 25 pp.
      Name (in English): OpenMP for Java
      RIV/00216224:14330/00:00003337 Book on a specialized topic. Computer hardware and software. English. United Kingdom of Great Britain and Northern Ireland.
      Changed by: doc. Mgr. Jan Obdržálek, PhD., učo 1552. Changed: 29/9/2000 11:19.
      More: https://is.muni.cz/publication/333571/en
    3. Towards OpenMP for Java
      BULL, Mark, Mark KAMBITES, Jan OBDRŽÁLEK and Martin WESTHEAD. Towards OpenMP for Java. In Proceedings of the Second European Workshop on OpenMP (EWOMP 2000). Edinburgh: University of Edinburgh, 2000, p. 98-105.
      Name (in English): Towards OpenMP for Java
      RIV/00216224:14330/00:00003333 Proceedings paper. Computer hardware and software. English. United Kingdom of Great Britain and Northern Ireland.
      Changed by: doc. Mgr. Jan Obdržálek, PhD., učo 1552. Changed: 29/9/2000 11:20.
      More: https://is.muni.cz/publication/333071/en
Displayed: 30/4/2024 20:35