| 2026 | DLT | The Four Corners Problem Over Larger Alphabets. | Daniel Prusa, Michael Wehar, Chen Xu |
| 2026 | FUN | Finding Maximum and Minimum Size Matrices: The Algorithmic Complexity of Coding Challenges. | Abdelrahman Abdelmonsef, Xingyu Dong, Daniel Prusa, Michael Wehar, Chen Xu |
| 2022 | ITiCSE | Analyzing Group and Individual Contributions within Group Programming: RepoRabbit Web Application. | Maria Quiroz, Michael Wehar |
| 2022 | STACS | Superlinear Lower Bounds Based on ETH. | Andrs Z. Salamon, Michael Wehar |
| 2020 | DLT | On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection. | Mateus de Oliveira Oliveira, Michael Wehar |
| 2020 | DLT | Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices. | Daniel Prusa, Michael Wehar |
| 2018 | DLT | Intersection Non-emptiness and Hardness Within Polynomial Time. | Mateus de Oliveira Oliveira, Michael Wehar |
| 2016 | FOSSACS | Shortest Paths in One-Counter Systems. | Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar |
| 2015 | ICALP | On the Complexity of Intersecting Regular, Context-Free, and Tree Languages. | Joseph Swernofsky, Michael Wehar |
| 2014 | ICALP | Hardness Results for Intersection Non-Emptiness. | Michael Wehar |