Остановите войну!
for scientists:
default search action
Ali Pinar
Publications
- 2022
- [c52]Kasimir Gabert, Ali Pinar, Ümit V. Çatalyürek:
Batch dynamic algorithm to find k-core hierarchies. GRADES-NDA@SIGMOD 2022: 9:1-9:10 - [i43]Kasimir Gabert, Ali Pinar, Ümit V. Çatalyürek:
Batch Dynamic Algorithm to Find k-Cores and Hierarchies. CoRR abs/2203.13095 (2022) - 2021
- [c49]Kasimir Gabert, Ali Pinar, Ümit V. Çatalyürek:
Shared-Memory Scalable k-Core Maintenance on Dynamic Graphs and Hypergraphs. IPDPS Workshops 2021: 998-1007 - [c48]Kasimir Gabert, Kaan Sancak, M. Yusuf Özkaya, Ali Pinar, Ümit V. Çatalyürek:
EIGA: elastic and scalable dynamic graph analysis. SC 2021: 50 - [c46]Kasimir Gabert, Ali Pinar, Ümit V. Çatalyürek:
A Unifying Framework to Identify Dense Subgraphs on Streams: Graph Nuclei to Hypergraph Cores. WSDM 2021: 689-697 - 2020
- [c44]M. Yusuf Özkaya, Muhammed Fatih Balin, Ali Pinar, Ümit V. Çatalyürek:
A scalable graph generation algorithm to sample over a given shell distribution. IPDPS Workshops 2020: 227-236 - 2018
- [c40]M. Yusuf Özkaya, Ahmet Erdem Sanyuce, Ali Pinar, Ümit V. Çatalyürek:
Local Detection of Critical Nodes in Active Graphs. ASONAM 2018: 107-110 - 2017
- [j21]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) - [i39]Yusuf Özkaya, Ahmet Erdem Sariyüce, Ümit V. Çatalyürek, Ali Pinar:
Active Betweenness Cardinality: Algorithms and Applications. CoRR abs/1711.10634 (2017) - 2015
- [c28]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
- [i25]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) - 2012
- [j11]Enver Kayaaslan, Ali Pinar, Ümit V. Çatalyürek, Cevdet Aykanat:
Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs. SIAM J. Sci. Comput. 34(2) (2012) - 2011
- [i8]Enver Kayaaslan, Ali Pinar, Ümit V. Çatalyürek, Cevdet Aykanat:
Hypergraph Partitioning through Vertex Separators on Graphs. CoRR abs/1103.0106 (2011) - 2004
- [j3]Cevdet Aykanat, Ali Pinar, Ümit V. Çatalyürek:
Permuting Sparse Rectangular Matrices into Block-Diagonal Form. SIAM J. Sci. Comput. 25(6): 1860-1879 (2004) - 1995
- [c1]Ali Pinar, Ümit V. Çatalyürek, Cevdet Aykanat, Mustafa Ç. Pinar:
Decomposing Linear Programs for Parallel Solution. PARA 1995: 473-482
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 2023-09-27 22:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint