Publikacje

Konferencja: International Symposium on Mathematical Foundations of Computer Science

2025

• Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski , Wojciech Rytter , Tomasz Waleń , Wiktor Zuba , Counting Distinct Square Substrings in Sublinear Time, 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 25 sierpnia 2025 - 29 sierpnia 2025, 345 (36) 2025, s. 1-19. Zobacz w PBN
• Romain Bourneuf, Jana Masaříková , Wojciech Nadara , Marcin Pilipczuk , Graphs with No Long Claws: An Improved Bound for the Analog of the Gyárfás' Path Argument, 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 25 sierpnia 2025 - 29 sierpnia 2025, 345 (28) 2025, s. 1-16. Zobacz w PBN
• Aliaume Lopez , Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width, 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 25 sierpnia 2025 - 29 sierpnia 2025, 345 (70) 2025, s. 1-17. Zobacz w PBN
• Filip Murlak , On Graph Queries and Modal Constraints (Invited Talk), 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 25 sierpnia 2025 - 29 sierpnia 2025, 345 (4) 2025, s. 1-1. Zobacz w PBN
• Łukasz Kamiński , Sławomir Lasota , Reachability in Symmetric VASS, 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 25 sierpnia 2025 - 29 sierpnia 2025, 345 (60) 2025, s. 1-17. Zobacz w PBN
• Stefan Kiefer, Andrew Ryzhikov , The Complexity of Reachability Problems in Strongly Connected Finite Automata, 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 25 sierpnia 2025 - 29 sierpnia 2025, 345 (62) 2025, s. 1-19. Zobacz w PBN

2024

• Wiktor Zuba , Grigorios Loukides, Solon Pissis, Sharma V. Thankachan, Approximate Suffix-Prefix Dictionary Queries, International Symposium on Mathematical Foundations of Computer Science, Bratislava, Slovakia, 26 sierpnia 2024 - 30 sierpnia 2024, 306 2024, s. 85:1-85:18. Zobacz w PBN
• Wojciech Czerwiński , Challenges of the Reachability Problem in Infinite-State Systems (Invited Paper), International Symposium on Mathematical Foundations of Computer Science, Bratislava, Slovakia, 26 sierpnia 2024 - 30 sierpnia 2024. Zobacz w PBN
• Karolina Okrasa, Paweł Rzążewski , Jan Goedgebeur, Jorik Jooken, Oliver Schaudt, Minimal Obstructions to C5-Coloring in Hereditary Graph Classes, 49th International Symposium on Mathematical Foundations of Computer Science, Bratysława, Slovakia, 25 sierpnia 2024 - 29 sierpnia 2024. Zobacz w PBN
• Antonio Casares Santos , Corto Mascle, The Complexity of Simplifying ω-Automata Through the Alternating Cycle Decomposition, International Symposium on Mathematical Foundations of Computer Science, Bratislava, Slovakia, 26 sierpnia 2024 - 30 sierpnia 2024. Zobacz w PBN

2021

• Giacomo Paesani, Daniël Paulusma, Paweł Rzążewski , Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs, 46th International Symposium on Mathematical Foundations of Computer Science, tallin, Estonia, 22 sierpnia 2021 - 26 sierpnia 2021. Zobacz w PBN
• Damian Niwiński , Michał Skrzypczak , On Guidable Index of Tree Automata, 46th International Symposium on Mathematical Foundations of Computer Science, Tallinn, Estonia, 23 sierpnia 2021 - 27 sierpnia 2021, 202 2021, s. 81:1--81:14. Zobacz w PBN
• Bart M.P. Jansen, Shivesh K. Roy, Michał Włodarczyk , On the Hardness of Compressing Weights, 46th International Symposium on Mathematical Foundations of Computer Science, Tallinn, Estonia, 23 sierpnia 2021 - 27 sierpnia 2021. Zobacz w PBN

2020

• Vincent Michielini , Michał Skrzypczak , Regular Choice Functions and Uniformisations For countable Domains, 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czechia, 24 sierpnia 2020 - 28 sierpnia 2020, 170 2020, s. 69:1--69:13. Zobacz w PBN
• Janusz Schmude, Mikołaj Bojańczyk , Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers, 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czechia, 24 sierpnia 2020 - 28 sierpnia 2020, 170 2020, s. 19:1--19:14. Zobacz w PBN
• Jan Kratochvíl, Tomáš Masařík , Jana Masaříková , U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited, 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czechia, 24 sierpnia 2020 - 28 sierpnia 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

• Wojciech Czerwiński , Sławomir Lasota , Löding, Christof, Radosław Piórkowski, New Pumping Technique for 2-Dimensional VASS, Leibniz International Proceedings in Informatics, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, 26 sierpnia 2019 - 30 sierpnia 2019, 138 2019, s. 62:1--62:14. Zobacz w PBN
• Dušan Knop, Tomáš Masařík , Tomáš Toufar, Parameterized Complexity of Fair Vertex Evaluation Problems, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, 26 sierpnia 2019 - 30 sierpnia 2019. Zobacz w PBN
• Paweł Parys , Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, 26 sierpnia 2019 - 30 sierpnia 2019. Zobacz w PBN
• Nathan Lhote, Vincent Michielini , Michał Skrzypczak , Uniformisation Gives the Full Strength of Regular Languages, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, 26 sierpnia 2019 - 30 sierpnia 2019, 138 2019, s. 61:1--61:13. Zobacz w PBN

2017

• Filippo Cavallari, Henryk Michalewski , Michał Skrzypczak , A Characterisation of Pi^0_2 Regular Tree Languages, 42nd International Symposium on Mathematical Foundations of Computer Science, Aalborg, Denmark, 21 sierpnia 2017 - 25 sierpnia 2017. Zobacz w PBN
• Michał Pilipczuk , Andreas Wiese, Erik Jan van Leeuwen, Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking, 42nd International Symposium on Mathematical Foundations of Computer Science, Aalborg, Denmark, 21 sierpnia 2017 - 25 sierpnia 2017. Zobacz w PBN