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øhlensgt. 55
  • Postal Address
    Postboks 7803
    5020 Bergen
Academic article
  • 2020. Compressing permutation groups into grammars and polytopes. A graph embedding approach. Leibniz International Proceedings in Informatics. 1-15.
  • 2019. Representations of monotone boolean functions by linear programs. ACM Transactions on Computation Theory. 31 pages.
  • 2019. On the width of regular classes of finite structures. Lecture Notes in Computer Science (LNCS). 18-34.
  • 2018. On weak isomorphism of rooted vertex-colored graphs. Lecture Notes in Computer Science (LNCS). 266-278.
  • 2018. Intersection Non-emptiness and Hardness Within Polynomial Time. Lecture Notes in Computer Science (LNCS). 282-290.
  • 2018. Graph amalgamation under logical constraints. Lecture Notes in Computer Science (LNCS). 152-163.
  • 2017. Size-treewidth tradeoffs for circuits computing the element distinctness function. Theory of Computing Systems. 136-161.
  • 2017. Revisiting the parameterized complexity of maximum-duo preservation string mapping. Leibniz International Proceedings in Informatics.
  • 2017. Representations of monotone boolean functions by linear programs. Leibniz International Proceedings in Informatics.
  • 2017. Parameterized provability in equational logic. Lecture Notes in Computer Science (LNCS). 364-380.
  • 2017. On supergraphs satisfying CMSO properties. Leibniz International Proceedings in Informatics.
  • 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.

More information in national current research information system (CRIStin)