A new refinement procedure for graph isomorphism algorithms. - Mateus de Oliveira Oliveira; Fabíola Greve (Electron. Notes Discret. Math., 2005)

Hasse Diagram Generators and Petri Nets. - Mateus de Oliveira Oliveira (Fundam. Informaticae, 2010)

Canonizable Partial Order Generators. - Mateus de Oliveira Oliveira (LATA, 2012)

Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs. - Mateus de Oliveira Oliveira (IPEC, 2013)

Combinatorial Slice Theory. - Mateus de Oliveira Oliveira (2013)

Automated Verification, Synthesis and Correction of Concurrent Systems via MSO Logic. - Mateus de Oliveira Oliveira (CoRR, 2014)

Reachability in Graph Transformation Systems and Slice Languages. - Mateus de Oliveira Oliveira (ICGT, 2015)

MSO Logic and the Partial Order Semantics of Place/Transition-Nets. - Mateus de Oliveira Oliveira (ICTAC, 2015)

A Slice Theoretic Approach for Embedding Problems on Digraphs. - Mateus de Oliveira Oliveira (WG, 2015)

Ground Reachability and Joinability in Linear Term Rewriting Systems are Fixed Parameter Tractable with Respect to Depth. - Mateus de Oliveira Oliveira (IPEC, 2016)

Satisfiability via Smooth Pictures. - Mateus de Oliveira Oliveira (SAT, 2016)

Causality in Bounded Petri Nets is MSO Definable. - Mateus de Oliveira Oliveira (WoLLIC, 2016)

An algorithmic metatheorem for directed treewidth. - Mateus de Oliveira Oliveira (Discret. Appl. Math., 2016)

Parameterized Provability in Equational Logic. - Mateus de Oliveira Oliveira (TABLEAUX, 2017)

Representations of Monotone Boolean Functions by Linear Programs. - Mateus de Oliveira Oliveira; Pavel Pudlák (Electron. Colloquium Comput. Complex., 2017)

On the Satisfiability of Quantum Circuits of Small Treewidth. - Mateus de Oliveira Oliveira (Theory Comput. Syst., 2017)

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

A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem. - Daniel Lokshtanov; Mateus de Oliveira Oliveira; Saket Saurabh 001 (IPEC, 2018)

A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth. - Mateus de Oliveira Oliveira (SODA, 2018)

On Weak Isomorphism of Rooted Vertex-Colored Graphs. - Lars Jaffke; Mateus de Oliveira Oliveira (WG, 2018)

Graph Amalgamation Under Logical Constraints. - Mateus de Oliveira Oliveira (WG, 2018)

Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function. - Mateus de Oliveira Oliveira (Theory Comput. Syst., 2018)

On the Width of Regular Classes of Finite Structures. - Alexsander Andrade de Melo; Mateus de Oliveira Oliveira (CADE, 2019)

Diversity in Combinatorial Optimization. - Julien Baste; Michael R. Fellows; Lars Jaffke; Tomás Masarík; Mateus de Oliveira Oliveira; Geevarghese Philip; Frances A. Rosamond (CoRR, 2019)

Succinct Monotone Circuit Certification: Planarity and Parameterized Complexity. - Mateus Rodrigues Alves; Mateus de Oliveira Oliveira; Janio Carlos Nascimento Silva; Uéverton dos Santos Souza (COCOON, 2020)

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

Width Notions for Ordering-Related Problems. - Emmanuel Arrighi; Henning Fernau; Mateus de Oliveira Oliveira; Petra Wolf 002 (FSTTCS, 2020)

Symbolic Solutions for Symbolic Constraint Satisfaction Problems. - Alexsander Andrade de Melo; Mateus de Oliveira Oliveira (KR, 2020)

Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach. - Lars Jaffke; Mateus de Oliveira Oliveira; Hans Raj Tiwary (MFCS, 2020)

Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping. - Christian Komusiewicz; Mateus de Oliveira Oliveira; Meirav Zehavi (Theor. Comput. Sci., 2020)

