Mateus de Oliveira Oliveira

Inf. Process. Lett., January, 2024

2023

Order Reconfiguration under Width Constraints.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2023

From Width-Based Model Checking to Width-Based Automated Theorem Proving.

[BibT_eX]

[DOI]

Farhad Vadiee

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Synchronization and Diversity of Solutions.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Second-Order Finite Automata.

[BibT_eX]

[DOI]

Celina M. H. de Figueiredo

Theory Comput. Syst., 2022

Computing the zig-zag number of directed graphs.

[BibT_eX]

[DOI]

Mitre Costa Dourado

Uéverton S. Souza

Discret. Appl. Math., 2022

Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory.

[BibT_eX]

[DOI]

Geevarghese Philip

Frances A. Rosamond

Artif. Intell., 2022

On the Satisfiability of Smooth Grid CSPs.

[BibT_eX]

[DOI]

Vasily Alferov

Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms.

[BibT_eX]

[DOI]

Jonas Lingg

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Mortality and Edge-to-Edge Reachability are Decidable on Surfaces.

[BibT_eX]

[DOI]

Olga Tveretina

Proceedings of the HSCC '22: 25th ACM International Conference on Hybrid Systems: Computation and Control, Milan, Italy, May 4, 2022

Synthesis and Analysis of Petri Nets from Causal Specifications.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021

Succinct certification of monotone circuits.

[BibT_eX]

[DOI]

Mateus Rodrigues Alves

Janio Carlos Nascimento Silva

Uéverton dos Santos Souza

Theor. Comput. Sci., 2021

On Supergraphs Satisfying CMSO Properties.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2021

Three Is Enough for Steiner Trees.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances.

[BibT_eX]

[DOI]

Gabriel L. Duarte

Uéverton S. Souza

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Diversity in Kemeny Rank Aggregation: A Parameterized Approach.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Fidel Ernesto Diaz Andino

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Unitary Branching Programs: Learnability and Lower Bounds.

[BibT_eX]

[DOI]

Maria Kokkou

Farhad Vadiee

Proceedings of the 38th International Conference on Machine Learning, 2021

On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.

[BibT_eX]

[DOI]

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping.

[BibT_eX]

[DOI]

Christian Komusiewicz

Meirav Zehavi

Theor. Comput. Sci., 2020

Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach.

[BibT_eX]

[DOI]

Lars Jaffke

Hans Raj Tiwary

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Symbolic Solutions for Symbolic Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Width Notions for Ordering-Related Problems.

[BibT_eX]

[DOI]

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection.

[BibT_eX]

[DOI]

Michael Wehar

Proceedings of the Developments in Language Theory - 24th International Conference, 2020

Succinct Monotone Circuit Certification: Planarity and Parameterized Complexity.

[BibT_eX]

[DOI]

Mateus Rodrigues Alves

Janio Carlos Nascimento Silva

Uéverton dos Santos Souza

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Diversity in Combinatorial Optimization.

[BibT_eX]

[DOI]

Geevarghese Philip

Frances A. Rosamond

CoRR, 2019

On the Width of Regular Classes of Finite Structures.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE 27, 2019

2018

Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Graph Amalgamation Under Logical Constraints.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

On Weak Isomorphism of Rooted Vertex-Colored Graphs.

[BibT_eX]

[DOI]

Lars Jaffke

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Saket Saurabh

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Intersection Non-emptiness and Hardness Within Polynomial Time.

[BibT_eX]

[DOI]

Michael Wehar

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

On the Satisfiability of Quantum Circuits of Small Treewidth.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Representations of Monotone Boolean Functions by Linear Programs.

[BibT_eX]

[DOI]

Pavel Pudlák

Electron. Colloquium Comput. Complex., 2017

Parameterized Provability in Equational Logic.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017

2016

An algorithmic metatheorem for directed treewidth.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Causality in Bounded Petri Nets is MSO Definable.

[BibT_eX]

[DOI]

Proceedings of the Logic, Language, Information, and Computation, 2016

Satisfiability via Smooth Pictures.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Ground Reachability and Joinability in Linear Term Rewriting Systems are Fixed Parameter Tractable with Respect to Depth.

[BibT_eX]

[DOI]

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015

A Slice Theoretic Approach for Embedding Problems on Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

MSO Logic and the Partial Order Semantics of Place/Transition-Nets.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Reachability in Graph Transformation Systems and Slice Languages.

[BibT_eX]

[DOI]

Proceedings of the Graph Transformation - 8th International Conference, 2015

2014

Automated Verification, Synthesis and Correction of Concurrent Systems via MSO Logic.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Combinatorial Slice Theory.

[BibT_eX]

[DOI]

PhD thesis, 2013

Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2012

Canonizable Partial Order Generators.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2012

2010

Hasse Diagram Generators and Petri Nets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

2005

A new refinement procedure for graph isomorphism algorithms.

[BibT_eX]

[DOI]