The following pages link to Fábio Protti (Q247856):
Displaying 50 items.
- Clique cycle-transversals in distance-hereditary graphs (Q299045) (← links)
- On solving manufacturing cell formation via bicluster editing (Q323416) (← links)
- The Flood-It game parameterized by the vertex cover number (Q324714) (← links)
- Corrigendum to ``Cycle transversals in perfect graphs and cographs'' (Q387014) (← links)
- Revisiting the complexity of and/or graph solution (Q394337) (← links)
- Exact and approximation algorithms for error-detecting even codes (Q441883) (← links)
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets (Q456142) (← links)
- The predecessor-existence problem for \(k\)-reversible processes (Q476889) (← links)
- SUTIL - network selection based on utility function and integer linear programming (Q605558) (← links)
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
- Mixed unit interval graphs (Q713160) (← links)
- (Q817140) (redirect page) (← links)
- Packing \(r\)-cliques in weighted chordal graphs (Q817141) (← links)
- List matrix partitions of chordal graphs (Q817772) (← links)
- The Helly property on subfamilies of limited size (Q834991) (← links)
- Complexity aspects of generalized Helly hypergraphs (Q845662) (← links)
- An efficient heuristic for selecting active nodes in wireless sensor networks (Q852514) (← links)
- Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs (Q897965) (← links)
- On the geodetic iteration number of distance-hereditary graphs (Q898096) (← links)
- Partition into cliques for cubic graphs: Planar case, complexity and approximation (Q947111) (← links)
- Some remarks on the geodetic number of a graph (Q965962) (← links)
- Extending the geometric build-up algorithm for the molecular distance geometry problem (Q975461) (← links)
- Improved algorithms for recognizing \(p\)-Helly and hereditary \(p\)-Helly hypergraphs (Q975464) (← links)
- Complexity results related to monophonic convexity (Q987671) (← links)
- Structured construction and simulation of nondeterministic stochastic activity networks (Q1027622) (← links)
- On the computation of the hull number of a graph (Q1045055) (← links)
- And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) (← links)
- Corrigendum to ``Complexity analysis of \(P_{3}\)-convexity problems on bounded-degree and planar graphs'' (Q1680540) (← links)
- New heuristics for the bicluster editing problem (Q1686528) (← links)
- Cograph generation with linear delay (Q1694670) (← links)
- On the hardness of finding the geodetic number of a subcubic graph (Q1708262) (← links)
- A matheuristic for the cell formation problem (Q1744631) (← links)
- A computational study of \(f\)-reversible processes on graphs (Q1752484) (← links)
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number (Q1752485) (← links)
- Fine-grained parameterized complexity analysis of knot-free vertex deletion -- a deadlock resolution graph problem (Q1790957) (← links)
- Partitioning chordal graphs into independent sets and cliques (Q1827861) (← links)
- On the convexity number of graphs (Q1926045) (← links)
- Cycle transversals in perfect graphs and cographs (Q1935798) (← links)
- Complexity aspects of the Helly property: graphs and hypergraphs (Q1960293) (← links)
- The biclique partitioning polytope (Q2032987) (← links)
- Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- Convex geometries over induced paths with bounded length (Q2092354) (← links)
- \(P_3\)-hull number of graphs with diameter two (Q2132359) (← links)
- A general framework for path convexities (Q2156285) (← links)
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers (Q2172420) (← links)
- Edge clique partition in \((k,\ell)\)-graphs (Q2243139) (← links)
- Algorithmic aspects of Steiner convexity and enumeration of Steiner trees (Q2259027) (← links)
- Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
- Vector domination in split-indifference graphs (Q2281167) (← links)
