Ahmet Erdem Sariyüce

Orcid: 0000-0002-4945-6821

According to our database1, Ahmet Erdem Sariyüce authored at least 44 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Temporal Network Motifs: Models, Limitations, Evaluation.
IEEE Trans. Knowl. Data Eng., 2023

Identifying Taxonomic Units in Metagenomic DNA Streams on Mobile Devices.
IEEE ACM Trans. Comput. Biol. Bioinform., 2023

Size-Aware Hypergraph Motifs.
CoRR, 2023

Temporal Motifs for Financial Networks: A Study on Mercari, JPMC, and Venmo Platforms.
CoRR, 2023

On Cohesively Polarized Communities in Signed Networks.
Proceedings of the Companion Proceedings of the ACM Web Conference 2023, 2023

Quantifying Node-Based Core Resilience.
Proceedings of the Machine Learning and Knowledge Discovery in Databases: Research Track, 2023

Skeletal Cores and Graph Resilience.
Proceedings of the Machine Learning and Knowledge Discovery in Databases: Research Track, 2023

Using Motif Transitions for Temporal Graph Generation.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

2022
Counting Induced 6-Cycles in Bipartite Graphs.
Proceedings of the 51st International Conference on Parallel Processing, 2022

Temporal Network Motifs: Models, Limitations, Evaluation (Extended abstract).
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021
Temporal Motifs in Patent Opposition and Collaboration Networks.
CoRR, 2021

Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks.
Proceedings of the WWW '21: The Web Conference 2021, 2021

2020
Residual Core Maximization: An Efficient Algorithm for Maximizing the Size of the <i>k</i>-Core.
Proceedings of the 2020 SIAM International Conference on Data Mining, 2020

Using Large Cliques for Hierarchical Dense Subgraph Discovery.
Proceedings of the Computational Data and Social Networks - 9th International Conference, 2020

Characterizing and Utilizing the Interplay Between Core and Truss Decompositions.
Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

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.
Proc. VLDB Endow., 2018

Counting Butterfies from a Large Bipartite Graph Stream.
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

Butterfly Counting in Bipartite Networks.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

2017
Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs.
ACM Trans. Web, 2017

Graph Manipulations for Fast Centrality Computation.
ACM Trans. Knowl. Discov. Data, 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.
Proc. VLDB Endow., 2016

Fast Hierarchy Construction for Dense Subgraphs.
Proc. VLDB Endow., 2016

SONIC: streaming overlapping community detection.
Data Min. Knowl. Discov., 2016

Butterfly Effect: Peeling Bipartite Networks.
CoRR, 2016

2015
Incremental closeness centrality in distributed memory.
Parallel Comput., 2015

Regularizing graph centrality computations.
J. Parallel Distributed Comput., 2015

Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions.
Proceedings of the 24th International Conference on World Wide Web, 2015

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.
Proc. VLDB Endow., 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 (IEEE BigData 2013), 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


  Loading...