Year |
Citation |
Score |
2022 |
Matejek B, Wei D, Chen T, Tsourakakis CE, Mitzenmacher M, Pfister H. Edge-colored directed subgraph enumeration on the connectome. Scientific Reports. 12: 11349. PMID 35790766 DOI: 10.1038/s41598-022-15027-7 |
0.427 |
|
2016 |
Chen C, Tong H, Prakash BA, Tsourakakis CE, Eliassi-Rad T, Faloutsos C, Chau DH. Node Immunization on Large Graphs: Theory and Algorithms Ieee Transactions On Knowledge and Data Engineering. 28: 113-126. DOI: 10.1109/Tkde.2015.2465378 |
0.466 |
|
2015 |
Tsourakakis CE. Streaming graph partitioning in the planted partition model Cosn 2015 - Proceedings of the 2015 Acm Conference On Online Social Networks. 27-35. DOI: 10.1145/2817946.2817950 |
0.512 |
|
2015 |
Gionis A, Tsourakakis CE. Dense subgraph discovery Proceedings of the Acm Sigkdd International Conference On Knowledge Discovery and Data Mining. 2015: 2313-2314. DOI: 10.1145/2783258.2789987 |
0.449 |
|
2015 |
Mitzenmacher M, Pachocki J, Peng R, Tsourakakis CE, Xu SC. Scalable large near-clique detection in large-scale networks via sampling Proceedings of the Acm Sigkdd International Conference On Knowledge Discovery and Data Mining. 2015: 815-824. DOI: 10.1145/2783258.2783385 |
0.507 |
|
2015 |
Bhattacharya S, Henzinger M, Nanongkai D, Tsourakakis CE. Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams Proceedings of the Annual Acm Symposium On Theory of Computing. 14: 173-182. DOI: 10.1145/2746539.2746592 |
0.433 |
|
2015 |
Bonchi F, Gionis A, Gullo F, Tsourakakis CE, Ukkonen A. Chromatic correlation clustering Acm Transactions On Knowledge Discovery From Data. 9. DOI: 10.1145/2728170 |
0.418 |
|
2015 |
Dudek A, Frieze AM, Tsourakakis CE. Rainbow connection of random regular graphs Siam Journal On Discrete Mathematics. 29: 2255-2266. DOI: 10.1137/140998433 |
0.479 |
|
2014 |
Tsourakakis CE. Toward quantifying vertex similarity in networks Internet Mathematics. 10: 263-286. DOI: 10.1080/15427951.2013.836581 |
0.547 |
|
2014 |
Frieze A, Tsourakakis CE. Some properties of random apollonian networks Internet Mathematics. 10: 162-187. DOI: 10.1080/15427951.2013.796300 |
0.379 |
|
2012 |
Frieze A, Tsourakakis CE. Rainbow connection of sparse random graphs Electronic Journal of Combinatorics. 19. DOI: 10.37236/2784 |
0.475 |
|
2012 |
Pagh R, Tsourakakis CE. Colorful triangle counting and a MapReduce implementation Information Processing Letters. 112: 277-281. DOI: 10.1016/J.Ipl.2011.12.007 |
0.448 |
|
2012 |
Frieze A, Tsourakakis CE. Rainbow connectivity of sparse random graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7408: 541-552. DOI: 10.1007/978-3-642-32512-0_46 |
0.427 |
|
2012 |
Frieze A, Tsourakakis CE. On certain properties of random Apollonian networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7323: 93-112. DOI: 10.1007/978-3-642-30541-2_8 |
0.377 |
|
2012 |
Kolountzakis MN, Miller GL, Peng R, Tsourakakis CE. Efficient Triangle Counting In Large Graphs Via Degree-Based Vertex Partitioning Internet Mathematics. 8: 161-185. DOI: 10.1007/978-3-642-18009-5_3 |
0.505 |
|
2011 |
Tsourakakis CE. Large scale graph mining with MapReduce: Diameter estimation and eccentricity plots of massive graphs with mining applications Social Network Mining, Analysis, and Research Trends: Techniques and Applications. 66-78. DOI: 10.4018/978-1-61350-513-7.ch005 |
0.494 |
|
2011 |
Tsourakakis CE, Peng R, Tsiarli MA, Miller GL, Schwartz R. Approximation algorithms for speeding up dynamic programming and denoising aCGH data Acm Journal of Experimental Algorithms. 16. DOI: 10.1145/1963190.2063517 |
0.334 |
|
2011 |
Kang U, Tsourakakis CE, Appel AP, Faloutsos C, Leskovec J. HADI: Mining radii of large graphs Acm Transactions On Knowledge Discovery From Data. 5. DOI: 10.1145/1921632.1921634 |
0.548 |
|
2011 |
Tsourakakis CE, Drineas P, Michelakis E, Koutis I, Faloutsos C. Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation Social Network Analysis and Mining. 1: 75-81. DOI: 10.1007/S13278-010-0001-9 |
0.546 |
|
2011 |
Kang U, Tsourakakis CE, Faloutsos C. PEGASUS: Mining peta-scale graphs Knowledge and Information Systems. 27: 303-325. DOI: 10.1007/s10115-010-0305-0 |
0.501 |
|
2011 |
Tsourakakis CE. Counting triangles in real-world networks using projections Knowledge and Information Systems. 26: 501-520. DOI: 10.1007/S10115-010-0291-2 |
0.557 |
|
2010 |
Kang U, Tsourakakis CE, Appel AP, Faloutsos C, Leskovec J. Radius plots for mining tera-byte scale graphs: Algorithms, patterns, and observations Proceedings of the 10th Siam International Conference On Data Mining, Sdm 2010. 548-558. |
0.527 |
|
2009 |
Tsourakakis CE, Kang U, Miller GL, Faloutsos C. DOULION: Counting triangles in massive graphs with a coin Proceedings of the Acm Sigkdd International Conference On Knowledge Discovery and Data Mining. 837-845. DOI: 10.1145/1557019.1557111 |
0.477 |
|
2009 |
Kang U, Tsourakakis CE, Faloutsos C. PEGASUS: A peta-scale graph mining system - Implementation and observations Proceedings - Ieee International Conference On Data Mining, Icdm. 229-238. DOI: 10.1109/ICDM.2009.14 |
0.505 |
|
2009 |
Tsourakakis CE, Drineas P, Michelakis E, Koutis I, Faloutsos C. Spectral counting of triangles in power-law networks via element-wise sparsification Proceedings of the 2009 International Conference On Advances in Social Network Analysis and Mining, Asonam 2009. 66-71. DOI: 10.1109/ASONAM.2009.32 |
0.475 |
|
2008 |
Tsourakakis CE. Fast counting of triangles in large real networks without counting: Algorithms and laws Proceedings - Ieee International Conference On Data Mining, Icdm. 608-617. DOI: 10.1109/ICDM.2008.72 |
0.482 |
|
Show low-probability matches. |