( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Cut Paths and Their Remainder Structure, with Applications.

, , , , , и . STACS, том 254 из LIPIcs, стр. 17:1-17:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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.

Andreas Rizzi

Romeo Spemann

Otto Ritter Rizzi

Christiane Romeo

Romeo Spemann

 

Другие публикации лиц с тем же именем

Optimal Listing of Cycles and St-paths in Undirected Graphs, , , , , , и . Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, стр. 1884--1896. SIAM, (2013)The Minimum Substring Cover Problem., , , и . WAOA, том 4927 из Lecture Notes in Computer Science, стр. 170-183. Springer, (2007)Optimal Omnitig Listing for Safe and Complete Contig Assembly., , , , и . CPM, том 78 из LIPIcs, стр. 29:1-29:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty., , и . TIME, том 120 из LIPIcs, стр. 8:1-8:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Evaluation of BIC-based algorithms for audio segmentation., , и . Comput. Speech Lang., 19 (2): 147-170 (2005)On the Trade-Off between Energy and Multicast Efficiency in 802.16e-Like Mobile Networks., , и . IEEE Trans. Mob. Comput., 7 (3): 346-357 (2008)Ranking, unranking and random generation of extensional acyclic digraphs., и . Inf. Process. Lett., 113 (5-6): 183-187 (2013)On the complexity of digraph packings., и . Inf. Process. Lett., 86 (2): 101-106 (2003)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)