default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli Kemal Sinop
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c21]Kritkorn Karntikoon, Yiheng Shen, Sreenivas Gollapudi, Kostas Kollias, Aaron Schild, Ali Kemal Sinop:
First Passage Percolation with Queried Hints. AISTATS 2024: 4231-4239- [i18]Kritkorn Karntikoon, Yiheng Shen, Sreenivas Gollapudi, Kostas Kollias, Aaron Schild, Ali Kemal Sinop:
First Passage Percolation with Queried Hints. CoRR abs/2403.10640 (2024) - 2023
- [j5]Ali Kemal Sinop
, Lisa Fawcett, Sreenivas Gollapudi, Kostas Kollias:
Robust Routing Using Electrical Flows. ACM Trans. Spatial Algorithms Syst. 9(4): 24:1-24:25 (2023) - [c20]Hamed Shirzad, Ameya Velingker, Balaji Venkatachalam, Danica J. Sutherland, Ali Kemal Sinop:
Exphormer: Sparse Transformers for Graphs. ICML 2023: 31613-31632 - [c19]Ameya Velingker, Ali Kemal Sinop, Ira Ktena, Petar Velickovic, Sreenivas Gollapudi:
Affinity-Aware Graph Networks. NeurIPS 2023 - [i17]Hamed Shirzad, Ameya Velingker, Balaji Venkatachalam, Danica J. Sutherland, Ali Kemal Sinop:
Exphormer: Sparse Transformers for Graphs. CoRR abs/2303.06147 (2023) - 2022
- [i16]Ameya Velingker, Ali Kemal Sinop, Ira Ktena, Petar Velickovic, Sreenivas Gollapudi:
Affinity-Aware Graph Networks. CoRR abs/2206.11941 (2022) - 2021
- [c18]Kostas Kollias, Arun Chandrashekharapuram, Lisa Fawcett, Sreenivas Gollapudi, Ali Kemal Sinop:
Weighted Stackelberg Algorithms for Road Traffic Optimization. SIGSPATIAL/GIS 2021: 57-68 - [c17]Ali Kemal Sinop, Lisa Fawcett, Sreenivas Gollapudi, Kostas Kollias:
Robust Routing Using Electrical Flows. SIGSPATIAL/GIS 2021: 282-292 - [c16]Gaurav Aggarwal, Sreenivas Gollapudi, Raghavender, Ali Kemal Sinop:
Sketch-based Algorithms for Approximate Shortest Paths in Road Networks. WWW 2021: 3918-3929
2010 – 2019
- 2018
- [c15]Alexandra Kolla, Ioannis Koutis, Vivek Madan, Ali Kemal Sinop:
Spectrally Robust Graph Isomorphism. ICALP 2018: 84:1-84:13 - [i15]Alexandra Kolla, Ioannis Koutis, Vivek Madan, Ali Kemal Sinop:
Spectrally Robust Graph Isomorphism. CoRR abs/1805.00181 (2018) - 2016
- [c14]Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop:
Spectral Embedding of k-Cliques, Graph Partitioning and k-Means. ITCS 2016: 301-310 - [c13]Ali Kemal Sinop:
How to Round Subspaces: A New Spectral Clustering Algorithm. SODA 2016: 1832-1847 - 2015
- [c12]Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop:
The Hardness of Approximation of Euclidean k-Means. SoCG 2015: 754-767 - [i14]Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop:
The Hardness of Approximation of Euclidean k-means. CoRR abs/1502.03316 (2015) - [i13]Ali Kemal Sinop:
How to Round Subspaces: A New Spectral Clustering Algorithm. CoRR abs/1503.00827 (2015) - 2014
- [j4]Venkatesan Guruswami, Ali Kemal Sinop, Yuan Zhou:
Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems. SIAM J. Optim. 24(4): 1698-1717 (2014) - 2013
- [j3]Venkatesan Guruswami, Ali Kemal Sinop:
Improved Inapproximability Results for Maximum k-Colorable Subgraph. Theory Comput. 9: 413-435 (2013) - [c11]Sanjeev Arora, Rong Ge, Ali Kemal Sinop:
Towards a Better Approximation for Sparsest Cut? FOCS 2013: 270-279 - [c10]Venkatesan Guruswami, Ali Kemal Sinop:
Approximating Non-Uniform Sparsest Cut Via Generalized Spectra. SODA 2013: 295-305 - [i12]Sanjeev Arora, Rong Ge, Ali Kemal Sinop:
Towards a better approximation for sparsest cut? CoRR abs/1304.3365 (2013) - [i11]Venkatesan Guruswami, Ali Kemal Sinop:
Rounding Lasserre SDPs using column selection and spectrum-based approximation schemes for graph partitioning and Quadratic IPs. CoRR abs/1312.3024 (2013) - 2012
- [c9]Venkatesan Guruswami, Ali Kemal Sinop:
Faster SDP Hierarchy Solvers for Local Rounding Algorithms. FOCS 2012: 197-206 - [c8]Venkatesan Guruswami, Ali Kemal Sinop:
Optimal column-based low-rank matrix reconstruction. SODA 2012: 1207-1214 - [i10]Venkatesan Guruswami, Ali Kemal Sinop, Yuan Zhou:
Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems. CoRR abs/1202.6071 (2012) - [i9]Venkatesan Guruswami, Ali Kemal Sinop:
Faster SDP hierarchy solvers for local rounding algorithms. CoRR abs/1207.4372 (2012) - [i8]Venkatesan Guruswami, Ali Kemal Sinop:
Faster SDP hierarchy solvers for local rounding algorithms. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [b1]Ali Kemal Sinop:
Graph Partitioning and Semi-definite Programming Hierarchies. Carnegie Mellon University, USA, 2011 - [c7]Venkatesan Guruswami, Ali Kemal Sinop:
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives. FOCS 2011: 482-491 - [c6]Venkatesan Guruswami, Ali Kemal Sinop:
The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number. SODA 2011: 1615-1626 - [i7]Venkatesan Guruswami, Ali Kemal Sinop:
Optimal Column-Based Low-Rank Matrix Reconstruction. CoRR abs/1104.1732 (2011) - [i6]Venkatesan Guruswami, Ali Kemal Sinop:
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives. CoRR abs/1104.4746 (2011) - [i5]Venkatesan Guruswami, Ali Kemal Sinop:
Certifying Graph Expansion and Non-Uniform Sparsity via Generalized Spectra. CoRR abs/1112.4109 (2011) - [i4]Venkatesan Guruswami, Ali Kemal Sinop:
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [i3]Venkatesan Guruswami, Ali Kemal Sinop:
The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c5]Venkatesan Guruswami, Ali Kemal Sinop:
Improved Inapproximability Results for Maximum k-Colorable Subgraph. APPROX-RANDOM 2009: 163-176 - [i2]Venkatesan Guruswami, Ali Kemal Sinop:
Improved Inapproximability Results for Maximum k-Colorable Subgraph. CoRR abs/0910.2271 (2009) - [i1]Venkatesan Guruswami, Ali Kemal Sinop:
Improved Inapproximability Results for Maximum k-Colorable Subgraph. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c4]Leo J. Grady, Ali Kemal Sinop:
Fast approximate RandomWalker segmentation using eigenvector precomputation. CVPR 2008 - 2007
- [c3]Ali Kemal Sinop, Leo J. Grady:
A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm. ICCV 2007: 1-8 - [c2]Ali Kemal Sinop, Leo J. Grady:
Uninitialized, Globally Optimal, Graph-Based Rectilinear Shape Segmentation The Opposing Metrics Method. ICCV 2007: 1-8 - 2006
- [c1]Ali Kemal Sinop, Leo J. Grady:
Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids. MICCAI (2) 2006: 896-903 - 2005
- [j2]Ali Kemal Sinop, Tolga Abaci, Ümit Akkus, Attila Gürsoy, Ugur Güdükbay:
PHR: A Parallel Hierarchical Radiosity System with Dynamic Load Balancing. J. Supercomput. 31(3): 249-263 (2005) - 2004
- [j1]Ediz Saykol, Ali Kemal Sinop, Ugur Güdükbay, Özgür Ulusoy, A. Enis Çetin:
Content-based retrieval of historical Ottoman documents stored as textual images. IEEE Trans. Image Process. 13(3): 314-325 (2004)
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-10-16 21:22 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:
