Остановите войну!
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 255 matches
- 2024
- Giulia Punzi, Alessio Conte, Roberto Grossi, Romeo Rizzi:
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs. Algorithmica 86(1): 194-217 (2024) - Alice Raffaele, Romeo Rizzi, Takeaki Uno:
Listing the bonds of a graph in O˜(n)-delay. Discret. Appl. Math. 348: 105-121 (2024) - Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, Elia C. Zirondelli:
Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. ACM Trans. Algorithms 20(1): 4:1-4:26 (2024) - 2023
- Matteo Zavatteri, Alice Raffaele, Dario Ostuni, Romeo Rizzi:
An interdisciplinary experimental evaluation on the disjunctive temporal problem. Constraints An Int. J. 28(1): 1-12 (2023) - Enrico Angelelli, Renata Mansini, Romeo Rizzi:
Solving the probabilistic profitable tour problem on a line. Optim. Lett. 17(8): 1873-1888 (2023) - Romeo Rizzi, Stéphane Vialette:
On recognising words that are squares for the shuffle product. Theor. Comput. Sci. 956: 111156 (2023) - Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Recognizing Unit Multiple Intervals Is Hard. ISAAC 2023: 8:1-8:18 - Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora:
Hardness of Balanced Mobiles. IWOCA 2023: 25-35 - Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
Cut Paths and Their Remainder Structure, with Applications. STACS 2023: 17:1-17:17 - Beatrice Amico, Carlo Combi, Romeo Rizzi, Pietro Sala:
Discovering Predictive Dependencies on Multi-Temporal Relations. TIME 2023: 4:1-4:19 - Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Recognizing unit multiple intervals is hard. CoRR abs/2309.11908 (2023) - Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette:
Quasi-kernels in split graphs. CoRR abs/2312.15519 (2023) - 2022
- Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu:
Safety in s-t Paths, Trails and Walks. Algorithmica 84(3): 719-741 (2022) - Matteo Zavatteri, Romeo Rizzi, Tiziano Villa:
Dynamic controllability of temporal networks with instantaneous reaction. Inf. Sci. 613: 932-952 (2022) - Manuel Cáceres, Brendan Mumey, Edin Husic, Romeo Rizzi, Massimo Cairo, Kristoffer Sahlin, Alexandru I. Tomescu:
Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG. IEEE ACM Trans. Comput. Biol. Bioinform. 19(6): 3673-3684 (2022) - Matteo Zavatteri, Davide Bresolin, Romeo Rizzi, Tiziano Villa:
Dynamic Controllability of Temporal Networks via Supervisory Control. OVERLAY@AI*IA 2022: 27-31 - Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. ESA 2022: 31:1-31:14 - Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. SODA 2022: 359-376 - Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette:
Algorithmic Aspects of Small Quasi-Kernels. WG 2022: 370-382 - Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. CoRR abs/2207.02136 (2022) - Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
Cut paths and their remainder structure, with applications. CoRR abs/2210.07530 (2022) - Enrico Angelelli, Renata Mansini, Romeo Rizzi:
Solving the Probabilistic Profitable Tour Problem on a Tree. CoRR abs/2210.11881 (2022) - Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
Minimum Path Cover in Parameterized Linear Time. CoRR abs/2211.09659 (2022) - 2021
- Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
A simplified algorithm computing all s-t bridges and articulation points. Discret. Appl. Math. 305: 103-108 (2021) - Carlo Combi, Romeo Rizzi, Pietro Sala:
Checking Sets of Pure Evolving Association Rules. Fundam. Informaticae 178(4): 283-313 (2021) - Matteo Zavatteri, Carlo Combi, Romeo Rizzi, Luca Viganò:
Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way. Inf. Comput. 280: 104637 (2021) - Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu:
Decomposing subcubic graphs into claws, paths or triangles. J. Graph Theory 98(4): 557-588 (2021) - Sara Giuliani, Zsuzsanna Lipták, Francesco Masillo, Romeo Rizzi:
When a dollar makes a BWT. Theor. Comput. Sci. 857: 123-146 (2021) - Dario Ostuni, Alice Raffaele, Romeo Rizzi, Matteo Zavatteri:
Faster and Better Simple Temporal Problems. AAAI 2021: 11913-11920 - Dario Ostuni, Edoardo Morassutto, Romeo Rizzi:
Make your programs compete and watch them play in the Code Colosseum. CoG 2021: 1-5
skipping 225 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-05-27 04:34 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