On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. - Emmanuel Arrighi; Henning Fernau; Stefan Hoffmann 001; Markus Holzer 001; Ismaël Jecker; Mateus de Oliveira Oliveira; Petra Wolf 002 (FSTTCS, 2021)

Unitary Branching Programs: Learnability and Lower Bounds. - Fidel Ernesto Diaz Andino; Maria Kokkou; Mateus de Oliveira Oliveira; Farhad Vadiee (ICML, 2021)

Diversity in Kemeny Rank Aggregation: A Parameterized Approach. - Emmanuel Arrighi; Henning Fernau; Daniel Lokshtanov; Mateus de Oliveira Oliveira; Petra Wolf 002 (IJCAI, 2021)

Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances. - Gabriel L. Duarte; Mateus de Oliveira Oliveira; Uéverton S. Souza (MFCS, 2021)

Three Is Enough for Steiner Trees. - Emmanuel Arrighi; Mateus de Oliveira Oliveira (SEA, 2021)

On Supergraphs Satisfying CMSO Properties. - Mateus de Oliveira Oliveira (Log. Methods Comput. Sci., 2021)

Succinct certification of monotone circuits. - Mateus Rodrigues Alves; Mateus de Oliveira Oliveira; Janio Carlos Nascimento Silva; Uéverton dos Santos Souza (Theor. Comput. Sci., 2021)

Synthesis and Analysis of Petri Nets from Causal Specifications. - Mateus de Oliveira Oliveira (CAV (2), 2022)

Mortality and Edge-to-Edge Reachability are Decidable on Surfaces. - Mateus de Oliveira Oliveira; Olga Tveretina (HSCC, 2022)

Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms. - Jonas Lingg; Mateus de Oliveira Oliveira; Petra Wolf 002 (IWOCA, 2022)

On the Satisfiability of Smooth Grid CSPs. - Vasily Alferov; Mateus de Oliveira Oliveira (SEA, 2022)

Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. - Julien Baste; Michael R. Fellows; Lars Jaffke; Tomás Masarík; Mateus de Oliveira Oliveira; Geevarghese Philip; Frances A. Rosamond (Artif. Intell., 2022)

Computing the zig-zag number of directed graphs. - Mitre Costa Dourado; Celina M. H. de Figueiredo; Alexsander Andrade de Melo; Mateus de Oliveira Oliveira; Uéverton S. Souza (Discret. Appl. Math., 2022)

Second-Order Finite Automata. - Alexsander Andrade de Melo; Mateus de Oliveira Oliveira (Theory Comput. Syst., 2022)

Synchronization and Diversity of Solutions. - Emmanuel Arrighi; Henning Fernau; Mateus de Oliveira Oliveira; Petra Wolf 002 (AAAI, 2023)

From Width-Based Model Checking to Width-Based Automated Theorem Proving. - Mateus de Oliveira Oliveira; Farhad Vadiee (AAAI, 2023)

Order Reconfiguration under Width Constraints. - Emmanuel Arrighi; Henning Fernau; Mateus de Oliveira Oliveira; Petra Wolf 002 (J. Graph Algorithms Appl., 2023)

State Canonization and Early Pruning in Width-Based Automated Theorem Proving. - Mateus de Oliveira Oliveira; Farhad Vadiee (FSCD, 2024)

Optimal Extended Formulations from Optimal Dynamic Programming Algorithms. - Mateus de Oliveira Oliveira; Wim Vanden Broeck (IJCAI, 2024)

Learning from positive and negative examples: New proof for binary alphabets. - Jonas Lingg; Mateus de Oliveira Oliveira; Petra Wolf 002 (Inf. Process. Lett., 2024)

Sound Over-Approximation of Equational Reasoning with Variable-Preserving Rules Parameterized by Derivation Depth. - Mateus de Oliveira Oliveira (AAAI, 2025)

Symbolic Functional Decomposition: A Reconfiguration Approach. - Mateus de Oliveira Oliveira; Wim Vanden Broeck (AAAI, 2025)