Michael Wehar

Publication Activity (10 Years)

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

Top Topics

Parameterized Complexity

Shortest Path Algorithm

Pattern Matching

Finite Automata

Top Venues

Publications

András Z. Salamon, Michael Wehar
Effective Guessing Has Unlikely Consequences. Theory Comput. Syst. 67 (3) (2023)
András Z. Salamon, Michael Wehar
Superlinear Lower Bounds Based on ETH. STACS (2022)
Maria Quiroz, Michael Wehar
Analyzing Group and Individual Contributions within Group Programming: RepoRabbit Web Application. ITiCSE (2) (2022)
Henning Fernau, Stefan Hoffmann, Michael Wehar
Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited. CoRR (2021)
András Z. Salamon, Michael Wehar
Effective guessing has unlikely consequences. CoRR (2021)
Frantisek Mráz, Daniel Prusa, Michael Wehar
Two-dimensional pattern matching against local and regular-like picture languages. Theor. Comput. Sci. 870 (2021)
Mateus de Oliveira Oliveira, Michael Wehar
On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection. DLT (2020)
Daniel Prusa, Michael Wehar
Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices. DLT (2020)
András Z. Salamon, Michael Wehar
Stronger Lower Bounds for Polynomial Time Problems. CoRR (2020)
Frantisek Mráz, Daniel Prusa, Michael Wehar
Two-Dimensional Pattern Matching Against Basic Picture Languages. CIAA (2019)
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
Shortest paths in one-counter systems. Log. Methods Comput. Sci. 15 (1) (2019)
Mateus de Oliveira Oliveira, Michael Wehar
Intersection Non-emptiness and Hardness Within Polynomial Time. DLT (2018)
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
Shortest Paths in One-Counter Systems. FoSSaCS (2016)
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
Shortest paths in one-counter systems. CoRR (2015)
Joseph Swernofsky, Michael Wehar
On the Complexity of Intersecting Regular, Context-Free, and Tree Languages. ICALP (2) (2015)
Michael Wehar
Hardness Results for Intersection Non-Emptiness. ICALP (2) (2014)