The following pages link to Mateus de Oliveira Oliveira (Q266805):
Displayed 39 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- Intersection non-emptiness and hardness within polynomial time (Q1622971) (← links)
- Graph amalgamation under logical constraints (Q1627163) (← links)
- On weak isomorphism of rooted vertex-colored graphs (Q1627179) (← links)
- Parameterized provability in equational logic (Q1694478) (← links)
- Size-treewidth tradeoffs for circuits computing the element distinctness function (Q1702852) (← links)
- Succinct monotone circuit certification: planarity and parameterized complexity (Q2019496) (← links)
- Second-order finite automata (Q2158302) (← links)
- Learning from positive and negative examples: dichotomies and parameterized algorithms (Q2169975) (← links)
- Revisiting the parameterized complexity of maximum-duo preservation string mapping (Q2210511) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- On the width of regular classes of finite structures (Q2305404) (← links)
- On the satisfiability of quantum circuits of small treewidth (Q2411047) (← links)
- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory (Q2667823) (← links)
- MSO Logic and the Partial Order Semantics of Place/Transition-Nets (Q2787436) (← links)
- Satisfiability via Smooth Pictures (Q2817998) (← links)
- Causality in Bounded Petri Nets is MSO Definable (Q2820695) (← links)
- A Slice Theoretic Approach for Embedding Problems on Digraphs (Q2827823) (← links)
- Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs (Q2867078) (← links)
- Canonizable Partial Order Generators (Q2890217) (← links)
- Reachability in Graph Transformation Systems and Slice Languages (Q2947215) (← links)
- On the Satisfiability of Quantum Circuits of Small Treewidth (Q3194714) (← links)
- (Q3439708) (← links)
- (Q4601908) (← links)
- (Q4607882) (← links)
- (Q4634409) (← links)
- (Q5028434) (← links)
- On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection (Q5041250) (← links)
- Second-Order Finite Automata (Q5042226) (← links)
- (Q5110875) (← links)
- (Q5111133) (← links)
- (Q5111201) (← links)
- Representations of Monotone Boolean Functions by Linear Programs (Q5205818) (← links)
- Hasse Diagram Generators and Petri Nets (Q5894195) (← links)
- Hasse Diagram Generators and Petri Nets (Q5902129) (← links)
- Learning from positive and negative examples: new proof for binary alphabets (Q6072211) (← links)
- Order Reconfiguration under Width Constraints (Q6075707) (← links)
- Mortality and Edge-to-Edge Reachability are Decidable on Surfaces (Q6120709) (← links)