The following pages link to Anthony Perez (Q393082):
Displaying 27 items.
- Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
- Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- On the complexity of broadcast domination and multipacking In digraphs (Q1979448) (← links)
- Direction matters in complex networks: a theoretical and applied study for greedy modularity optimization (Q2162958) (← links)
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← links)
- Exact algorithms for weak Roman domination (Q2413969) (← links)
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel (Q2672433) (← links)
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
- An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (Q2827805) (← links)
- Exact Algorithms for Weak Roman Domination (Q2870018) (← links)
- Kernels for feedback arc set in tournaments (Q2920111) (← links)
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699) (← links)
- Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem (Q3088066) (← links)
- Polynomial Kernels for Proper Interval Completion and Related Problems (Q3088286) (← links)
- Polynomial Kernels for 3-Leaf Power Graph Modification Problems (Q3651535) (← links)
- Linear Vertex-kernels for Several Dense Ranking r -Constraint Satisfaction Problems (Q4922137) (← links)
- On the Complexity of Broadcast Domination and Multipacking in Digraphs (Q5041195) (← links)
- (Q6168461) (← links)
- (Q6192485) (← links)
- Detecting $K_{2,3}$ as an induced minor (Q6521576) (← links)
- On graphs coverable by \({k}\) shortest paths (Q6561322) (← links)
- On graphs coverable by \(k\) shortest paths (Q6602460) (← links)
- Sufficient conditions for polynomial-time detection of induced minors (Q6760505) (← links)
