The following pages link to Lucia Draque Penso (Q436802):
Displaying 48 items.
- (Q299036) (redirect page) (← links)
- Slash and burn on graphs -- firefighting with general weights (Q299037) (← links)
- (Q317427) (redirect page) (← links)
- Extremal values and bounds for the zero forcing number (Q317429) (← links)
- On graphs with induced matching number almost equal to matching number (Q324703) (← links)
- Recognizing some complementary products (Q389934) (← links)
- On termination detection in crash-prone distributed systems with failure detectors (Q436803) (← links)
- (Q494439) (redirect page) (← links)
- Brush your trees! (Q494441) (← links)
- Complexity properties of complementary prisms (Q511681) (← links)
- Irreversible conversion of graphs (Q551200) (← links)
- Threshold protocols in survivor set systems (Q661005) (← links)
- Reversible iterative graph processes (Q690472) (← links)
- Long cycles and paths in distance graphs (Q712275) (← links)
- Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs (Q897965) (← links)
- Corrigendum to ``Complexity analysis of \(P_{3}\)-convexity problems on bounded-degree and planar graphs'' (Q1680540) (← links)
- On the hardness of finding the geodetic number of a subcubic graph (Q1708262) (← links)
- Dynamic monopolies for interval graphs with bounded thresholds (Q1741518) (← links)
- A distributed algorithm to find \(k\)-dominating sets (Q1827867) (← links)
- Tight bounds for \(k\)-set agreement with limited-scope failure detectors (Q1953644) (← links)
- Geodetic convexity parameters for \((q, q - 4)\)-graphs (Q2030436) (← links)
- The hull number in the convexity of induced paths of order \(3\) (Q2077392) (← links)
- Relating dissociation, independence, and matchings (Q2081478) (← links)
- Identifying codes in the complementary prism of cycles (Q2132351) (← links)
- Partial immunization of trees (Q2299985) (← links)
- The hull number in the convexity of induced paths of order 3 (Q2301745) (← links)
- Maximum induced matchings close to maximum matchings (Q2348267) (← links)
- The geodetic hull number is hard for chordal graphs (Q2413187) (← links)
- More fires and more fighters (Q2444533) (← links)
- On the geodetic hull number of \(P_{k}\)-free graphs (Q2629231) (← links)
- (Q2741487) (← links)
- Geodetic Number versus Hull Number in $P_3$-Convexity (Q2848533) (← links)
- tight bounds for k-set agreement with limited-scope failure detectors (Q2943758) (← links)
- Connectivity and diameter in distance graphs (Q3087615) (← links)
- Geodetic Convexity Parameters for Graphs with Few Short Induced Paths (Q3181044) (← links)
- From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors (Q3523206) (← links)
- Optimizing Threshold Protocols in Adversarial Structures (Q3540241) (← links)
- Graphs in which some and every maximum matching is uniquely restricted (Q4553727) (← links)
- The Geodetic Hull Number is Hard for Chordal Graphs (Q4604645) (← links)
- Robust recoverable perfect matchings (Q4642438) (← links)
- Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity (Q5200513) (← links)
- On P 3-Convexity of Graphs with Bounded Degree (Q5251650) (← links)
- Distributed Computing (Q5395139) (← links)
- (Q5420034) (← links)
- Cycles, Paths, Connectivity and Diameter in Distance Graphs (Q5851116) (← links)
- Distributed Computing (Q5897414) (← links)
- A bound on the dissociation number (Q6047956) (← links)
- Relating the independence number and the dissociation number (Q6094030) (← links)
