The following pages link to Charalampos E. Tsourakakis (Q413299):
Displayed 19 items.
- Colorful triangle counting and a \textsc{MapReduce} implementation (Q413300) (← links)
- Rainbow connection of sparse random graphs (Q1953307) (← links)
- Finding densest \(k\)-connected subgraphs (Q2235249) (← links)
- Triangle Sparsifiers (Q2865055) (← links)
- On Certain Properties of Random Apollonian Networks (Q2900588) (← links)
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams (Q2941505) (← links)
- Rainbow Connectivity of Sparse Random Graphs (Q3167424) (← links)
- Rainbow Connection of Random Regular Graphs (Q3452164) (← links)
- Some Properties of Random Apollonian Networks (Q4985353) (← links)
- Toward Quantifying Vertex Similarity in Networks (Q4985357) (← links)
- (Q5365147) (← links)
- Approximation algorithms for speeding up dynamic programming and denoising aCGH data (Q5406242) (← links)
- Joint Alignment from Pairwise Differences with a Noisy Oracle (Q5881228) (← links)
- Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning (Q5891737) (← links)
- Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning (Q5894040) (← links)
- Perfect Reconstruction of Oncogenetic Trees (Q6230425) (← links)
- Scalable motif-aware graph clustering (Q6274788) (← links)
- Predicting Positive and Negative Links with Noisy Queries: Theory & Practice (Q6291631) (← links)
- Optimal Learning of Joint Alignments with a Faulty Oracle (Q6325742) (← links)