Johannes Schmitt

Orcid: 0000-0001-5774-3508

Affiliations:
  • ETH Zurich, Departement of Mathematics, Switzerland


According to our database1, Johannes Schmitt authored at least 9 papers between 2018 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
IMProofBench: Benchmarking AI on Research-Level Mathematical Proof Generation.
CoRR, September, 2025

Humanity's Last Exam.
, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,
CoRR, January, 2025

Parameterised Holant Problems.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2023
Parameterized Counting and Cayley Graph Expanders.
SIAM J. Discret. Math., June, 2023

2021
Parameterized (Modular) Counting and Cayley Graph Expanders.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Counting Small Induced Subgraphs Satisfying Monotone Properties.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness.
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018


  Loading...