Остановите войну!
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
Likely 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 151 matches
- 2024
- Giorgio Lazzarinetti, Riccardo Dondi, Sara Manzoni, Italo Zoppis:
An Attention-Based Method for the Minimum Vertex Cover Problem on Complex Networks. Algorithms 17(2): 72 (2024) - 2023
- Riccardo Dondi, Manuel Lafond:
On the Tractability of Covering a Graph with 2-Clubs. Algorithmica 85(4): 992-1028 (2023) - Riccardo Dondi, Danny Hermelin:
Computing the k densest subgraphs of a graph. Inf. Process. Lett. 179: 106316 (2023) - Mohammad Mehdi Hosseinzadeh, Mario Cannataro, Pietro Hiram Guzzi, Riccardo Dondi:
Temporal networks in biology and medicine: a survey on models, algorithms, and tools. Netw. Model. Anal. Health Informatics Bioinform. 12(1): 10 (2023) - Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Colorful path detection in vertex-colored temporal. Netw. Sci. 11(4): 615-631 (2023) - Riccardo Dondi, Pietro Hiram Guzzi, Mohammad Mehdi Hosseinzadeh, Marianna Milano:
Dense subgraphs in temporal social networks. Soc. Netw. Anal. Min. 13(1): 128 (2023) - Riccardo Dondi:
Untangling temporal graphs of bounded degree. Theor. Comput. Sci. 969: 114040 (2023) - Riccardo Dondi, Alexandru Popa:
Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms. IWOCA 2023: 173-184 - Riccardo Dondi, Manuel Lafond:
An FPT Algorithm for Temporal Graph Untangling. IPEC 2023: 12:1-12:16 - Riccardo Dondi, Manuel Lafond:
An FTP Algorithm for Temporal Graph Untangling. CoRR abs/2307.00786 (2023) - 2022
- Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
On the complexity of approximately matching a string to a directed graph. Inf. Comput. 288: 104748 (2022) - Mathieu Gascon, Riccardo Dondi, Nadia El-Mabrouk:
MUL-tree pruning for consistency and optimal reconciliation - complexity and algorithms. Theor. Comput. Sci. 937: 22-38 (2022) - Riccardo Dondi, Alexandru Popa:
Covering a Graph with Densest Subgraphs. CALDAM 2022: 152-163 - Riccardo Dondi, Pietro Hiram Guzzi, Mohammad Mehdi Hosseinzadeh:
Integrating Temporal Graphs via Dual Networks: Dense Graph Discovery. COMPLEX NETWORKS (2) 2022: 523-535 - Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Italo Zoppis:
Dense Temporal Subgraphs in Protein-Protein Interaction Networks. ICCS (1) 2022: 469-480 - Riccardo Dondi:
Insights into the Complexity of Disentangling Temporal Graphs. ICTCS 2022: 1-13 - Riccardo Dondi:
Sequence Classification via LCS. KES-IDT 2022: 77-86 - 2021
- Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Pietro H. Guzzi:
A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks. Appl. Netw. Sci. 6(1): 40 (2021) - Ambroise Baril, Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Hardness and tractability of the γ-Complete Subgraph problem. Inf. Process. Lett. 169: 106105 (2021) - Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Giancarlo Mauri, Italo Zoppis:
Top-k overlapping densest subgraphs: approximation algorithms and computational complexity. J. Comb. Optim. 41(1): 80-104 (2021) - Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Dense Sub-networks Discovery in Temporal Networks. SN Comput. Sci. 2(3): 158 (2021) - Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Finding Colorful Paths in Temporal Graphs. COMPLEX NETWORKS 2021: 553-565 - Riccardo Dondi, Florian Sikora:
The Longest Run Subsequence Problem: Further Complexity Results. CPM 2021: 14:1-14:15 - Mathieu Gascon, Riccardo Dondi, Nadia El-Mabrouk:
Complexity and Algorithms for MUL-Tree Pruning. IWOCA 2021: 324-339 - Tomás Bures, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdzinski, Claus Pahl, Florian Sikora, Prudence W. H. Wong:
SOFSEM 2021: Theory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings. Lecture Notes in Computer Science 12607, Springer 2021, ISBN 978-3-030-67730-5 [contents] - Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Finding Colorful Paths in Temporal Graphs. CoRR abs/2109.01392 (2021) - 2020
- Riccardo Dondi, Pietro Hiram Guzzi, Mohammad Mehdi Hosseinzadeh:
Top-k Connected Overlapping Densest Subgraphs in Dual Networks. COMPLEX NETWORKS (2) 2020: 585-596 - Mauro Castelli, Riccardo Dondi, Mohammad Mehdi Hosseinzadeh:
Genetic Algorithms for Finding Episodes in Temporal Networks. KES 2020: 215-224 - Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
Complexity Issues of String to Graph Approximate Matching. LATA 2020: 248-259 - Alexander Chatzigeorgiou, Riccardo Dondi, Herodotos Herodotou, Christos A. Kapoutsis, Yannis Manolopoulos, George A. Papadopoulos, Florian Sikora:
SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings. Lecture Notes in Computer Science 12011, Springer 2020, ISBN 978-3-030-38918-5 [contents]
skipping 121 more matches
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-04-25 02:50 CEST 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