vix.ing · top · new · best · stats · spec

Siebertz, Sebastian

  1. Deciding first-order properties of nowhere dense graphs
    2013/11/15 by Martin Grohe, Stephan Kreutzer, Grohe, Martin +3 · 7 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory #Logic in Computer Science (cs.LO)
  2. Progressive Algorithms for Domination and Independence
    2018/11/16 by Fabiański, Grzegorz, Pilipczuk, Michał, Siebertz, Sebastian +1 · 3 citations
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)
  3. Vertex Cover Reconfiguration and Beyond
    2014/02/20 by Amer E. Mouawad, Naomi Nishimura, Mouawad, Amer E. +5 · 2 citations
    Computer Science · Engineering · #Advanced Graph Theory Research #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Interconnection Networks and Systems #graph theory and CDMA systems
  4. First-order interpretations of bounded expansion classes
    2018/10/04 by Gajarský, Jakub, Kreutzer, Stephan, Nešetřil, Jaroslav +4 · 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)
  5. Classes of graphs with low complexity: the case of classes with bounded\n linear rankwidth
    2019/09/04 by Jaroslav Nešetřil, Nesetril, Jaroslav, Patrice Ossona de Mendez +5 · 2 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Limits and Structures in Graph Theory
  6. Flipper games for monadically stable graph classes
    2023/01/31 by Gajarský, Jakub, Mählmann, Nikolas, McCarty, Rose +6 · 3 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)
  7. First-Order Model Checking on Structurally Sparse Graph Classes
    2023/02/07 by Jan Dreier, Nikolas Mählmann, Dreier, Jan +3 · 3 citations
    Computer Science · #Complexity and Algorithms in Graphs #Formal Methods in Verification #Logic, Reasoning, and Knowledge
  8. Polynomial bounds for centered colorings on proper minor-closed graph classes
    2018/07/10 by Pilipczuk, Michał, Siebertz, Sebastian · 2 citations
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  9. Transducing paths in graph classes with unbounded shrubdepth
    2022/03/31 by Pilipczuk, Michał, de Mendez, Patrice Ossona, Siebertz, Sebastian · 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)
  10. Distributed Dominating Set Approximations beyond Planar Graphs
    2017/05/25 by Amiri, Saeed Akhoondian, Schmid, Stefan, Siebertz, Sebastian · 1 citation
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #Distributed #FOS: Computer and information sciences #FOS: Mathematics #Parallel #and Cluster Computing (cs.DC)
  11. Reconfiguration on nowhere dense graph classes
    2017/07/21 by Siebertz, Sebastian · 1 citation
    #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  12. Token sliding on graphs of girth five
    2022/05/02 by Valentin Bartier, Bartier, Valentin, Nicolás Bousquet +7 · 2 citations
    Computer Science · #Advanced Graph Theory Research #semigroups and automata theory #Algorithms and Data Compression
  13. A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems
    2022/04/22 by Nicolás Bousquet, Amer E. Mouawad, Bousquet, Nicolas +5 · 2 citations
    Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Constraint Satisfaction and Optimization #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #semigroups and automata theory
  14. 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
  15. On Solution Discovery via Reconfiguration
    2023/04/27 by Michael R. Fellows, Fellows, Michael R., Mario Grobler +13 · 2 citations
    Computer Science · #Computational Complexity (cs.CC) #Constraint Satisfaction and Optimization #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  16. Linear rankwidth meets stability
    2019/11/15 by Nesetril, Jaroslav, de Mendez, Patrice Ossona, Rabinovich, Roman +1 · 1 citation
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Logic in Computer Science (cs.LO)
  17. On the Parameterized Complexity of Reconfiguration of Connected\n Dominating Sets
    2019/10/01 by Daniel Lokshtanov, Lokshtanov, Daniel, Amer E. Mouawad +5 · 1 citation
    Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #Advanced Graph Theory Research #Advanced Optical Network Technologies #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #Enzyme Catalysis and Immobilization #FOS: Computer and information sciences #FOS: Mathematics
  18. Rankwidth meets stability
    2020/07/15 by Nesetril, Jaroslav, de Mendez, Patrice Ossona, Pilipczuk, Michal +2 · 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)
  19. Solution discovery via reconfiguration for problems in P
    2023/11/22 by Grobler, Mario, Maaz, Stephanie, Megow, Nicole +4 · 2 citations
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  20. 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)
  21. Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes
    2022/06/28 by Dreier, Jan, Mählmann, Nikolas, Siebertz, Sebastian +1 · 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)
  22. Distributed domination on sparse graph classes
    2022/07/06 by Heydt, Ozan, Kublenz, Simeon, de Mendez, Patrice Ossona +2 · 1 citation
    #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
  23. On first-order transductions of classes of graphs
    2022/08/30 by Braunfeld, Samuel, Nešetřil, Jaroslav, de Mendez, Patrice Ossona +1 · 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)
  24. Kernelization Complexity of Solution Discovery Problems
    2024/09/25 by Mario Grobler, Stephanie Maaz, Grobler, Mario +9 · 2 citations
    Chemistry · Computer Science · #AI-based Problem Solving and Planning #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Graph Theory and Algorithms #History and advancements in chemistry
  25. On the generalized coloring numbers
    2025/01/15 by Siebertz, Sebastian · 1 citation
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Logic in Computer Science (cs.LO)