Mateus de Oliveira Oliveira

According to our database1, Mateus de Oliveira Oliveira authored at least 30 papers between 2005 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 





Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection.
Proceedings of the Developments in Language Theory - 24th International Conference, 2020

Second-Order Finite Automata.
Proceedings of the Computer Science - Theory and Applications, 2020

Succinct Monotone Circuit Certification: Planarity and Parameterized Complexity.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Diversity in Combinatorial Optimization.
CoRR, 2019

On the Width of Regular Classes of Finite Structures.
Proceedings of the Automated Deduction - CADE 27, 2019

Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function.
Theory Comput. Syst., 2018

Graph Amalgamation Under Logical Constraints.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

On Weak Isomorphism of Rooted Vertex-Colored Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem.
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Intersection Non-emptiness and Hardness Within Polynomial Time.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

On the Satisfiability of Quantum Circuits of Small Treewidth.
Theory Comput. Syst., 2017

Representations of Monotone Boolean Functions by Linear Programs.
Electron. Colloquium Comput. Complex., 2017

Parameterized Provability in Equational Logic.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017

On Supergraphs Satisfying CMSO Properties.
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

An algorithmic metatheorem for directed treewidth.
Discret. Appl. Math., 2016

Causality in Bounded Petri Nets is MSO Definable.
Proceedings of the Logic, Language, Information, and Computation, 2016

Satisfiability via Smooth Pictures.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Ground Reachability and Joinability in Linear Term Rewriting Systems are Fixed Parameter Tractable with Respect to Depth.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

A Slice Theoretic Approach for Embedding Problems on Digraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

MSO Logic and the Partial Order Semantics of Place/Transition-Nets.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Reachability in Graph Transformation Systems and Slice Languages.
Proceedings of the Graph Transformation - 8th International Conference, 2015

Automated Verification, Synthesis and Correction of Concurrent Systems via MSO Logic.
CoRR, 2014

Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Canonizable Partial Order Generators.
Proceedings of the Language and Automata Theory and Applications, 2012

Hasse Diagram Generators and Petri Nets.
Fundam. Informaticae, 2010

A new refinement procedure for graph isomorphism algorithms.
Electron. Notes Discret. Math., 2005