Masaryk University

Publication Records

česky | in English

Filter publications

    2023

    1. Clique-Width of Point Configurations
      CAGIRICI, Onur, Petr HLINĚNÝ, Filip POKRÝVKA and Abhisekh SANKARAN. Clique-Width of Point Configurations. Journal of Combinatorial Theory, Ser B. Amsterdam: Elsevier B.V., 2023, vol. 158, No 1, p. 43-73. ISSN 0095-8956. Available from: https://dx.doi.org/10.1016/j.jctb.2021.09.001.
      More: https://is.muni.cz/publication/1799076/en
    2. Efficient Isomorphism for Sd-Graphs and T-Graphs
      AGAOGLU CAGIRICI, Deniz and Petr HLINĚNÝ. Efficient Isomorphism for Sd-Graphs and T-Graphs. ALGORITHMICA. UNITED STATES: SPRINGER, 2023, vol. 85, No 2, p. 352-383. ISSN 0178-4617. Available from: https://dx.doi.org/10.1007/s00453-022-01033-8.
      More: https://is.muni.cz/publication/2218880/en
    3. Inserting Multiple Edges into a Planar Graph
      CHIMANI, Markus and Petr HLINĚNÝ. Inserting Multiple Edges into a Planar Graph. Journal of Graph Algorithms and Applications. USA: Brown University, 2023, vol. 27, No 6, p. 489-522. ISSN 1526-1719. Available from: https://dx.doi.org/10.7155/jgaa.00631.
      More: https://is.muni.cz/publication/2294837/en

    2022

    1. Bounded degree conjecture holds precisely for c-crossing-critical graphs with c<=12
      BOKAL, Drago, Zdeněk DVOŘÁK, Petr HLINĚNÝ, Jesus LEANOS, Bojan MOHAR and Tilo WIEDERA. Bounded degree conjecture holds precisely for c-crossing-critical graphs with c<=12. COMBINATORICA. GERMANY: SPRINGER HEIDELBERG, 2022, vol. 42, No 5, p. 701-728. ISSN 0209-9683. Available from: https://dx.doi.org/10.1007/s00493-021-4285-3.
      More: https://is.muni.cz/publication/2243995/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.
      More: https://is.muni.cz/publication/1759916/en
    2. Joint Forces for Memory Safety Checking Revisited
      CHALUPA, Marek, Jan STREJČEK and Martina VITOVSKÁ. Joint Forces for Memory Safety Checking Revisited. International Journal on Software Tools for Technology Transfer (STTT). Springer, 2020, vol. 22, No 2, p. 115-133. ISSN 1433-2779. Available from: https://dx.doi.org/10.1007/s10009-019-00526-2.
      More: https://is.muni.cz/publication/1549999/en
    3. LTL to self-loop alternating automata with generic acceptance and back
      BLAHOUDEK, František, Juraj MAJOR and Jan STREJČEK. LTL to self-loop alternating automata with generic acceptance and back. Theoretical Computer Science. AMSTERDAM: North Holland, 2020, vol. 840, Nov 2020, p. 122-142. ISSN 0304-3975. Available from: https://dx.doi.org/10.1016/j.tcs.2020.07.015.
      More: https://is.muni.cz/publication/1686867/en
    4. Toroidal grid minors and stretch in embedded graphs
      CHIMANI, Markus, Petr HLINĚNÝ and Gelasio SALAZAR. Toroidal grid minors and stretch in embedded graphs. JOURNAL OF COMBINATORIAL THEORY SERIES B. SAN DIEGO: ACADEMIC PRESS INC ELSEVIER SCIENCE, 2020, vol. 140, No 1, p. 323-371. ISSN 0095-8956. Available from: https://dx.doi.org/10.1016/j.jctb.2019.05.009.
      More: https://is.muni.cz/publication/1646019/en

    2019

    1. FO model checking on geometric graphs
      HLINĚNÝ, Petr, Filip POKRÝVKA and Bodhayan ROY. FO model checking on geometric graphs. Computational geometry. Amsterdam: ELSEVIER SCIENCE BV, 2019, vol. 78, No 1, p. 1-19. ISSN 0925-7721. Available from: https://dx.doi.org/10.1016/j.comgeo.2018.10.001.
      More: https://is.muni.cz/publication/1486962/en
    2. Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms
      BAIER, Christel, Clemens DUBSLAFF, Ľuboš KORENČIAK, Antonín KUČERA and Vojtěch ŘEHÁK. Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms. ACM Transactions on Modeling and Computer Simulation (TOMACS). ACM, 2019, vol. 29, No 4, p. "28:1"-"28:26", 26 pp. ISSN 1049-3301. Available from: https://dx.doi.org/10.1145/3310225.
      More: https://is.muni.cz/publication/1598416/en
    3. On Degree Properties of Crossing-Critical Families of Graphs
      BOKAL, Drago, Mojca BRACIC, Marek DERŇÁR and Petr HLINĚNÝ. On Degree Properties of Crossing-Critical Families of Graphs. Electronic Journal of Combinatorics. internet: -, 2019, vol. 26, No 1, p. 1-28. ISSN 1077-8926. Available from: https://dx.doi.org/10.37236/7753.
      More: https://is.muni.cz/publication/1646039/en
    4. Parameterized shifted combinatorial optimization
      GAJARSKÝ, Jakub, Petr HLINĚNÝ, Martin KOUTECKÝ and Shmuel ONN. Parameterized shifted combinatorial optimization. Journal of Computer and System Sciences. SAN DIEGO: Academic Press, 2019, vol. 99, No 1, p. 53-71. ISSN 0022-0000. Available from: https://dx.doi.org/10.1016/j.jcss.2018.06.002.
      More: https://is.muni.cz/publication/1646042/en

    2018

    1. A Simpler Self-reduction Algorithm for Matroid Path-width
      HLINĚNÝ, Petr. A Simpler Self-reduction Algorithm for Matroid Path-width. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2018, vol. 32, No 2, p. 1425-1440. ISSN 0895-4801. Available from: https://dx.doi.org/10.1137/17M1120129.
      More: https://is.muni.cz/publication/1480301/en
    2. Deciding Parity of Graph Crossing Number
      HLINĚNÝ, Petr and Carsten THOMASSEN. Deciding Parity of Graph Crossing Number. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2018, vol. 32, No 3, p. 1962-1965. ISSN 0895-4801. Available from: https://dx.doi.org/10.1137/17M1137231.
      More: https://is.muni.cz/publication/1480299/en
    3. On the complexity of the quantified bit-vector arithmetic with binary encoding
      JONÁŠ, Martin and Jan STREJČEK. On the complexity of the quantified bit-vector arithmetic with binary encoding. Information Processing Letters. Elsevier, 2018, vol. 135, červenec 2018, p. 57-61. ISSN 0020-0190. Available from: https://dx.doi.org/10.1016/j.ipl.2018.02.018.
      More: https://is.muni.cz/publication/1415323/en
    4. Parameterized Extension Complexity of Independent Set and Related Problems
      GAJARSKÝ, Jakub, Petr HLINĚNÝ and Hans Raj TIWARY. Parameterized Extension Complexity of Independent Set and Related Problems. Discrete Applied Mathematics. Elsevier Science, 2018, vol. 248, SI, p. 56-67. ISSN 0166-218X. Available from: https://dx.doi.org/10.1016/j.dam.2017.04.042.
      More: https://is.muni.cz/publication/1392989/en

    2017

    1. A tighter insertion-based approximation of the crossing number
      CHIMANI, Markus and Petr HLINĚNÝ. A tighter insertion-based approximation of the crossing number. Journal of Combinatorial Optimization. Springer, 2017, vol. 33, No 4, p. 1183-1225. ISSN 1382-6905. Available from: https://dx.doi.org/10.1007/s10878-016-0030-z.
      More: https://is.muni.cz/publication/1372354/en
    2. 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.
      More: https://is.muni.cz/publication/1372353/en
    3. 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.
      More: https://is.muni.cz/publication/1372352/en
    4. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
      SVOREŇOVÁ, Mária, Jan KŘETÍNSKÝ, Martin CHMELÍK, Krishnendu CHATTERJEE, Ivana ČERNÁ and Calin BELTA. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. Elsevier, 2017, vol. 23, February 2017, p. 230-253. ISSN 1751-570X. Available from: https://dx.doi.org/10.1016/j.nahs.2016.04.006.
      More: https://is.muni.cz/publication/1365664/en
    5. Trading performance for stability in Markov decision processes
      BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Vojtěch FOREJT and Antonín KUČERA. Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. SAN DIEGO: Elsevier, 2017, vol. 84, No 2017, p. 144-170. ISSN 0022-0000. Available from: https://dx.doi.org/10.1016/j.jcss.2016.09.009.
      More: https://is.muni.cz/publication/1366042/en

    2016

    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? 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.
      More: https://is.muni.cz/publication/1323142/en
    2. From LTL to deterministic automata (A safraless compositional approach)
      ESPARZA, Javier, Jan KŘETÍNSKÝ and Salomon SICKERT. From LTL to deterministic automata (A safraless compositional approach). Formal Methods in System Design. Springer Netherlands, 2016, vol. 49, No 3, p. 219-271. ISSN 0925-9856. Available from: https://dx.doi.org/10.1007/s10703-016-0259-2.
      More: https://is.muni.cz/publication/1365661/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.
      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.
      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.
      More: https://is.muni.cz/publication/1323000/en
    3. Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences
      GAJARSKÝ, Jakub and Petr HLINĚNÝ. Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences. Logical Methods in Computer Science. Německo: Logical Methods in Computer Science e.V., 2015, vol. 11, No 1, p. 1-26. ISSN 1860-5974. Available from: https://dx.doi.org/10.2168/LMCS-11(1:19)2015.
      More: https://is.muni.cz/publication/1316739/en
    4. Planar Emulators Conjecture Is Nearly True for Cubic Graphs
      DERKA, Martin and Petr HLINĚNÝ. Planar Emulators Conjecture Is Nearly True for Cubic Graphs. European Journal of Combinatorics. Elsevier, 2015, vol. 48, No 1, p. 63-70. ISSN 0195-6698. Available from: https://dx.doi.org/10.1016/j.ejc.2015.02.009.
      More: https://is.muni.cz/publication/1206004/en
    5. Refinement checking on parametric modal transition systems
      BENEŠ, Nikola, Jan KŘETÍNSKÝ, Kim G. LARSEN, Mikael H. MOLLER, Salomon SICKERT and Jiří SRBA. Refinement checking on parametric modal transition systems. Acta Informatica. Springer, 2015, vol. 52, 2-3, p. 269-297. ISSN 0001-5903. Available from: https://dx.doi.org/10.1007/s00236-015-0215-4.
      More: https://is.muni.cz/publication/1232561/en
    6. Runtime analysis of probabilistic programs with unbounded recursion
      BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA and Ivana HUTAŘOVÁ VAŘEKOVÁ. Runtime analysis of probabilistic programs with unbounded recursion. Journal of Computer and System Sciences. Academic Press, 2015, vol. 81, No 1, p. 288-310. ISSN 0022-0000. Available from: https://dx.doi.org/10.1016/j.jcss.2014.06.005.
      More: https://is.muni.cz/publication/1219109/en

    2014

    1. Branching-time model-checking of probabilistic pushdown automata
      BRÁZDIL, Tomáš, Václav BROŽEK, Vojtěch FOREJT and Antonín KUČERA. Branching-time model-checking of probabilistic pushdown automata. Journal of Computer and System Sciences. Academic Press, 2014, vol. 80, No 1, p. 139-156. ISSN 0022-0000. Available from: https://dx.doi.org/10.1016/j.jcss.2013.07.001.
      More: https://is.muni.cz/publication/1130512/en
    2. Computing the stretch of an embedded graph
      CABELLO, Sergio, Markus CHIMANI and Petr HLINĚNÝ. Computing the stretch of an embedded graph. SIAM Journal on Discrete Mathematics. Philadelphia: SIAM, 2014, vol. 28, No 3, p. 1391-1401. ISSN 0895-4801. Available from: https://dx.doi.org/10.1137/130945636.
      More: https://is.muni.cz/publication/1206003/en
    3. 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.
      More: https://is.muni.cz/publication/1186160/en
    4. Efficient Analysis of Probabilistic Programs with an Unbounded Counter
      BRÁZDIL, Tomáš, Stefan KIEFER and Antonín KUČERA. Efficient Analysis of Probabilistic Programs with an Unbounded Counter. Journal of the ACM. New York, NY, USA: ACM, 2014, vol. 61, No 6, p. 1-35. ISSN 0004-5411. Available from: https://dx.doi.org/10.1145/2629599.
      More: https://is.muni.cz/publication/1215263/en
    5. 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.
      More: https://is.muni.cz/publication/1130258/en
    6. Markov Decision Processes with Multiple Long-Run Average Objectives
      BRÁZDIL, Tomáš, Václav BROŽEK, Krishnendu CHATTERJEE, Vojtěch FOREJT and Antonín KUČERA. Markov Decision Processes with Multiple Long-Run Average Objectives. Logical Methods in Computer Science. Technical University of Braunschweig, 2014, vol. 10, No 1, p. 1-29. ISSN 1860-5974. Available from: https://dx.doi.org/10.2168/LMCS-10(1:13)2014.
      More: https://is.muni.cz/publication/1232717/en

    2013

    1. Analyzing probabilistic pushdown automata
      BRÁZDIL, Tomáš, Javier ESPARZA, Stefan KIEFER and Antonín KUČERA. Analyzing probabilistic pushdown automata. Formal Methods in System Design. Springer Netherlands, 2013, vol. 43, No 2, p. 124-163. ISSN 0925-9856. Available from: https://dx.doi.org/10.1007/s10703-012-0166-0.
      More: https://is.muni.cz/publication/1076453/en
    2. Approximating the termination value of one-counter MDPs and stochastic games
      BRÁZDIL, Tomáš, Václav BROŽEK, Kousha ETESSAMI and Antonín KUČERA. Approximating the termination value of one-counter MDPs and stochastic games. Information and Computation. Netherlands: Elsevier Science, 2013, vol. 222, January, p. 121-138. ISSN 0890-5401. Available from: https://dx.doi.org/10.1016/j.ic.2012.01.008.
      More: https://is.muni.cz/publication/1076357/en
    3. 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.
      More: https://is.muni.cz/publication/1123106/en
    4. Continuous-Time Stochastic Games with Time-Bounded Reachability
      BRÁZDIL, Tomáš, Vojtěch FOREJT, Jan KRČÁL, Jan KŘETÍNSKÝ and Antonín KUČERA. Continuous-Time Stochastic Games with Time-Bounded Reachability. Information and Computation. Elsevier, 2013, vol. 224, No 1, p. 46-70. ISSN 0890-5401. Available from: https://dx.doi.org/10.1016/j.ic.2013.01.001.
      More: https://is.muni.cz/publication/1082203/en
    5. How Not to Characterize Planar-emulable Graphs
      HLINĚNÝ, Petr, Martin DERKA, Markus CHIMANI and Matěj KLUSÁČEK. How Not to Characterize Planar-emulable Graphs. Advances in Applied Mathematics. Holandsko: Elsevier, 2013, vol. 50, No 1, p. 46-68. ISSN 0196-8858. Available from: https://dx.doi.org/10.1016/j.aam.2012.06.004.
      More: https://is.muni.cz/publication/1075300/en
    6. 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.
      More: https://is.muni.cz/publication/1075308/en

    2012

    1. Generalized Maneuvers in Route Planning
      HLINĚNÝ, Petr and Ondrej MORIŠ. Generalized Maneuvers in Route Planning. Computing and Informatics. Bratislava: Slovak Academy of Sciences, 2012, vol. 31, No 3, p. 531-549. ISSN 1335-9150. Available from: https://dx.doi.org/10.1007/978-3-642-25929-6_15.
      More: https://is.muni.cz/publication/991998/en
    2. Space-efficient scheduling of stochastically generated tasks
      BRÁZDIL, Tomáš, Javier ESPARZA, Stefan KIEFER and Michael LUTTENBERGER. Space-efficient scheduling of stochastically generated tasks. Information and Computation. Elsevier, 2012, vol. 210, January, p. 87–110. ISSN 0890-5401. Available from: https://dx.doi.org/10.1016/j.ic.2011.10.005.
      More: https://is.muni.cz/publication/979394/en
    3. Stochastic game logic
      BAIER, Christel, Tomáš BRÁZDIL, Marcus GRÖSSER and Antonín KUČERA. Stochastic game logic. Acta informatica. Berlin: Springer-Verlag, 2012, vol. 49, No 4, p. 203-224. ISSN 0001-5903. Available from: https://dx.doi.org/10.1007/s00236-012-0156-0.
      More: https://is.muni.cz/publication/984990/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.
      More: https://is.muni.cz/publication/1076197/en
    5. Vertex insertion approximates the crossing number of apex graphs
      HLINĚNÝ, Petr, Markus CHIMANI and Petra MUTZEL. Vertex insertion approximates the crossing number of apex graphs. European Journal of Combinatorics. Elsevier, 2012, vol. 33, No 3, p. 326-335. ISSN 0195-6698. Available from: https://dx.doi.org/10.1016/j.ejc.2011.09.009.
      More: https://is.muni.cz/publication/977218/en
Display details
Displayed: 25/4/2024 17:00