default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAhmet Erdem Sariyüce
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]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: 70-85- 2023
- [j12]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): 1092-1103 (2023) - [j11]Penghang Liu, Valerio Guarrasi, Ahmet Erdem Sariyüce:
Temporal Network Motifs: Models, Limitations, Evaluation. IEEE Trans. Knowl. Data Eng. 35(1): 945-957 (2023) - [c22]Penghang Liu, Ahmet Erdem Sariyüce:
Using Motif Transitions for Temporal Graph Generation. KDD 2023: 1501-1511 - [c21]Jakir Hossain, Sucheta Soundarajan, Ahmet Erdem Sariyüce:
Quantifying Node-Based Core Resilience. ECML/PKDD (3) 2023: 259-276 - [c20]Danylo Honcharov, Ahmet Erdem Sariyüce, Ricky Laishram, Sucheta Soundarajan:
Skeletal Cores and Graph Resilience. ECML/PKDD (3) 2023: 293-308 - [c19]Jason Niu, Ahmet Erdem Sariyüce:
On Cohesively Polarized Communities in Signed Networks. WWW (Companion Volume) 2023: 1339-1347 - [i18]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 abs/2301.07791 (2023) - [i17]Penghang Liu, Ahmet Erdem Sariyüce:
Using Motif Transitions for Temporal Graph Generation. CoRR abs/2306.11190 (2023) - [i16]Jakir Hossain, Sucheta Soundarajan, Ahmet Erdem Sariyüce:
Quantifying Node-based Core Resilience. CoRR abs/2306.12038 (2023) - [i15]Jason Niu, Ilya D. Amburg, Sinan G. Aksoy, Ahmet Erdem Sariyüce:
Size-Aware Hypergraph Motifs. CoRR abs/2311.07783 (2023) - 2022
- [c18]Penghang Liu, Valerio Guarrasi, Ahmet Erdem Sariyüce:
Temporal Network Motifs: Models, Limitations, Evaluation (Extended abstract). ICDE 2022: 1531-1532 - [c17]Jason Niu, Jaroslaw Zola, Ahmet Erdem Sariyüce:
Counting Induced 6-Cycles in Bipartite Graphs. ICPP 2022: 36:1-36:10 - 2021
- [c16]Ahmet Erdem Sariyüce:
Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks. WWW 2021: 379-390 - [i14]Ahmet Erdem Sariyüce:
Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks. CoRR abs/2103.03374 (2021) - [i13]Penghang Liu, Naoki Masuda, Tomomi Kito, Ahmet Erdem Sariyüce:
Temporal Motifs in Patent Opposition and Collaboration Networks. CoRR abs/2110.11198 (2021) - 2020
- [c15]Penghang Liu, Ahmet Erdem Sariyüce:
Characterizing and Utilizing the Interplay Between Core and Truss Decompositions. IEEE BigData 2020: 957-962 - [c14]Md Moniruzzaman Monir, Ahmet Erdem Sariyüce:
Using Large Cliques for Hierarchical Dense Subgraph Discovery. CSoNet 2020: 179-192 - [c13]Ricky Laishram, Ahmet Erdem Sariyüce, Tina Eliassi-Rad, Ali Pinar, Sucheta Soundarajan:
Residual Core Maximization: An Efficient Algorithm for Maximizing the Size of the k-Core. SDM 2020: 325-333 - [i12]Penghang Liu, Valerio Guarrasi, Ahmet Erdem Sariyüce:
Temporal Network Motifs: Models, Limitations, Evaluation. CoRR abs/2005.11817 (2020) - [i11]Penghang Liu, Ahmet Erdem Sariyüce:
Characterizing and Utilizing the Interplay Between Core and Truss Decompositions. CoRR abs/2011.00749 (2020)
2010 – 2019
- 2019
- [c12]Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyüce, Srikanta Tirthapura:
FLEET: Butterfly Estimation from a Bipartite Graph Stream. CIKM 2019: 1201-1210 - 2018
- [j10]Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar:
Local Algorithms for Hierarchical Dense Subgraph Discovery. Proc. VLDB Endow. 12(1): 43-56 (2018) - [c11]Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariyüce, Srikanta Tirthapura:
Butterfly Counting in Bipartite Networks. KDD 2018: 2150-2159 - [c10]Ahmet Erdem Sariyüce, Ali Pinar:
Peeling Bipartite Networks for Dense Subgraph Discovery. WSDM 2018: 504-512 - [c9]Ricky Laishram, Ahmet Erdem Sariyüce, Tina Eliassi-Rad, Ali Pinar, Sucheta Soundarajan:
Measuring and Improving the Core Resilience of Networks. WWW 2018: 609-618 - [i10]Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariyüce, Srikanta Tirthapura:
Butterfly Counting in Bipartite Networks. CoRR abs/1801.00338 (2018) - [i9]Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyüce, Srikanta Tirthapura:
Counting Butterfies from a Large Bipartite Graph Stream. CoRR abs/1812.03398 (2018) - 2017
- [j9]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): 26:1-26:25 (2017) - [j8]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): 16:1-16:27 (2017) - [i8]Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar:
Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions. CoRR abs/1704.00386 (2017) - [i7]Yusuf Özkaya, Ahmet Erdem Sariyüce, Ümit V. Çatalyürek, Ali Pinar:
Active Betweenness Cardinality: Algorithms and Applications. CoRR abs/1711.10634 (2017) - 2016
- [j7]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): 819-847 (2016) - [j6]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): 1341-1352 (2016) - [j5]Ahmet Erdem Sariyüce, Ali Pinar:
Fast Hierarchy Construction for Dense Subgraphs. Proc. VLDB Endow. 10(3): 97-108 (2016) - [j4]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): 425-447 (2016) - [i6]Ahmet Erdem Sariyüce, Ali Pinar:
Fast Hierarchy Construction for Dense Subgraphs. CoRR abs/1610.01961 (2016) - [i5]Ahmet Erdem Sariyüce, Ali Pinar:
Butterfly Effect: Peeling Bipartite Networks. CoRR abs/1611.02756 (2016) - 2015
- [j3]Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
Regularizing graph centrality computations. J. Parallel Distributed Comput. 76: 106-119 (2015) - [j2]Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
Incremental closeness centrality in distributed memory. Parallel Comput. 47: 3-18 (2015) - [c8]Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek:
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. WWW 2015: 927-937 - 2014
- [c7]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: 1386-1395 - [i4]Ahmet Erdem Sariyüce, Erik Saule, Ümit V. Çatalyürek:
On Distributed Graph Coloring with Iterative Recoloring. CoRR abs/1407.6745 (2014) - [i3]Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek:
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. CoRR abs/1411.3312 (2014) - 2013
- [j1]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): 433-444 (2013) - [c6]Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek:
Betweenness centrality on GPUs and heterogeneous architectures. GPGPU@ASPLOS 2013: 76-85 - [c5]Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek:
Incremental algorithms for closeness centrality. IEEE BigData 2013: 487-492 - [c4]Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
STREAMER: A distributed framework for incremental closeness centrality computation. CLUSTER 2013: 1-8 - [c3]Ümit V. Çatalyürek, Kamer Kaya, Ahmet Erdem Sariyüce, Erik Saule:
Shattering and Compressing Networks for Betweenness Centrality. SDM 2013: 686-694 - [i2]Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek:
Incremental Algorithms for Network Management and Analysis based on Closeness Centrality. CoRR abs/1303.0422 (2013) - 2012
- [c2]Ahmet Erdem Sariyüce, Erik Saule, Ümit V. Çatalyürek:
Scalable Hybrid Implementation of Graph Coloring Using MPI and OpenMP. IPDPS Workshops 2012: 1744-1753 - [i1]Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
Shattering and Compressing Networks for Centrality Analysis. CoRR abs/1209.6007 (2012) - 2011
- [c1]Ahmet Erdem Sariyüce, Erik Saule, Ümit V. Çatalyürek:
Improving graph coloring on distributed-memory parallel computers. HiPC 2011: 1-10
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-25 01:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
