Johannes Schmitt

Publication Activity (10 Years)

Years Active: 2018-2023
Publications (10 Years): 13

Top Topics

Learning Theory

Topological Information

Graph Properties

Top Venues

Publications

Norbert Peyerimhoff, Marc Roth, Johannes Schmitt, Jakob Stix, Alina Vdovina, Philip Wellnitz
Parameterized Counting and Cayley Graph Expanders. SIAM J. Discret. Math. 37 (2) (2023)
Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness. Algorithmica 84 (2) (2022)
Norbert Peyerimhoff, Marc Roth, Johannes Schmitt, Jakob Stix, Alina Vdovina
Parameterized (Modular) Counting and Cayley Graph Expanders. MFCS (2021)
Norbert Peyerimhoff, Marc Roth, Johannes Schmitt, Jakob Stix, Alina Vdovina
Parameterized (Modular) Counting and Cayley Graph Expanders. CoRR (2021)
Marc Roth, Johannes Schmitt, Philip Wellnitz
Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. ICALP (2021)
Marc Roth, Johannes Schmitt, Philip Wellnitz
Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders. CoRR (2020)
Marc Roth, Johannes Schmitt, Philip Wellnitz
Counting Small Induced Subgraphs Satisfying Monotone Properties. CoRR (2020)
Marc Roth, Johannes Schmitt, Philip Wellnitz
Counting Small Induced Subgraphs Satisfying Monotone Properties. FOCS (2020)
Marc Roth, Johannes Schmitt
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness. Algorithmica 82 (8) (2020)
Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. MFCS (2019)
Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. CoRR (2019)
Marc Roth, Johannes Schmitt
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness. IPEC (2018)
Marc Roth, Johannes Schmitt
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness. CoRR (2018)