# Ahmet Erdem Sariyüce

According to our database

Collaborative distances:

^{1}, Ahmet Erdem Sariyüce authored at least 30 papers between 2011 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

FLEET: Butterfly Estimation from a Bipartite Graph Stream.

Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018

Local Algorithms for Hierarchical Dense Subgraph Discovery.

PVLDB, 2018

Counting Butterfies from a Large Bipartite Graph Stream.

CoRR, 2018

Butterfly Counting in Bipartite Networks.

CoRR, 2018

Measuring and Improving the Core Resilience of Networks.

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Peeling Bipartite Networks for Dense Subgraph Discovery.

Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

2017

Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs.

TWEB, 2017

Graph Manipulations for Fast Centrality Computation.

TKDD, 2017

Active Betweenness Cardinality: Algorithms and Applications.

CoRR, 2017

Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions.

CoRR, 2017

2016

Incremental k-core decomposition: algorithms and evaluation.

VLDB J., 2016

Consistent Regions: Guaranteed Tuple Processing in IBM Streams.

PVLDB, 2016

SONIC: streaming overlapping community detection.

Data Min. Knowl. Discov., 2016

Butterfly Effect: Peeling Bipartite Networks.

CoRR, 2016

Fast Hierarchy Construction for Dense Subgraphs.

CoRR, 2016

2015

Incremental closeness centrality in distributed memory.

Parallel Computing, 2015

Regularizing graph centrality computations.

J. Parallel Distrib. Comput., 2015

Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions.

Proceedings of the 24th International Conference on World Wide Web, 2015

2014

Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions.

CoRR, 2014

On Distributed Graph Coloring with Iterative Recoloring.

CoRR, 2014

Hardware/Software Vectorization for Closeness Centrality on Multi-/Many-Core Architectures.

Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014

2013

Streaming Algorithms for k-core Decomposition.

PVLDB, 2013

Incremental Algorithms for Network Management and Analysis based on Closeness Centrality

CoRR, 2013

Shattering and Compressing Networks for Betweenness Centrality.

Proceedings of the 13th SIAM International Conference on Data Mining, 2013

STREAMER: A distributed framework for incremental closeness centrality computation.

Proceedings of the 2013 IEEE International Conference on Cluster Computing, 2013

Incremental algorithms for closeness centrality.

Proceedings of the 2013 IEEE International Conference on Big Data, 2013

Betweenness centrality on GPUs and heterogeneous architectures.

Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units, 2013

2012

Shattering and Compressing Networks for Centrality Analysis

CoRR, 2012

Scalable Hybrid Implementation of Graph Coloring Using MPI and OpenMP.

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

2011

Improving graph coloring on distributed-memory parallel computers.

Proceedings of the 18th International Conference on High Performance Computing, 2011