Academic article

• Mateus De Oliveira Oliveira (2017). On supergraphs satisfying CMSO properties. (external link)
• Christian Komusiewicz; Mateus De Oliveira Oliveira; Meirav Zehavi (2017). Revisiting the parameterized complexity of maximum-duo preservation string mapping. (external link)
• Mateus De Oliveira Oliveira (2025). Sound Over-Approximation of Equational Reasoning with Variable-Preserving Rules Parameterized by Derivation Depth. (external link)
• Gabriel L. Duarte; Mateus De Oliveira Oliveira; Uéverton S. Souza (2021). Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances. (external link)
• Mateus De Oliveira Oliveira; Pavel Pudlak (2017). Representations of monotone boolean functions by linear programs. (external link)
• Emmanuel Jean Paul Pierre Arrighi; Henning Fernau; Stefan Hoffmann et al. (2021). On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. (external link)
• Jonas Lingg; Mateus De Oliveira Oliveira; Petra Henrike Karola Wolf (2022). Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms. (external link)
• Mateus De Oliveira Oliveira (2017). Size-treewidth tradeoffs for circuits computing the element distinctness function. (external link)
• Alexsander Andrade de Melo; Mateus De Oliveira Oliveira (2019). On the width of regular classes of finite structures. (external link)
• Mateus De Oliveira Oliveira (2017). Parameterized provability in equational logic. (external link)
• Julien Baste; Michael Fellows; Lars Jaffke et al. (2020). Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. (external link)
• Mateus De Oliveira Oliveira; Wim van den Broeck (2024). Optimal Extended Formulations from Optimal Dynamic Programming Algorithms. (external link)
• Mateus De Oliveira Oliveira (2021). On Supergraphs Satisfying CMSO Properties. (external link)
• Mateus De Oliveira Oliveira (2017). Ground reachability and joinability in linear term rewriting systems are fixed parameter tractable with respect to depth. (external link)
• Mateus De Oliveira Oliveira (2022). Synthesis and Analysis of Petri Nets from Causal Specifications. (external link)
• Mateus De Oliveira Oliveira; Wim van den Broeck (2025). Symbolic Functional Decomposition: A Reconfiguration Approach. (external link)
• Mateus Rodrigues Alves; Mateus De Oliveira Oliveira; Janio Carlos Nascimento Silva et al. (2020). Succinct Monotone Circuit Certification: Planarity and Parameterized Complexity. (external link)
• Christian Komusiewicz; Mateus De Oliveira Oliveira; Meirav Zehavi (2020). Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping. (external link)
• Mateus De Oliveira Oliveira; Pavel Pudlák (2019). Representations of monotone boolean functions by linear programs. (external link)
• Mateus De Oliveira Oliveira; Farhad Vadiee (2023). From Width-Based Model Checking to Width-Based Automated Theorem Proving. (external link)
• Emmanuel Arrighi; Henning Fernau; Mateus De Oliveira Oliveira et al. (2020). Width Notions for Ordering-Related Problems. (external link)
• Lars Jaffke; Mateus De Oliveira Oliveira (2018). On weak isomorphism of rooted vertex-colored graphs. (external link)
• Mitre Dourado; Celina de Figueiredo; Alexsander Andrade de Melo et al. (2022). Computing the zig-zag number of directed graphs. (external link)
• Emmanuel Jean Paul Pierre Arrighi; Henning Fernau; Daniel Lokshtanov et al. (2021). Diversity in Kemeny Rank Aggregation: A Parameterized Approach. (external link)
• Emmanuel Jean Paul Pierre Arrighi; Henning Fernau; Mateus De Oliveira Oliveira et al. (2021). Order Reconfiguration Under Width Constraints. (external link)
• Alexsander Andrade de Melo; Mateus De Oliveira Oliveira (2022). Second-Order Finite Automata. (external link)
• Mateus De Oliveira Oliveira; Michael Wehar (2020). On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection. (external link)
• Emmanuel Arrighi; Mateus De Oliveira Oliveira (2021). Three is Enough for Steiner Trees. (external link)
• Mateus De Oliveira Oliveira (2018). Graph amalgamation under logical constraints. (external link)
• Julien Baste; Michael Ralph Fellows; Lars Jaffke et al. (2022). Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. (external link)
• Mateus De Oliveira Oliveira; Farhad Vadiee (2024). State Canonization and Early Pruning in Width-Based Automated Theorem Proving. (external link)
• Vasily Alferov; Mateus De Oliveira Oliveira (2022). On the Satisfiability of Smooth Grid CSPs. (external link)
• Daniel Lokshtanov; Mateus De Oliveira Oliveira; Saket Saurabh (2019). A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem. (external link)
• Emmanuel Jean Paul Pierre Arrighi; Henning Fernau; Mateus De Oliveira Oliveira et al. (2023). Synchronization and Diversity of Solutions. (external link)
• Emmanuel Jean Paul Pierre Arrighi; Henning Fernau; Mateus De Oliveira Oliveira et al. (2023). Order Reconfiguration under Width Constraints. (external link)
• Jonas Lingg; Mateus De Oliveira Oliveira; Petra Henrike Karola Wolf (2023). Learning from positive and negative examples: New proof for binary alphabets. (external link)
• Lars Jaffke; Mateus De Oliveira Oliveira; Hans Raj Tiwary (2020). Compressing permutation groups into grammars and polytopes. A graph embedding approach. (external link)
• Mateus Rodrigues Alves; Mateus De Oliveira Oliveira; Janio Carlos Nascimento Silva et al. (2021). Succinct certification of monotone circuits. (external link)
• Fidel Ernesto Diaz Andino; Maria Kokkou; Mateus De Oliveira Oliveira et al. (2021). Unitary Branching Programs: Learnability and Lower Bounds. (external link)
• Mateus De Oliveira Oliveira; Michael Wehar (2018). Intersection Non-emptiness and Hardness Within Polynomial Time. (external link)
• Alexsander Andrade de Melo; Mateus De Oliveira Oliveira (2020). Second-Order Finite Automata. (external link)
• Mateus De Oliveira Oliveira; Olga Tveretina (2022). Mortality and Edge-to-Edge Reachability are Decidable on Surfaces. (external link)

Conference lecture

• Frances Rosamond; Lars Jaffke; Mateus De Oliveira Oliveira et al. (2021). Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. (external link)
• Mateus De Oliveira Oliveira; Alexsander Andrade de Melo (2020). Symbolic Solutions for Symbolic Constraint Satisfaction Problems. (external link)

See a complete overview of publications in Cristin.

Autoproving - Automated Theorem Proving from the Mindset of Parameterized Complexity Theory (Research Council of Norway, 8 Million NOK)