Hardness Results for Intersection Non-Emptiness. - Michael Wehar (ICALP (2), 2014)

On the Complexity of Intersecting Regular, Context-Free, and Tree Languages. - Joseph Swernofsky; Michael Wehar (ICALP (2), 2015)

Intersection Non-emptiness and Hardness Within Polynomial Time. - Mateus de Oliveira Oliveira; Michael Wehar (DLT, 2018)

Two-Dimensional Pattern Matching Against Basic Picture Languages. - Frantisek Mráz; Daniel Prusa; Michael Wehar (CIAA, 2019)

Shortest paths in one-counter systems. - Dmitry Chistikov 001; Wojciech Czerwinski; Piotr Hofman; Michal Pilipczuk; Michael Wehar (Log. Methods Comput. Sci., 2019)

On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection. - Mateus de Oliveira Oliveira; Michael Wehar (DLT, 2020)

Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices. - Daniel Prusa; Michael Wehar (DLT, 2020)

Stronger Lower Bounds for Polynomial Time Problems. - András Z. Salamon; Michael Wehar (CoRR, 2020)

Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited. - Henning Fernau; Stefan Hoffmann 001; Michael Wehar (CoRR, 2021)

Two-dimensional pattern matching against local and regular-like picture languages. - Frantisek Mráz; Daniel Prusa; Michael Wehar (Theor. Comput. Sci., 2021)

Analyzing Group and Individual Contributions within Group Programming: RepoRabbit Web Application. - Maria Quiroz; Michael Wehar (ITiCSE (2), 2022)

Superlinear Lower Bounds Based on ETH. - András Z. Salamon; Michael Wehar (STACS, 2022)

Algorithmically Generated Artwork. - John Mancini; Maya Newman-Toker; Michael Wehar; Alyssa Zhang (J. Comput. Sci. Coll., 2022)

Effective Guessing Has Unlikely Consequences. - András Z. Salamon; Michael Wehar (Theory Comput. Syst., 2023)