Výpis publikací

EFFENBERGER, Tomáš a Radek PELÁNEK. Code Quality Defects Across Introductory Programming Topics. Online. In Larry Merkle, Maureen Doyle. Proceedings of the 53rd ACM Technical Symposium on Computer Science Education V. 1. New York, NY, USA: Association for Computing Machinery, 2022, s. 941-947. ISBN 978-1-4503-9070-5. Dostupné z: https://dx.doi.org/10.1145/3478431.3499415.

CHREN, Stanislav, Martin MACÁK, Bruno ROSSI a Barbora BÜHNOVÁ. Evaluating Code Improvements in Software Quality Course Projects. Online. In Proceedings of The 25th International Conference on Evaluation and Assessment in Software Engineering. New York, NY, USA: Association for Computing Machinery (ACM), 2022, s. 160-169. ISBN 978-1-4503-9613-4. Dostupné z: https://dx.doi.org/10.1145/3530019.3530036.

ŠVÁBENSKÝ, Valdemar, Richard WEISS, Jack COOK, Jan VYKOPAL, Pavel ČELEDA, Jens MACHE, Radoslav CHUDOVSKÝ a Ankur CHATTOPADHYAY. Evaluating Two Approaches to Assessing Student Progress in Cybersecurity Exercises. Online. In Proceedings of the 53rd ACM Technical Symposium on Computer Science Education (SIGCSE '22). New York, NY, USA: ACM, 2022, s. 787-793. ISBN 978-1-4503-9070-5. Dostupné z: https://dx.doi.org/10.1145/3478431.3499414.

KONIARIK, Jan, Daniel DLHOPOLČEK a Martin UKROP. Experience with Abrupt Transition to Remote Teaching of Embedded Systems. Online. In Proceedings of the 2022 ACM Conference on Innovation and Technology in Computer Science Education (ITiCSE ’22). Dublin, Ireland: ACM, 2022, s. 386-392. ISBN 978-1-4503-9201-3. Dostupné z: https://dx.doi.org/10.1145/3502718.3524821.

KLAŠKA, David, Antonín KUČERA, Vít MUSIL a 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, s. 4642-4648. ISBN 978-1-956792-00-3. Dostupné z: https://dx.doi.org/10.24963/ijcai.2022/644.

BEKOS, Michael A., Giordano DA LOZZO, Petr HLINĚNÝ a 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, s. "23:1"-"23:15", 15 s. ISBN 978-3-95977-258-7. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.ISAAC.2022.23.

BRIAŃSKI, Marcin, Martin KOUTECKÝ, Daniel KRÁĽ, Kristýna PEKÁRKOVÁ a Felix SCHRÖDER. Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming. Online. In Proceedings of the 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, s. "29:1"-"29:20", 20 s. ISBN 978-3-95977-235-8. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.ICALP.2022.29.

WIESNER, David, Julian SUK, Sven DUMMER, David SVOBODA a Jelmer WOLTERINK. Implicit Neural Representations for Generative Modeling of Living Cell Shapes. Online. In Linwei Wang, Qi Dou, P. Thomas Fletcher, Stefanie Speidel, Shuo Li. International Conference on Medical Image Computing and Computer Assisted Intervention. Switzerland: Springer Nature Switzerland, 2022, s. 58-67. ISBN 978-3-031-16439-2. Dostupné z: https://dx.doi.org/10.1007/978-3-031-16440-8_6.

REGAL, Georg, Jakob Carl UHL, Anna GERHARDUS, Stefan SUETTE, Elisabeth FRANKUS, Julia SCHMID, Simone KRIGLSTEIN a Manfred TSCHELIGI. Marcus or Mira - Investigating the Perception of Virtual Agent Gender in Virtual Reality Role Play-Training. In 28th ACM Symposium on Virtual Reality Software and Technology (VRST '22). USA: ACM, 2022, s. 1-11. ISBN 978-1-4503-9889-3. Dostupné z: https://dx.doi.org/10.1145/3562939.3565629.

BRÁZDIL, Tomáš, David KLAŠKA, Antonín KUČERA, Vít MUSIL, Petr NOVOTNÝ a 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, s. 244-254. ISBN 978-1-7138-6329-8.

HAMM, Thekla a 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, s. "46:1"-"46:15", 15 s. ISBN 978-3-95977-227-3. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.SoCG.2022.46.

VYKOPAL, Jan, Valdemar ŠVÁBENSKÝ, Pavel ŠEDA a Pavel ČELEDA. Preventing Cheating in Hands-on Lab Assignments. Online. In Proceedings of the 53rd ACM Technical Symposium on Computer Science Education (SIGCSE '22). New York, NY, USA: ACM, 2022, s. 78-84. ISBN 978-1-4503-9070-5. Dostupné z: https://dx.doi.org/10.1145/3478431.3499420.

MACÁK, Martin, Radek OŠLEJŠEK a Barbora BÜHNOVÁ. Process Mining Analysis of Puzzle-Based Cybersecurity Training. Online. In Proceedings of the 27th ACM Conference on on Innovation and Technology in Computer Science Education Vol. 1 (ITiCSE '22). New York, NY, USA: Association for Computing Machinery, 2022, s. 449-455. ISBN 978-1-4503-9201-3. Dostupné z: https://dx.doi.org/10.1145/3502718.3524819.

JANČÁR, Ján, Marcel FOURNÉ, Daniel DE ALMEIDA BRAGA, Mohamed SABT, Peter SCHWABE, Gilles BARTHE, Pierre-Alain FOUQUE a Yasemin ACAR. “They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks. Online. In 43rd IEEE Symposium on Security and Privacy. San Francisco: IEEE, 2022, s. 632-649. ISBN 978-1-6654-1316-9. Dostupné z: https://dx.doi.org/10.1109/SP46214.2022.9833713.

BALABÁN, Jakub, Petr HLINĚNÝ a 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, s. 43-55. ISBN 978-3-031-15913-8. Dostupné z: https://dx.doi.org/10.1007/978-3-031-15914-5_4.

GANIAN, Robert, Filip POKRÝVKA, André SCHIDLER, Kirill SIMONOV a Stefan SZEIDER. Weighted Model Counting with Twin-Width. Online. In Meel, Kuldeep S. and Strichman, Ofer. 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik, 2022, s. "15:1"-"15:17", 17 s. ISBN 978-3-95977-242-6. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.SAT.2022.15.

SEDLÁČEK, Vladimír, Jesús-Javier CHI-DOMINGUEZ, Ján JANČÁR a Billy Bob BRUMLEY. A formula for disaster: a unified approach to elliptic curve special-point-based attacks. Online. In Tibouchi M., Wang H. Advances in Cryptology – ASIACRYPT 2021. Cham: Springer, 2021, s. 130-159. ISBN 978-3-030-92061-6. Dostupné z: https://dx.doi.org/10.1007/978-3-030-92062-3_5.

ČECHÁK, Jaroslav a Radek PELÁNEK. Better Model, Worse Predictions: The Dangers in Student Model Comparisons. In Roll, Ido and McNamara, Danielle and Sosnovsky, Sergey and Luckin, Rose and Dimitrova, Vania. International Conference on Artificial Intelligence in Education. Cham: Springer, 2021, s. 500-511. ISBN 978-3-030-78291-7. Dostupné z: https://dx.doi.org/10.1007/978-3-030-78292-4_40.

PAULUS, Anselm, Michal ROLÍNEK, Vít MUSIL, Brandon AMOS a Georg MARTIUS. CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints. Online. In Meila, M; Zhang, T. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139. 139. vyd. SAN DIEGO: JMLR-JOURNAL MACHINE LEARNING RESEARCH, 2021, s. 8443-8453. ISBN 978-1-7138-4506-5.

BOK, Jan, Jiří FIALA, Petr HLINĚNÝ, Nikola JEDLIČKOVÁ a 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, s. "21:1"-"21:15", 15 s. ISBN 978-3-95977-201-3. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2021.21.

BENEŠ, Nikola, Luboš BRIM, Samuel PASTVA a David ŠAFRÁNEK. Computing Bottom SCCs Symbolically Using Transition Guided Reduction. Online. In Alexandra Silva, K. Rustan, M. Leino. Computer Aided Verification - 33rd International Conference, CAV 2021. Neuveden: Springer Nature, 2021, s. 505-528. ISBN 978-3-030-81684-1. Dostupné z: https://dx.doi.org/10.1007/978-3-030-81685-8_24.

BENDÍK, Jaroslav a Kuldeep S. MEEL. Counting Maximal Satisfiable Subsets. Online. In 35th AAAI Conference on Artificial Intelligence (AAAI-21). Palo Alto: AAAI, 2021, s. 3651-3660. ISBN 978-1-57735-866-4.

BENDÍK, Jaroslav a Kuldeep S. MEEL. Counting Minimal Unsatisfiable Subsets. In Alexandra Silva, K. Rustan M. Leino. Computer Aided Verification - 33rd International Conference. Cham: Springer, 2021, s. 313-336. ISBN 978-3-030-81687-2. Dostupné z: https://dx.doi.org/10.1007/978-3-030-81688-9_15.

AJDARÓW, Michal a Antonín KUČERA. Deciding Polynomial Termination Complexity for VASS Programs. Online. In Haddad, Serge and Varacca, Daniele. 32nd International Conference on Concurrency Theory (CONCUR 2021). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik, 2021, s. "30:1"-"30:15", 15 s. ISBN 978-3-95977-203-7. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2021.30.

SÍČ, Juraj a Jan STREJČEK. DQBDD: An Efficient BDD-Based DQBF Solver. Online. In Chu-Min Li and Felip Manyà. Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings. Cham (Switzerland): Springer, 2021, s. 535-544. ISBN 978-3-030-80222-6. Dostupné z: https://dx.doi.org/10.1007/978-3-030-80223-3_36.

CHALUPA, Marek, David KLAŠKA, Jan STREJČEK a Lukáš TOMOVIČ. Fast Computation of Strong Control Dependencies. In Alexandra Silva, K. Rustan M. Leino. Computer Aided Verification - 33rd International Conference, CAV 2021, Virtual Event, July 20-23, 2021, Proceedings, Part II. Cham (Švýcarsko): Springer, Cham, 2021, s. 887-910. ISBN 978-3-030-81687-2. Dostupné z: https://dx.doi.org/10.1007/978-3-030-81688-9_41.

BLUMENSATH, Achim a Jakub LÉDL. ω-Forest Algebras and Temporal Logics. Online. In Filippo Bonchi, Simon J. Puglisi. 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, s. 1-21. ISBN 978-3-95977-201-3. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2021.19.

BLAHOUDEK, František, Murat CUBUKTEPE, Petr NOVOTNÝ, Melkior ORNIK, Pranay THANGEDA a Ufuk TOPCU. Fuel in Markov Decision Processes (FiMDP): A Practical Approach to Consumption. Online. In 24th International Symposium on Formal Methods, FM 2021. Cham, Switzerland: Springer, 2021, s. 640-656. ISBN 978-3-030-90869-0. Dostupné z: https://dx.doi.org/10.1007/978-3-030-90870-6_34.

RIESE, Emma, Madeleine LORÅS, Martin UKROP a Tomáš EFFENBERGER. Challenges Faced by Teaching Assistants in Computer Science Education Across Europe. Online. In Proceedings of the 2021 ACM Conference on Innovation and Technology in Computer Science Education (ITiCSE ’21). Paderborn, Germany: ACM, 2021, s. 547-553. ISBN 978-1-4503-8214-4. Dostupné z: https://dx.doi.org/10.1145/3430665.3456304.

EFFENBERGER, Tomáš a Radek PELÁNEK. Interpretable Clustering of Students’ Solutions in Introductory Programming. Online. In Roll I., McNamara D., Sosnovsky S., Luckin R., Dimitrova V. Artificial Intelligence in Education. AIED 2021. Lecture Notes in Computer Science, vol 12748. Cham: Springer, 2021, s. 101-112. ISBN 978-3-030-78291-7. Dostupné z: https://dx.doi.org/10.1007/978-3-030-78292-4_9.

HERMOSILLA CASAJÚS, Pedro, Marco SCHÄFER, Matěj LANG, Gloria FACKELMANN, Pere-Pau VÁZQUEZ ALCOCER, Barbora KOZLÍKOVÁ, Michael KRONE, Tobias RITSCHEL a Timo ROPINSKI. Intrinsic-Extrinsic Convolution and Pooling for Learning on 3D Protein Structures. In International Conference on Learning Representations (ICLR). 2021.

CHATTERJEE, Krishnendu, Ehsan Kafshdar GOHARSHADY, Petr NOVOTNÝ, Jiří ZÁREVÚCKY a Djordje ŽIKELIĆ. On Lexicographic Proof Rules for Probabilistic Termination. Online. In 24th International Symposium on Formal Methods, FM 2021. Cham, Switzerland: Springer, 2021, s. 619-639. ISBN 978-3-030-90869-0. Dostupné z: https://dx.doi.org/10.1007/978-3-030-90870-6_33.

CHATTERJEE, Krishnendu, Ehsan Kafshdar GOHARSHADY, Petr NOVOTNÝ a Djordje ŽIKELIĆ. Proving non-termination by program reversal. Online. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). New York, NY, USA: ACM, 2021, s. 1033-1048. ISBN 978-1-4503-8391-2. Dostupné z: https://dx.doi.org/10.1145/3453483.3454093.

MRÁZEK, Jan, Martin JONÁŠ a Jiří BARNAT. Reconfiguring Metamorphic Robots via SMT: Is It a Viable Way?. Online. In 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). Prague: IEEE, 2021, s. 6935-6940. ISBN 978-1-6654-1714-3. Dostupné z: https://dx.doi.org/10.1109/IROS51168.2021.9636534.

KLAŠKA, David, Antonín KUČERA, Vojtěch ŘEHÁK a 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, s. 471-481. ISSN 2640-3498.

BENEŠ, Nikola, Luboš BRIM, Samuel PASTVA a David ŠAFRÁNEK. Symbolic Coloured SCC Decomposition. Online. In Jan Friso Groote, Kim Larsen. Tools and Algorithms for the Construction and Analysis of Systems, 27th International Conference, TACAS 2021. Neuveden: Springer Nature, 2021, s. 64-83. ISBN 978-3-030-72012-4. Dostupné z: https://dx.doi.org/10.1007/978-3-030-72013-1_4.

BENDÍK, Jaroslav, Ahmet SENCAN, Ebru Aydin GOL a Ivana ČERNÁ. Timed Automata Relaxation for Reachability. In Friso Groote and Kim Guldstrand Larsen. 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'21). Part I vol. 12651. Heidelberg: Springer, 2021, s. 291-310. ISBN 978-3-030-72015-5. Dostupné z: https://dx.doi.org/10.1007/978-3-030-72016-2_16.

EFFENBERGER, Tomáš a Radek PELÁNEK. Validity and Reliability of Student Models for Problem-Solving Activities. Online. In Proceedings of the 11th International Conference on Learning Analytics and Knowledge. New York, NY, USA: Association for Computing Machinery, 2021, s. 1-11. ISBN 978-1-4503-8935-8. Dostupné z: https://dx.doi.org/10.1145/3448139.3448140.

WALLNER, Günter, Marnix van WIJLAND, Regina BERNHAUPT a Simone KRIGLSTEIN. What Players Want: Information Needs of Players on Post-Game Visualizations. Online. In CHI Conference on Human Factors in Computing Systems (CHI '21). New York: Association for Computing Machinery, 2021, s. 1-13. ISBN 978-1-4503-8096-6. Dostupné z: https://dx.doi.org/10.1145/3411764.3445174.

KLAŠKA, David, Antonín KUČERA a 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, s. 629-637. ISBN 978-1-4503-7518-4. Dostupné z: https://dx.doi.org/10.5555/3398761.3398837.

BENEŠ, Nikola, Luboš BRIM, Jakub KADLECAJ, Samuel PASTVA a David ŠAFRÁNEK. AEON: Attractor Bifurcation Analysis of Parametrised Boolean Networks. In Shuvendu K. Lahiri and Chao Wang. Computer Aided Verification. CAV 2020. LNCS 12224. Cham: Springer, Cham, 2020, s. 569-581. ISBN 978-3-030-53287-1. Dostupné z: https://dx.doi.org/10.1007/978-3-030-53288-8_28.

BENDÍK, Jaroslav a Kuldeep S. MEEL. Approximate Counting of Minimal Unsatisfiable Subsets. In Shuvendu K. Lahiri and Chao Wang. Computer Aided Verification - 32nd International Conference, CAV 2020. Neuveden: Springer, Cham, 2020, s. 439-462. ISBN 978-3-030-53287-1. Dostupné z: https://dx.doi.org/10.1007/978-3-030-53288-8_21.

VYKOPAL, Jan, Valdemar ŠVÁBENSKÝ a Ee-Chien CHANG. Benefits and Pitfalls of Using Capture The Flag Games in University Courses. Online. In Proceedings of the 51st ACM Technical Symposium on Computer Science Education (SIGCSE '20). New York, NY, USA: ACM, 2020, s. 752-758. ISBN 978-1-4503-6793-6. Dostupné z: https://dx.doi.org/10.1145/3328778.3366893.

JANOVSKÝ, Adam, Matúš NEMEC, Petr ŠVENDA, Peter SEKAN a Václav MATYÁŠ. Biased RSA private keys: Origin attribution of GCD-factorable keys. In Liqun Chen and Ninghui Li and Kaitai Liang and Steve Schneider. Computer Security – ESORICS 2020. Cham, Switzerland: Springer, 2020, s. 505-524. ISBN 978-3-030-59012-3. Dostupné z: https://dx.doi.org/10.1007/978-3-030-59013-0_25.

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

CHALUPA, Marek. DG: Analysis and Slicing of LLVM Bitcode. In Dang Van Hung and Oleg Sokolsky. The 18ᵗʰ International Symposium on Automated Technology for Verification and Analysis. Hanoi, Vietnam: Springer, 2020, s. 557-563. ISBN 978-3-030-59151-9. Dostupné z: https://dx.doi.org/10.1007/978-3-030-59152-6_33.

KUČERA, Antonín, Jérôme LEROUX a Dominik VELAN. Efficient Analysis of VASS Termination Complexity. Online. In Holger Hermanns, Lijun Zhang, Naoki Kobayashi, Dale Miller. LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science. New York, USA: ACM, 2020, s. 676-688. ISBN 978-1-4503-7104-9. Dostupné z: https://dx.doi.org/10.1145/3373718.3394751.

SEDLÁČEK, Vladimír, Ján JANČÁR a Petr ŠVENDA. Fooling primality tests on smartcards. In Liqun Chen, Ninghui Li, Kaitai Liang and Steve Schneider. 25th European Symposium on Research in Computer Security (ESORICS) 2020. Švýcarsko: Springer, 2020, s. 209-229. ISBN 978-3-030-59012-3. Dostupné z: https://dx.doi.org/10.1007/978-3-030-59013-0_11.

BLONDIN, Michael, Javier ESPARZA, Martin HELFRICH, Antonín KUČERA a Philipp MEYER. Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. In Shuvendu K. Lahiri, Chao Wang. Computer Aided Verification, CAV 2020. Cham, Německo: Springer International Publishing, 2020, s. 372-397. ISBN 978-3-030-53290-1. Dostupné z: https://dx.doi.org/10.1007/978-3-030-53291-8_20.

EFFENBERGER, Tomáš a Radek PELÁNEK. Impact of Methodological Choices on the Evaluation of Student Models. Online. In Bittencourt I., Cukurova M., Muldner K., Luckin R., Millán E. Artificial Intelligence in Education. AIED 2020. Lecture Notes in Computer Science, vol 12163. Cham: Springer, 2020, s. 153-164. ISBN 978-3-030-52236-0. Dostupné z: https://dx.doi.org/10.1007/978-3-030-52237-7_13.

DĘBSKI, Michał Karol, Stefan FELSNER, Piotr MICEK a Felix SCHRÖDER. Improved bounds for centered colorings. Online. In Shuchi Chawla. Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms. Not specified: SIAM, 2020, s. 2212-2226. ISBN 978-1-61197-599-4. Dostupné z: https://dx.doi.org/10.1137/1.9781611975994.136.

AGAOGLU, Deniz a 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, s. "4:1"-"4:14", 14 s. ISBN 978-3-95977-159-7. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2020.4.

ČELEDA, Pavel, Jan VYKOPAL, Valdemar ŠVÁBENSKÝ a Karel SLAVÍČEK. KYPO4INDUSTRY: A Testbed for Teaching Cybersecurity of Industrial Control Systems. Online. In Proceedings of the 51st ACM Technical Symposium on Computer Science Education (SIGCSE '20). New York, NY, USA: ACM, 2020, s. 1026-1032. ISBN 978-1-4503-6793-6. Dostupné z: https://dx.doi.org/10.1145/3328778.3366908.

CHAN, Timothy Fong Nam, Jacob COOPER, Martin KOUTECKÝ, Daniel KRÁĽ a Kristýna PEKÁRKOVÁ. Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming. Online. In Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), p. "26:1"-"26:19", 19 pp. 2020. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2020, s. "26:1"-"26:19", 19 s. ISBN 978-3-95977-138-2. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.ICALP.2020.26.

JANČÁR, Ján, Vladimír SEDLÁČEK, Petr ŠVENDA a Marek SÝS. Minerva: The curse of ECDSA nonces. Online. In Amir Moradi, Mehdi Tibouchi. IACR Transactions on Cryptographic Hardware and Embedded Systems. Německo: Ruhr-University of Bochum, 2020, s. 281-308. ISSN 2569-2925. Dostupné z: https://dx.doi.org/10.13154/tches.v2020.i4.281-308.

SEDMIDUBSKÝ, Jan, Petra BUDÍKOVÁ, Vlastislav DOHNAL a Pavel ZEZULA. Motion Words: A Text-like Representation of 3D Skeleton Sequences. Online. In 42nd European Conference on Information Retrieval (ECIR). Cham: Springer, 2020, s. 527-541. ISBN 978-3-030-45438-8. Dostupné z: https://dx.doi.org/10.1007/978-3-030-45439-5_35.

CHATTERJEE, Krishnendu, Martin CHMELÍK, Deep KARKHANIS, Petr NOVOTNÝ a Amélie ROYER. Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications. Online. In Proceedings of the International Conference on Automated Planning and Scheduling. Palo Alto: AAAI Press, 2020, s. 48-56. ISBN 978-1-57735-824-4.

BENDÍK, Jaroslav a Ivana ČERNÁ. MUST: Minimal Unsatisfiable Subsets Enumeration Tool. In Armin Biere and David Parker. Tools and Algorithms for the Construction and Analysis of Systems. Neuveden: Springer International Publishing, 2020, s. 135-152. ISBN 978-3-030-45189-9. Dostupné z: https://dx.doi.org/10.1007/978-3-030-45190-5_8.

BLAHOUDEK, František, Tomáš BRÁZDIL, Petr NOVOTNÝ, Melkior ORNIK, Pranay THANGEDA a Ufuk TOPCU. Qualitative Controller Synthesis for Consumption Markov Decision Processes. In Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part {II}. Cham: Springer, 2020, s. 421-447. ISBN 978-3-030-53290-1. Dostupné z: https://dx.doi.org/10.1007/978-3-030-53291-8_22.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Petr NOVOTNÝ a Jiří VAHALA. Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes. Online. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020. Palo Alto, California, USA: AAAI Press, 2020, s. 9794-9801. ISBN 978-1-57735-823-7. Dostupné z: https://dx.doi.org/10.1609/aaai.v34i06.6531.

BENDÍK, Jaroslav a Ivana ČERNÁ. Replication-Guided Enumeration of Minimal Unsatisfiable Subsets. In Helmut Simonis. 26th International Conference on Principles and Practice of Constraint Programming. Neuveden: Springer, Cham, 2020, s. 37-54. ISBN 978-3-030-58474-0. Dostupné z: https://dx.doi.org/10.1007/978-3-030-58475-7_3.

BENDÍK, Jaroslav a Ivana ČERNÁ. Rotation Based MSS/MCS Enumeration. Online. In Elvira Albert and Laura Kovacs. LPAR 2020: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Neuveden: EPiC Series in Computing, 2020, s. 120-137. ISSN 2398-7340. Dostupné z: https://dx.doi.org/10.29007/8btb.

BLAHOUDEK, František, Alexandre DURET-LUTZ a 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, s. 15-27. ISBN 978-3-030-53290-1. Dostupné z: https://dx.doi.org/10.1007/978-3-030-53291-8_2.

JONÁŠ, Martin a 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, s. 378-393. ISBN 978-3-030-51824-0. Dostupné z: https://dx.doi.org/10.1007/978-3-030-51825-7_27.

ŠVÁBENSKÝ, Valdemar, Jan VYKOPAL a Pavel ČELEDA. What Are Cybersecurity Education Papers About? A Systematic Literature Review of SIGCSE and ITiCSE Conferences. Online. In Proceedings of the 51st ACM Technical Symposium on Computer Science Education (SIGCSE '20). New York, NY, USA: ACM, 2020, s. 2-8. ISBN 978-1-4503-6793-6. Dostupné z: https://dx.doi.org/10.1145/3328778.3366816.

NIFORATOS, Evangelos, Adam PALMA, Roman GLUSZNY, Athanasios VOURVOPOULOS a Fotios LIAROKAPIS. Would You Do It?: Enacting Moral Dilemmas in Virtual Reality for Understanding Ethical Decision-Making. Online. In Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems. New York, NY, USA: ACM, 2020, s. 1-12. ISBN 978-1-4503-6708-0. Dostupné z: https://dx.doi.org/10.1145/3313831.3376788.

GANIAN, Robert, Sebastian ORDYNIAK a Stefan SZEIDER. A Join-Based Hybrid Parameter for Constraint Satisfaction. Online. In Thomas Schiex and Simon de Givry. Principles and Practice of Constraint Programming - 25th International Conference. USA: Springer, 2019, s. 195-212. ISBN 978-3-030-30047-0. Dostupné z: https://dx.doi.org/10.1007/978-3-030-30048-7_12.

ENEVOLDSEN, Soeren, Kim G. LARSEN a Jiří SRBA. Abstract Dependency Graphs and Their Application to Model Checking. In Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'19). The Netherlands: Springer, 2019, s. 316-333. ISBN 978-3-030-17461-3. Dostupné z: https://dx.doi.org/10.1007/978-3-030-17462-0_18.

DANG, Vinh Quang, Hana RUDOVÁ a Cong Thanh NGUYEN. Adaptive Large Neighborhood Search for Scheduling of Mobile Robots. Online. In The Genetic and Evolutionary Computation Conference (GECCO). New York, NY, USA: ACM, 2019, s. 224-232. ISBN 978-1-4503-6111-8. Dostupné z: https://dx.doi.org/10.1145/3321707.3321764.

BOKAL, Drago, Zdeněk DVOŘÁK, Petr HLINĚNÝ, Jesus LEANOS, Bojan MOHAR a 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, s. "14:1"-"14:15", 15 s. ISBN 978-3-95977-104-7. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.SoCG.2019.14.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Antonín KUČERA, Petr NOVOTNÝ a Dominik VELAN. Deciding Fast Termination for Probabilistic VASS with Nondeterminism. In Yu-Fang Chen, Chih-Hong Cheng, Javier Esparza. Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Proceedings. Cham: Springer, 2019, s. 462-478. ISBN 978-3-030-31783-6. Dostupné z: https://dx.doi.org/10.1007/978-3-030-31784-3_27.

BENEŠ, Nikola, Luboš BRIM, Samuel PASTVA a David ŠAFRÁNEK. Digital Bifurcation Analysis of TCP Dynamics. In Tomáš Vojnar and Lijun Zhang. Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2019. LNCS, volume 11428. Cham: Springer International Publishing, 2019, s. 339-356. ISBN 978-3-030-17464-4. Dostupné z: https://dx.doi.org/10.1007/978-3-030-17465-1_19.

HLINĚNÝ, Petr a 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, s. 307-319. ISBN 978-3-030-35801-3. Dostupné z: https://dx.doi.org/10.1007/978-3-030-35802-0_24.

ŠKOLA, Filip a Fotis LIAROKAPIS. Examining And Enhancing The Illusory Touch Perception In Virtual Reality Using Non-Invasive Brain Stimulation. Online. In Proceedings of the 2019 CHI Conference on Human Factors in Computing Systems, Paper No. 247. Glasgow, Scotland Uk: ACM Press, 2019, s. 1-12. ISBN 978-1-4503-5970-2. Dostupné z: https://dx.doi.org/10.1145/3290605.3300477.

BAIER, Christel, František BLAHOUDEK, Alexandre DURET-LUTZ, Joachim KLEIN, David MÜLLER a 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, s. 445-461. ISBN 978-3-030-31783-6. Dostupné z: https://dx.doi.org/10.1007/978-3-030-31784-3_26.

GANIAN, Robert, Sebastian ORDYNIAK a C. S. RAHUL. Group Activity Selection with Few Agent Types. Online. In Michael A. Bender and Ola Svensson and Grzegorz Herman. 27th Annual European Symposium on Algorithms (ESA 2019). Nemecko: Dagstuhl, 2019, s. 1-16. ISBN 978-3-95977-124-5. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.ESA.2019.48.

CHREN, Stanislav, Bruno ROSSI, Barbora BÜHNOVÁ, Mouzhi GE a Tomáš PITNER. Industrial Involvement In Information System Education: Lessons Learned from a Software Quality Course. Online. In Proceedings of 28th International Conference on Information Systems Development. Toulon, France: AIS, 2019, s. 1-12. ISBN 978-2-9571876-0-7.

EIBEN, Eduard, Robert GANIAN, Dusan KNOP, Sebastian ORDYNIAK, Michal PILIPCZUK a Marcin WROCHNA. Integer Programming and Incidence Treedepth. Online. In Andrea Lodi and Viswanath Nagarajan. Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019. USA: Springer, 2019, s. 194-204. ISBN 978-3-030-17952-6. Dostupné z: https://dx.doi.org/10.1007/978-3-030-17953-3_15.

ČECHÁK, Jaroslav a Radek PELÁNEK. Item Ordering Biases in Educational Data. Online. In Seiji Isotani, Eva Millán, Amy Ogan, Peter Hastings, Bruce McLaren, Rose Luckin. International Conference on Artificial Intelligence in Education. Cham: Springer, 2019, s. 48-58. ISBN 978-3-030-23203-0. Dostupné z: https://dx.doi.org/10.1007/978-3-030-23204-7_5.

MAJOR, Juraj, František BLAHOUDEK, Jan STREJČEK, Miriama JÁNOŠOVÁ a 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, s. 357-365. ISBN 978-3-030-31783-6. Dostupné z: https://dx.doi.org/10.1007/978-3-030-31784-3_21.

EIBEN, Eduard, Robert GANIAN, Thekla HAMM a O-joung KWON. Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. Online. In Peter Rossmanith and Pinar Heggernes and Joost-Pieter Katoen. 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Nemecko: Dagstuhl, 2019, s. 1-15. ISBN 978-3-95977-117-7. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2019.42.

CHREN, Stanislav, Barbora BÜHNOVÁ, Martin MACÁK, Lukáš DAUBNER a Bruno ROSSI. Mistakes in UML Diagrams: Analysis of Student Projects in a Software Engineering Course. Online. In Sarah Beecham, Daniela Damian. Proceedings of the 41st International Conference on Software Engineering: Software Engineering Education and Training. Piscataway, NJ, USA: IEEE Press, 2019, s. 100-109. ISBN 978-1-7281-1000-4. Dostupné z: https://dx.doi.org/10.1109/ICSE-SEET.2019.00019.

KŘETÍNSKÝ, Jan a Tobias MEGGENDORFER. Of Cores: A Partial-Exploration Framework for Markov Decision Processes. Online. In 30th International Conference on Concurrency Theory (CONCUR 2019). Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019, s. 1-17. ISBN 978-3-95977-121-4. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2019.5.

FORSTER, Henry, Robert GANIAN, Fabian KLUTE a Martin NOLLENBURG. On Strict (Outer-)Confluent Graphs. Online. In Daniel Archambault, Csaba D. Toth. Graph Drawing and Network Visualization - 27th International Symposium, GD 2019. USA: Springer, 2019, s. 147-161. ISBN 978-3-030-35801-3. Dostupné z: https://dx.doi.org/10.1007/978-3-030-35802-0_12.

BALAJI, Nikhil, Stefan KIEFER, Petr NOVOTNÝ, Guillermo A. PÉREZ a Mahsa SHIRMOHAMMADI. On the Complexity of Value Iteration. Online. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, Stefano Leonardi. Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019, s. "102:1"-"102:15", 15 s. ISBN 978-3-95977-109-2. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.ICALP.2019.102.

ASHOK, Pranav, Jan KŘETÍNSKÝ a Maximilian WEININGER. PAC Statistical Model Checking for Markov Decision Processes and Stochastic Games. In Computer Aided Verification (CAV 2019). Cham: Springer, 2019, s. 497-519. ISBN 978-3-030-25539-8. Dostupné z: https://dx.doi.org/10.1007/978-3-030-25540-4_29.

BHORE, Sujoy, Robert GANIAN, Fabrizio MONTECCHIANI a Martin NOLLENBURG. Parameterized Algorithms for Book Embedding Problems. Online. In Daniel Archambault, Csaba D. Toth. Graph Drawing and Network Visualization - 27th International Symposium, GD 2019. USA: Springer, 2019, s. 365-378. ISBN 978-3-030-35801-3. Dostupné z: https://dx.doi.org/10.1007/978-3-030-35802-0_28.

BOENNELAND, Frederik M., Peter G. JENSEN, Kim G. LARSEN, Marco MUNIZ a Jiří SRBA. Partial Order Reduction for Reachability Games. Online. In Proceedings of the 30th International Conference on Concurrency Theory (CONCUR'19). Gernmany: Dagstuhl Publishing, 2019, s. 1-15. ISBN 978-3-95977-121-4. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2019.23.

CALZAVARA, Stefano, Riccardo FOCARDI, Matúš NEMEC, Alvise RABITTI a Marco SQUARCINA. Postcards from the Post-HTTP World: Amplification of HTTPS Vulnerabilities in the Web Ecosystem. Online. In Proceedings of the 40th IEEE Symposium on Security and Privacy. San Fransisco, CA, US: IEEE, 2019, s. 281-298. ISBN 978-1-5386-6660-9. Dostupné z: https://dx.doi.org/10.1109/SP.2019.00053.

JIRSÍK, Tomáš, Štěpán TRČKA a Pavel ČELEDA. Quality of Service Forecasting with LSTM Neural Network. Online. In 2019 IFIP/IEEE Symposium on Integrated Network and Service Management (IM). Washington DC, USA: IEEE, 2019, s. 251-260. ISBN 978-1-72810-618-2.

JONÁŠ, Martin a 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, s. 64-73. ISBN 978-3-030-25542-8. Dostupné z: https://dx.doi.org/10.1007/978-3-030-25543-5_4.

ČERMÁK, Milan, Martin LAŠTOVIČKA a Tomáš JIRSÍK. Real-time Pattern Detection in IP Flow Data using Apache Spark. Online. In 2019 IFIP/IEEE Symposium on Integrated Network and Service Management (IM). Washington DC, USA: IEEE, 2019, s. 521-526. ISBN 978-1-7281-0618-2.

UKROP, Martin, Valdemar ŠVÁBENSKÝ a Jan NEHYBA. Reflective Diary for Professional Development of Novice Teachers. Online. In Proceedings of the 50th ACM Technical Symposium on Computer Science Education (SIGCSE’19). Minneapolis, Minnesota, USA: ACM, 2019, s. 1088-1094. ISBN 978-1-4503-5890-3. Dostupné z: https://dx.doi.org/10.1145/3287324.3287448.

MRÁZEK, Jan a Jiří BARNAT. RoFICoM - First Open-Hardware Connector for Metamorphic Robots. In 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). Neuveden: IEEE, 2019, s. 2720-2725. ISBN 978-1-72814-004-9. Dostupné z: https://dx.doi.org/10.1109/IROS40897.2019.8968167.

GANIAN, Robert, Neha LODHA, Sebastian ORDYNIAK a Stefan SZEIDER. SAT-Encodings for Treecut Width and Treedepth. Online. In Stephen G. Kobourov and Henning Meyerhenke. ALENEX 2019. USA: SIAM, 2019, s. 117-129. ISBN 978-1-61197-549-9. Dostupné z: https://dx.doi.org/10.1137/1.9781611975499.10.

MURÍN, Stanislav a Hana RUDOVÁ. Scheduling of Mobile Robots Using Constraint Programming. In Thomas Schiex, Simon de Givry. Principles and Practice of Constraint Programming. Switzerland: Springer International Publishing, 2019, s. 456-471. ISBN 978-3-030-30047-0. Dostupné z: https://dx.doi.org/10.1007/978-3-030-30048-7_27.

DAŇA, Josef, Ivan KOPEČEK, Radek OŠLEJŠEK a Jaromír PLHÁK. Simulating the Impact of Cooperation and Management Strategies on Stress and Economic Performance. Online. In Tung Bui. Proceedings of the 52nd Hawaii International Conference on System Sciences. USA: University of Hawaii at Manoa, 2019, s. 6569-6578. ISBN 978-0-9981331-2-6. Dostupné z: https://dx.doi.org/10.24251/HICSS.2019.787.

EIBEN, Eduard, Robert GANIAN, Dusan KNOP a Sebastian ORDYNIAK. Solving Integer Quadratic Programming via Explicit and Structural Restrictions. Online. In Peter Stone. Proceedings of the AAAI Conference on Artificial Intelligence. USA: AAAI Press, 2019, s. 1477-1484. ISBN 978-1-57735-809-1. Dostupné z: https://dx.doi.org/10.1609/aaai.v33i01.33011477.

CHREN, Stanislav, Radoslav MIČKO, Barbora BÜHNOVÁ a Bruno ROSSI. STRAIT: A Tool for Automated Software Reliability Growth Analysis. Online. In Margaret-Anne Storey. Proceedings of the 16th International Conference on Mining Software Repositories. Piscataway, NJ, USA: ACM, 2019, s. 105-110. ISBN 978-1-7281-3412-3. Dostupné z: https://dx.doi.org/10.1109/MSR.2019.00025.

EIBEN, Eduard, Robert GANIAN, Iyad KANJ a Stefan SZEIDER. The Parameterized Complexity of Cascading Portfolio Scheduling. Online. In Hanna M. Wallach and Hugo Larochelle and Alina Beygelzimer and Florence d'Alche-Buc and Emily B. Fox and Roman Garnett. Advances in Neural Information Processing Systems 32 (NIPS 2019). USA: Neural Information Processing Systems Foundation, Inc., 2019, s. 7666-7676. ISBN 978-1-7281-1044-8.

GANIAN, Robert a Sebastian ORDYNIAK. The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. Online. In Ignasi Sau and Dimitrios M. Thilikos. WG 2019: Graph-Theoretic Concepts in Computer Science. USA: Springer, 2019, s. 190-204. ISBN 978-3-030-30785-1. Dostupné z: https://dx.doi.org/10.1007/978-3-030-30786-8_15.

ALECHINA, Natasha, Tomáš BRÁZDIL, Giuseppe DE GIACOMO, Paolo FELLI, Brian LOGAN a Moshe VARDI. Unbounded Orchestrations of Transducers for Manufacturing. In Proceedings of the AAAI Conference on Artificial Intelligence. Palo Alto: AAAI, 2019, s. 2646-2653. ISBN 978-1-57735-809-1. Dostupné z: https://dx.doi.org/10.1609/aaai.v33i01.33012646.

UKROP, Martin, Lydia KRAUS, Václav MATYÁŠ a Heider Ahmad Mutleq WAHSHEH. Will You Trust This TLS Certificate? Perceptions of People Working in IT. Online. In Proceedings of the 35rd Annual Computer Security Applications Conference. New York, NY, USA: Association for Computing Machinery, 2019, s. 718-731. ISBN 978-1-4503-7628-0. Dostupné z: https://dx.doi.org/10.1145/3359789.3359800.

EIBEN, Eduard, Robert GANIAN a Sebastian ORDYNIAK. A Structural Approach to Activity Selection. Online. In Jerome Lang. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI). USA: ijcai.org, 2018, s. 203-209. ISBN 978-0-9992411-2-7. Dostupné z: https://dx.doi.org/10.24963/ijcai.2018/28.

KLAŠKA, David, Antonín KUČERA, Tomáš LAMSER a 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, s. 659-666. ISBN 978-1-5108-6808-3. Dostupné z: https://dx.doi.org/10.5555/3237383.3237481.

BLUMENSATH, Achim a Felix WOLF. Bisimulation Invariant Monadic-Second Order Logic in the Finite. Online. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic. Dagstuhl: Schloss Dagstuhl, 2018, s. 1-13. ISBN 978-3-95977-076-7. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.ICALP.2018.117.

PELÁNEK, Radek. Conceptual Issues in Mastery Criteria: Differentiating Uncertainty and Degrees of Knowledge. Online. In Carolyn Penstein Rosé, Roberto Martínez Maldonado, Heinz Ulrich Hoppe, Rose Luckin, Manolis Mavrikis, Kaska Porayska-Pomsta, Bruce M. McLaren, Benedict du Boulay. Artificial Intelligence in Education. New York: Springer, 2018, s. 450-461. ISBN 978-3-319-93842-4. Dostupné z: https://dx.doi.org/10.1007/978-3-319-93843-1_33.

KŘETÍNSKÝ, Jan a Tobias MEGGENDORFER. Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes. Online. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS '18). New York, NY, USA: ACM, 2018, s. 609-618. ISBN 978-1-4503-5583-4. Dostupné z: https://dx.doi.org/10.1145/3209108.3209176.

ASHOK, Pranav, Yuliya BUTKOVA, Holger HERMANNS a Jan KŘETÍNSKÝ. Continuous-Time Markov Decisions Based on Partial Exploration. In Automated Technology for Verification and Analysis. ATVA 2018. Cham: Springer, 2018, s. 317-334. ISBN 978-3-030-01089-8. Dostupné z: https://dx.doi.org/10.1007/978-3-030-01090-4_19.

CHALUPA, Marek, Krishnendu CHATTERJEE, Andreas PAVLOGIANNIS, Nishant SINHA a Kapil VAIDYA. Data-centric Dynamic Partial Order Reduction. In Proceedings of Symposium on Principles of Programming Languages 2018. New York: ACM, 2018, s. 1-30. ISSN 2475-1421. Dostupné z: https://dx.doi.org/10.1145/3158119.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Antonín KUČERA, Petr NOVOTNÝ, Dominik VELAN a Florian ZULEGER. Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. In Anuj Dawar, Erich Gradel. 2018 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Oxford, England: ACM, 2018, s. 185-194. ISBN 978-1-4503-5583-4. Dostupné z: https://dx.doi.org/10.1145/3209108.3209191.

ŠVÁBENSKÝ, Valdemar, Jan VYKOPAL, Milan ČERMÁK a Martin LAŠTOVIČKA. Enhancing Cybersecurity Skills by Creating Serious Games. Online. In Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education (ITiCSE'18). Larnaca, Cyprus: ACM, 2018, s. 194-199. ISBN 978-1-4503-5707-4. Dostupné z: https://dx.doi.org/10.1145/3197091.3197123.

BENDÍK, Jaroslav a Ivana ČERNÁ. Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets. Online. In Gilles Barthe and Geoff Sutcliffe and Margus Veanes. LPAR-22, 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Awassa, Etiopie: EPiC Series in Computing, 2018, s. 131-142. ISSN 2398-7340. Dostupné z: https://dx.doi.org/10.29007/sxzb.

MRÁZEK, Vojtěch, Marek SÝS, Zdenek VASICEK, Lukáš SEKANINA a Václav MATYÁŠ. Evolving boolean functions for fast and efficient randomness testing. In Proceedings of the Genetic and Evolutionary Computation Conference 2018. USA: Association for Computing Machinery, 2018, s. 1302-1309. ISBN 978-1-4503-5618-3. Dostupné z: https://dx.doi.org/10.1145/3205455.3205518.

REINKE, Annika, Matthias EISENMANN, Sinan ONOGUR, Marko STANKOVIC, Patrick SCHOLZ, Peter M FULL, Hrvoje BOGUNOVIC, Bennett A LANDMAN, Oskar MAIER, Bjoern MENZE, Gregory C SHARP, Korsuk SIRINUKUNWATTANA, Stefanie SPEIDEL, Fons VAN DER SOMMEN, Guoyan ZHENG, Henning MÜLLER, Michal KOZUBEK, Tal ARBEL, Andrew P BRADLEY, Pierre JANNIN, Annette KOPP-SCHNEIDER a Lena MAIER-HEIN. How to Exploit Weaknesses in Biomedical Challenge Design and Organization. In Alejandro F. Frangi, Julia A. Schnabel, Christos Davatzikos, Carlos Alberola-López, Gabor Fichtinger. Medical Image Computing and Computer Assisted Intervention – MICCAI 2018. LNCS 11073. Cham (Switzerland): Springer, 2018, s. 388-395. ISBN 978-3-030-00936-6. Dostupné z: https://dx.doi.org/10.1007/978-3-030-00937-3_45.

ŠVÁBENSKÝ, Valdemar a Jan VYKOPAL. Challenges Arising from Prerequisite Testing in Cybersecurity Games. Online. In Proceedings of the 49th ACM Technical Symposium on Computer Science Education (SIGCSE’18). Baltimore, Maryland, USA: ACM, 2018, s. 56-61. ISBN 978-1-4503-5103-4. Dostupné z: https://dx.doi.org/10.1145/3159450.3159454.

NOVOTNÝ, Vít. Implementation Notes for the Soft Cosine Measure. Online. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management (CIKM '18). Torino, Italy: Association for Computing Machinery, 2018, s. 1639-1642. ISBN 978-1-4503-6014-2. Dostupné z: https://dx.doi.org/10.1145/3269206.3269317.

JONÁŠ, Martin a 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, s. 488-497. ISSN 2398-7340. Dostupné z: https://dx.doi.org/10.29007/spnx.

KŘETÍNSKÝ, Jan, Guillermo PEREZ a Jean-Francois RASKIN. Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints. Online. In 29th International Conference on Concurrency Theory (CONCUR 2018). Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, s. 1-18. ISBN 978-3-95977-087-3. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2018.8.

GANIAN, Robert, Fabian KLUTE a Sebastian ORDYNIAK. On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. Online. In Rolf Niedermeier, Brigitte Vallee. STACS 2018. Nemecko: Dagstuhl, 2018, s. 1-14. ISBN 978-3-95977-062-0. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2018.33.

GANIAN, Robert, Iyad KANJ, Sebastian ORDYNIAK a Stefan SZEIDER. Parameterized Algorithms for the Matrix Completion Problem. Online. In Jennifer G. Dy, Andreas Krause. Proceedings of the 35th International Conference on Machine Learning (ICML). USA: PMLR, 2018, s. 1642-1651. ISBN 978-1-5108-6796-3.

SCHMID, Stefan a Jiří SRBA. Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks. Online. In IEEE International Conference on Computer Communications (INFOCOM'18). USA: IEEE, 2018, s. 1799-1807. ISBN 978-1-5386-4128-6. Dostupné z: https://dx.doi.org/10.1109/INFOCOM.2018.8486261.

JENSEN, Jesper S., Troels B. KROEGH, Jonas S. MADSEN, Stefan SCHMID, Jiří SRBA a Marc T. THORGERSEN. P-Rex: Fast Verification of MPLS Networks with Multiple Link Failures. In Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies (CoNEXT'18). USA: ACM, 2018, s. 217-227. ISBN 978-1-4503-6080-7. Dostupné z: https://dx.doi.org/10.1145/3281411.3281432.

BENDÍK, Jaroslav, Ivana ČERNÁ a Nikola BENEŠ. Recursive Online Enumeration of All Minimal Unsatisfiable Subsets. In Shuvendu Lahiri and Chao Wang. Automated Technology for Verification and Analysis - 16th International Symposium, {ATVA} 2018, Los Angeles, CA, USA, October 7-10, 2018, Proceedings}. Los Angeles: Springer, 2018, s. 143-159. ISBN 978-3-030-01089-8. Dostupné z: https://dx.doi.org/10.1007/978-3-030-01090-4_9.

DUPONT DUPUIS, Frédéric, Serge FEHR, Philippe LAMONTAGNE a Louis SALVAIL. Secure Certification of Mixed Quantum States with Application to Two-Party Randomness Generation. In 16th International Theory of Cryptography Conference (TCC 2018). Cham: Springer, 2018, s. 282-314. ISBN 978-3-030-03809-0. Dostupné z: https://dx.doi.org/10.1007/978-3-030-03810-6_11.

EIBEN, Eduard, Robert GANIAN a Sebastian ORDYNIAK. Small Resolution Proofs for QBF using Dependency Treewidth. Online. In Rolf Niedermeier, Brigitte Vallee. STACS 2018. Nemecko: Dagstuhl, 2018, s. 1-15. ISBN 978-3-95977-062-0. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2018.28.

BRÁZDIL, Tomáš, Antonín KUČERA a 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, s. 121-127. ISBN 978-0-9992411-2-7. Dostupné z: https://dx.doi.org/10.24963/ijcai.2018/17.

BOENNELAND, Frederik M., Peter G. JENSEN, Kim G. LARSEN, Marco MUNIZ a Jiří SRBA. Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems. In Proceedings of the 30th International Conference on Computer Aided Verification (CAV'18). Netherlands: Springer, 2018, s. 527-546. ISBN 978-3-319-96144-6. Dostupné z: https://dx.doi.org/10.1007/978-3-319-96145-3_28.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Jan KŘETÍNSKÝ a Viktor TOMAN. Strategy Representation by Decision Trees in Reactive Synthesis. In 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2018). Cham: Springer, 2018, s. 385-407. ISBN 978-3-319-89959-6. Dostupné z: https://dx.doi.org/10.1007/978-3-319-89960-2_21.

DVOŘÁK, Zdeněk, Petr HLINĚNÝ a 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, s. "33:1"-"33:14", 14 s. ISBN 978-3-95977-066-8. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.SoCG.2018.33.

KIM, Doowon, Bum Jun KWON, Kristián KOZÁK, Christopher GATES a Tudor DUMITRAȘ. The Broken Shield: Measuring Revocation Effectiveness in the Windows Code-Signing PKI. Online. In 27th USENIX Security Symposium (USENIX Security 18). Baltimore, MD: USENIX Association, 2018, s. 851-868. ISBN 978-1-931971-46-1.

VYKOPAL, Jan, Radek OŠLEJŠEK, Karolína BURSKÁ a Kristína ZÁKOPČANOVÁ. Timely Feedback in Unstructured Cybersecurity Exercises. Online. In Proceedings of Special Interest Group on Computer Science Education, Baltimore, Maryland, USA, February 21–24, 2018(SIGCSE’18). New York, NY, USA: ACM, 2018, s. 173-178. ISBN 978-1-4503-5103-4. Dostupné z: https://dx.doi.org/10.1145/3159450.3159561.

EIBEN, Eduard, Robert GANIAN, Dusan KNOP a Sebastian ORDYNIAK. Unary Integer Linear Programming with Structural Restrictions. Online. In Jerome Lang. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. USA: ijcai.org, 2018, s. 1284-1290. ISBN 978-0-9992411-2-7. Dostupné z: https://dx.doi.org/10.24963/ijcai.2018/179.

KELMENDI, Edon, Julia KRÄMER, Jan KŘETÍNSKÝ a Maximilian WEININGER. Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm. In Computer Aided Verification (CAV 2018). Cham: Springer, 2018, s. 623-642. ISBN 978-3-319-96144-6. Dostupné z: https://dx.doi.org/10.1007/978-3-319-96145-3_36.

MAVROUDIS, Vasilios, Andrea CERULLI, Petr ŠVENDA, Daniel CVRČEK, Dušan KLINEC a George DANEZIS. A Touch of Evil: High-Assurance Cryptographic Hardware from Untrusted Components. Online. In ACM. CCS '17: Proceedings of the 24th ACM SIGSAC Conference on Computer and Communications Security. Dallas, TX, USA: ACM, 2017, s. 1583-1600. ISBN 978-1-4503-4946-8. Dostupné z: https://dx.doi.org/10.1145/3133956.3133961.

GANIAN, Robert, M.S. RAMANUJAN a Stefan SZEIDER. Backdoor Treewidth for SAT. Online. In Serge Gaspers and Toby Walsh. Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings. 10491. vyd. Nemecko: Springer, 2017, s. 20-37. ISBN 978-3-319-66262-6. Dostupné z: https://dx.doi.org/10.1007/978-3-319-66263-3_2.

HUSÁK, Martin, Milan ČERMÁK, Martin LAŠTOVIČKA a Jan VYKOPAL. Exchanging Security Events: Which And How Many Alerts Can We Aggregate?. Online. In Prosper Chemouil, Edmundo Monteiro, Marinos Charalambides, Edmundo Madeira, Paulo Simões, Stefano Secci, Luciano Paschoal Gaspary, Carlos Raniery P. dos Santos. 2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM). Lisbon: IEEE, 2017, s. 604-607. ISBN 978-3-901882-89-0. Dostupné z: https://dx.doi.org/10.23919/INM.2017.7987340.

GANIAN, Robert, M.S. RAMANUJAN a Sebastian ORDYNIAK. Going Beyond Primal Treewidth for {(M)ILP}. Online. In Satinder P. Singh; Shaul Markovitch. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA. USA: AAAI, 2017, s. 815-821. ISBN 978-1-57735-781-0.

PETERLÍK, Igor, Nazim HAOUCHINE, Lukáš RUČKA a Stéphane COTIN. Image-driven Stochastic Identification of Boundary Conditions for Predictive Simulation. Online. In Descoteaux M., Maier-Hein L., Franz A., Jannin P., Collins D., Duchesne S. Medical Image Computing and Computer-Assisted Intervention − MICCAI 2017: 20th International Conference, Quebec City, QC, Canada, September 11-13, 2017, Proceedings, Part II. Cham: Springer, 2017, s. 548-556. ISBN 978-3-319-66184-1. Dostupné z: https://dx.doi.org/10.1007/978-3-319-66185-8_62.

NEMEC, Matúš, Dušan KLINEC, Petr ŠVENDA, Peter SEKAN a Václav MATYÁŠ. Measuring Popularity of Cryptographic Libraries in Internet-Wide Scans. Online. In Proceedings of the 33rd Annual Computer Security Applications Conference. New York, NY, USA: ACM, 2017, s. 162-175. ISBN 978-1-4503-5345-8. Dostupné z: https://dx.doi.org/10.1145/3134600.3134612.

BARANOVÁ, Zuzana, Jiří BARNAT, Katarína KEJSTOVÁ, Tadeáš KUČERA, Henrich LAUKO, Jan MRÁZEK, Petr ROČKAI a Vladimír ŠTILL. Model Checking of C and C++ with DIVINE 4. In Deepak D'Souza, K. Narayan Kumar. Automated Technology for Verification and Analysis. Cham: Springer International Publishing, 2017, s. 201-207. ISBN 978-3-319-68166-5. Dostupné z: https://dx.doi.org/10.1007/978-3-319-68167-2_14.

MEDKOVÁ, Jana, Martin HUSÁK a Martin DRAŠAR. Network Defence Strategy Evaluation: Simulation vs. Live Network. Online. In Prosper Chemouil, Edmundo Monteiro, Marinos Charalambides, Edmundo Madeira, Paulo Simões, Stefano Secci, Luciano Paschoal Gaspary, Carlos Raniery P. dos Santos. 2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM). Lisbon: IEEE, 2017, s. 81-88. ISBN 978-3-901882-89-0. Dostupné z: https://dx.doi.org/10.23919/INM.2017.7987267.

GANIAN, Robert a Stefan SZEIDER. New Width Parameters for Model Counting. Online. In Serge Gaspers and Toby Walsh. Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings. Nemecko: Springer, 2017, s. 38-52. ISBN 978-3-319-66262-6. Dostupné z: https://dx.doi.org/10.1007/978-3-319-66263-3_3.

JONÁŠ, Martin a 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, s. 364-379. ISBN 978-3-319-66262-6. Dostupné z: https://dx.doi.org/10.1007/978-3-319-66263-3_23.

GANIAN, Robert, Sebastian ORDYNIAK a M.S. RAMANUJAN. On Structural Parameterizations of the Edge Disjoint Paths Problem. Online. In Yoshio Okamoto; Takeshi Tokuyama. 28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand. 92. vyd. Nemecko: LIPIcs, 2017, s. 1-13. ISBN 978-3-95977-054-5. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.ISAAC.2017.36.

GAJARSKÝ, Jakub, Petr HLINĚNÝ, Martin KOUTECKÝ a 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, s. 224-236. ISBN 978-3-319-62388-7. Dostupné z: https://dx.doi.org/10.1007/978-3-319-62389-4_19.

ALDEGHERI, Stefano, Jiří BARNAT, Nicola BOMBIERI, Federico BUSATO a Milan ČEŠKA. Parametric multi-step scheme for GPU-accelerated graph decomposition into strongly connected components. In 22nd International Conference on Parallel and Distributed Computing, Euro-Par 2016. Cham: Springer Verlag, 2017, s. 519-531. ISBN 978-3-319-58942-8. Dostupné z: https://dx.doi.org/10.1007/978-3-319-58943-5_42.

BENEŠ, Nikola, Luboš BRIM, Martin DEMKO, Samuel PASTVA a David ŠAFRÁNEK. Pithya: A Parallel Tool for Parameter Synthesis of Piecewise Multi-Affine Dynamical Systems. In Rupak Majumdar and Viktor Kunčak. Computer Aided Verification. CAV 2017. LNCS 10426. Cham: Springer International Publishing, 2017, s. 591-598. ISBN 978-3-319-63386-2. Dostupné z: https://dx.doi.org/10.1007/978-3-319-63387-9_29.

GEŠVINDR, David, Barbora BÜHNOVÁ a Ondřej GASIOR. Quality Evaluation of PaaS Cloud Application Design Using Generated Prototypes. Online. In 2017 IEEE International Conference on Software Architecture (ICSA). Neuveden: IEEE, 2017, s. 31-40. ISBN 978-1-5090-5729-0. Dostupné z: https://dx.doi.org/10.1109/ICSA.2017.43.

BLAHOUDEK, František, Alexandre DURET-LUTZ, Mikuláš KLOKOČKA, Mojmír KŘETÍNSKÝ a Jan STREJČEK. Seminator: A Tool for Semi-Determinization of Omega-Automata. Online. In Thomas Eiter and David Sands. Proceedings of the 21th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2017). Neuveden: EasyChair, 2017, s. 356-367. ISSN 2398-7340. Dostupné z: https://dx.doi.org/10.29007/k5nl.

DVORAK, Pavel, Eduard EIBEN, Robert GANIAN, Dusan KNOP a Sebastian ORDYNIAK. Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. Online. In Carles Sierra. Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August 19-25, 2017. USA: ijcai.org, 2017, s. 607-613. ISBN 978-0-9992411-0-3. Dostupné z: https://dx.doi.org/10.24963/ijcai.2017/85.

BAIER, Christel, Clemens DUBSLAFF, Ľuboš KORENČIAK, Antonín KUČERA a 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, s. 417-434. ISBN 978-3-319-68166-5. Dostupné z: https://dx.doi.org/10.1007/978-3-319-68167-2_27.

NEMEC, Matúš, Marek SÝS, Petr ŠVENDA, Dušan KLINEC a Václav MATYÁŠ. The Return of Coppersmith's Attack: Practical Factorization of Widely Used RSA Moduli. Online. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. New York, NY, USA: ACM, 2017, s. 1631-1648. ISBN 978-1-4503-4946-8. Dostupné z: https://dx.doi.org/10.1145/3133956.3133969.

EIBEN, Eduard, Sebastian ORDYNIAK, M.S. RAMANUJAN, Benjamin BERGOUGNOUX a Robert GANIAN. Towards a Polynomial Kernel for Directed Feedback Vertex Set. Online. In Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin. 42nd International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark. 83. vyd. Nemecko: LIPIcs, 2017, s. 1-15. ISBN 978-3-95977-046-0. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2017.36.

BENEŠ, Nikola, Luboš BRIM, Martin DEMKO, Samuel PASTVA a David ŠAFRÁNEK. A Model Checking Approach to Discrete Bifurcation Analysis. In John S. Fitzgerald et al. Formal Methods. FM 2016. LNCS 9995. Neuveden: Springer International Publishing, 2016, s. 85-101. ISBN 978-3-319-48988-9. Dostupné z: https://dx.doi.org/10.1007/978-3-319-48989-6_6.

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

GANIAN, Robert, Eduard EIBEN a O-joung KWON. A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. Online. In Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier. 41st International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland. Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, s. "34:1"-"34:14", 14 s. ISBN 978-3-95977-016-3. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2016.34.

DUPONT DUPUIS, Frédéric, Serge FEHR, Philippe LAMONTAGNE a Louis SALVAIL. Adaptive versus non-adaptive strategies in the quantum setting with applications. Online. In Robshaw, Matthew and Katz, Jonathan. Proceedings of CRYPTO 2016. Santa Barbara, CA: Springer Berlin Heidelberg, 2016, s. 33-59. ISBN 978-3-662-53014-6. Dostupné z: https://dx.doi.org/10.1007/978-3-662-53015-3_2.

GEŠVINDR, David a Barbora BÜHNOVÁ. Architectural Tactics for the Design of Efficient PaaS Cloud Applications. Online. In 2016 13th Working IEEE/IFIP Conference on Software Architecture (WICSA). Neuveden: IEEE, 2016, s. 158-167. ISBN 978-1-5090-2131-4. Dostupné z: https://dx.doi.org/10.1109/WICSA.2016.42.

GANIAN, Robert, M.S. RAMANUJAN a Stefan SZEIDER. Backdoors to Tractable Valued CSP. In Rueher, M. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2016. CHAM: SPRINGER INT PUBLISHING AG, 2016, s. 233-250. ISBN 978-3-319-44952-4. Dostupné z: https://dx.doi.org/10.1007/978-3-319-44953-1_16.

BISGAARD, Morten, David GERHARDT, Holger HERMANNS, Jan KRČÁL, Gilles NIES a Marvin STENGER. Battery-Aware Scheduling in Low Orbit: The GomX–3 Case. Online. In FM 2016: Formal Methods: 21st International Symposium. Berlin: Springer International Publishing., 2016, s. 559-576. ISBN 978-3-319-48988-9. Dostupné z: https://dx.doi.org/10.1007/978-3-319-48989-6_34.

BLAHOUDEK, František, Matthias HEIZMANN, Sven SCHEWE, Jan STREJČEK a 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, s. 770-787. ISBN 978-3-662-49673-2. Dostupné z: https://dx.doi.org/10.1007/978-3-662-49674-9_49.

GANIAN, Robert, Sebastian ORDYNIAK, Eduard EIBEN a Kanga KUSTAA. Counting Linear Extensions: Parameterizations by Treewidth. Online. In Piotr Sankowski and Christos D. Zaroliagis. 24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24, 2016, Aarhus, Denmark. Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, s. 1-18. ISBN 978-3-95977-015-6. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.ESA.2016.39.

DERŇÁR, Marek a 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, s. "42:1"-"42:10", 10 s. ISBN 978-3-95977-009-5. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.SoCG.2016.42.

BRENGUIER, Romain a Vojtěch FOREJT. Decidability Results for Multi-objective Stochastic Games. In Artho C., Legay A., Peled D. International Symposium on Automated Technology for Verification and Analysis. Germany: Springer, 2016, s. 227-243. ISBN 978-3-319-46519-7. Dostupné z: https://dx.doi.org/10.1007/978-3-319-46520-3_15.

VACULÍK, Karel a Lubomír POPELÍNSKÝ. DGRMiner: Anomaly Detection and Explanation in Dynamic Graphs. In Boström, H., Knobbe, A., Soares, C., Papapetrou, P. Advances in Intelligent Data Analysis XV - 15th International Symposium, IDA 2016. Neuveden: LNCS 9897, Springer, 2016, s. 308-319. ISBN 978-3-319-46348-3. Dostupné z: https://dx.doi.org/10.1007/978-3-319-46349-0_27.

HERMANNS, Holger, Jan KRČÁL a Steen VESTER. Distributed synthesis in continuous time. In International Conference on Foundations of Software Science and Computation Structures. Berlin: Springer, 2016, s. 353-369. ISBN 978-3-662-49629-9. Dostupné z: https://dx.doi.org/10.1007/978-3-662-49630-5_21.

KORENČIAK, Ľuboš, Antonín KUČERA a 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, s. 367-372. ISBN 978-1-5090-3431-4. Dostupné z: https://dx.doi.org/10.1109/MASCOTS.2016.34.

DACA, Przemyslaw, Thomas A. HENZINGER, Jan KŘETÍNSKÝ a 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, s. 112-129. ISBN 978-3-662-49673-2. Dostupné z: https://dx.doi.org/10.1007/978-3-662-49674-9_7.

PAPOUŠEK, Jan, Vít STANISLAV a Radek PELÁNEK. Impact of Question Difficulty on Engagement and Learning. Online. In Alessandro Micarelli, John Stamper, Kitty Panourgia. Intelligent Tutoring Systems: 13th International Conference. Zagreb, Croatia: Springer International Publishing, 2016, s. 267-272. ISBN 978-3-319-39582-1. Dostupné z: https://dx.doi.org/10.1007/978-3-319-39583-8_28.

CHIMANI, Markus a 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, s. "30:1"-"30:15", 15 s. ISBN 978-3-95977-009-5. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.SoCG.2016.30.

SICKERT, Salomon, Javier ESPARZA, Stefan JAAX a 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, s. 312-332. ISBN 978-3-319-41539-0. Dostupné z: https://dx.doi.org/10.1007/978-3-319-41540-6_17.

DACA, Przemyslaw, Thomas A. HENZINGER, Jan KŘETÍNSKÝ a 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, s. 1-15. ISBN 978-3-95977-017-0. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2016.20.

SICKERT, Salomon a 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, s. 130-137. ISBN 978-3-319-46519-7. Dostupné z: https://dx.doi.org/10.1007/978-3-319-46520-3_9.

BOYTSOV, Leonid, David NOVÁK, Yury MALKOV a Eric NYBERG. Off the Beaten Path: Let's Replace Term-Based Retrieval with k-NN Search. In CIKM'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT. NEW YORK: ASSOC COMPUTING MACHINERY, 2016, s. 1099-1108. ISBN 978-1-4503-4073-1. Dostupné z: https://dx.doi.org/10.1145/2983323.2983815.

GANIAN, Robert, Ronald DE HAAN, Stefan SZEIDER a Iyad KANJ. On Existential MSO and its Relation to ETH. Online. In Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier. 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26. Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, s. "42:1"-"42:14", 14 s. ISBN 978-3-95977-016-3. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2016.42.

GANIAN, Robert, N. S. NARAYANASWAMY, Sebastian ORDYNIAK, C. S. RAHUL a M. S. RAMANUJAN. On the Complexity Landscape of Connected f-Factor Problems. Online. In Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier. 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26. Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, s. "41:1"-"41:14", 14 s. ISBN 978-3-95977-016-3. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2016.41.

LARSEN, Kim G., Marius MIKUCIONIS, Marco MUNIZ, Jiří SRBA a Jakob H. TAANKVIST. Online and Compositional Learning of Controllers with Application to Floor Heating. In Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'16). Nizozemsko: Springer, 2016, s. 244-259. ISBN 978-3-662-49673-2. Dostupné z: https://dx.doi.org/10.1007/978-3-662-49674-9_14.

BRÁZDIL, Tomáš, Antonín KUČERA a 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, s. 32-49. ISBN 978-3-319-46519-7. Dostupné z: https://dx.doi.org/10.1007/978-3-319-46520-3_3.

BENEŠ, Nikola, Luboš BRIM, Martin DEMKO, Samuel PASTVA a David ŠAFRÁNEK. Parallel SMT-Based Parameter Synthesis with Application to Piecewise Multi-Affine Systems. In Cyrille Artho et al. Automated Technology for Verification and Analysis. ATVA 2016. LNCS 9938. Neuveden: Springer International Publishing, 2016, s. 192-208. ISBN 978-3-319-46519-7. Dostupné z: https://dx.doi.org/10.1007/978-3-319-46520-3_13.

GANIAN, Robert, Martin KALANY, Stefan SZEIDER a Jesper Larsson TRAFF. Polynomial-time Construction of Optimal MPI Derived Datatype Trees. Online. In 2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2016). NEW YORK: IEEE, 2016, s. 638-647. ISBN 978-1-5090-2140-6. Dostupné z: https://dx.doi.org/10.1109/IPDPS.2016.13.

ČEŠKA, Milan, Petr PILAŘ, Nikola PAOLETTI, Luboš BRIM a Marta KWIATKOWSKA. PRISM-PSY: Precise GPU-Accelerated Parameter Synthesis for Stochastic Systems. In Marsha Chechik, Jean-François Raskin. 22nd International Conference, TACAS 2016. LNCS 9636. Berlin: Springer International Publishing, 2016, s. 367-384. ISBN 978-3-662-49673-2. Dostupné z: https://dx.doi.org/10.1007/978-3-662-49674-9_21.

KUČERA, Antonín a Tomáš LAMSER. Regular Strategies and Strategy Improvement: Efficient Tools for Solving Large Patrolling Problems. In Catholijn M. Jonker, Stacy Marsella, John Thangarajah, Karl Tuyls. Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems. New York: ACM, 2016, s. 1171-1179. ISBN 978-1-4503-4239-1.

JONÁŠ, Martin a 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, s. 267-283. ISBN 978-3-319-40969-6. Dostupné z: https://dx.doi.org/10.1007/978-3-319-40970-2_17.

BRÁZDIL, Tomáš, Vojtěch FOREJT, Antonín KUČERA a 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, s. 1-14. ISBN 978-3-95977-017-0. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2016.10.

GANIAN, Robert a Sebastian ORDYNIAK. The Complexity Landscape of Decompositional Parameters for ILP. Online. In Dale Schuurmans, Michael P. Wellman. Proceedings of the Thirtieth {AAAI} Conference on Artificial Intelligence. USA: AAAI Press, 2016, s. 710-716. ISBN 978-1-57735-760-5.

ALFARO, Carlos A., Alan ARROYO, Marek DERŇÁR a Bojan MOHAR. The Crossing Number of the Cone of a Graph. In Yifan Hu and Martin Nollenburg. Graph Drawing and Network Visualization - 24th International Symposium, GD 2016. LNCS 9801. Berlin: Springer Verlag, 2016, s. 427-438. ISBN 978-3-319-50105-5. Dostupné z: https://dx.doi.org/10.1007/978-3-319-50106-2_33.

ŠVENDA, Petr, Matúš NEMEC, Peter SEKAN, Rudolf KVAŠŇOVSKÝ, David FORMÁNEK, David KOMÁREK a Václav MATYÁŠ. The Million-Key Question – Investigating the Origins of RSA Public Keys. Online. In Thorsten Holz, Stefan Savage. Proceedings of 25th USENIX Security Symposium. Austin, Texas: USENIX Association, 2016, s. 893-910. ISBN 978-1-931971-32-4.

ČADEK, Pavel, Jan STREJČEK a 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, s. 512-527. ISBN 978-3-319-46519-7. Dostupné z: https://dx.doi.org/10.1007/978-3-319-46520-3_32.

GANIAN, Robert, Sebastian ORDYNIAK a Eduard EIBEN. Using Decomposition-Parameters for QBF: Mind the Prefix!. Online. In Dale Schuurmans, Michael P. Wellman. Proceedings of the Thirtieth {AAAI} Conference on Artificial Intelligence. USA: AAAI Press, 2016, s. 964-970. ISBN 978-1-57735-760-5.

BALÁŽIA, Michal a Petr SOJKA. Walker-Independent Features for Gait Recognition from Motion Capture Data. In Antonio Robles-Kelly, Marco Loog, Battista Biggio, Francisco Escolano, Richard Wilson. Proceedings of the joint IAPR International Workshops on Structural and Syntactic Pattern Recognition (SSPR 2016) and Statistical Techniques in Pattern Recognition (SPR 2016). LNCS 10029. Switzerland: Springer International Publishing AG, 2016, s. 310-321. ISBN 978-3-319-49054-0. Dostupné z: https://dx.doi.org/10.1007/978-3-319-49055-7_28.

ABATE, Alessandro, Milan ČEŠKA, Luboš BRIM a Marta KWIATKOWSKA. Adaptive Aggregation of Markov Chains: Quantitative Analysis of Chemical Reaction Networks. In 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings. LNCS 9206. Berlin: Springer International Publishing, 2015, s. 195-213. ISBN 978-3-319-21689-8. Dostupné z: https://dx.doi.org/10.1007/978-3-319-21690-4_12.

NEZVALOVÁ, Leona, Lubomír POPELÍNSKÝ, Luis TORGO a Karel VACULÍK. Class-Based Outlier Detection: Staying Zombies or Awaiting for Resurrection?. Online. In Elisa Fromont, Tijl De Bie, Matthijs van Leeuwen. Advances in Intelligent Data Analysis XIV - 14th International Symposium, IDA 2015. Neuveden: Springer, 2015, s. 193-204. ISBN 978-3-319-24464-8. Dostupné z: https://dx.doi.org/10.1007/978-3-319-24465-5_17.

KLIMOŠ, Miroslav a Antonín KUČERA. Cobra: A Tool for Solving General Deductive Games. In Martin Davis, Ansgar Fehnker, Annabelle McIver, Andrei Voronkov. Proceedings of 20th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2015). Heidelberg: Springer, 2015, s. 31-47. ISBN 978-3-662-48898-0. Dostupné z: https://dx.doi.org/10.1007/978-3-662-48899-7_3.

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

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Martin CHMELÍK, Andreas FELLNER a 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, s. 158-177. ISBN 978-3-319-21689-8. Dostupné z: 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 a Saket SAURABH. FO Model Checking on Posets of Bounded Width. Online. In Venkatesan Guruswami. 56th Annual Symposium on Foundations of Computer Science, FOCS 2015. Berkeley, CA, USA: IEEE Computer Society, 2015, s. 963-974. ISBN 978-1-4673-8191-8. Dostupné z: https://dx.doi.org/10.1109/FOCS.2015.63.

ROSECKÝ, Jan, Filip PROCHÁZKA a Barbora BÜHNOVÁ. Grid Mind: Prolog-Based Simulation Environment for Future Energy Grids. Online. In Proceedings of the 31st International Conference on Logic Programming (Technical Communications). Volume 1433. Aachen, Germany: CEUR-WS, 2015, s. 1-14. ISSN 1613-0073.

PAPOUŠEK, Jan a Radek PELÁNEK. Impact of Adaptive Educational System Behaviour on Student Motivation. In Artificial Intelligence in Education. Madrid: Springer International Publishing, 2015, s. 348-357. ISBN 978-3-319-19772-2. Dostupné z: https://dx.doi.org/10.1007/978-3-319-19773-9_35.

BENEŠ, Nikola, Peter BEZDĚK, Kim G. LARSEN a Jiří SRBA. Language Emptiness of Continuous-Time Parametric Timed Automata. In Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann. Automata, Languages, and Programming. Neuveden: Springer Berlin Heidelberg, 2015, s. 69-81. ISBN 978-3-662-47665-9. Dostupné z: https://dx.doi.org/10.1007/978-3-662-47666-6_6.

BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA a 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, s. 44-55. ISBN 978-1-4799-8875-4. Dostupné z: https://dx.doi.org/10.1109/LICS.2015.15.

BRÁZDIL, Tomáš, Chatterjee KRISHNENDU, Vojtěch FOREJT a 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, s. 181-187. ISBN 978-3-662-46680-3. Dostupné z: https://dx.doi.org/10.1007/978-3-662-46681-0_12.

BOKAL, Drago, Mojca BRAČIČ, Marek DERŇÁR a 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, s. 75-86. ISBN 978-3-319-27260-3. Dostupné z: https://dx.doi.org/10.1007/978-3-319-27261-0_7.

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

HLINĚNÝ, Petr a 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, s. 603-613. ISBN 978-3-662-48970-3. Dostupné z: https://dx.doi.org/10.1007/978-3-662-48971-0_51.

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

GAJARSKÝ, Jakub, Sebastian ORDYNIAK, Michael LAMPIS, Valia MITSOU a Kazuhisa MAKINO. Parameterized Algorithms for Parity Games. Online. In Italiano, Giuseppe F. , Pighizzini, Giovanni, Sannella, Donald T. MFCS 2015, LNCS 9235. 9235. vyd. Berlin: Springer, 2015, s. 336-347. ISBN 978-3-662-48053-3. Dostupné z: https://dx.doi.org/10.1007/978-3-662-48054-0_28.

KŘETÍNSKÝ, Jan, Kim Guldstrand LARSEN, Simon LAURSEN a 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, s. 142-154. ISBN 978-3-939897-91-0. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2015.142.

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

BYDŽOVSKÁ, Hana. Student Performance Prediction Using Collaborative Filtering Methods. In Conati, Heffernan, Mitrovic, Verdejo. 17th International Conference on Artificial Inteligence in Education - AIED 2015. Madrid: Springer International Publishing, 2015, s. 550-553. ISBN 978-3-319-19772-2. Dostupné z: https://dx.doi.org/10.1007/978-3-319-19773-9_59.

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

CHATTERJEE, Krishnendu, Zuzana KOMÁRKOVÁ a 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, s. 244-256. ISBN 978-1-4799-8875-4. Dostupné z: https://dx.doi.org/10.1109/LICS.2015.32.

KRONEGGER, Martin, Sebastian ORDYNIAK a Andreas PFANDLER. Variable-Deletion Backdoors to Planning. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. Austin; United States: AI Access Foundation, 2015, s. 3305-3312. ISBN 978-1-57735-703-2.

PLANTEFÈVE, Rosalie, Igor PETERLÍK, Hadrien COURTECUISSE, Raffaella TRIVISONNE, Jean-Pierre RADOUX a Stéphane COTIN. Atlas-based Transfer of Boundary Conditions for Biomechanical Simulation. In MICCAI - 17th International Conference on Medical Image Computing and Computer Assisted Intervention. Neuveden: Springer International Publishing, 2014, s. 33-40. ISBN 978-3-319-10469-0. Dostupné z: https://dx.doi.org/10.1007/978-3-319-10470-6_5.

GASPERS, Serge, Sebastian ORDYNIAK, Stefan SZEIDER, Neelhara MISRA a Stanislav ZIVNY. Backdoors into Heterogeneous Classes of SAT and CSP. In Carla E. Brodley and Peter Stone. AAAI Press. Quebec: AAAI Press, 2014, s. 2652-2658. ISBN 978-1-57735-680-6.

KRONEGGER, Martin, Sebastian ORDYNIAK a Andreas PFANDLER. Backdoors to Planning. In Carla E. Brodley and Peter Stone. AAAI Press. Quebec: AAAI Press, 2014, s. 2300-2307. ISBN 978-1-57735-679-0.

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

ESPARZA, Javier a Jan KŘETÍNSKÝ. From LTL to Deterministic Automata: A Safraless Compositional Approach. In Computer Aided Verification - 26th International Conference, CAV 2014. Heidelberg Dordrecht London New York: Springer, 2014, s. 192-208. ISBN 978-3-319-08866-2. Dostupné z: https://dx.doi.org/10.1007/978-3-319-08867-9_13.

TROUBIL, Pavel, Hana RUDOVÁ a Petr HOLUB. Media Streams Planning with Uncertain Link Capacities. Online. In IEEE 13th International Symposium on Network Computing and Applications NCA 2014. USA: IEEE, 2014, s. 197-204. ISBN 978-1-4799-5393-6. Dostupné z: https://dx.doi.org/10.1109/NCA.2014.37.

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

KLUSÁČEK, Dalibor a Šimon TÓTH. On Interactions Among Scheduling Policies: Finding Efficient Queue Setup Using High-Resolution Simulations. In Fernando Silva, Inês Dutra and Vítor Santos Costa. Euro-Par 2014. 1. vyd. Neuveden: Springer, 2014, s. 138-149. ISBN 978-3-319-09872-2. Dostupné z: https://dx.doi.org/10.1007/978-3-319-09873-9_12.

DRAEGER, Klaus, Vojtěch FOREJT, Marta KWIATKOWSKA, David PARKER a Mateusz UJMA. Permissive Controller Synthesis for Probabilistic Systems. In Erika Ábrahám, Klaus Havelund. Tools and Algorithms for the Construction and Analysis of Systems. Berlin: Springer Berlin Heidelberg, 2014, s. 531-546. ISBN 978-3-642-54861-1. Dostupné z: https://dx.doi.org/10.1007/978-3-642-54862-8_44.

FOREJT, Vojtěch, Daniel KROENING, Ganesh NARAYANASWAMY a Subodh SHARMA. Precise Predictive Analysis for Discovering Communication Deadlocks in MPI Programs. In Cliff Jones, Pekka Pihlajasaari, Jun Sun. FM 2014: Formal Methods. Switzerland: Springer, 2014, s. 263-278. ISBN 978-3-319-06409-3. Dostupné z: https://dx.doi.org/10.1007/978-3-319-06410-9_19.

HERMANNS, Holger, Jan KRČÁL a Jan KŘETÍNSKÝ. Probabilistic Bisimulation: Naturally on Distributions. In CONCUR 2014 - Concurrency Theory - 25th International Conference. Heidelberg Dordrecht London New York: Springer, 2014, s. 249-265. ISBN 978-3-662-44583-9. Dostupné z: https://dx.doi.org/10.1007/978-3-662-44584-6_18.

KOMÁRKOVÁ, Zuzana a Jan KŘETÍNSKÝ. Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata. In Automated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014. Heidelberg Dordrecht London New York: Springer, 2014, s. 235-241. ISBN 978-3-319-11935-9. Dostupné z: https://dx.doi.org/10.1007/978-3-319-11936-6_17.

TRTÍK, Marek a 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, s. 380-395. ISBN 978-3-319-11935-9. Dostupné z: https://dx.doi.org/10.1007/978-3-319-11936-6_27.

LARSEN, Kim G., Simon LAURSEN a Jiří SRBA. Synchronizing Strategies under Partial Observability. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14). Nizozemsko: Springer-Verlag, 2014, s. 188-202. ISBN 978-3-662-44583-9. Dostupné z: https://dx.doi.org/10.1007/978-3-662-44584-6_14.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Martin CHMELÍK, Vojtěch FOREJT, Jan KŘETÍNSKÝ, Marta KWIATKOWSKA, David PARKER a 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, s. 98-114. ISBN 978-3-319-11935-9. Dostupné z: https://dx.doi.org/10.1007/978-3-319-11936-6_8.

BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA, Petr NOVOTNÝ a 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, s. nestránkováno, 10 s. ISBN 978-1-4503-2886-9. Dostupné z: https://dx.doi.org/10.1145/2603088.2603161.

CHATTERJEE, Krishnendu, Andreas GAISER a Jan KŘETÍNSKÝ. Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. In Computer Aided Verification - 25th International Conference, CAV 2013. Heidelberg Dordrecht London New York: Springer, 2013, s. 559-575. ISBN 978-3-642-39798-1. Dostupné z: https://dx.doi.org/10.1007/978-3-642-39799-8_37.

PELÁNEK, Radek, Petr BOROŠ, Juraj NIŽNAN a Jiří ŘIHÁK. Automatic Detection of Concepts from Problem Solving Times. In Lane, H.C.; Yacef, K.; Mostow, J.; Pavlik, P. Artificial Intelligence in Education. USA: Springer, 2013, s. 595-598. ISBN 978-3-642-39111-8. Dostupné z: https://dx.doi.org/10.1007/978-3-642-39112-5_67.

SLABÝ, Jiří, Jan STREJČEK a 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, s. 193-207. ISBN 978-3-319-02443-1. Dostupné z: https://dx.doi.org/10.1007/978-3-319-02444-8_15.

BLAHOUDEK, František, Mojmír KŘETÍNSKÝ a 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, s. 164-172. ISBN 978-3-642-45220-8. Dostupné z: https://dx.doi.org/10.1007/978-3-642-45221-5_12.

HERMANNS, Holger, Jan KRČÁL a 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, s. 364-379. ISBN 978-3-642-40183-1. Dostupné z: https://dx.doi.org/10.1007/978-3-642-40184-8_26.

BARNAT, Jiří, Luboš BRIM, Vojtěch HAVEL, Jan HAVLÍČEK, Jan KRIHO, Milan LENČO, Petr ROČKAI, Vladimír ŠTILL a Jiří WEISER. DiVinE 3.0 -- An Explicit-State Model Checker for Multithreaded C & C++ Programs. In Sharygina, Natasha; Veith, Helmut. Computer Aided Verification 2013. Heidelberg: Springer, 2013, s. 863-868. ISBN 978-3-642-39798-1. Dostupné z: https://dx.doi.org/10.1007/978-3-642-39799-8_60.

BLAHOUDEK, František, Tomáš BABIAK, Mojmír KŘETÍNSKÝ a 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, s. 24-38. ISBN 978-3-319-02443-1. Dostupné z: https://dx.doi.org/10.1007/978-3-319-02444-8_4.

BRIM, Luboš, Milan ČEŠKA, Sven DRAŽAN a David ŠAFRÁNEK. Exploring Parameter Space of Stochastic Biochemical Systems Using Quantitative Model Checking. In 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings. Berlin: Springer Berlin Heidelberg, 2013, s. 107-123. ISBN 978-3-642-39798-1. Dostupné z: https://dx.doi.org/10.1007/978-3-642-39799-8_7.

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

BENEŠ, Nikola, Benoit DELAHAYE, Uli FAHRENBERG, Jan KŘETÍNSKÝ a Axel LEGAY. Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory. In CONCUR 2013 - Concurrency Theory - 24th International Conference. Heidelberg Dordrecht London New York: Springer, 2013, s. 76-90. ISBN 978-3-642-40183-1. Dostupné z: https://dx.doi.org/10.1007/978-3-642-40184-8_7.

REYES CASTRO, Luis Ignacio, Pratik CHAUDHARI, Jana TŮMOVÁ, Sertac KARAMAN, Emilio FRAZZOLI a Daniela RUS. Incremental Sampling-Based Algorithm for Minimum-Violation Motion Planning. In Proceedings of the IEEE 52nd Annual Conference on Decision and Control (CDC), 2013. Florence, Italy: IEEE, 2013, s. 3217-3224. ISBN 978-1-4673-5717-3. Dostupné z: https://dx.doi.org/10.1109/CDC.2013.6760374.

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

TROUBIL, Pavel, Hana RUDOVÁ a Petr HOLUB. Media Streams Planning with Transcoding. Online. In 12th IEEE International Symposium on Network Computing and Applications (NCA 2013). USA: IEEE, 2013, s. 41-48. ISBN 978-0-7685-5043-6. Dostupné z: https://dx.doi.org/10.1109/NCA.2013.46.

KŘETÍNSKÝ, Jan a Salomon SICKERT. MoTraS: A Tool for Modal Transition Systems and Their Extensions. In Automated Technology for Verification and Analysis - 11th International Symposium, ATVA 2013. Heidelberg Dordrecht London New York: Springer, 2013, s. 487-491. ISBN 978-3-319-02443-1. Dostupné z: https://dx.doi.org/10.1007/978-3-319-02444-8_41.

BARRIENTOS, Ricardo, Jose GOMEZ, Christian TENLLADO, Manuel PRIETO-MATIAS a Pavel ZEZULA. Multi-level Clustering on Metric Spaces Using a Multi-GPU Platform. In Felix Wolf and Bernd Mohr and Dieter an Mey. Euro-Par 2013 Parallel Processing - 19th International Conference. Berlin: Springer, 2013, s. 216-228. ISBN 978-3-642-40046-9. Dostupné z: https://dx.doi.org/10.1007/978-3-642-40047-6_24.

CHATTERJEE, Krishnendu, Vojtěch FOREJT a Dominik WOJTCZAK. Multi-objective Discounted Reward Verification in Graphs and MDPs. In Kenneth L. McMillan and Aart Middeldorp and Andrei Voronkov. Logic for Programming, Artificial Intelligence, and Reasoning. Berlin, Heidelberg: Springer, 2013, s. 228-242. ISBN 978-3-642-45220-8. Dostupné z: https://dx.doi.org/10.1007/978-3-642-45221-5_17.

CHEN, Taolue, Vojtěch FOREJT, Marta KWIATKOWSKA, Aistis SIMAITIS a Clemens WILTSCHE. On Stochastic Games with Multiple Objectives. In Krishnendu Chatterjee and Jiri Sgall. Proc. 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13). Berlin, Heidelberg: Springer, 2013, s. 266-277. ISBN 978-3-642-40312-5. Dostupné z: https://dx.doi.org/10.1007/978-3-642-40313-2_25.

SVOREŇOVÁ, Mária, Ivana ČERNÁ a Calin BELTA. Optimal Control of MDPs with Temporal Logic Constraints. Online. In Proceedings of The 52nd IEEE Conference on Decision and Control. Neuveden: Omnipress for the IEEE Control Systems Society, 2013, s. 3938-3943. ISBN 978-1-4673-5714-2. Dostupné z: https://dx.doi.org/10.1109/CDC.2013.6760491.

MATERNA, Jiří. Parameter Estimation for LDA-Frames. Online. In Lucy Vanderwende, Hal Daume III, Katrin Kirchhoff. Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. Atlanta, Georgia: Association for Computational Linguistics, 2013, s. 482-486. ISBN 978-1-937284-47-3.

CHEN, Taolue, Vojtěch FOREJT, Marta KWIATKOWSKA, David PARKER a Aistis SIMAITIS. PRISM-games: A model checker for stochastic multi-player games. In Nir Piterman and Scott A. Smolka. TACAS 2013. Berlin, Heidelberg: Springer, 2013, s. 185-191. ISBN 978-3-642-36741-0. Dostupné z: https://dx.doi.org/10.1007/978-3-642-36742-7_13.

KŘETÍNSKÝ, Jan a Ruslan LEDESMA GARZA. Rabinizer 2: Small Deterministic Automata for LTL\GU. In Automated Technology for Verification and Analysis - 11th International Symposium, ATVA 2013. Heidelberg Dordrecht London New York: Springer, 2013, s. 446-450. ISBN 978-3-319-02443-1. Dostupné z: https://dx.doi.org/10.1007/978-3-319-02444-8_32.

BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Vojtěch FOREJT a 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, s. 331-340. ISBN 978-1-4799-0413-6. Dostupné z: https://dx.doi.org/10.1109/LICS.2013.39.