Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 29 matches
- 2019
- Daniela Ferrero, Mary Flagg, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Seth A. Meyer, Shahla Nasserasr, Bryan L. Shader:
Rigid Linkages and Partial Zero Forcing. Electron. J. Comb. 26(2): 2 (2019) - Kirk Boyer, Boris Brimkov, Sean English, Daniela Ferrero, Ariel Keller, Rachel Kirsch, Michael Phillips, Carolyn Reinhart:
The zero forcing polynomial of a graph. Discret. Appl. Math. 258: 35-48 (2019) - Daniela Ferrero, Thomas Kalinowski, Sudeep Stephen:
Zero forcing in iterated line digraphs. Discret. Appl. Math. 255: 198-208 (2019) - Chassidy Bozeman, Boris Brimkov, Craig Erickson, Daniela Ferrero, Mary Flagg, Leslie Hogben:
Restricted power domination and zero forcing problems. J. Comb. Optim. 37(3): 935-956 (2019) - Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen:
Minimum rank and zero forcing number for butterfly networks. J. Comb. Optim. 37(3): 970-988 (2019) - 2018
- Katherine F. Benson, Daniela Ferrero, Mary Flagg, Veronika Furst, Leslie Hogben, Violeta Vasilevska:
Nordhaus-Gaddum problems for power domination. Discret. Appl. Math. 251: 103-113 (2018) - Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter, Michael Young:
The relationship between k-forcing and k-power domination. Discret. Math. 341(6): 1789-1797 (2018) - Daniela Ferrero, Linda M. Lesniak:
Chorded Pancyclicity in k-Partite Graphs. Graphs Comb. 34(6): 1565-1580 (2018) - 2017
- Marco Beccuti, Elisa Genuardi, Greta Romano, Luigia Monitillo, Daniela Barbero, Mario Boccadoro, Marco Ladetto, Raffaele A. Calogero, Simone Ferrero, Francesca Cordero:
HashClone: a new tool to quantify the minimal residual disease in B-cell lymphoma from deep sequencing data. BMC Bioinform. 18(1): 516 (2017) - Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter, Michael Young:
Note on power propagation time and lower bounds for the power domination number. J. Comb. Optim. 34(3): 736-741 (2017) - 2016
- Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen:
Minimum rank and zero forcing number for butterfly networks. CoRR abs/1607.07522 (2016) - 2014
- Daniela Ferrero, Sarah Hanusch:
Component connectivity of generalized Petersen graphs. Int. J. Comput. Math. 91(9): 1940-1963 (2014) - 2012
- Carlo Sozzi, E. Alessi, Luca Boncagni, Cristian Galperti, C. Marchetto, S. Nowak, W. Bin, A. Botrugno, Alessandro Bruschi, S. Cirant, Gabriele D'Antona, Ocleto D'Arcangelo, Mohsen Davoudi, Daniela Farina, Lorenzo Figini, Roberto Ferrero, S. Garavaglia, Gustavo Granucci, A. Grosso, F. Iannone, E. Lazzaro, A. Moro, V. Mellera, D. Minelli, Maaurizio Panella, P. Platania, Giovanni Ramponi, A. Simonetto, B. Tilia, Vincenzo Vitale, Ocleto Tudisco:
A Real-Time system for data acquisition, elaboration and actuator's control for magnetohydrodynamics instabilities in the FTU tokamak. CDC 2012: 4353-4358 - 2011
- Roberto Barrera, Daniela Ferrero:
Power domination in cylinders, tori, and generalized Petersen graphs. Networks 58(1): 43-49 (2011) - 2008
- Jeng-Jung Wang, Tung-Yang Ho, Daniela Ferrero, Ting-Yi Sung:
Diameter variability of cycles and tori. Inf. Sci. 178(14): 2960-2967 (2008) - Daniela Ferrero:
Product Line Sigraphs. ISPAN 2008: 141-145 - 2007
- Valeria Teppati, Andrea Ferrero, Daniela Parena, Umberto Pisani:
Accuracy Improvement of Real-Time Load-Pull Measurements. IEEE Trans. Instrum. Meas. 56(2): 610-613 (2007) - Daniela Ferrero:
Some properties of superline digraphs. ITNG 2007: 1073-1076 - 2005
- Camino Balbuena, Xavier Marcote, Daniela Ferrero:
Diameter vulnerability of iterated line digraphs in terms of the girth. Networks 45(2): 49-54 (2005) - Jay S. Bagga, Daniela Ferrero:
The structure of super line graphs. ISPAN 2005: 468-471 - 2003
- Camino Balbuena, Daniela Ferrero:
Edge-connectivity and super edge-connectivity of P2-path graphs. Discret. Math. 269(1-3): 13-20 (2003) - Daniela Ferrero, Frank Harary:
Edge Sums of Debruijn Interconnection Networks. Int. J. Comput. Math. 80(7): 819-824 (2003) - Camino Balbuena, Daniela Ferrero, Xavier Marcote, Ignacio M. Pelayo:
Algebraic properties of a digraph and its line digraph. J. Interconnect. Networks 4(4): 377-393 (2003) - 2002
- Daniela Ferrero, Carles Padró:
Connectivity and fault-tolerance of hyperdigraphs. Discret. Appl. Math. 117(1-3): 15-26 (2002) - Daniela Ferrero, Carles Padró:
Partial line directed hypergraphs. Networks 39(2): 61-67 (2002) - 2001
- Daniela Ferrero, Carles Padró:
New bounds on the diameter vulnerability of iterated line digraphs. Discret. Math. 233(1-3): 103-113 (2001) - 1999
- Daniela Ferrero, Carles Padró:
Disjoint paths of bounded length in large generalized cycles. Discret. Math. 197-198: 285-298 (1999) - Daniela Ferrero:
A Technique for the (d, s, N)-Bus Network Problem. SCCC 1999: 129-135 - 1997
- Daniela Ferrero, Carles Padró:
Fault-Tolerant Routings in Large Generalized Cycles. SCCC 1997: 58-65
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-03-29 02:40 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint