Publikacje

Czasopismo: Leibniz International Proceedings in Informatics, LIPIcs

2024

• Bartłomiej Bosek , Grzegorz Gutowski, Michał Lasoń, Jakub Przybyło, First-fit coloring of forests in random arrival model, Leibniz International Proceedings in Informatics, LIPIcs, 49th International Symposium on Mathematical Foundations of Computer Science, Bratislava, Slovakia, 26 sierpnia 2024 - 30 sierpnia 2024. Zobacz w PBN

2021

• Alejandro Grez, Gabriele Puppis, Cristian Riveros, Filip Mazowiecki , Michał Pilipczuk , Dynamic Data Structures for Timed Automata Acceptance, Leibniz International Proceedings in Informatics, LIPIcs, 214 2021, s. 20:1--20:18. Zobacz w PBN

2020

• Maria Chudnovsky, Jason King, Michał Pilipczuk , Paweł Rzążewski, Sophie Spirkl, Finding Large H-Colorable Subgraphs in Hereditary Graph Classes, Leibniz International Proceedings in Informatics, LIPIcs, 28th Annual European Symposium on Algorithms, Pisa, Italy, 7 września 2020 - 9 września 2020. Zobacz w PBN
• Michaël Cadilhac, Charles Paperman, Michał Pilipczuk , Géraud Sénizergues, Filip Mazowiecki , On Polynomial Recursive Sequences, Leibniz International Proceedings in Informatics, LIPIcs, 47th International Colloquium on Automata, Languages, and Programming, Saarbrücken, Germany, 8 lipca 2020 - 11 lipca 2020, 168 2020, s. 117:1--117:17. Zobacz w PBN
• Bartłomiej Bosek , Yann Disser, Andreas Emil, Jakub Pawlewicz , Anna Zych-Pawlewicz , Recoloring interval graphs with limited recourse budget, Leibniz International Proceedings in Informatics, LIPIcs, 17th Scandinavian Symposium and Workshops on Algorithm Theory, Torshavn, the Faroe Islands, 22 czerwca 2020 - 24 czerwca 2020. Zobacz w PBN
• Piotr Hofman , Wojciech Czerwiński , Diego Figueira, Universality Problem for Unambiguous VASS, Leibniz International Proceedings in Informatics, LIPIcs, 2020. Zobacz w PBN
• Adam Paszke, Michał Pilipczuk , VC Density of Set Systems Definable in Tree-Like Graphs, Leibniz International Proceedings in Informatics, LIPIcs, 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czechia, 24 sierpnia 2020 - 28 sierpnia 2020, 170 2020, s. 78:1--78:13. Zobacz w PBN

2019

• Maria Chudnovsky, Shenwei Huang, Paweł Rzążewski , Sophie Spirkl, Mingxian Zhong, Complexity of C_k-Coloring in Hereditary Classes of Graphs, Leibniz International Proceedings in Informatics, LIPIcs, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 września 2019 - 13 września 2019. Zobacz w PBN

2018

• Michael Blondin, Christoph Haase, Filip Mazowiecki , Affine Extensions of Integer Vector Addition Systems with States, Leibniz International Proceedings in Informatics, LIPIcs, 118 2018, s. 14:1--14:17. Zobacz w PBN
• Cristian Riveros, Filip Mazowiecki , Pumping Lemmas for Weighted Automata, Leibniz International Proceedings in Informatics, LIPIcs, 96 2018, s. 50:1--50:14. Zobacz w PBN
• Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Guillermo A., James Worrell, Filip Mazowiecki , When is Containment Decidable for Probabilistic Automata?, Leibniz International Proceedings in Informatics, LIPIcs, 107 2018, s. 121:1--121:14. Zobacz w PBN

2017

• Michał Aleksander Ciach, Paweł Górecki , Anna Muszewska, Detecting locus acquisition events in gene trees., Leibniz International Proceedings in Informatics, LIPIcs, 17th International Workshop on Algoritms in Bioinformatics WABI , Boston, the United States of America, 20 sierpnia 2017 - 22 sierpnia 2017, 88 (brak) 2017, s. brak. Zobacz w PBN
• Diego Figueira, Ranko Lazic, J{\'{e}}r{\^{o}}me Leroux, Gr{\'{e}}goire Sutre, Filip Mazowiecki , Polynomial-Space Completeness of Reachability for Succinct Branching {VASS} in Dimension One, Leibniz International Proceedings in Informatics, LIPIcs, 80 2017, s. 119:1--119:14. Zobacz w PBN