Home
Mateus De Oliveira Oliveira's picture

Mateus De Oliveira Oliveira

Researcher
  • E-mailMateus.Oliveira@uib.no
  • Phone+47 55 58 42 78
  • Visitor Address
    HIB - Thormøhlens gate 55
  • Postal Address
    Postboks 7803
    5020 Bergen
Academic article
  • Show author(s) 2021. Unitary Branching Programs: Learnability and Lower Bounds. Proceedings of Machine Learning Research (PMLR).
  • Show author(s) 2021. Three is Enough for Steiner Trees. Leibniz International Proceedings in Informatics.
  • Show author(s) 2021. Succinct certification of monotone circuits. Theoretical Computer Science.
  • Show author(s) 2020. Width Notions for Ordering-Related Problems. Leibniz International Proceedings in Informatics. 9:1-9:18.
  • Show author(s) 2020. Succinct Monotone Circuit Certification: Planarity and Parameterized Complexity. Lecture Notes in Computer Science (LNCS). 496-507.
  • Show author(s) 2020. Second-Order Finite Automata. Lecture Notes in Computer Science (LNCS). 46-63.
  • Show author(s) 2020. Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping. Theoretical Computer Science. 27-38.
  • Show author(s) 2020. On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection. Lecture Notes in Computer Science (LNCS). 69-82.
  • Show author(s) 2020. Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. IJCAI International Joint Conference on Artificial Intelligence. 1119-1125.
  • Show author(s) 2020. Compressing permutation groups into grammars and polytopes. A graph embedding approach. Leibniz International Proceedings in Informatics. 50:1-50:15.
  • Show author(s) 2019. Representations of monotone boolean functions by linear programs. ACM Transactions on Computation Theory. 31 pages.
  • Show author(s) 2019. On the width of regular classes of finite structures. Lecture Notes in Computer Science (LNCS). 18-34.
  • Show author(s) 2018. On weak isomorphism of rooted vertex-colored graphs. Lecture Notes in Computer Science (LNCS). 266-278.
  • Show author(s) 2018. Intersection Non-emptiness and Hardness Within Polynomial Time. Lecture Notes in Computer Science (LNCS). 282-290.
  • Show author(s) 2018. Graph amalgamation under logical constraints. Lecture Notes in Computer Science (LNCS). 152-163.
  • Show author(s) 2017. Size-treewidth tradeoffs for circuits computing the element distinctness function. Theory of Computing Systems. 136-161.
  • Show author(s) 2017. Revisiting the parameterized complexity of maximum-duo preservation string mapping. Leibniz International Proceedings in Informatics.
  • Show author(s) 2017. Representations of monotone boolean functions by linear programs. Leibniz International Proceedings in Informatics.
  • Show author(s) 2017. Parameterized provability in equational logic. Lecture Notes in Computer Science (LNCS). 364-380.
  • Show author(s) 2017. On supergraphs satisfying CMSO properties. Leibniz International Proceedings in Informatics.
  • Show author(s) 2017. Ground reachability and joinability in linear term rewriting systems are fixed parameter tractable with respect to depth. Leibniz International Proceedings in Informatics. 1-12.
Academic lecture
  • Show author(s) 2021. Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory.
  • Show author(s) 2020. Symbolic Solutions for Symbolic Constraint Satisfaction Problems.

More information in national current research information system (CRIStin)

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