Ali Kemal Sinop

48 papers A* 15A 3Journal 24Unranked 5
YearRankTypeTitle / Venue / Authors
2025 A conf
Fairness and Optimality in Routing.
AAMAS
Sreenivas Gollapudi, Kostas Kollias, Alkmini Sgouritsa, Ali Kemal Sinop
2025 — conf
Why is My Route Different Today? An Algorithm for Explaining Route Selection.
ACDA
Aaron Schild, Sreenivas Gollapudi, Anupam Gupta, Kostas Kollias, Ali Kemal Sinop
2025 J jnl
Why is My Route Different Today? An Algorithm for Explaining Route Selection.
CoRR
Aaron Schild, Sreenivas Gollapudi, Anupam Gupta, Kostas Kollias, Ali Kemal Sinop
2024 A conf
First Passage Percolation with Queried Hints.
AISTATS
Kritkorn Karntikoon, Yiheng Shen, Sreenivas Gollapudi, Kostas Kollias, Aaron Schild, Ali Kemal Sinop
2024 J jnl
First Passage Percolation with Queried Hints.
CoRR
Kritkorn Karntikoon, Yiheng Shen, Sreenivas Gollapudi, Kostas Kollias, Aaron Schild, Ali Kemal Sinop
2023 A* conf
Affinity-Aware Graph Networks.
NeurIPS
Ameya Velingker, Ali Kemal Sinop, Ira Ktena, Petar Velickovic, Sreenivas Gollapudi
2023 A* conf
Exphormer: Sparse Transformers for Graphs.
ICML
Hamed Shirzad, Ameya Velingker, Balaji Venkatachalam, Danica J. Sutherland, Ali Kemal Sinop
2023 J jnl
Exphormer: Sparse Transformers for Graphs.
CoRR
Hamed Shirzad, Ameya Velingker, Balaji Venkatachalam, Danica J. Sutherland, Ali Kemal Sinop
2023 J jnl
Robust Routing Using Electrical Flows.
ACM Trans. Spatial Algorithms Syst.
Ali Kemal Sinop, Lisa Fawcett, Sreenivas Gollapudi, Kostas Kollias
2022 J jnl
Affinity-Aware Graph Networks.
CoRR
Ameya Velingker, Ali Kemal Sinop, Ira Ktena, Petar Velickovic, Sreenivas Gollapudi
2021 — conf
Robust Routing Using Electrical Flows.
SIGSPATIAL/GIS
Ali Kemal Sinop, Lisa Fawcett, Sreenivas Gollapudi, Kostas Kollias
2021 A* conf
Sketch-based Algorithms for Approximate Shortest Paths in Road Networks.
WWW
Gaurav Aggarwal, Sreenivas Gollapudi, Raghavender, Ali Kemal Sinop
2021 — conf
Weighted Stackelberg Algorithms for Road Traffic Optimization.
SIGSPATIAL/GIS
Kostas Kollias, Arun Chandrashekharapuram, Lisa Fawcett, Sreenivas Gollapudi, Ali Kemal Sinop
2018 A* conf
Spectrally Robust Graph Isomorphism.
ICALP
Alexandra Kolla, Ioannis Koutis, Vivek Madan, Ali Kemal Sinop
2018 J jnl
Spectrally Robust Graph Isomorphism.
CoRR
Alexandra Kolla, Ioannis Koutis, Vivek Madan, Ali Kemal Sinop
2016 A* conf
How to Round Subspaces: A New Spectral Clustering Algorithm.
SODA
Ali Kemal Sinop
2016 A conf
Spectral Embedding of k-Cliques, Graph Partitioning and k-Means.
ITCS
Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop
2015 J jnl
How to Round Subspaces: A New Spectral Clustering Algorithm.
CoRR
Ali Kemal Sinop
2015 A* conf
The Hardness of Approximation of Euclidean k-Means.
SoCG
Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop
2015 J jnl
The Hardness of Approximation of Euclidean k-means.
CoRR
Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop
2014 J jnl
Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems.
SIAM J. Optim.
Venkatesan Guruswami, Ali Kemal Sinop, Yuan Zhou
2013 A* conf
Approximating Non-Uniform Sparsest Cut Via Generalized Spectra.
SODA
Venkatesan Guruswami, Ali Kemal Sinop
2013 J jnl
Improved Inapproximability Results for Maximum k-Colorable Subgraph.
Theory Comput.
Venkatesan Guruswami, Ali Kemal Sinop
2013 J jnl
Rounding Lasserre SDPs using column selection and spectrum-based approximation schemes for graph partitioning and Quadratic IPs.
CoRR
Venkatesan Guruswami, Ali Kemal Sinop
2013 A* conf
Towards a Better Approximation for Sparsest Cut?
FOCS
Sanjeev Arora, Rong Ge, Ali Kemal Sinop
2013 J jnl
Towards a better approximation for sparsest cut?
CoRR
Sanjeev Arora, Rong Ge, Ali Kemal Sinop
2012 J jnl
Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems
CoRR
Venkatesan Guruswami, Ali Kemal Sinop, Yuan Zhou
2012 A* conf
Faster SDP Hierarchy Solvers for Local Rounding Algorithms.
FOCS
Venkatesan Guruswami, Ali Kemal Sinop
2012 J jnl
Faster SDP hierarchy solvers for local rounding algorithms
CoRR
Venkatesan Guruswami, Ali Kemal Sinop
2012 J jnl
Faster SDP hierarchy solvers for local rounding algorithms.
Electron. Colloquium Comput. Complex.
Venkatesan Guruswami, Ali Kemal Sinop
2012 A* conf
Optimal column-based low-rank matrix reconstruction.
SODA
Venkatesan Guruswami, Ali Kemal Sinop
2011 J jnl
Certifying Graph Expansion and Non-Uniform Sparsity via Generalized Spectra
CoRR
Venkatesan Guruswami, Ali Kemal Sinop
2011 — —
Graph Partitioning and Semi-definite Programming Hierarchies.
Ali Kemal Sinop
2011 A* conf
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives.
FOCS
Venkatesan Guruswami, Ali Kemal Sinop
2011 J jnl
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
CoRR
Venkatesan Guruswami, Ali Kemal Sinop
2011 J jnl
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives.
Electron. Colloquium Comput. Complex.
Venkatesan Guruswami, Ali Kemal Sinop
2011 J jnl
Optimal Column-Based Low-Rank Matrix Reconstruction
CoRR
Venkatesan Guruswami, Ali Kemal Sinop
2011 A* conf
The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number.
SODA
Venkatesan Guruswami, Ali Kemal Sinop
2010 J jnl
The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number.
Electron. Colloquium Comput. Complex.
Venkatesan Guruswami, Ali Kemal Sinop
2009 J jnl
Improved Inapproximability Results for Maximum k-Colorable Subgraph
CoRR
Venkatesan Guruswami, Ali Kemal Sinop
2009 — conf
Improved Inapproximability Results for Maximum k-Colorable Subgraph.
APPROX-RANDOM
Venkatesan Guruswami, Ali Kemal Sinop
2009 J jnl
Improved Inapproximability Results for Maximum k-Colorable Subgraph.
Electron. Colloquium Comput. Complex.
Venkatesan Guruswami, Ali Kemal Sinop
2008 A* conf
Fast approximate RandomWalker segmentation using eigenvector precomputation.
CVPR
Leo J. Grady, Ali Kemal Sinop
2007 A* conf
A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm.
ICCV
Ali Kemal Sinop, Leo J. Grady
2007 A* conf
Uninitialized, Globally Optimal, Graph-Based Rectilinear Shape Segmentation The Opposing Metrics Method.
ICCV
Ali Kemal Sinop, Leo J. Grady
2006 — conf
Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids.
MICCAI (2)
Ali Kemal Sinop, Leo J. Grady
2005 J jnl
PHR: A Parallel Hierarchical Radiosity System with Dynamic Load Balancing.
J. Supercomput.
Ali Kemal Sinop, Tolga Abaci, Ümit Akkus, Attila Gürsoy, Ugur Güdükbay
2004 J jnl
Content-based retrieval of historical Ottoman documents stored as textual images.
IEEE Trans. Image Process.
Ediz Saykol, Ali Kemal Sinop, Ugur Güdükbay, Özgür Ulusoy, A. Enis Çetin