The following pages link to Uéverton S. Souza (Q317428):
Displaying 50 items.
- Extremal values and bounds for the zero forcing number (Q317429) (← links)
- On the terminal connection problem (Q831820) (← links)
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) (← links)
- On the hardness of finding the geodetic number of a subcubic graph (Q1708262) (← links)
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number (Q1752485) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- Fine-grained parameterized complexity analysis of knot-free vertex deletion -- a deadlock resolution graph problem (Q1790957) (← links)
- Linear-time algorithms for eliminating claws in graphs (Q2019430) (← links)
- Reducing graph transversals via edge contractions (Q2037191) (← links)
- Finding the maximum multi improvement on neighborhood exploration (Q2070118) (← links)
- Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques (Q2081655) (← links)
- Compositions, decompositions, and conformability for total coloring on power of cycle graphs (Q2091818) (← links)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- \(P_3\)-hull number of graphs with diameter two (Q2132359) (← links)
- Even-power of cycles with many vertices are type 1 total colorable (Q2132416) (← links)
- Parameterized complexity classes defined by threshold circuits: using sorting networks to show collapses with W-hierarchy classes (Q2150563) (← links)
- Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case (Q2151382) (← links)
- A general framework for path convexities (Q2156285) (← links)
- Perfect matching cuts partitioning a graph into complementary subgraphs (Q2169960) (← links)
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers (Q2172420) (← links)
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
- An efficient algorithm for combining verification and validation methods (Q2206241) (← links)
- A multivariate analysis of the strict terminal connection problem (Q2306846) (← links)
- Bipartizing with a matching (Q2327112) (← links)
- Maximum induced matchings close to maximum matchings (Q2348267) (← links)
- Generalized threshold processes on graphs (Q2402258) (← links)
- Deletion graph problems based on deadlock resolution (Q2412401) (← links)
- Simple undirected two-commodity integral flow with a unitary demand (Q2413185) (← links)
- Deadlock resolution in wait-for graphs by vertex/arc deletion (Q2420655) (← links)
- Decycling with a matching (Q2628271) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Computing the best-case energy complexity of satisfying assignments in monotone circuits (Q2674710) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
- (Q3386616) (← links)
- (Q4560268) (← links)
- (Q4982363) (← links)
- (Q5089236) (← links)
- On P 3-Convexity of Graphs with Bounded Degree (Q5251650) (← links)
- (Q5377222) (← links)
- Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms (Q5859672) (← links)
- Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. (Q5875534) (← links)
- Computing the largest bond of a graph (Q5875544) (← links)
- Partitioning a graph into complementary subgraphs (Q5896124) (← links)
- Partitioning a graph into complementary subgraphs (Q5918340) (← links)
- Maximum cuts in edge-colored graphs (Q5918845) (← links)
- On the computational difficulty of the terminal connection problem (Q6041044) (← links)
- Recognizing well-dominated graphs is coNP-complete (Q6072202) (← links)
- Linear‐time algorithms for eliminating claws in graphs (Q6082274) (← links)
