Publication Records

JONÁŠ, Martin, Jan STREJČEK, Marek TRTÍK and Lukáš URBAN. Fizzer: New Gray-Box Fuzzer. Online. In Dirk Beyer and Ana Cavalcanti. Fundamental Approaches to Software Engineering - 27th International Conference, FASE 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings. Cham (Švýcarsko): Springer, 2024, p. 309-313. ISBN 978-3-031-57258-6. Available from: https://dx.doi.org/10.1007/978-3-031-57259-3_17.

JONÁŠ, Martin, Jan STREJČEK, Marek TRTÍK and Lukáš URBAN. Gray-Box Fuzzing via Gradient Descent and Boolean Expression Coverage. Online. In Bernd Finkbeiner and Laura Kovács. Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part III. Cham (Švýcarsko): Springer, 2024, p. 90-109. ISBN 978-3-031-57255-5. Available from: https://dx.doi.org/10.1007/978-3-031-57256-2_5.

AYAZIOVÁ, Paulína, Dirk BEYER, Marian LINGSCH-ROSENFELD, Martin SPIESSL and Jan STREJČEK. Software Verification Witnesses 2.0. Online. In Thomas Neele and Anton Wijs. Model Checking Software - 30th International Symposium, SPIN 2024. Cham (Švýcarsko): Springer, 2024, p. 184-203. ISBN 978-3-031-66148-8. Available from: https://dx.doi.org/10.1007/978-3-031-66149-5_11.

JONÁŠ, Martin, Kristián KUMOR, Jakub NOVÁK, Jindřich SEDLÁČEK, Marek TRTÍK, Lukáš ZAORAL, Paulína AYAZIOVÁ and Jan STREJČEK. Symbiotic 10: Lazy Memory Initialization and Compact Symbolic Execution. Online. In Bernd Finkbeiner and Laura Kovács. Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part III. Cham (Švýcarsko): Springer, 2024, p. 406-411. ISBN 978-3-031-57255-5. Available from: https://dx.doi.org/10.1007/978-3-031-57256-2_29.

JANKOLA, Marek and Jan STREJČEK. Tighter Construction of Tight Büchi Automata. Online. In Naoki Kobayashi and James Worrell. Foundations of Software Science and Computation Structures - 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part I. Cham: Springer, 2024, p. 234-255. ISBN 978-3-031-57227-2. Available from: https://dx.doi.org/10.1007/978-3-031-57228-9_12.

AYAZIOVÁ, Paulína and Jan STREJČEK. Witch 3: Validation of Violation Witnesses in the Witness Format 2.0. Online. In Bernd Finkbeiner and Laura Kovács. Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part III. Cham (Švýcarsko): Springer, 2024, p. 341-346. ISBN 978-3-031-57255-5. Available from: https://dx.doi.org/10.1007/978-3-031-57256-2_18.

AGAOGLU CAGIRICI, Deniz, Onur CAGIRICI, Jan DERBISZ, Tim HARTMANN, Petr HLINĚNÝ, Jan KRATOCHVÍL, Tomasz KRAWCZYK and Peter ZEMAN. Recognizing H-Graphs - Beyond Circular-Arc Graphs. Online. In Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David. 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik, 2023, p. "8:1"-"8:14", 14 pp. ISBN 978-3-95977-292-1. Available from: https://dx.doi.org/10.4230/LIPIcs.MFCS.2023.8.

SCHWARZOVÁ, Tereza, Jan STREJČEK and Juraj MAJOR. Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving. Online. In Meena Mahajan and Friedrich Slivovsky. 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 1-20. ISBN 978-3-95977-286-0. Available from: https://dx.doi.org/10.4230/LIPIcs.SAT.2023.23.

HLINĚNÝ, Petr and Adam STRAKA. Stack and Queue Numbers of Graphs Revisited. Online. In European Conference on Combinatorics, Graph Theory and Applications EUROCOMB’23. Brno, Czech Republic: MUNI Press, 2023, p. 601-606. ISSN 2788-3116. Available from: https://dx.doi.org/10.5817/CZ.MUNI.EUROCOMB23-083.

AYAZIOVÁ, Paulína and Jan STREJČEK. Symbiotic-Witch 2: More Efficient Algorithm and Witness Refutation. Online. In Sriram Sankaranarayanan and Natasha Sharygina. Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22-27, 2023, Proceedings, Part II. Cham (Švýcarsko): Springer, Cham, 2023, p. 523-528. ISBN 978-3-031-30819-2. Available from: https://dx.doi.org/10.1007/978-3-031-30820-8_30.

HLINĚNÝ, Petr and Jan JEDELSKÝ. Twin-width of Planar Graphs is at most 8, and at most 6 when Bipartite Planar. Online. In Etessami, Kousha and Feige, Uriel and Puppis, Gabriele. 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik, 2023, p. "75:1"-"75:18", 18 pp. ISBN 978-3-95977-278-5. Available from: https://dx.doi.org/10.4230/LIPIcs.ICALP.2023.75.

BEYER, Dirk and Jan STREJČEK. Case Study on Verification-Witness Validators: Where We Are and Where We Go. Online. In Gagandeep Singh, Caterina Urban. Static Analysis - 29th International Symposium, SAS 2022, Auckland, New Zealand, December 5–7, 2022, Proceedings. Cham (Switzerland): Springer, 2022, p. 160-174. ISBN 978-3-031-22307-5. Available from: https://dx.doi.org/10.1007/978-3-031-22308-2_8.

KLAŠKA, David, Antonín KUČERA, Vít MUSIL and Vojtěch ŘEHÁK. General Optimization Framework for Recurrent Reachability Objectives. Online. In Luc De Raedt. Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022. Neuveden: ijcai.org, 2022, p. 4642-4648. ISBN 978-1-956792-00-3. Available from: https://dx.doi.org/10.24963/ijcai.2022/644.

