default search action
Lucia Draque Penso
Person information
- affiliation: University of Ulm, Germany
- affiliation (former): Technische Universität Ilmenau, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j34]Felix Bock, Johannes Pardey
, Lucia Draque Penso, Dieter Rautenbach
A bound on the dissociation number. J. Graph Theory 103(4): 661-673 (2023) - [j33]Felix Bock, Johannes Pardey
Relating the independence number and the dissociation number. J. Graph Theory 104(2): 320-340 (2023) - [c20]J. Araújo, Ana Karolinna Maia, P. P. Medeiros, Lucia Draque Penso:
On the hull and interval numbers of oriented graphs (Brief Announcement). LAGOS 2023: 397-399 - 2022
- [j32]Felix Bock, Johannes Pardey, Lucia Draque Penso, Dieter Rautenbach:
Relating dissociation, independence, and matchings. Discret. Appl. Math. 322: 160-165 (2022) - [j31]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
The hull number in the convexity of induced paths of order 3. Theor. Comput. Sci. 906: 52-63 (2022) - [i6]Júlio Araújo, Ana Karolinna Maia, P. P. Medeiros, Lucia Draque Penso:
On the hull and interval numbers of oriented graphs. CoRR abs/2210.01598 (2022) - 2020
- [j30]Mitre Costa Dourado, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach:
Partial immunization of trees. Discret. Optim. 35: 100568 (2020)
2010 – 2019
- 2019
- [j29]Stéphane Bessy
Dynamic monopolies for interval graphs with bounded thresholds. Discret. Appl. Math. 260: 256-261 (2019) - [c19]Mitre Costa Dourado
The Hull Number in the Convexity of Induced Paths of Order 3. IWOCA 2019: 214-228 - [c18]Márcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho, Lucia Draque Penso, Dieter Rautenbach:
Identifying Codes in the Complementary Prism of Cycles. LAGOS 2019: 241-251 - 2018
- [j28]Letícia Rodrigues Bueno
On the hardness of finding the geodetic number of a subcubic graph. Inf. Process. Lett. 135: 22-27 (2018) - [j27]Lucia Draque Penso, Dieter Rautenbach
Graphs in which some and every maximum matching is uniquely restricted. J. Graph Theory 89(1): 55-63 (2018) - [j26]Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
The Geodetic Hull Number is Hard for Chordal Graphs. SIAM J. Discret. Math. 32(1): 543-547 (2018) - [i5]Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach:
Dynamic monopolies for interval graphs with bounded thresholds. CoRR abs/1802.03935 (2018) - 2017
- [j25]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
Geodetic convexity parameters for (q, q-4)-graphs. Discret. Appl. Math. 223: 64-71 (2017) - [j24]Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
The Geodetic Hull Number is Hard for Chordal Graphs. Electron. Notes Discret. Math. 62: 291-296 (2017) - [j23]Márcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza
Complexity properties of complementary prisms. J. Comb. Optim. 33(2): 365-372 (2017) - [j22]Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton dos Santos Souza
Corrigendum to "Complexity analysis of P3-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95]. Theor. Comput. Sci. 704: 92-93 (2017) - [i4]Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
The Geodetic Hull Number is Hard for Chordal Graphs. CoRR abs/1704.02242 (2017) - 2016
- [j21]Vítor Costa, Simone Dantas, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
Slash and burn on graphs - Firefighting with general weights. Discret. Appl. Math. 210: 4-13 (2016) - [j20]Michael Gentner, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza
Extremal values and bounds for the zero forcing number. Discret. Appl. Math. 214: 196-200 (2016) - [j19]Mitre Costa Dourado, Lucia Draque Penso Rautenbach, Dieter Rautenbach:
On the geodetic hull number of Pk-free graphs. Theor. Comput. Sci. 640: 52-60 (2016) - [c17]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
Geodetic Convexity Parameters for Graphs with Few Short Induced Paths. WG 2016: 25-37 - 2015
- [j18]Lucia Draque Penso, Dieter Rautenbach, Aline Ribeiro de Almeida:
Brush your trees! Discret. Appl. Math. 194: 167-170 (2015) - [j17]Márcio Antônio Duarte, Felix Joos, Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza
On Graphs with Induced Matching Number Almost Equal to Matching Number. Electron. Notes Discret. Math. 50: 9-14 (2015) - [j16]Mitre Costa Dourado, Dirk Meierling, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti, Aline Ribeiro de Almeida:
Robust recoverable perfect matchings. Networks 66(3): 210-213 (2015) - [j15]Márcio Antônio Duarte, Felix Joos, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza
Maximum induced matchings close to maximum matchings. Theor. Comput. Sci. 588: 131-137 (2015) - [j14]Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton dos Santos Souza
Complexity analysis of P3-convexity problems on bounded-degree and planar graphs. Theor. Comput. Sci. 607: 83-95 (2015) - [i3]Uéverton S. Souza, Letícia Rodrigues Bueno, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti:
Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4. CTW 2015: 197-200 - [i2]Márcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza:
The P3-Convexity in the Complementary Prism of a Graph. CTW 2015: 225-228 - 2014
- [j13]Márcia R. Cappelle, Lucia Draque Penso, Dieter Rautenbach:
Recognizing some complementary products. Theor. Comput. Sci. 521: 1-7 (2014) - [c16]Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza
On P 3-Convexity of Graphs with Bounded Degree. AAIM 2014: 263-274 - 2013
- [j12]Vítor Costa, Simone Dantas, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
More fires and more fighters. Discret. Appl. Math. 161(16-17): 2410-2419 (2013) - [j11]Carmen C. Centeno, Lucia Draque Penso, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá:
Geodetic Number versus Hull Number in P3-Convexity. SIAM J. Discret. Math. 27(2): 717-731 (2013) - 2012
- [j10]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Reversible iterative graph processes. Theor. Comput. Sci. 460: 16-25 (2012) - [j9]Roberto Cortiñas
Secure Failure Detection and Consensus in TrustedPals. IEEE Trans. Dependable Secur. Comput. 9(4): 610-625 (2012) - [c15]Carmen Cecilia Centeno, Lucia Draque Penso, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá:
Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity. WG 2012: 262-273 - 2011
- [j8]Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Connectivity and diameter in distance graphs. Networks 57(4): 310-315 (2011) - [j7]Carmen C. Centeno, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Irreversible conversion of graphs. Theor. Comput. Sci. 412(29): 3693-3700 (2011) - [c14]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
The South Zone: Distributed Algorithms for Alliances. SSS 2011: 178-192 - 2010
- [j6]Flavio Paiva Junqueira, Keith Marzullo, Maurice Herlihy, Lucia Draque Penso:
Threshold protocols in survivor set systems. Distributed Comput. 23(2): 135-149 (2010) - [j5]Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Long cycles and paths in distance graphs. Discret. Math. 310(23): 3417-3420 (2010) - [c13]Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Brief Announcement: On Reversible and Irreversible Conversions. DISC 2010: 395-397
2000 – 2009
- 2009
- [c12]Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Cycles, Paths, Connectivity and Diameter in Distance Graphs. WG 2009: 320-328 - 2008
- [b1]Lucia Draque Penso:
Distributed Protocols Robust Against Malicious Attacks. Brown University, USA, 2008 - [j4]Neeraj Mittal, Felix C. Freiling, Subbarayan Venkatesan, Lucia Draque Penso:
On termination detection in crash-prone distributed systems with failure detectors. J. Parallel Distributed Comput. 68(6): 855-875 (2008) - [c11]Maurice Herlihy, Flavio Paiva Junqueira, Keith Marzullo, Lucia Draque Penso:
Optimizing Threshold Protocols in Adversarial Structures. DISC 2008: 335-349 - 2007
- [c10]Martin Biely, Martin Hutle, Lucia Draque Penso, Josef Widder:
Relating Stabilizing Timing Assumptions to Stabilizing Failure Detectors Regarding Solvability and Efficiency. SSS 2007: 4-20 - [c9]Roberto Cortiñas
Secure Failure Detection in TrustedPals. SSS 2007: 173-188 - [c8]Carole Delporte-Gallet, Hugues Fauconnier, Felix C. Freiling, Lucia Draque Penso, Andreas Tielmann:
From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors. DISC 2007: 165-178 - 2006
- [c7]Zinaida Benenson, Felix C. Freiling, Thorsten Holz, Dogan Kesdogan, Lucia Draque Penso:
Safety, Liveness, and Information Flow: Dependability Revisited. ARCS Workshops 2006: 56-65 - [c6]Milan Fort, Felix C. Freiling, Lucia Draque Penso, Zinaida Benenson, Dogan Kesdogan:
TrustedPals: Secure Multiparty Computation Implemented with Smart Cards. ESORICS 2006: 34-48 - 2005
- [j3]Maurice Herlihy, Lucia Draque Penso:
Tight bounds for k-set agreement with limited-scope failure detectors. Distributed Comput. 18(2): 157-166 (2005) - [c5]Felix C. Freiling, Neeraj Mittal, Lucia Draque Penso:
Transformations in Secure and Fault-Tolerant Distributed Computation. GI Jahrestagung (1) 2005: 410-412 - [c4]Felix C. Freiling, Maurice Herlihy, Lucia Draque Penso:
Optimal Randomized Fair Exchange with Secret Shared Coins. OPODIS 2005: 61-72 - [c3]Neeraj Mittal, Felix C. Freiling, Subbarayan Venkatesan, Lucia Draque Penso:
Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System. DISC 2005: 93-107 - 2004
- [j2]Lucia Draque Penso, Valmir Carneiro Barbosa
A distributed algorithm to find k-dominating sets. Discret. Appl. Math. 141(1-3): 243-253 (2004) - 2003
- [c2]Maurice Herlihy, Lucia Draque Penso:
tight bounds for k-set agreement with limited-scope failure detectors. PODC 2003: 221 - [c1]Maurice Herlihy, Lucia Draque Penso:
Tight Bounds for k-Set Agreement with Limited-Scope Failure Detectors. DISC 2003: 279-291 - [i1]Lucia Draque Penso, Valmir Carneiro Barbosa:
A distributed algorithm to find k-dominating sets. CoRR cs.DC/0309040 (2003) - 2001
- [j1]Lucia Draque Penso, Valmir Carneiro Barbosa
A distributed algorithm for k-dominating sets. Electron. Notes Discret. Math. 7: 130-133 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: