Obdržálek, Jan

1. Kernelization Using Structural Parameters on Sparse Graph Classes
   2013/02/27 by Jakub Gajarský, Petr Hliněný, Gajarský, Jakub +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
2. Expanding the expressive power of Monadic Second-Order logic on restricted graph classes
   2013/06/24 by Robert Ganian, Jan Obdržálek, Ganian, Robert +1 · 1 citation
   Computer Science · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.DS #cs.LO
3. FO Model Checking on Posets of Bounded Width
   2015/04/16 by Jakub Gajarský, Petr Hliněný, Gajarský, Jakub +12 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #cs.DM #cs.LO
4. Tree-depth and Vertex-minors
   2014/03/27 by Petr Hliněný, O-joung Kwon, Hliněný, Petr +5 · 1 citation
   Computer Science · Mathematics · #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #math.CO