| The Weak call-by-value λ-Calculus is Reasonable for both Time and Space Y Forster, F Kunze, M Roth Proceedings of the ACM on Programming Languages 4 (POPL), 27:1-27:23, 2019 | 39 | 2019 |
| Counting Answers to Existential Questions (Track B: Automata, Logic, Semantics, and Theory of Programming) H Dell, M Roth, P Wellnitz 46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019 | 33* | 2019 |
| Counting Induced Subgraphs: A Topological Approach to #W[1]-Hardness M Roth, J Schmitt Algorithmica, 2020 | 22 | 2020 |
| Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness J Dörfler, M Roth, J Schmitt, P Wellnitz 44th International Symposium on Mathematical Foundations of Computer Science …, 2019 | 21 | 2019 |
| Exact and approximate pattern counting in degenerate graphs: New algorithms, hardness results, and complexity dichotomies M Bressan, M Roth 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 20 | 2022 |
| Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory M Roth, P Wellnitz Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA 2020 …, 2020 | 20 | 2020 |
| Fine-grained Dichotomies for the Tutte Plane and Boolean #CSP C Brand, H Dell, M Roth Algorithmica 81 (2), 541-556, 2019 | 20 | 2019 |
| Counting small induced subgraphs with hereditary properties J Focke, M Roth Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 15 | 2022 |
| Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices M Roth 25th Annual European Symposium on Algorithms (ESA 2017), 63:1-63:14, 2017 | 15 | 2017 |
| Counting small induced subgraphs satisfying monotone properties M Roth, J Schmitt, P Wellnitz SIAM Journal on Computing 53 (6), FOCS20-139-FOCS20-174, 2022 | 14 | 2022 |
| Humanity's Last Exam L Phan, A Gatti, Z Han, N Li, J Hu, H Zhang, S Shi, M Choi, A Agrawal, ... arXiv preprint arXiv:2501.14249, 2025 | 12 | 2025 |
| Parameterized Counting of Trees, Forests and Matroid Bases C Brand, M Roth 12th International Computer Science Symposium in Russia (CSR 2017), 85-98, 2017 | 12 | 2017 |
| Approximately counting answers to conjunctive queries with disequalities and negations J Focke, LA Goldberg, M Roth, S Živný ACM Transactions on Algorithms 21 (1), 1-29, 2024 | 11 | 2024 |
| Parameterized (Modular) Counting and Cayley Graph Expanders N Peyerimhoff, M Roth, J Schmitt, J Stix, A Vdovina arXiv preprint arXiv:2104.14596, 2021 | 11 | 2021 |
| Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders M Roth, J Schmitt, P Wellnitz arXiv preprint arXiv:2011.03433, 2020 | 11 | 2020 |
| Counting Problems on Quantum Graphs: Parameterized and Exact Complexity Classifications M Roth Saarland University, 2019 | 9 | 2019 |
| Counting Homomorphisms to -Minor-Free Graphs, Modulo 2 J Focke, LA Goldberg, M Roth, S Živný SIAM Journal on Discrete Mathematics 35 (4), 2749-2814, 2021 | 8 | 2021 |
| Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes R Curticapean, H Dell, M Roth Theory of Computing Systems 63 (5), 987-1026, 2019 | 8 | 2019 |
| The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree M Bressan, M Lanzinger, M Roth Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 542-552, 2023 | 6 | 2023 |
| Parameterized Counting and Cayley Graph Expanders N Peyerimhoff, M Roth, J Schmitt, J Stix, A Vdovina, P Wellnitz SIAM Journal on Discrete Mathematics 37 (2), 405-486, 2023 | 5 | 2023 |
Johannes SchmittPostdoc in Mathematics, ETH Zurichยืนยันอีเมลแล้วที่ math.ethz.ch