BEKOS, Michael A., Giordano DA LOZZO, Petr HLINĚNÝ and Michael KAUFMANN. Graph Product Structure for h-Framed Graphs. Online. In Bae, Sang Won and Park, Heejin. 33rd International Symposium on Algorithms and Computation (ISAAC 2022). LIPIcs 248. Dagstuhl, Germany: Schloss Dagstuhl, 2022, p. "23:1"-"23:15", 15 pp. ISBN 978-3-95977-258-7. Available from: https://dx.doi.org/10.4230/LIPIcs.ISAAC.2022.23.

AGAOGLU CAGIRICI, Deniz and Petr HLINĚNÝ. Isomorphism Testing for T-graphs in FPT. In Mutzel, P., Rahman, M.S., Slamin. WALCOM: Algorithms and Computation. LNCS 13174. Cham: Springer, Cham, 2022, p. 239-250. ISBN 978-3-030-96730-7. Available from: https://dx.doi.org/10.1007/978-3-030-96731-4_20.

KLAŠKA, David, Antonín KUČERA, Vít MUSIL and Vojtěch ŘEHÁK. Minimizing Expected Intrusion Detection Time in Adversarial Patrolling. Online. In Piotr Faliszewski, Viviana Mascardi, Catherine Pelachaud, Matthew E. Taylor. 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022. Neuveden: International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2022, p. 1660-1662. ISBN 978-1-4503-9213-6. Available from: https://dx.doi.org/10.5555/3535850.3536068.

BRÁZDIL, Tomáš, David KLAŠKA, Antonín KUČERA, Vít MUSIL, Petr NOVOTNÝ and Vojtěch ŘEHÁK. On-the-fly Adaptation of Patrolling Strategies in Changing Environments. Online. In James Cussens, Kun Zhang. Proceedings of the Thirty-Eighth Conference on Uncertainty in Artificial Intelligence, UAI 2022. Neuveden: Proceedings of Machine Learning Research, 2022, p. 244-254. ISBN 978-1-7138-6329-8.

HAMM, Thekla and Petr HLINĚNÝ. Parameterised Partially-Predrawn Crossing Number. Online. In Goaoc, Xavier and Kerber, Michael. 38th International Symposium on Computational Geometry (SoCG 2022). LIPIcs Vol. 224. Dagstuhl, Germany: Schloss Dagstuhl, 2022, p. "46:1"-"46:15", 15 pp. ISBN 978-3-95977-227-3. Available from: https://dx.doi.org/10.4230/LIPIcs.SoCG.2022.46.

BALABÁN, Jakub, Petr HLINĚNÝ and Jan JEDELSKÝ. Twin-Width and Transductions of Proper k-Mixed-Thin Graphs. In Michael A. Bekos and Michael Kaufmann. WG 2022: Graph-Theoretic Concepts in Computer Science. LNCS 13453. Cham: Springer Nature, 2022, p. 43-55. ISBN 978-3-031-15913-8. Available from: https://dx.doi.org/10.1007/978-3-031-15914-5_4.

HLINĚNÝ, Petr. A Short Proof of Euler–Poincaré Formula. In Nešetřil J., Perarnau G., Rué J., Serra O. Extended Abstracts EuroComb 2021. Trends in Mathematics. Cham: Birkhäuser, 2021, p. 92-96. ISBN 978-3-030-83822-5. Available from: https://dx.doi.org/10.1007/978-3-030-83823-2_15.

BOK, Jan, Jiří FIALA, Petr HLINĚNÝ, Nikola JEDLIČKOVÁ and Jan KRATOCHVÍL. Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. Online. In Bonchi, Filippo and Puglisi, Simon J. 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Dagstuhl: Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik, 2021, p. "21:1"-"21:15", 15 pp. ISBN 978-3-95977-201-3. Available from: https://dx.doi.org/10.4230/LIPIcs.MFCS.2021.21.

HLINĚNÝ, Petr and Michal KORBELA. On 13-Crossing-Critical Graphs with Arbitrarily Large Degrees. In Nešetřil J., Perarnau G., Rué J., Serra O. Extended Abstracts EuroComb 2021. Trends in Mathematics. Cham: Birkhäuser, 2021, p. 50-56. ISBN 978-3-030-83822-5. Available from: https://dx.doi.org/10.1007/978-3-030-83823-2_9.

KLAŠKA, David, Antonín KUČERA, Vojtěch ŘEHÁK and Vít MUSIL. Regstar: Efficient Strategy Synthesis for Adversarial Patrolling Games. Online. In de Campos, Cassio and Maathuis, Marloes H. Proceedings of 37th Conference on Uncertainty in Artificial Intelligence (UAI 2021). Neuveden: AUAI Press, 2021, p. 471-481. ISSN 2640-3498.

BALABÁN, Jakub and Petr HLINĚNÝ. Twin-Width is Linear in the Poset Width. Online. In Golovach, Petr A. and Zehavi, Meirav. International Symposium on Parameterized and Exact Computation (IPEC). 214th ed. Dagstuhl: Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik, 2021, p. "6:1"-"6:13", 13 pp. ISBN 978-3-95977-216-7. Available from: https://dx.doi.org/10.4230/LIPIcs.IPEC.2021.6.

KLAŠKA, David, Antonín KUČERA and Vojtěch ŘEHÁK. Adversarial Patrolling with Drones. Online. In Proceedings of the 2020 International Conference on Autonomous Agents & Multiagent Systems. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2020, p. 629-637. ISBN 978-1-4503-7518-4. Available from: https://dx.doi.org/10.5555/3398761.3398837.

CAGIRICI, Onur, Petr HLINĚNÝ, Filip POKRÝVKA and Abhisekh SANKARAN. Clique-Width of Point Configurations. In Graph-Theoretic Concepts in Computer Science, WG 2020. Cham: Springer, Lecture Notes in Computer Science, 2020, p. 54-66. ISBN 978-3-030-60439-4. Available from: https://dx.doi.org/10.1007/978-3-030-60440-0_5.

