Lucia Draque Penso

Affiliations:
  • University of Ulm, Germany
  • Technische Universität Ilmenau, Germany (former)


According to our database1, Lucia Draque Penso authored at least 55 papers between 2001 and 2023.

Collaborative distances:

Timeline

2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
2
3
1
1
2
4
3
5
1
2
2
2
2
1
1
1
1
1
1
1
2
1
1
1
1
1
1
3
2
3
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Relating the independence number and the dissociation number.
J. Graph Theory, October, 2023

A bound on the dissociation number.
J. Graph Theory, August, 2023

On the hull and interval numbers of oriented graphs (Brief Announcement).
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022
The hull number in the convexity of induced paths of order 3.
Theor. Comput. Sci., 2022

Relating dissociation, independence, and matchings.
Discret. Appl. Math., 2022

On the hull and interval numbers of oriented graphs.
CoRR, 2022

2020
Partial immunization of trees.
Discret. Optim., 2020

2019
Identifying Codes in the Complementary Prism of Cycles.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Dynamic monopolies for interval graphs with bounded thresholds.
Discret. Appl. Math., 2019

2018
Graphs in which some and every maximum matching is uniquely restricted.
J. Graph Theory, 2018

On the hardness of finding the geodetic number of a subcubic graph.
Inf. Process. Lett., 2018

2017
Corrigendum to "Complexity analysis of P<sub>3</sub>-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95].
Theor. Comput. Sci., 2017

Complexity properties of complementary prisms.
J. Comb. Optim., 2017

The Geodetic Hull Number is Hard for Chordal Graphs.
Electron. Notes Discret. Math., 2017

Geodetic convexity parameters for (q, q-4)-graphs.
Discret. Appl. Math., 2017

2016
On the geodetic hull number of P<sub>k</sub>-free graphs.
Theor. Comput. Sci., 2016

Extremal values and bounds for the zero forcing number.
Discret. Appl. Math., 2016

Slash and burn on graphs - Firefighting with general weights.
Discret. Appl. Math., 2016

Geodetic Convexity Parameters for Graphs with Few Short Induced Paths.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

2015
Complexity analysis of P<sub>3</sub>-convexity problems on bounded-degree and planar graphs.
Theor. Comput. Sci., 2015

Maximum induced matchings close to maximum matchings.
Theor. Comput. Sci., 2015

Robust recoverable perfect matchings.
Networks, 2015

On Graphs with Induced Matching Number Almost Equal to Matching Number.
Electron. Notes Discret. Math., 2015

Brush your trees!
Discret. Appl. Math., 2015

Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

The P3-Convexity in the Complementary Prism of a Graph.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Recognizing some complementary products.
Theor. Comput. Sci., 2014

On P 3-Convexity of Graphs with Bounded Degree.
Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013
Geodetic Number versus Hull Number in P<sub>3</sub>-Convexity.
SIAM J. Discret. Math., 2013

More fires and more fighters.
Discret. Appl. Math., 2013

2012
Secure Failure Detection and Consensus in TrustedPals.
IEEE Trans. Dependable Secur. Comput., 2012

Reversible iterative graph processes.
Theor. Comput. Sci., 2012

Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011
Irreversible conversion of graphs.
Theor. Comput. Sci., 2011

Connectivity and diameter in distance graphs.
Networks, 2011

The South Zone: Distributed Algorithms for Alliances.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

2010
Long cycles and paths in distance graphs.
Discret. Math., 2010

Threshold protocols in survivor set systems.
Distributed Comput., 2010

Brief Announcement: On Reversible and Irreversible Conversions.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

2009
Cycles, Paths, Connectivity and Diameter in Distance Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

2008
Distributed Protocols Robust Against Malicious Attacks.
PhD thesis, 2008

On termination detection in crash-prone distributed systems with failure detectors.
J. Parallel Distributed Comput., 2008

Optimizing Threshold Protocols in Adversarial Structures.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

2007
From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Secure Failure Detection in TrustedPals.
Proceedings of the Stabilization, 2007

Relating Stabilizing Timing Assumptions to Stabilizing Failure Detectors Regarding Solvability and Efficiency.
Proceedings of the Stabilization, 2007

2006
TrustedPals: Secure Multiparty Computation Implemented with Smart Cards.
Proceedings of the Computer Security, 2006

Safety, Liveness, and Information Flow: Dependability Revisited.
Proceedings of the ARCS 2006, 2006

2005
Tight bounds for <i>k</i>-set agreement with limited-scope failure detectors.
Distributed Comput., 2005

Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Optimal Randomized Fair Exchange with Secret Shared Coins.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Transformations in Secure and Fault-Tolerant Distributed Computation.
Proceedings of the 35. Jahrestagung der Gesellschaft für Informatik, 2005

2004
A distributed algorithm to find k-dominating sets.
Discret. Appl. Math., 2004

2003
tight bounds for k-set agreement with limited-scope failure detectors.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

2001
A distributed algorithm for k-dominating sets.
Electron. Notes Discret. Math., 2001


  Loading...