Ahmet Erdem Sariyüce

66 papers A* 6A 6B 3C 1Misc 1Journal 37Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Core-based Hierarchies for Efficient GraphRAG. CoRR Jakir Hossain, Ahmet Erdem Sariyüce
2026	J	`jnl`	Stochastic Event Prediction via Temporal Motif Transitions. CoRR Ibrahim Bahadir Altun, Ahmet Erdem Sariyüce
2025	J	`jnl`	Better Call Graphs: A New Dataset of Function Call Graphs for Malware Classification. CoRR Jakir Hossain, Gurvinder Singh, Lukasz Ziarek, Ahmet Erdem Sariyüce
2025	J	`jnl`	Characterizing and locating polarized communities in signed networks. Knowl. Inf. Syst. Jason Niu, Ahmet Erdem Sariyüce
2025	—	`conf`	Density-Aware Walks for Coordinated Campaign Detection. ECML/PKDD (10) Atul Anand Gopalakrishnan, Jakir Hossain, Tugrulcan Elmas, Ahmet Erdem Sariyüce
2025	J	`jnl`	Density-aware Walks for Coordinated Campaign Detection. CoRR Atul Anand Gopalakrishnan, Jakir Hossain, Tugrulcan Elmas, Ahmet Erdem Sariyüce
2025	J	`jnl`	Fast Counting and Utilizing Induced 6-Cycles in Bipartite Networks. IEEE Trans. Knowl. Data Eng. Jason Niu, Jaroslaw Zola, Ahmet Erdem Sariyüce
2025	A	`conf`	Large Engagement Networks for Classifying Coordinated Campaigns and Organic Twitter Trends. ICWSM Atul Anand Gopalakrishnan, Jakir Hossain, Tugrulcan Elmas, Ahmet Erdem Sariyüce
2025	J	`jnl`	Large Engagement Networks for Classifying Coordinated Campaigns and Organic Twitter Trends. CoRR Atul Anand Gopalakrishnan, Jakir Hossain, Tugrulcan Elmas, Ahmet Erdem Sariyüce
2025	—	`conf`	Robustness of Truss Decomposition and Implications for GNN-Based Edge Classification. ICDM (Workshops) Jakir Hossain, Sucheta Soundarajan, Ahmet Erdem Sariyüce
2025	—	`conf`	Temporal Motifs for Financial Networks: A Study on Mercari, JPMC, and Venmo Platforms. ASONAM (1) Penghang Liu, Bahadir Altun, Rupam Acharyya, Robert E. Tillman, Shunya Kimura, Naoki Masuda, Ahmet Erdem Sariyüce
2024	A	`conf`	Curated and Asymmetric Exposure: A Case Study of Partisan Talk during COVID on Twitter. ICWSM Zijian An, Jessica Breuhaus, Jason Niu, Ahmet Erdem Sariyüce, Kenneth Joseph
2024	B	`conf`	From Words to Actions: A Comprehensive Approach to Identifying Incel Behavior on Reddit. IEEE Big Data Ahmet Y. Demirbas, Jakir Hossain, Ahmet Erdem Sariyüce
2024	B	`conf`	Retrieving Top-k Hyperedge Triplets: Models and Applications. IEEE Big Data Jason Niu, Ilya D. Amburg, Sinan G. Aksoy, Ahmet Erdem Sariyüce
2023	J	`jnl`	Identifying Taxonomic Units in Metagenomic DNA Streams on Mobile Devices. IEEE ACM Trans. Comput. Biol. Bioinform. Vicky Zheng, Ahmet Erdem Sariyüce, Jaroslaw Zola
2023	—	`conf`	On Cohesively Polarized Communities in Signed Networks. WWW (Companion Volume) Jason Niu, Ahmet Erdem Sariyüce
2023	—	`conf`	Quantifying Node-Based Core Resilience. ECML/PKDD (3) Jakir Hossain, Sucheta Soundarajan, Ahmet Erdem Sariyüce
2023	J	`jnl`	Quantifying Node-based Core Resilience. CoRR Jakir Hossain, Sucheta Soundarajan, Ahmet Erdem Sariyüce
2023	J	`jnl`	Size-Aware Hypergraph Motifs. CoRR Jason Niu, Ilya D. Amburg, Sinan G. Aksoy, Ahmet Erdem Sariyüce
2023	—	`conf`	Skeletal Cores and Graph Resilience. ECML/PKDD (3) Danylo Honcharov, Ahmet Erdem Sariyüce, Ricky Laishram, Sucheta Soundarajan
2023	J	`jnl`	Temporal Motifs for Financial Networks: A Study on Mercari, JPMC, and Venmo Platforms. CoRR Penghang Liu, Rupam Acharyya, Robert E. Tillman, Shunya Kimura, Naoki Masuda, Ahmet Erdem Sariyüce
2023	J	`jnl`	Temporal Network Motifs: Models, Limitations, Evaluation. IEEE Trans. Knowl. Data Eng. Penghang Liu, Valerio Guarrasi, Ahmet Erdem Sariyüce
2023	A*	`conf`	Using Motif Transitions for Temporal Graph Generation. KDD Penghang Liu, Ahmet Erdem Sariyüce
2023	J	`jnl`	Using Motif Transitions for Temporal Graph Generation. CoRR Penghang Liu, Ahmet Erdem Sariyüce
2022	B	`conf`	Counting Induced 6-Cycles in Bipartite Graphs. ICPP Jason Niu, Jaroslaw Zola, Ahmet Erdem Sariyüce
2022	A*	`conf`	Temporal Network Motifs: Models, Limitations, Evaluation (Extended abstract). ICDE Penghang Liu, Valerio Guarrasi, Ahmet Erdem Sariyüce
2021	A*	`conf`	Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks. WWW Ahmet Erdem Sariyüce
2021	J	`jnl`	Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks. CoRR Ahmet Erdem Sariyüce
2021	J	`jnl`	Temporal Motifs in Patent Opposition and Collaboration Networks. CoRR Penghang Liu, Naoki Masuda, Tomomi Kito, Ahmet Erdem Sariyüce
2020	—	`conf`	Characterizing and Utilizing the Interplay Between Core and Truss Decompositions. IEEE BigData Penghang Liu, Ahmet Erdem Sariyüce
2020	J	`jnl`	Characterizing and Utilizing the Interplay Between Core and Truss Decompositions. CoRR Penghang Liu, Ahmet Erdem Sariyüce
2020	A	`conf`	Residual Core Maximization: An Efficient Algorithm for Maximizing the Size of the SDM Ricky Laishram, Ahmet Erdem Sariyüce, Tina Eliassi-Rad, Ali Pinar, Sucheta Soundarajan
2020	J	`jnl`	Temporal Network Motifs: Models, Limitations, Evaluation. CoRR Penghang Liu, Valerio Guarrasi, Ahmet Erdem Sariyüce
2020	—	`conf`	Using Large Cliques for Hierarchical Dense Subgraph Discovery. CSoNet Md Moniruzzaman Monir, Ahmet Erdem Sariyüce
2019	A	`conf`	FLEET: Butterfly Estimation from a Bipartite Graph Stream. CIKM Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyüce, Srikanta Tirthapura
2018	A*	`conf`	Butterfly Counting in Bipartite Networks. KDD Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariyüce, Srikanta Tirthapura
2018	J	`jnl`	Butterfly Counting in Bipartite Networks. CoRR Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariyüce, Srikanta Tirthapura
2018	J	`jnl`	Counting Butterfies from a Large Bipartite Graph Stream. CoRR Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyüce, Srikanta Tirthapura
2018	J	`jnl`	Local Algorithms for Hierarchical Dense Subgraph Discovery. Proc. VLDB Endow. Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar
2018	A*	`conf`	Measuring and Improving the Core Resilience of Networks. WWW Ricky Laishram, Ahmet Erdem Sariyüce, Tina Eliassi-Rad, Ali Pinar, Sucheta Soundarajan
2018	A	`conf`	Peeling Bipartite Networks for Dense Subgraph Discovery. WSDM Ahmet Erdem Sariyüce, Ali Pinar
2017	J	`jnl`	Active Betweenness Cardinality: Algorithms and Applications. CoRR Yusuf Özkaya, Ahmet Erdem Sariyüce, Ümit V. Çatalyürek, Ali Pinar
2017	J	`jnl`	Graph Manipulations for Fast Centrality Computation. ACM Trans. Knowl. Discov. Data Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek
2017	J	`jnl`	Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs. ACM Trans. Web Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek
2017	J	`jnl`	Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions. CoRR Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar
2016	J	`jnl`	Butterfly Effect: Peeling Bipartite Networks. CoRR Ahmet Erdem Sariyüce, Ali Pinar
2016	J	`jnl`	Consistent Regions: Guaranteed Tuple Processing in IBM Streams. Proc. VLDB Endow. Gabriela Jacques da Silva, Fang Zheng, Daniel Debrunner, Kun-Lung Wu, Victor Dogaru, Eric Johnson, Michael Spicer, Ahmet Erdem Sariyüce
2016	J	`jnl`	Fast Hierarchy Construction for Dense Subgraphs. CoRR Ahmet Erdem Sariyüce, Ali Pinar
2016	J	`jnl`	Fast Hierarchy Construction for Dense Subgraphs. Proc. VLDB Endow. Ahmet Erdem Sariyüce, Ali Pinar
2016	J	`jnl`	Incremental k-core decomposition: algorithms and evaluation. VLDB J. Ahmet Erdem Sariyüce, Bugra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, Ümit V. Çatalyürek
2016	J	`jnl`	SONIC: streaming overlapping community detection. Data Min. Knowl. Discov. Ahmet Erdem Sariyüce, Bugra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, Ümit V. Çatalyürek
2015	A*	`conf`	Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. WWW Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek
2015	J	`jnl`	Incremental closeness centrality in distributed memory. Parallel Comput. Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
2015	J	`jnl`	Regularizing graph centrality computations. J. Parallel Distributed Comput. Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
2014	J	`jnl`	Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. CoRR Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek
2014	—	`conf`	Hardware/Software Vectorization for Closeness Centrality on Multi-/Many-Core Architectures. IPDPS Workshops Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
2014	J	`jnl`	On Distributed Graph Coloring with Iterative Recoloring. CoRR Ahmet Erdem Sariyüce, Erik Saule, Ümit V. Çatalyürek
2013	—	`conf`	Betweenness centrality on GPUs and heterogeneous architectures. GPGPU@ASPLOS Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek
2013	J	`jnl`	Incremental Algorithms for Network Management and Analysis based on Closeness Centrality CoRR Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek
2013	—	`conf`	Incremental algorithms for closeness centrality. IEEE BigData Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek
2013	C	`conf`	STREAMER: A distributed framework for incremental closeness centrality computation. CLUSTER Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
2013	A	`conf`	Shattering and Compressing Networks for Betweenness Centrality. SDM Ümit V. Çatalyürek, Kamer Kaya, Ahmet Erdem Sariyüce, Erik Saule
2013	J	`jnl`	Streaming Algorithms for k-core Decomposition. Proc. VLDB Endow. Ahmet Erdem Sariyüce, Bugra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, Ümit V. Çatalyürek
2012	—	`conf`	Scalable Hybrid Implementation of Graph Coloring Using MPI and OpenMP. IPDPS Workshops Ahmet Erdem Sariyüce, Erik Saule, Ümit V. Çatalyürek
2012	J	`jnl`	Shattering and Compressing Networks for Centrality Analysis CoRR Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
2011	Misc	`conf`	Improving graph coloring on distributed-memory parallel computers. HiPC Ahmet Erdem Sariyüce, Erik Saule, Ümit V. Çatalyürek