default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMateus de Oliveira Oliveira
Person information
- affiliation: University of Bergen, Norway
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Jonas Lingg, Mateus de Oliveira Oliveira
, Petra Wolf:
Learning from positive and negative examples: New proof for binary alphabets. Inf. Process. Lett. 183: 106427 (2024)- [c42]Mateus de Oliveira Oliveira, Farhad Vadiee:
State Canonization and Early Pruning in Width-Based Automated Theorem Proving. FSCD 2024: 33:1-33:17 - [c41]Mateus de Oliveira Oliveira, Wim Vanden Broeck:
Optimal Extended Formulations from Optimal Dynamic Programming Algorithms. IJCAI 2024: 1881-1888 - 2023
- [j13]Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf:
Order Reconfiguration under Width Constraints. J. Graph Algorithms Appl. 27(6): 409-431 (2023) - [c40]Mateus de Oliveira Oliveira, Farhad Vadiee:
From Width-Based Model Checking to Width-Based Automated Theorem Proving. AAAI 2023: 6297-6304 - [c39]Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf:
Synchronization and Diversity of Solutions. AAAI 2023: 11516-11524 - 2022
- [j12]Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond:
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. Artif. Intell. 303: 103644 (2022) - [j11]Mitre Costa Dourado, Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Mateus de Oliveira Oliveira, Uéverton S. Souza:
Computing the zig-zag number of directed graphs. Discret. Appl. Math. 312: 86-105 (2022) - [j10]Alexsander Andrade de Melo, Mateus de Oliveira Oliveira:
Second-Order Finite Automata. Theory Comput. Syst. 66(4): 861-909 (2022) - [c38]Mateus de Oliveira Oliveira:
Synthesis and Analysis of Petri Nets from Causal Specifications. CAV (2) 2022: 447-467 - [c37]Mateus de Oliveira Oliveira, Olga Tveretina:
Mortality and Edge-to-Edge Reachability are Decidable on Surfaces. HSCC 2022: 16:1-16:10 - [c36]Jonas Lingg, Mateus de Oliveira Oliveira, Petra Wolf:
Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms. IWOCA 2022: 398-411 - [c35]Vasily Alferov, Mateus de Oliveira Oliveira:
On the Satisfiability of Smooth Grid CSPs. SEA 2022: 18:1-18:14 - [i16]Mateus de Oliveira Oliveira, Farhad Vadiee:
From Width-Based Model Checking to Width-Based Automated Theorem Proving. CoRR abs/2205.10995 (2022) - [i15]Jonas Lingg, Mateus de Oliveira Oliveira, Petra Wolf:
Learning from Positive and Negative Examples: New Proof for Binary Alphabets. CoRR abs/2206.10025 (2022) - 2021
- [j9]Mateus de Oliveira Oliveira:
On Supergraphs Satisfying CMSO Properties. Log. Methods Comput. Sci. 17(4) (2021) - [j8]Mateus Rodrigues Alves, Mateus de Oliveira Oliveira, Janio Carlos Nascimento Silva, Uéverton dos Santos Souza:
Succinct certification of monotone circuits. Theor. Comput. Sci. 889: 1-13 (2021) - [c34]Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf:
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. FSTTCS 2021: 34:1-34:15 - [c33]Fidel Ernesto Diaz Andino, Maria Kokkou, Mateus de Oliveira Oliveira, Farhad Vadiee:
Unitary Branching Programs: Learnability and Lower Bounds. ICML 2021: 297-306 - [c32]Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf:
Diversity in Kemeny Rank Aggregation: A Parameterized Approach. IJCAI 2021: 10-16 - [c31]Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf:
Order Reconfiguration Under Width Constraints. MFCS 2021: 8:1-8:15 - [c30]Gabriel L. Duarte, Mateus de Oliveira Oliveira, Uéverton S. Souza:
Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances. MFCS 2021: 42:1-42:17 - [c29]Emmanuel Arrighi, Mateus de Oliveira Oliveira:
Three Is Enough for Steiner Trees. SEA 2021: 5:1-5:15 - [i14]Alexsander Andrade de Melo, Mateus de Oliveira Oliveira:
On the Width of Regular Classes of Finite Structures. CoRR abs/2104.10286 (2021) - [i13]Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf:
Diversity in Kemeny Rank Aggregation: A Parameterized Approach. CoRR abs/2105.09413 (2021) - [i12]Alexsander Andrade de Melo, Mateus de Oliveira Oliveira:
Second-Order Finite Automata. CoRR abs/2108.12751 (2021) - [i11]Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf:
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. CoRR abs/2110.01279 (2021) - 2020
- [j7]Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi:
Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping. Theor. Comput. Sci. 847: 27-38 (2020) - [c28]Mateus Rodrigues Alves, Mateus de Oliveira Oliveira, Janio Carlos Nascimento Silva, Uéverton dos Santos Souza:
Succinct Monotone Circuit Certification: Planarity and Parameterized Complexity. COCOON 2020: 496-507 - [c27]Alexsander Andrade de Melo, Mateus de Oliveira Oliveira:
Second-Order Finite Automata. CSR 2020: 46-63 - [c26]Mateus de Oliveira Oliveira, Michael Wehar:
On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection. DLT 2020: 69-82 - [c25]Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf:
Width Notions for Ordering-Related Problems. FSTTCS 2020: 9:1-9:18 - [c24]Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond:
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. IJCAI 2020: 1119-1125 - [c23]Alexsander Andrade de Melo, Mateus de Oliveira Oliveira:
Symbolic Solutions for Symbolic Constraint Satisfaction Problems. KR 2020: 49-58 - [c22]Lars Jaffke, Mateus de Oliveira Oliveira, Hans Raj Tiwary:
Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach. MFCS 2020: 50:1-50:15 - [i10]Mateus de Oliveira Oliveira:
On Supergraphs Satisfying CMSO Properties. CoRR abs/2001.00758 (2020) - [i9]Lars Jaffke, Mateus de Oliveira Oliveira, Hans Raj Tiwary:
Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach. CoRR abs/2001.05583 (2020)
2010 – 2019
- 2019
- [j6]Mateus de Oliveira Oliveira, Pavel Pudlák:
Representations of Monotone Boolean Functions by Linear Programs. ACM Trans. Comput. Theory 11(4): 22:1-22:31 (2019) - [c21]Alexsander Andrade de Melo, Mateus de Oliveira Oliveira:
On the Width of Regular Classes of Finite Structures. CADE 2019: 18-34 - [i8]Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond:
Diversity in Combinatorial Optimization. CoRR abs/1903.07410 (2019) - 2018
- [j5]Mateus de Oliveira Oliveira:
Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function. Theory Comput. Syst. 62(1): 136-161 (2018) - [c20]Mateus de Oliveira Oliveira, Michael Wehar:
Intersection Non-emptiness and Hardness Within Polynomial Time. DLT 2018: 282-290 - [c19]Daniel Lokshtanov, Mateus de Oliveira Oliveira, Saket Saurabh:
A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem. IPEC 2018: 25:1-25:13 - [c18]Mateus de Oliveira Oliveira:
A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth. SODA 2018: 136-145 - [c17]Mateus de Oliveira Oliveira:
Graph Amalgamation Under Logical Constraints. WG 2018: 152-163 - [c16]Lars Jaffke, Mateus de Oliveira Oliveira:
On Weak Isomorphism of Rooted Vertex-Colored Graphs. WG 2018: 266-278 - 2017
- [j4]Mateus de Oliveira Oliveira:
On the Satisfiability of Quantum Circuits of Small Treewidth. Theory Comput. Syst. 61(2): 656-688 (2017) - [c15]Mateus de Oliveira Oliveira, Pavel Pudlák:
Representations of Monotone Boolean Functions by Linear Programs. CCC 2017: 3:1-3:14 - [c14]Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi:
Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping. CPM 2017: 11:1-11:17 - [c13]Mateus de Oliveira Oliveira:
On Supergraphs Satisfying CMSO Properties. CSL 2017: 33:1-33:15 - [c12]Mateus de Oliveira Oliveira:
Parameterized Provability in Equational Logic. TABLEAUX 2017: 364-380 - [i7]Mateus de Oliveira Oliveira, Pavel Pudlák:
Representations of Monotone Boolean Functions by Linear Programs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j3]Mateus de Oliveira Oliveira:
An algorithmic metatheorem for directed treewidth. Discret. Appl. Math. 204: 49-76 (2016) - [c11]Mateus de Oliveira Oliveira:
Ground Reachability and Joinability in Linear Term Rewriting Systems are Fixed Parameter Tractable with Respect to Depth. IPEC 2016: 25:1-25:12 - [c10]Mateus de Oliveira Oliveira:
Satisfiability via Smooth Pictures. SAT 2016: 13-28 - [c9]Mateus de Oliveira Oliveira:
Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function. STACS 2016: 56:1-56:14 - [c8]Mateus de Oliveira Oliveira:
Causality in Bounded Petri Nets is MSO Definable. WoLLIC 2016: 200-214 - [i6]Mateus de Oliveira Oliveira:
A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth. CoRR abs/1609.09643 (2016) - 2015
- [c7]Mateus de Oliveira Oliveira:
On the Satisfiability of Quantum Circuits of Small Treewidth. CSR 2015: 157-172 - [c6]Mateus de Oliveira Oliveira:
Reachability in Graph Transformation Systems and Slice Languages. ICGT 2015: 121-137 - [c5]Mateus de Oliveira Oliveira:
MSO Logic and the Partial Order Semantics of Place/Transition-Nets. ICTAC 2015: 368-387 - [c4]Mateus de Oliveira Oliveira:
A Slice Theoretic Approach for Embedding Problems on Digraphs. WG 2015: 360-372 - 2014
- [i5]Mateus de Oliveira Oliveira:
Automated Verification, Synthesis and Correction of Concurrent Systems via MSO Logic. CoRR abs/1402.2698 (2014) - [i4]Mateus de Oliveira Oliveira:
On the Satisfiability of Quantum Circuits of Small Treewidth. CoRR abs/1404.5565 (2014) - [i3]Mateus de Oliveira Oliveira:
An Algorithmic Metatheorem for Directed Treewidth. CoRR abs/1410.0589 (2014) - 2013
- [b1]Mateus de Oliveira Oliveira:
Combinatorial Slice Theory. KTH Royal Institute of Technology, Sweden, 2013 - [c3]Mateus de Oliveira Oliveira:
Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs. IPEC 2013: 123-136 - [i2]Mateus de Oliveira Oliveira:
Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs. CoRR abs/1303.4443 (2013) - 2012
- [c2]Mateus de Oliveira Oliveira:
Canonizable Partial Order Generators. LATA 2012: 445-457 - 2010
- [j2]Mateus de Oliveira Oliveira:
Hasse Diagram Generators and Petri Nets. Fundam. Informaticae 105(3): 263-289 (2010) - [i1]Mateus de Oliveira Oliveira:
Canonizable Partial Order Generators. CoRR abs/1009.5341 (2010)
2000 – 2009
- 2009
- [c1]Mateus de Oliveira Oliveira:
Hasse Diagram Generators and Petri Nets. Petri Nets 2009: 183-203 - 2005
- [j1]Mateus de Oliveira Oliveira, Fabíola Greve:
A new refinement procedure for graph isomorphism algorithms. Electron. Notes Discret. Math. 19: 373-379 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
