Ahmet Erdem Sariyüce

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 41

Top Topics

Degree Centrality

Bipartite Graph

Community Detection

Top Venues

Proc. VLDB Endow.

Publications

Zijian An, Jessica Breuhaus, Jason Niu, Ahmet Erdem Sariyüce, Kenneth Joseph
Curated and Asymmetric Exposure: A Case Study of Partisan Talk during COVID on Twitter. ICWSM (2024)
Penghang Liu, Ahmet Erdem Sariyüce
Using Motif Transitions for Temporal Graph Generation. CoRR (2023)
Penghang Liu, Valerio Guarrasi, Ahmet Erdem Sariyüce
Temporal Network Motifs: Models, Limitations, Evaluation. IEEE Trans. Knowl. Data Eng. 35 (1) (2023)
Jason Niu, Ahmet Erdem Sariyüce
On Cohesively Polarized Communities in Signed Networks. WWW (Companion Volume) (2023)
Jason Niu, Ilya D. Amburg, Sinan G. Aksoy, Ahmet Erdem Sariyüce
Size-Aware Hypergraph Motifs. CoRR (2023)
Jakir Hossain, Sucheta Soundarajan, Ahmet Erdem Sariyüce
Quantifying Node-based Core Resilience. CoRR (2023)
Penghang Liu, Rupam Acharyya, Robert E. Tillman, Shunya Kimura, Naoki Masuda, Ahmet Erdem Sariyüce
Temporal Motifs for Financial Networks: A Study on Mercari, JPMC, and Venmo Platforms. CoRR (2023)
Penghang Liu, Ahmet Erdem Sariyüce
Using Motif Transitions for Temporal Graph Generation. KDD (2023)
Jakir Hossain, Sucheta Soundarajan, Ahmet Erdem Sariyüce
Quantifying Node-Based Core Resilience. ECML/PKDD (3) (2023)
Vicky Zheng, Ahmet Erdem Sariyüce, Jaroslaw Zola
Identifying Taxonomic Units in Metagenomic DNA Streams on Mobile Devices. IEEE ACM Trans. Comput. Biol. Bioinform. 20 (2) (2023)
Danylo Honcharov, Ahmet Erdem Sariyüce, Ricky Laishram, Sucheta Soundarajan
Skeletal Cores and Graph Resilience. ECML/PKDD (3) (2023)
Penghang Liu, Valerio Guarrasi, Ahmet Erdem Sariyüce
Temporal Network Motifs: Models, Limitations, Evaluation (Extended abstract). ICDE (2022)
Jason Niu, Jaroslaw Zola, Ahmet Erdem Sariyüce
Counting Induced 6-Cycles in Bipartite Graphs. ICPP (2022)
Ahmet Erdem Sariyüce
Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks. WWW (2021)
Ahmet Erdem Sariyüce
Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks. CoRR (2021)
Penghang Liu, Naoki Masuda, Tomomi Kito, Ahmet Erdem Sariyüce
Temporal Motifs in Patent Opposition and Collaboration Networks. CoRR (2021)
Ricky Laishram, Ahmet Erdem Sariyüce, Tina Eliassi-Rad, Ali Pinar, Sucheta Soundarajan
-Core. SDM (2020)
Penghang Liu, Ahmet Erdem Sariyüce
Characterizing and Utilizing the Interplay Between Core and Truss Decompositions. IEEE BigData (2020)
Md Moniruzzaman Monir, Ahmet Erdem Sariyüce
Using Large Cliques for Hierarchical Dense Subgraph Discovery. CSoNet (2020)
Penghang Liu, Valerio Guarrasi, Ahmet Erdem Sariyüce
Temporal Network Motifs: Models, Limitations, Evaluation. CoRR (2020)
Penghang Liu, Ahmet Erdem Sariyüce
Characterizing and Utilizing the Interplay Between Core and Truss Decompositions. CoRR (2020)
Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyüce, Srikanta Tirthapura
FLEET: Butterfly Estimation from a Bipartite Graph Stream. CIKM (2019)
Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar
Local Algorithms for Hierarchical Dense Subgraph Discovery. Proc. VLDB Endow. 12 (1) (2018)
Ricky Laishram, Ahmet Erdem Sariyüce, Tina Eliassi-Rad, Ali Pinar, Sucheta Soundarajan
Measuring and Improving the Core Resilience of Networks. WWW (2018)
Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariyüce, Srikanta Tirthapura
Butterfly Counting in Bipartite Networks. KDD (2018)
Ahmet Erdem Sariyüce, Ali Pinar
Peeling Bipartite Networks for Dense Subgraph Discovery. WSDM (2018)
Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyüce, Srikanta Tirthapura
Counting Butterfies from a Large Bipartite Graph Stream. CoRR (2018)
Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariyüce, Srikanta Tirthapura
Butterfly Counting in Bipartite Networks. CoRR (2018)
Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar
Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions. CoRR (2017)
Yusuf Özkaya, Ahmet Erdem Sariyüce, Ümit V. Çatalyürek, Ali Pinar
Active Betweenness Cardinality: Algorithms and Applications. CoRR (2017)
Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek
Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs. ACM Trans. Web 11 (3) (2017)
Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek
Graph Manipulations for Fast Centrality Computation. ACM Trans. Knowl. Discov. Data 11 (3) (2017)
Ahmet Erdem Sariyüce, Ali Pinar
Butterfly Effect: Peeling Bipartite Networks. CoRR (2016)
Ahmet Erdem Sariyüce, Bugra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, Ümit V. Çatalyürek
SONIC: streaming overlapping community detection. Data Min. Knowl. Discov. 30 (4) (2016)
Ahmet Erdem Sariyüce, Bugra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, Ümit V. Çatalyürek
Incremental k-core decomposition: algorithms and evaluation. VLDB J. 25 (3) (2016)
Gabriela Jacques da Silva, Fang Zheng, Daniel Debrunner, Kun-Lung Wu, Victor Dogaru, Eric Johnson, Michael Spicer, Ahmet Erdem Sariyüce
Consistent Regions: Guaranteed Tuple Processing in IBM Streams. Proc. VLDB Endow. 9 (13) (2016)
Ahmet Erdem Sariyüce, Ali Pinar
Fast Hierarchy Construction for Dense Subgraphs. CoRR (2016)
Ahmet Erdem Sariyüce, Ali Pinar
Fast Hierarchy Construction for Dense Subgraphs. Proc. VLDB Endow. 10 (3) (2016)
Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
Regularizing graph centrality computations. J. Parallel Distributed Comput. 76 (2015)
Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
Incremental closeness centrality in distributed memory. Parallel Comput. 47 (2015)
Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. WWW (2015)
Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
Hardware/Software Vectorization for Closeness Centrality on Multi-/Many-Core Architectures. IPDPS Workshops (2014)
Ahmet Erdem Sariyüce, Erik Saule, Ümit V. Çatalyürek
On Distributed Graph Coloring with Iterative Recoloring. CoRR (2014)
Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. CoRR (2014)
Ümit V. Çatalyürek, Kamer Kaya, Ahmet Erdem Sariyüce, Erik Saule
Shattering and Compressing Networks for Betweenness Centrality. SDM (2013)
Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
STREAMER: A distributed framework for incremental closeness centrality computation. CLUSTER (2013)
Ahmet Erdem Sariyüce, Bugra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, Ümit V. Çatalyürek
Streaming Algorithms for k-core Decomposition. Proc. VLDB Endow. 6 (6) (2013)
Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek
Incremental Algorithms for Network Management and Analysis based on Closeness Centrality CoRR (2013)
Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek
Incremental algorithms for closeness centrality. IEEE BigData (2013)
Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek
Betweenness centrality on GPUs and heterogeneous architectures. GPGPU@ASPLOS (2013)
Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
Shattering and Compressing Networks for Centrality Analysis CoRR (2012)
Ahmet Erdem Sariyüce, Erik Saule, Ümit V. Çatalyürek
Scalable Hybrid Implementation of Graph Coloring Using MPI and OpenMP. IPDPS Workshops (2012)
Ahmet Erdem Sariyüce, Erik Saule, Ümit V. Çatalyürek
Improving graph coloring on distributed-memory parallel computers. HiPC (2011)