AGAOGLU, Deniz and Petr HLINĚNÝ. Isomorphism Problem for Sd-Graphs. Online. In Javier Esparza and Daniel Kral. 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik, 2020, p. "4:1"-"4:14", 14 pp. ISBN 978-3-95977-159-7. Available from: https://dx.doi.org/10.4230/LIPIcs.MFCS.2020.4.

BLAHOUDEK, František, Alexandre DURET-LUTZ and Jan STREJČEK. Seminator 2 Can Complement Generalized Büchi Automata via Improved Semi-determinization. Online. In Shuvendu K. Lahiri and Chao Wang. Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part II. Cham (Switzerland): Springer, 2020, p. 15-27. ISBN 978-3-030-53290-1. Available from: https://dx.doi.org/10.1007/978-3-030-53291-8_2.

JONÁŠ, Martin and Jan STREJČEK. Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions. Online. In Luca Pulina and Martina Seidl. Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings. Cham (Switzerland): Springer, 2020, p. 378-393. ISBN 978-3-030-51824-0. Available from: https://dx.doi.org/10.1007/978-3-030-51825-7_27.

CHALUPA, Marek, Tomáš JAŠEK, Lukáš TOMOVIČ, Martin HRUŠKA, Veronika ŠOKOVÁ, Paulína AYAZIOVÁ, Jan STREJČEK and Tomáš VOJNAR. Symbiotic 7: Integration of Predator and More (Competition Contribution). In Armin Biere, David Parker. Tools and Algorithms for the Construction and Analysis of Systems. Německo: Springer, 2020, p. 413-417. ISBN 978-3-030-45236-0. Available from: https://dx.doi.org/10.1007/978-3-030-45237-7_31.

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. Online. In 35th International Symposium on Computational Geometry, SoCG 2019. Dagstuhl: Leibniz International Proceedings in Informatics, LIPIcs, 2019, p. "14:1"-"14:15", 15 pp. ISBN 978-3-95977-104-7. Available from: https://dx.doi.org/10.4230/LIPIcs.SoCG.2019.14.

CHALUPA, Marek and Jan STREJČEK. Evaluation of Program Slicing in Software Verification. In Wolfgang Ahrendt, Silvia Lizeth Tapia Tarifa. Integrated Formal Methods - 15th International Conference, IFM 2019, Bergen, Norway, December 2-6, 2019, Proceedings. Cham (Switzerland): Springer, 2019, p. 101-119. ISBN 978-3-030-34967-7. Available from: https://dx.doi.org/10.1007/978-3-030-34968-4_6.

HLINĚNÝ, Petr and Abhisekh SANKARAN. Exact Crossing Number Parameterized by Vertex Cover. In GD 2019: Graph Drawing and Network Visualization. Cham: Springer, Lecture Notes in Computer Science, volume 11904, 2019, p. 307-319. ISBN 978-3-030-35801-3. Available from: https://dx.doi.org/10.1007/978-3-030-35802-0_24.

BAIER, Christel, František BLAHOUDEK, Alexandre DURET-LUTZ, Joachim KLEIN, David MÜLLER and Jan STREJČEK. Generic Emptiness Check for Fun and Profit. Online. In Yu-Fang Chen, Chih-Hong Cheng, Javier Esparza. Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28-31, 2019, Proceedings. Cham (Switzerland): Springer, 2019, p. 445-461. ISBN 978-3-030-31783-6. Available from: https://dx.doi.org/10.1007/978-3-030-31784-3_26.

BLAHOUDEK, František, Juraj MAJOR and Jan STREJČEK. LTL to Smaller Self-Loop Alternating Automata and Back. Online. In Robert Mark Hierons, Mohamed Mosbah. Theoretical Aspects of Computing - ICTAC 2019 - 16th International Colloquium, Hammamet, Tunisia, October 31 - November 4, 2019, Proceedings. Cham (Switzerland): Springer, 2019, p. 152-171. ISBN 978-3-030-32504-6. Available from: https://dx.doi.org/10.1007/978-3-030-32505-3_10.

MAJOR, Juraj, František BLAHOUDEK, Jan STREJČEK, Miriama JÁNOŠOVÁ and Tatiana ZBONČÁKOVÁ. ltl3tela: LTL to Small Deterministic or Nondeterministic Emerson-Lei Automata. Online. In Yu-Fang Chen, Chih-Hong Cheng, Javier Esparza. Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28-31, 2019, Proceedings. Cham (Switzerland): Springer, 2019, p. 357-365. ISBN 978-3-030-31783-6. Available from: https://dx.doi.org/10.1007/978-3-030-31784-3_21.

CAGIRICI, Onur, Subir GHOSH, Petr HLINĚNÝ and Bodhayan ROY. On conflict-free chromatic guarding of simple polygons. Online. In 13th Annual International Conference on Combinatorial Optimization and Applications (COCOA'19). Cham: Springer, Lecture Notes in Computer Science, volume 11949, 2019, p. 601-612. ISBN 978-3-030-36411-3. Available from: https://dx.doi.org/10.1007/978-3-030-36412-0_49.

HLINĚNÝ, Petr and Michal KORBELA. On the achievable average degrees in 2-crossing-critical graphs. Acta Math. Univ. Comenianae. 2019, vol. 88, No 3, p. 787-793. ISSN 0231-6986.

JONÁŠ, Martin and Jan STREJČEK. Q3B: An Efficient BDD-based SMT Solver for Quantified Bit-Vectors. Online. In Isil Dillig, Serdar Tasiran. CAV 2019: Computer Aided Verification. Cham (Switzerland): Springer, 2019, p. 64-73. ISBN 978-3-030-25542-8. Available from: https://dx.doi.org/10.1007/978-3-030-25543-5_4.

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.

JONÁŠ, Martin and Jan STREJČEK. Abstraction of Bit-Vector Operations for BDD-Based SMT Solvers. In Bernd Fischer, Tarmo Uustalu. Theoretical Aspects of Computing – ICTAC 2018. Cham (Switzerland): Springer, 2018, p. 273-291. ISBN 978-3-030-02507-6. Available from: https://dx.doi.org/10.1007/978-3-030-02508-3_15.

KLAŠKA, David, Antonín KUČERA, Tomáš LAMSER and Vojtěch ŘEHÁK. Automatic Synthesis of Efficient Regular Strategies in Adversarial Patrolling Games. Online. In Proceedings of the 2018 International Conference on Autonomous Agents & Multiagent Systems. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2018, p. 659-666. ISBN 978-1-5108-6808-3. Available from: https://dx.doi.org/10.5555/3237383.3237481.

HLINĚNÝ, Petr, Filip POKRÝVKA and Bodhayan ROY. FO model checking of geometric graphs. Online. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). LIPIcs 89. Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, p. "19:1"-"19:12", 12 pp. ISBN 978-3-95977-051-4. Available from: https://dx.doi.org/10.4230/LIPIcs.IPEC.2017.19.

