# Mateus De Oliveira Oliveira

Associate Professor
• E-mailmateus.oliveira@uib.no
• Phone+47 55 58 42 78
HIB - Thormøhlens gate 55
5006 Bergen
Postboks 7803
5020 Bergen
• Show author(s) (2022). Synthesis and Analysis of Petri Nets from Causal Specifications. Lecture Notes in Computer Science (LNCS). 447-467.
• Show author(s) (2022). Second-Order Finite Automata. Theory of Computing Systems. 861-909.
• Show author(s) (2022). On the Satisfiability of Smooth Grid CSPs. Leibniz International Proceedings in Informatics. 14 pages.
• Show author(s) (2022). Mortality and Edge-to-Edge Reachability are Decidable on Surfaces. Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control.
• Show author(s) (2022). Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms. Lecture Notes in Computer Science (LNCS). 398-411.
• Show author(s) (2022). Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. Artificial Intelligence. 15 pages.
• Show author(s) (2022). Computing the zig-zag number of directed graphs. Discrete Applied Mathematics.
• Show author(s) (2021). Unitary Branching Programs: Learnability and Lower Bounds. Proceedings of Machine Learning Research (PMLR). 297-306.
• Show author(s) (2021). Three is Enough for Steiner Trees. Leibniz International Proceedings in Informatics. 5:1-5:15.
• Show author(s) (2021). Succinct certification of monotone circuits. Theoretical Computer Science. 1-13.
• Show author(s) (2021). Order Reconfiguration Under Width Constraints. Leibniz International Proceedings in Informatics. 8:1-8:15.
• Show author(s) (2021). On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. Leibniz International Proceedings in Informatics. 34:1-34:15.
• Show author(s) (2021). On Supergraphs Satisfying CMSO Properties. Logical Methods in Computer Science. 1-22.
• Show author(s) (2021). Diversity in Kemeny Rank Aggregation: A Parameterized Approach. IJCAI International Joint Conference on Artificial Intelligence. 10-16.
• Show author(s) (2021). Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances. Leibniz International Proceedings in Informatics. 42:1-42:17.
• 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) (2019). A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem. Leibniz International Proceedings in Informatics.
• 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.