( en | de | ru )

 

Disambiguation of "Rizzi, Romeo"

Author of the publication

copydeleteadd this publication to your clipboard
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs.

, , and . MFCS, volume 3618 of Lecture Notes in Computer Science, page 328-339. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Romeo Spemann

Andreas Rizzi

Otto Ritter Rizzi

Christiane Romeo

Romeo Spemann

 

Other publications of authors with the same name

Optimal Listing of Cycles and St-paths in Undirected Graphs, , , , , , and . Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, page 1884--1896. SIAM, (2013)The Minimum Substring Cover Problem., , , and . WAOA, volume 4927 of Lecture Notes in Computer Science, page 170-183. Springer, (2007)Hybrid SAT-Based Consistency Checking Algorithms for Simple Temporal Networks with Decisions., , , and . TIME, volume 147 of LIPIcs, page 16:1-16:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty., , and . TIME, volume 120 of LIPIcs, page 8:1-8:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Optimal Omnitig Listing for Safe and Complete Contig Assembly., , , , and . CPM, volume 78 of LIPIcs, page 29:1-29:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Evaluation of BIC-based algorithms for audio segmentation., , and . Comput. Speech Lang., 19 (2): 147-170 (2005)König's Edge Coloring Theorem without Augmenting Paths. Journal of Graph Theory, 29 (2): 87--87 (1998)A Short Proof of König's Matching Theorem. Journal of Graph Theory, 33 (3): 138--139 (2000)On the Trade-Off between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks., , and . IEEE Trans. Mob. Comput., 7 (3): 346-357 (2008)Ranking, unranking and random generation of extensional acyclic digraphs., and . Inf. Process. Lett., 113 (5-6): 183-187 (2013)