Toruńczyk, Szymon
- Twin-width IV: ordered graphs and matrices
2021/02/05 by Édouard Bonnet, Bonnet, Édouard, Ugo Giocanti +9 · 8 citations
Engineering · Computer Science · #graph theory and CDMA systems #semigroups and automata theory #Coding theory and cryptography
- Progressive Algorithms for Domination and Independence
2018/11/16 by Fabiański, Grzegorz, Pilipczuk, Michał, Siebertz, Sebastian +1 · 4 citations
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)
- First-order interpretations of bounded expansion classes
2018/10/04 by Gajarský, Jakub, Kreutzer, Stephan, Nešetřil, Jaroslav +4 · 4 citations
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)
- Stable graphs of bounded twin-width
2021/07/08 by Jakub Gajarský, Gajarský, Jakub, Michał Pilipczuk +3 · 3 citations
Computer Science · Mathematics · Neuroscience · #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Finite Group Theory Research #Logic in Computer Science (cs.LO) #Nuclear Receptors and Signaling
- Entropy bounds for conjunctive queries with functional dependencies
2015/12/06 by Tomasz Gogacz, Szymon Toruńczyk, Gogacz, Tomasz +1 · 2 citations
Computer Science · #Complexity and Algorithms in Graphs #Data Management and Algorithms #Databases (cs.DB) #FOS: Computer and information sciences #Optimization and Search Problems
- Flip-width: Cops and Robber on dense graphs
2023/02/01 by Symon Toruńczyk, Toruńczyk, Szymon · 4 citations
Computer Science · #05C75 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Graph Labeling and Dimension Problems #Logic in Computer Science (cs.LO)
- Flipper games for monadically stable graph classes
2023/01/31 by Gajarský, Jakub, Mählmann, Nikolas, McCarty, Rose +6 · 4 citations
#Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)
- Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
2024/03/22 by Jan Dreier, Nikolas Mählmann, Dreier, Jan +3 · 5 citations
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computability, Logic, AI Algorithms #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)
- Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
2022/02/25 by Bonnet, Édouard, Dreier, Jan, Gajarský, Jakub +4 · 2 citations
#05C85 #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #Logic in Computer Science (cs.LO)
- Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes
2022/06/28 by Dreier, Jan, Mählmann, Nikolas, Siebertz, Sebastian +1 · 2 citations
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)
- Parameterized circuit complexity of model checking first-order logic on\n sparse structures
2018/05/09 by Michał Pilipczuk, Sebastian Siebertz, Pilipczuk, Michał +3 · 1 citation
Computer Science · #Complexity and Algorithms in Graphs #Computability, Logic, AI Algorithms #semigroups and automata theory
- Algorithms and data structures for first-order logic with connectivity under vertex failures
2021/11/05 by Michał Pilipczuk, Pilipczuk, Michał, Nicole Schirrmacher +7 · 1 citation
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #Distributed systems and fault tolerance #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)
- Twin-width and types
2022/06/16 by Gajarský, Jakub, Pilipczuk, Michał, Przybyszewski, Wojciech +1 · 1 citation
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)
- Canonical decompositions in monadically stable and bounded shrubdepth graph classes
2023/03/02 by Ohlmann, Pierre, Pilipczul, Michał, Toruńczyk, Szymon +1 · 1 citation
#FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
- Merge-width and First-Order Model Checking
2025/02/25 by Jan Dreier, Szymon Toruńczyk, Dreier, Jan +1 · 2 citations
Computer Science · #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Model-Driven Software Engineering Techniques