Mateus de Oliveira Oliveira
Mateus de Oliveira Oliveira
Stockholm University
Verified email at - Homepage
Cited by
Cited by
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory
J Baste, MR Fellows, L Jaffke, T Masařík, M de Oliveira Oliveira, G Philip, ...
Artificial Intelligence 303, 103644, 2022
Hasse diagram generators and Petri nets
M de Oliveira Oliveira
Fundamenta Informaticae 105 (3), 263-289, 2010
Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs
M de Oliveira Oliveira
Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013
Canonizable partial order generators
M de Oliveira Oliveira
Language and Automata Theory and Applications: 6th International Conference …, 2012
An algorithmic metatheorem for directed treewidth
M de Oliveira Oliveira
Discrete Applied Mathematics 204, 49-76, 2016
On the fine grained complexity of finite automata non-emptiness of intersection
M de Oliveira Oliveira, M Wehar
International Conference on Developments in Language Theory, 69-82, 2020
Intersection non-emptiness and hardness within polynomial time
M de Oliveira Oliveira, M Wehar
International Conference on Developments in Language Theory, 282-290, 2018
Diversity in Kemeny rank aggregation: A parameterized approach
E Arrighi, H Fernau, D Lokshtanov, MO Oliveira, P Wolf
arXiv preprint arXiv:2105.09413, 2021
Size-treewidth tradeoffs for circuits computing the element distinctness function
M de Oliveira Oliveira
Theory of Computing Systems 62, 136-161, 2018
Representations of monotone Boolean functions by linear programs
MDO Oliveira, P Pudlák
ACM Transactions on Computation Theory (TOCT) 11 (4), 1-31, 2019
A new refinement procedure for graph isomorphism algorithms.
M de Oliveira Oliveira, F Greve
Electron. Notes Discret. Math. 19, 373-379, 2005
Co-degeneracy and co-treewidth: using the complement to solve dense instances
G Duarte, MDO Oliveira, US Souza
Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2021
On the satisfiability of quantum circuits of small treewidth
M de Oliveira Oliveira
Computer Science--Theory and Applications: 10th International Computer …, 2015
On the complexity of intersection non-emptiness for star-free language classes
E Arrighi, H Fernau, S Hoffmann, M Holzer, I Jecker, MO Oliveira, P Wolf
arXiv preprint arXiv:2110.01279, 2021
On Supergraphs satisfying CMSO properties
M de Oliveira Oliveira
Logical Methods in Computer Science 17, 2021
Revisiting the parameterized complexity of maximum-duo preservation string mapping
C Komusiewicz, M de Oliveira Oliveira, M Zehavi
Theoretical Computer Science 847, 27-38, 2020
Embezzlement States are Universal for Non-Local Strategies
MO Oliveira
arXiv preprint arXiv:1009.0771, 2010
Synchronization and diversity of solutions
E Arrighi, H Fernau, M de Oliveira Oliveira, P Wolf
Proceedings of the AAAI Conference on Artificial Intelligence 37 (10), 11516 …, 2023
On the width of regular classes of finite structures
A Andrade de Melo, M de Oliveira Oliveira
Automated Deduction–CADE 27: 27th International Conference on Automated …, 2019
Second-order finite automata
AA de Melo, M de Oliveira Oliveira
Theory of Computing Systems 66 (4), 861-909, 2022
The system can't perform the operation now. Try again later.
Articles 1–20