Publikacje

Konferencja: International Symposium on Theoretical Aspects of Computer Science

Liczba publikacji: 20

2023

• Jędrzej Olkowski, Michał Pilipczuk , Mateusz Rychlicki, Karol Węgrzycki, Anna Zych-Pawlewicz , Dynamic Data Structures for Parameterized String Problems, 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 7 marca 2023 - 9 marca 2023. Zobacz w PBN
• Marek Sokołowski , Michał Pilipczuk , Konrad Majewski , Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number, 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 7 marca 2023 - 9 marca 2023. Zobacz w PBN
• Lorenzo Clemente , Maria Donten-Bury , Filip Mazowiecki, Michał Pilipczuk , On Rational Recursive Sequences, 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 7 marca 2023 - 9 marca 2023. Zobacz w PBN

2022

• Michał Pilipczuk , Marek Sokołowski , Anna Zych-Pawlewicz , Compact Representation for Matrices of Bounded Twin-Width, 39th International Symposium on Theoretical Aspects of Computer Science, Marseille, France, 15 kwietnia 2022 - 18 kwietnia 2022, 219 (52) 2022, s. 1-14. Zobacz w PBN

2021

• Barloy, Corentin, Lorenzo Clemente , Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata, 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 16 marca 2021 - 19 marca 2021. Zobacz w PBN
• Shaohua Li, Marcin Pilipczuk , Manuel Sorge, Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings, 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 16 marca 2021 - 19 marca 2021. Zobacz w PBN
• Karolina Okrasa, Paweł Rzążewski , Complexity of the List Homomorphism Problem in Hereditary Graph Classes, 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 16 marca 2021 - 19 marca 2021. Zobacz w PBN
• Marta Piecyk, Paweł Rzążewski , Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth, 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 16 marca 2021 - 19 marca 2021. Zobacz w PBN

2020

• Jakub Gajarský , Computing Srub-Depth Decompositions, Leibniz International Proceedings in Informatics, 37th Symposium on Theoretical Aspects of Computer Science, Montpellier, France, 10 marca 2020 - 13 marca 2020, 154 (56) 2020, s. 1-17. Zobacz w PBN

2019

• Grzegorz Fabiański , Michał Pilipczuk , Sebastian Siebertz, Szymon Toruńczyk , Progressive Algorithms for Domination and Independence, 36th International Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, 13 marca 2019 - 16 marca 2019, 126 2019, s. 27:1--27:16. Zobacz w PBN
• Dušan Knop, Michał Pilipczuk , Marcin Wrochna , Tight complexity lower bounds for integer linear programming with few constraints, Leibniz International Proceedings in Informatics, 36th International Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, 13 marca 2019 - 16 marca 2019, 126 2019, s. 44:1--44:15. Zobacz w PBN

2018

• Paweł Rzążewski , Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization, Leibniz International Proceedings in Informatics, 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, Caen, France, 28 lutego 2018 - 3 marca 2018. Zobacz w PBN
• Paweł Parys , Recursion Schemes and the WMSO+U Logic, The 35th International Symposium on Theoretical Aspects of Computer Science, Caen, France, 28 lutego 2018 - 3 marca 2018. Zobacz w PBN
• Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski , Wojciech Rytter , Arseny M. Shur, Tomasz Waleń , String Periods in the Order-Preserving Model, The 35th International Symposium on Theoretical Aspects of Computer Science, Caen, France, 28 lutego 2018 - 3 marca 2018. Zobacz w PBN

2017

• Édouard Bonnet, Tillmann Miltzow, Paweł Rzążewski , Complexity of Token Swapping and its Variants, 34th International Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 8 marca 2017 - 11 marca 2017. Zobacz w PBN
• Piotr Sankowski , Karol Węgrzycki, Improved Distance Queries and Cycle Counting by Frobenius Normal Form, 34th International Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 8 marca 2017 - 11 marca 2017. Zobacz w PBN
• Piotr Hofman , Stanislav Böhm, Stefan Göller, Simon Halfon, On Büchi One-Counter Automata, 34th International Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 8 marca 2017 - 11 marca 2017. Zobacz w PBN
• Mikołaj Bojańczyk , Michał Pilipczuk , Optimizing Tree Decompositions in MSO, 34th International Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 8 marca 2017 - 11 marca 2017. Zobacz w PBN
• Sławomir Lasota , Charles Paperman, Wojciech Czerwiński , Lorenzo Clemente , Separability of Reachability Sets of Vector Addition Systems, 34th International Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 8 marca 2017 - 11 marca 2017. Zobacz w PBN

2015

• Marcin Wrochna , Homomorphism Reconfiguration via Homotopy, 32nd International Symposium on Theoretical Aspects of Computer Science, Garching, Germany, 4 marca 2015 - 7 marca 2015. Zobacz w PBN