( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph.

, , , , и . COCOON, том 10392 из Lecture Notes in Computer Science, стр. 150-161. Springer, (2017)

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.

Ralf Conte

Tobias Daniel Conte

Carla Conte

Alessio Langiu

Alessio Meneghetti

 

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

Polynomial-Delay Enumeration of Maximal Common Subsequences., , , и . SPIRE, том 11811 из Lecture Notes in Computer Science, стр. 189-202. Springer, (2019)Finding the Anticover of a String., , , , , , и . CPM, том 161 из LIPIcs, стр. 2:1-2:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs., , , , и . IEEE Access, (2020)CAGE: Cache-Aware Graphlet Enumeration., , и . SPIRE, том 14240 из Lecture Notes in Computer Science, стр. 129-142. Springer, (2023)Directing Road Networks by Listing Strong Orientations., , , , и . IWOCA, том 9843 из Lecture Notes in Computer Science, стр. 83-95. Springer, (2016)Node Similarity with q -Grams for Real-World Labeled Networks., , , , , и . KDD, стр. 1282-1291. ACM, (2018)Listing Subgraphs by Cartesian Decomposition., , , , и . MFCS, том 117 из LIPIcs, стр. 84:1-84:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Clique covering of large real-world networks., , и . SAC, стр. 1134-1139. ACM, (2016)Radiomics and artificial intelligence analysis of CT data for the identification of prognostic features in multiple myeloma., , , , , , , , , и 6 other автор(ы). Medical Imaging: Computer-Aided Diagnosis, том 11314 из SPIE Proceedings, SPIE, (2020)New polynomial delay bounds for maximal subgraph enumeration by proximity search., и . STOC, стр. 1179-1190. ACM, (2019)