JONÁŠ, Martin and Jan STREJČEK. Is Satisfiability of Quantified Bit-Vector Formulas Stable Under Bit-Width Changes?. Online. In Gilles Barthe, Geoff Sutcliffe, Margus Veanes. LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Neuveden: EasyChair, 2018, p. 488-497. ISSN 2398-7340. Available from: https://dx.doi.org/10.29007/spnx.

CHALUPA, Marek, Jan STREJČEK and Martina VITOVSKÁ. Joint Forces for Memory Safety Checking. In María-del-Mar Gallardo and Pedro Merino. Model Checking Software. SPIN 2018. Cham, Švýcarsko: Springer, 2018, p. 115-132. ISBN 978-3-319-94110-3. Available from: https://dx.doi.org/10.1007/978-3-319-94111-0_7.

CAGIRICI, Onur, Petr HLINĚNÝ and Bodhayan ROY. On Colourability of Polygon Visibility Graphs. Online. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). LIPIcs 93. Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, p. "21:1"-"21:14", 14 pp. ISBN 978-3-95977-055-2. Available from: https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2017.21.

BRÁZDIL, Tomáš, Antonín KUČERA and Vojtěch ŘEHÁK. Solving Patrolling Problems in the Internet Environment. Online. In Jerome Lang. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden. Neuveden: International Joint Conferences on Artificial Intelligence, 2018, p. 121-127. ISBN 978-0-9992411-2-7. Available from: https://dx.doi.org/10.24963/ijcai.2018/17.

DVOŘÁK, Zdeněk, Petr HLINĚNÝ and Bojan MOHAR. Structure and generation of crossing-critical graphs. Online. In 34th International Symposium on Computational Geometry, SoCG 2018. Dagstuhl: Leibniz International Proceedings in Informatics, LIPIcs, 2018, p. "33:1"-"33:14", 14 pp. ISBN 978-3-95977-066-8. Available from: https://dx.doi.org/10.4230/LIPIcs.SoCG.2018.33.

CHALUPA, Marek, Martina VITOVSKÁ and Jan STREJČEK. Symbiotic 5: Boosted Instrumentation (Competition Contribution). In Dirk Beyer and Marieke Huisman. Tools and Algorithms for the Construction and Analysis of Systems, 24th International Conference, Proceedings, Part II. Berlin: Springer, 2018, p. 442-446. ISBN 978-3-319-89963-3. Available from: https://dx.doi.org/10.1007/978-3-319-89963-3_29.

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. In Nathalie Bertrand, Luca Bortolussi. Quantitative Evaluation of Systems. Cham: Springer, 2017, p. 190-206. ISBN 978-3-319-66334-0. Available from: https://dx.doi.org/10.1007/978-3-319-66335-7_12.

JONÁŠ, Martin and Jan STREJČEK. On Simplification of Formulas with Unconstrained Variables and Quantifiers. In Serge Gaspers, Toby Walsh. Theory and Applications of Satisfiability Testing – SAT 2017. Cham (Switzerland): Springer, 2017, p. 364-379. ISBN 978-3-319-66262-6. Available from: https://dx.doi.org/10.1007/978-3-319-66263-3_23.

GAJARSKÝ, Jakub, Petr HLINĚNÝ, Martin KOUTECKÝ and Shmuel ONN. Parameterized Shifted Combinatorial Optimization. In Y. Cao and J. Chen. International Computing and Combinatorics Conference COCOON 2017 (LNCS, volume 10392). Hong Kong: Springer International Publishing AG, 2017, p. 224-236. ISBN 978-3-319-62388-7. Available from: https://dx.doi.org/10.1007/978-3-319-62389-4_19.

CHALUPA, Marek, Martina VITOVSKÁ, Martin JONÁŠ, Jiří SLABÝ and Jan STREJČEK. Symbiotic 4: Beyond Reachability (Competition Contribution). In Axel Legay, Tiziana Margaria. Tools and Algorithms for the Construction and Analysis of Systems: 23rd International Conference. Berlin: Springer Berlin Heidelberg, 2017, p. 385-389. ISBN 978-3-662-54580-5. Available from: https://dx.doi.org/10.1007/978-3-662-54580-5_28.

BAIER, Christel, Clemens DUBSLAFF, Ľuboš KORENČIAK, Antonín KUČERA and Vojtěch ŘEHÁK. Synthesis of Optimal Resilient Control Strategies. In Deepak D'Souza, K. Narayan Kumar. Automated Technology for Verification and Analysis. Cham: Springer International Publishing, 2017, p. 417-434. ISBN 978-3-319-68166-5. Available from: https://dx.doi.org/10.1007/978-3-319-68167-2_27.

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.

BLAHOUDEK, František, Matthias HEIZMANN, Sven SCHEWE, Jan STREJČEK and Ming-Hsien TSAI. Complementing Semi-deterministic Büchi Automata. In Marsha Chechik, Jean-François Raskin. Tools and Algorithms for the Construction and Analysis of Systems 22nd International Conference, TACAS 2016. Berlin: Springer Berlin Heidelberg, 2016, p. 770-787. ISBN 978-3-662-49673-2. Available from: https://dx.doi.org/10.1007/978-3-662-49674-9_49.

