Gajarský, Jakub
- Parameterized Algorithms for Modular-Width
2013/08/13 by Gajarský, Jakub, Lampis, Michael, Ordyniak, Sebastian · 5 citations
#Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
- Stable graphs of bounded twin-width
2021/07/08 by Jakub Gajarský, Michał Pilipczuk, Gajarský, Jakub +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
- Kernelization Using Structural Parameters on Sparse Graph Classes
2013/02/27 by Jakub Gajarský, Gajarský, Jakub, Petr Hliněný +13 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Graph Labeling and Dimension Problems #Graph theory and applications
- FO Model Checking on Posets of Bounded Width
2015/04/16 by Gajarský, Jakub, Hliněný, Petr, Lokshtanov, Daniel +4 · 1 citation
#Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #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 · 1 citation
#Combinatorics (math.CO) #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 · 1 citation
#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)
- Taming graphs with no large creatures and skinny ladders
2022/05/02 by Gajarský, Jakub, Jaffke, Lars, Lima, Paloma T. +4 · 1 citation
#Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- 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)
- Flipper games for monadically stable graph classes
2023/01/31 by Gajarský, Jakub, Mählmann, Nikolas, McCarty, Rose +6 · 1 citation
#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)
- Sparse Graphs of Twin-width 2 Have Bounded Tree-width
2023/07/04 by Bergougnoux, Benjamin, Gajarský, Jakub, Guśpiel, Grzegorz +3 · 1 citation
#05C75 #68R10 #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics