Ali Kemal Sinop

Proceedings of the SIGSPATIAL '21: 29th International Conference on Advances in Geographic Information Systems, 2021

2018

Spectrally Robust Graph Isomorphism.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2016

How to Round Subspaces: A New Spectral Clustering Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Spectral Embedding of k-Cliques, Graph Partitioning and k-Means.

[BibT_eX]

[DOI]

Pranjal Awasthi

Moses Charikar

Ravishankar Krishnaswamy

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015

The Hardness of Approximation of Euclidean k-Means.

[BibT_eX]

[DOI]

Pranjal Awasthi

Moses Charikar

Ravishankar Krishnaswamy

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems.

[BibT_eX]

[DOI]

Yuan Zhou

SIAM J. Optim., 2014

2013

Rounding Lasserre SDPs using column selection and spectrum-based approximation schemes for graph partitioning and Quadratic IPs.

[BibT_eX]

[DOI]

CoRR, 2013

Approximating Non-Uniform Sparsest Cut Via Generalized Spectra.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Towards a Better Approximation for Sparsest Cut?

[BibT_eX]

[DOI]

Sanjeev Arora

Rong Ge

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

Optimal column-based low-rank matrix reconstruction.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Faster SDP Hierarchy Solvers for Local Rounding Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Graph Partitioning and Semi-definite Programming Hierarchies.

[BibT_eX]

[DOI]

PhD thesis, 2011

Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

Certifying Graph Expansion and Non-Uniform Sparsity via Generalized Spectra

[BibT_eX]

[DOI]

CoRR, 2011

The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2009

Improved Inapproximability Results for Maximum k-Colorable Subgraph.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2009

2008

Fast approximate RandomWalker segmentation using eigenvector precomputation.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2008), 2008

2007

Uninitialized, Globally Optimal, Graph-Based Rectilinear Shape Segmentation The Opposing Metrics Method.

[BibT_eX]

[DOI]

Proceedings of the IEEE 11th International Conference on Computer Vision, 2007

A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm.

[BibT_eX]

[DOI]

Proceedings of the IEEE 11th International Conference on Computer Vision, 2007

2006

Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids.

[BibT_eX]

[DOI]