DERŇÁR, Marek and Petr HLINĚNÝ. Crossing Number is Hard for Kernelization. Online. In 32nd International Symposium on Computational Geometry (SoCG 2016). Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016, p. "42:1"-"42:10", 10 pp. ISBN 978-3-95977-009-5. Available from: https://dx.doi.org/10.4230/LIPIcs.SoCG.2016.42.

KORENČIAK, Ľuboš, Antonín KUČERA and Vojtěch ŘEHÁK. Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration. In 2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems. London: IEEE Computer Society, 2016, p. 367-372. ISBN 978-1-5090-3431-4. Available from: https://dx.doi.org/10.1109/MASCOTS.2016.34.

KORENČIAK, Ľuboš, Vojtěch ŘEHÁK and Adrian FARMADIN. Extension of PRISM by Synthesis of Optimal Timeouts in Fixed-Delay CTMC. In Erika Ábrahám, Marieke Huisman. Integrated Formal Methods. Switzerland: Springer International Publishing, 2016, p. 130-138. ISBN 978-3-319-33692-3. Available from: https://dx.doi.org/10.1007/978-3-319-33693-0_9.

DACA, Przemyslaw, Thomas A. HENZINGER, Jan KŘETÍNSKÝ and Tatjana PETROV. Faster Statistical Model Checking for Unbounded Temporal Properties. In Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016. Berlin Heidelberg: Springer, 2016, p. 112-129. ISBN 978-3-662-49673-2. Available from: https://dx.doi.org/10.1007/978-3-662-49674-9_7.

CHIMANI, Markus and Petr HLINĚNÝ. Inserting Multiple Edges into a Planar Graph. Online. In 32nd International Symposium on Computational Geometry (SoCG 2016). Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016, p. "30:1"-"30:15", 15 pp. ISBN 978-3-95977-009-5. Available from: https://dx.doi.org/10.4230/LIPIcs.SoCG.2016.30.

SICKERT, Salomon, Javier ESPARZA, Stefan JAAX and Jan KŘETÍNSKÝ. Limit-Deterministic Büchi Automata for Linear Temporal Logic. In Computer Aided Verification - 28th International Conference, CAV 2016. Switzerland: Springer, 2016, p. 312-332. ISBN 978-3-319-41539-0. Available from: https://dx.doi.org/10.1007/978-3-319-41540-6_17.

DACA, Przemyslaw, Thomas A. HENZINGER, Jan KŘETÍNSKÝ and Tatjana PETROV. Linear Distances between Markov Chains. Online. In 27th International Conference on Concurrency Theory, CONCUR 2016. Schloss Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, p. 1-15. ISBN 978-3-95977-017-0. Available from: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2016.20.

SICKERT, Salomon and Jan KŘETÍNSKÝ. MoChiBA: Probabilistic {LTL} Model Checking Using Limit-Deterministic Büchi Automata. In Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016. Switzerland: Springer, 2016, p. 130-137. ISBN 978-3-319-46519-7. Available from: https://dx.doi.org/10.1007/978-3-319-46520-3_9.

BRÁZDIL, Tomáš, Antonín KUČERA and Petr NOVOTNÝ. Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. In Cyrille Artho, Axel Legay, Doron Peled. Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016. Heidelberg: Springer, 2016, p. 32-49. ISBN 978-3-319-46519-7. Available from: https://dx.doi.org/10.1007/978-3-319-46520-3_3.

BRÁZDIL, Tomáš, Ezio BARTOCCI, Dimitrios MILIOS, Guido SANGUINETTI and Luca BORTOLUSSI. Policy Learning for Time-Bounded Reachability in Continuous-Time Markov Decision Processes via Doubly-Stochastic Gradient Ascent. In Proceedings of QEST 2016. Quebec City: Springer, 2016, p. 244-259. ISBN 978-3-319-43424-7. Available from: https://dx.doi.org/10.1007/978-3-319-43425-4_17.

HLINĚNÝ, Petr and Ondřej SLÁMEČKA. Practical Exhaustive Generation of Small Multiway Cuts in Sparse Graphs. In Jan Kofroň, Tomáš Vojnar. Mathematical and Engineering Methods in Computer Science, Lecture Notes in Computer Science 9548. Switzerland: Springer, 2016, p. 54-66. ISBN 978-3-319-29816-0. Available from: https://dx.doi.org/10.1007/978-3-319-29817-7_6.

JONÁŠ, Martin and Jan STREJČEK. Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams. In Nadia Creignou and Daniel Le Berre. Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference. Berlin, Heidelberg: Springer, 2016, p. 267-283. ISBN 978-3-319-40969-6. Available from: https://dx.doi.org/10.1007/978-3-319-40970-2_17.

BRÁZDIL, Tomáš, Vojtěch FOREJT, Antonín KUČERA and Petr NOVOTNÝ. Stability in Graphs and Games. Online. In Josee Desharnais, Radha Jagadeesan. 27th International Conference on Concurrency Theory, CONCUR 2016. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, p. 1-14. ISBN 978-3-95977-017-0. Available from: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2016.10.

BRÁZDIL, Tomáš, Petr NOVOTNÝ, Krishnendu CHATTERJEE, Martin CHMELÍK and Anchit GUPTA. Stochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract). In Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems. Singapur: ACM, 2016, p. 1465-1466. ISBN 978-1-4503-4239-1.

KŘETÍNSKÝ, Jan. Survey of Statistical Verification of Linear Unbounded Properties: Model Checking and Distances. In Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques - 7th International Symposium, ISoLA 2016. Switzerland: Springer, 2016, p. 27-45. ISBN 978-3-319-47165-5. Available from: https://dx.doi.org/10.1007/978-3-319-47166-2_3.

CHALUPA, Marek, Martin JONÁŠ, Jiří SLABÝ, Jan STREJČEK and Martina VITOVSKÁ. Symbiotic 3: New Slicer and Error-Witness Generation (Competition Contribution). In Marsha Chechik and Jean-Francois Raskin. Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016. Berlin, Heidelberg: Springer, 2016, p. 946-949. ISBN 978-3-662-49673-2. Available from: https://dx.doi.org/10.1007/978-3-662-49674-9_67.

ČADEK, Pavel, Jan STREJČEK and Marek TRTÍK. Tighter Loop Bound Analysis. In Cyrille Artho and Axel Legay and Doron Peled. Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016. Berlin, Heidelberg: Springer, 2016, p. 512-527. ISBN 978-3-319-46519-7. Available from: https://dx.doi.org/10.1007/978-3-319-46520-3_32.

BENEŠ, Nikola, Przemysław DACA, Thomas A. HENZINGER, Jan KŘETÍNSKÝ and Dejan NIČKOVIĆ. Complete Composition Operators for IOCO-Testing Theory. Online. In Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering. New York, NY, USA: ACM, 2015, p. 101-110. ISBN 978-1-4503-3471-6. Available from: https://dx.doi.org/10.1145/2737166.2737175.

FAHRENBERG, Uli, Jan KŘETÍNSKÝ, Axel LEGAY and Louis-Marie TRAONOUEZ. Compositionality for Quantitative Specifications. In The 11th International Symposium on Formal Aspects of Component Software - FACS 2014. Heidelberg Dordrecht London New York: Springer, 2015, p. 306-324. ISBN 978-3-319-15316-2. Available from: https://dx.doi.org/10.1007/978-3-319-15317-9_19.

FOREJT, Vojtěch, Jan KRČÁL and Jan KŘETÍNSKÝ. Controller Synthesis for MDPs and Frequency LTL\GU. In LPAR 2015. Suva, Fiji: Springer, 2015, p. 162-177. ISBN 978-3-662-48898-0. Available from: https://dx.doi.org/10.1007/978-3-662-48899-7_12.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Martin CHMELÍK, Andreas FELLNER and Jan KŘETÍNSKÝ. Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. In Daniel Kroening, Corina Pasareanu. Computer Aided Verification: 27th International Conference, CAV 2015. Cham: Springer, 2015, p. 158-177. ISBN 978-3-319-21689-8. Available from: https://dx.doi.org/10.1007/978-3-319-21690-4_10.

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.

BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA and Petr NOVOTNÝ. Long-Run Average Behaviour of Probabilistic Vector Addition Systems. In Neuveden. 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015. Neuveden: IEEE, 2015, p. 44-55. ISBN 978-1-4799-8875-4. Available from: https://dx.doi.org/10.1109/LICS.2015.15.

BRÁZDIL, Tomáš, Chatterjee KRISHNENDU, Vojtěch FOREJT and Antonín KUČERA. MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives. In Christel Baier, Cesare Tinelli. Tools and Algorithms for the Construction and Analysis of Systems - 21st International Conference, TACAS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings. Heidelberg: Springer, 2015, p. 181-187. ISBN 978-3-662-46680-3. Available from: https://dx.doi.org/10.1007/978-3-662-46681-0_12.

BOKAL, Drago, Mojca BRAČIČ, Marek DERŇÁR and Petr HLINĚNÝ. On Degree Properties of Crossing-critical Families of Graphs. In Emilio Di Giacomo, Anna Lubiw. Graph Drawing and Network Visualization 2015, Lecture Notes in Computer Science 9411. LNCS 9411. Berlin: Springer Verlag, 2015, p. 75-86. ISBN 978-3-319-27260-3. Available from: https://dx.doi.org/10.1007/978-3-319-27261-0_7.

FOREJT, Vojtěch and Jan KRČÁL. On Frequency LTL in Probabilistic Systems. Online. In CONCUR 2015. Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015, p. 184-197. ISBN 978-3-939897-91-0. Available from: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2015.184.

HLINĚNÝ, Petr and Gelasio SALAZAR. On Hardness of the Joint Crossing Number. In Khaled Elbassioni, Kazuhisa Makino. International Symposium on Algorithms and Computation (ISAAC 2015), Lecture Notes in Computer Science 9472. LNCS 9472. Berlin: Springer Verlag, 2015, p. 603-613. ISBN 978-3-662-48970-3. Available from: https://dx.doi.org/10.1007/978-3-662-48971-0_51.

BLAHOUDEK, František, Alexandre DURET-LUTZ, Vojtěch RUJBR and Jan STREJČEK. On Refinement of Büchi Automata for Explicit Model Checking. In Fischer, Bernd and Geldenhuys, Jaco. 2015 International SPIN Symposium on Model Checking of Software. Heidelberg, New York, Dordrecht, London: Springer International Publishing, 2015, p. 66-83. ISBN 978-3-319-23403-8. Available from: https://dx.doi.org/10.1007/978-3-319-23404-5_6.

BUTKOVA, Yuliya, Hassan HATEFI, Holger HERMANNS and Jan KRČÁL. Optimal Continuous Time Markov Decisions. Online. In ATVA 2015. Shanghai, China: Springer, 2015, p. 166-182. ISBN 978-3-319-24952-0. Available from: https://dx.doi.org/10.1007/978-3-319-24953-7_12.

BRÁZDIL, Tomáš, Ľuboš KORENČIAK, Jan KRČÁL, Petr NOVOTNÝ and Vojtěch ŘEHÁK. Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis. In Javier Campos, Boudewijn R. Haverkort. Quantitative Evaluation of Systems. BERLIN: SPRINGER-VERLAG BERLIN, 2015, p. 141-159. ISBN 978-3-319-22263-9. Available from: https://dx.doi.org/10.1007/978-3-319-22264-6_10.

KŘETÍNSKÝ, Jan, Kim Guldstrand LARSEN, Simon LAURSEN and Jiří SRBA. Polynomial Time Decidability of Weighted Synchronization under Partial Observability. Online. In 26th International Conference on Concurrency Theory (CONCUR 2015). Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2015, p. 142-154. ISBN 978-3-939897-91-0. Available from: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2015.142.

KRČÁL, Jan and Pavel KRČÁL. Scalable Analysis of Fault Trees with Dynamic Features. In DSN 2015. Rio de Janeiro, Brazil: IEEE, 2015, p. 89-100. ISBN 978-1-4799-8629-3. Available from: https://dx.doi.org/10.1109/DSN.2015.29.

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. Online. In Proceedings of ACM international conference on Hybrid Systems: Computation and Control. Seattle, Washington, USA: Association for Computing Machinery (ACM), 2015, p. 259-268. ISBN 978-1-4503-3433-4. Available from: https://dx.doi.org/10.1145/2728606.2728608.

BABIAK, Tomáš, František BLAHOUDEK, Alexandre DURET-LUTZ, Joachim KLEIN, Jan KŘETÍNSKÝ, David MÜLLER, David PARKER and Jan STREJČEK. The Hanoi Omega-Automata Format. In Daniel Kroening, Corina Pasareanu. Computer Aided Verification: 27th International Conference, CAV 2015. Cham: Springer, 2015, p. 479-486. ISBN 978-3-319-21689-8. Available from: https://dx.doi.org/10.1007/978-3-319-21690-4_31.

CHATTERJEE, Krishnendu, Zuzana KOMÁRKOVÁ and Jan KŘETÍNSKÝ. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. In Thirtieth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Los Alamitos, California: IEEE, 2015, p. 244-256. ISBN 978-1-4799-8875-4. Available from: https://dx.doi.org/10.1109/LICS.2015.32.

KORENČIAK, Ľuboš, Jan KRČÁL and Vojtěch ŘEHÁK. Dealing with Zero Density Using Piecewise Phase-Type Approximation. In András Horváth, Katinka Wolter. Computer Performance Engineering. Switzerland: Springer International Publishing, 2014, p. 119-134. ISBN 978-3-319-10884-1. Available from: https://dx.doi.org/10.1007/978-3-319-10885-8_9.

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.

BLAHOUDEK, František, Alexandre DURET-LUTZ, Mojmír KŘETÍNSKÝ and Jan STREJČEK. Is there a best Büchi automaton for explicit model checking? In Neha Rungta and Oksana Tkachuk. 2014 International SPIN Symposium on Model Checking of Software. New York: ACM, 2014, p. 68-76. ISBN 978-1-4503-2452-6. Available from: https://dx.doi.org/10.1145/2632362.2632377.

BRÁZDIL, Tomáš, David KLAŠKA, Antonín KUČERA and Petr NOVOTNÝ. Minimizing Running Costs in Consumption Systems. In Armin Biere, Roderick Bloem. Computer Aided Verification. Neuveden: Springer International Publishing, 2014, p. 457-472. ISBN 978-3-319-08866-2. Available from: https://dx.doi.org/10.1007/978-3-319-08867-9_30.

ABAFFY, Michal, Tomáš BRÁZDIL, Vojtěch ŘEHÁK, Branislav BOŠANSKÝ, Antonín KUČERA and Jan KRČÁL. Solving adversarial patrolling games with bounded error: (extended abstract). In Alessio Lomuscio, Paul Scerri, Ana Bazzan, and Michael Huhns. Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'14). Richland, SC, USA: International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2014, p. 1617-1618. ISBN 978-1-4503-2738-1.

SLABÝ, Jiří and Jan STREJČEK. Symbiotic 2: More Precise Slicing (Competition Contribution). In E. Ábrahám and K. Havelund. Tools and Algorithms for the Construction and Analysis of Systems - 20th International Conference, TACAS 2014. Berlin, Heidelberg: Springer, 2014, p. 415-417. ISBN 978-3-642-54861-1. Available from: https://dx.doi.org/10.1007/978-3-642-54862-8_34.

TRTÍK, Marek and Jan STREJČEK. Symbolic Memory with Pointers. In Franck Cassez and Jean-Francois Raskin. Automated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014. Berlin Heidelberg: Springer, 2014, p. 380-395. ISBN 978-3-319-11935-9. Available from: https://dx.doi.org/10.1007/978-3-319-11936-6_27.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Martin CHMELÍK, Vojtěch FOREJT, Jan KŘETÍNSKÝ, Marta KWIATKOWSKA, David PARKER and Mateusz UJMA. Verification of Markov Decision Processes using Learning Algorithms. In Automated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014. Heidelberg Dordrecht London New York: Springer, 2014, p. 98-114. ISBN 978-3-319-11935-9. Available from: https://dx.doi.org/10.1007/978-3-319-11936-6_8.

BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA, Petr NOVOTNÝ and Joost-Pieter KATOEN. Zero-reachability in probabilistic multi-counter automata. Online. In Thomas Henzinger and Dale Miller. Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). New York: ACM, 2014, p. nestránkováno, 10 pp. ISBN 978-1-4503-2886-9. Available from: https://dx.doi.org/10.1145/2603088.2603161.

SLABÝ, Jiří, Jan STREJČEK and Marek TRTÍK. ClabureDB: Classified Bug-Reports Database Tool for Developers of Program Analysis Tools. In Roberto Giacobazzi, Josh Berdine, Isabella Mastroeni. Verification, Model Checking, and Abstract Interpretation: 14th International Conference, VMCAI 2013. Berlin, Heidelberg: Springer, 2013, p. 268-274. ISBN 978-3-642-35872-2. Available from: https://dx.doi.org/10.1007/978-3-642-35873-9_17.

SLABÝ, Jiří, Jan STREJČEK and Marek TRTÍK. Compact Symbolic Execution. In Hung Dang-Van and Mizuhito Ogawa. 11th International Symposium on Automated Technology for Verification and Analysis, ATVA 2013. Berlin Heidelberg: Springer, 2013, p. 193-207. ISBN 978-3-319-02443-1. Available from: https://dx.doi.org/10.1007/978-3-319-02444-8_15.

BLAHOUDEK, František, Mojmír KŘETÍNSKÝ and Jan STREJČEK. Comparison of LTL to Deterministic Rabin Automata Translators. In Kenneth L. McMillan, Aart Middeldorp, and Andrei Voronkov. Logic for Programming Artificial Intelligence and Reasoning, LPAR-19. Berlin Heidelberg: Springer, 2013, p. 164-172. ISBN 978-3-642-45220-8. Available from: https://dx.doi.org/10.1007/978-3-642-45221-5_12.

BABIAK, Tomáš, Thomas BADIE, Alexandre DURET-LUTZ, Mojmír KŘETÍNSKÝ and Jan STREJČEK. Compositional Approach to Suspension and Other Improvements to LTL Translation. In Ezio Bartocci, C. R. Ramakrishnan. Model Checking Software - 20th International Symposium, SPIN 2013. LNCS 7976. Berlin Heidelberg: Springer, 2013, p. 81-98. ISBN 978-3-642-39175-0. Available from: https://dx.doi.org/10.1007/978-3-642-39176-7_6.

HERMANNS, Holger, Jan KRČÁL and Jan KŘETÍNSKÝ. Compositional Verification and Optimization of Interactive Markov Chains. In CONCUR 2013 - Concurrency Theory - 24th International Conference. Heidelberg Dordrecht London New York: Springer, 2013, p. 364-379. ISBN 978-3-642-40183-1. Available from: https://dx.doi.org/10.1007/978-3-642-40184-8_26.

CHMELÍK, Martin and Vojtěch ŘEHÁK. Controllable-choice Message Sequence Graphs. In Proceedings of Mathematical and Engineering Methods in Computer Science, 8th Doctoral Workshop (MEMICS 2012), Selected Papers. Berlin Heidelberg: Springer, 2013, p. 118-130. ISBN 978-3-642-36044-2. Available from: https://dx.doi.org/10.1007/978-3-642-36046-6_12.

BRÁZDIL, Tomáš, Antonín KUČERA and Petr NOVOTNÝ. Determinacy in Stochastic Games with Unbounded Payoff Functions. Online. In Mathematical and Engineering Methods in Computer Science (MEMICS 2012). Heidelberg: Springer, 2013, p. 94-105. ISBN 978-3-642-36044-2. Available from: https://dx.doi.org/10.1007/978-3-642-36046-6_10.

BLAHOUDEK, František, Tomáš BABIAK, Mojmír KŘETÍNSKÝ and Jan STREJČEK. Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment. In Hung Dang-Van and Mizuhito Ogawa. 11th International Symposium on Automated Technology for Verification and Analysis, ATVA 2013. Berlin Heidelberg: Springer, 2013, p. 24-38. ISBN 978-3-319-02443-1. Available from: https://dx.doi.org/10.1007/978-3-319-02444-8_4.

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.

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.

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.

BRÁZDIL, Tomáš, Ľuboš KORENČIAK, Jan KRČÁL, Jan KŘETÍNSKÝ and Vojtěch ŘEHÁK. On time-average limits in deterministic and stochastic Petri nets. In ACM/SPEC International Conference on Performance Engineering, ICPE'13. New York: ACM, 2013, p. 421-422. ISBN 978-1-4503-1636-1. Available from: https://dx.doi.org/10.1145/2479871.2479936.

HLINĚNÝ, Petr and Martin DERKA. Planar Emulators Conjecture Is Nearly True for Cubic Graphs. In J. Nešetřil, M. Pellegrini. The Seventh European Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013. Pisa, Italy: Scuola Normale Superiore Pisa, 2013, p. 245-250. ISBN 978-88-7642-474-8.

BRÁZDIL, Tomáš, Taolue CHEN, Vojtěch FOREJT, Petr NOVOTNÝ and Aistis SIMAITIS. Solvency Markov Decision Processes with Interest. Online. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Dagstuhl, Germany: IBFI Schloss Dagstuhl, 2013, p. 487-499. ISBN 978-3-939897-64-4. Available from: https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2013.487.

SLABÝ, Jiří, Jan STREJČEK and Marek TRTÍK. Symbiotic: Synergy of Instrumentation, Slicing, and Symbolic Execution - (Competition Contribution). In Nir Piterman, Scott A. Smolka. Tools and Algorithms for the Construction and Analysis of Systems - 19th International Conference, TACAS 2013. Berlin, Heidelberg: Springer, 2013, p. 630-632. ISBN 978-3-642-36741-0. Available from: https://dx.doi.org/10.1007/978-3-642-36742-7_50.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Vojtěch FOREJT and Antonín KUČERA. Trading Performance for Stability in Markov Decision Processes. In Proceedings of 28th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2013). London: IEEE Computer Society, 2013, p. 331-340. ISBN 978-1-4799-0413-6. Available from: https://dx.doi.org/10.1109/LICS.2013.39.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Antonín KUČERA and Petr NOVOTNÝ. Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. In Computer Aided Verification - 24th International Conference, CAV 2012. Berlin: Springer, 2012, p. 23-38. ISBN 978-3-642-31423-0. Available from: https://dx.doi.org/10.1007/978-3-642-31424-7_8.

GAJARSKÝ, Jakub and Petr HLINĚNÝ. Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences. Online. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). 2012th ed. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2012, p. 112-123. ISBN 978-3-939897-47-7. Available from: https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2012.112.

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.

BRÁZDIL, Tomáš, Antonín KUČERA, Petr NOVOTNÝ and Dominik WOJTCZAK. Minimizing Expected Termination Time in One-Counter Markov Decision Processes. In Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012). Berlin: Springer, 2012, p. 141-152. ISBN 978-3-642-31584-8. Available from: https://dx.doi.org/10.1007/978-3-642-31585-5_16.

BRÁZDIL, Tomáš and Stefan KIEFER. Stabilization of Branching Queueing Networks. In Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science. Paris, France: IBFI Schloss Dagstuhl, 2012, p. 507-518. ISBN 978-3-939897-35-4.

BRÁZDIL, Tomáš, Holger HERMANNS, Jan KRČÁL, Jan KŘETÍNSKÝ and Vojtěch ŘEHÁK. Verification of Open Interactive Markov Chains. In Deepak D'Souza and Telikepalli Kavitha and Jaikumar Radhakrishnan. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2012, p. 474-485. ISBN 978-3-939897-47-7. Available from: https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2012.474.

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.