Content-based retrieval of historical Ottoman documents stored as textual images. - Ediz Saykol; Ali Kemal Sinop; Ugur Güdükbay; Özgür Ulusoy; A. Enis Çetin (IEEE Trans. Image Process., 2004)

PHR: A Parallel Hierarchical Radiosity System with Dynamic Load Balancing. - Ali Kemal Sinop; Tolga Abaci; Ümit Akkus; Attila Gürsoy; Ugur Güdükbay (J. Supercomput., 2005)

Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids. - Ali Kemal Sinop; Leo J. Grady (MICCAI (2), 2006)

A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm. - Ali Kemal Sinop; Leo J. Grady (ICCV, 2007)

Uninitialized, Globally Optimal, Graph-Based Rectilinear Shape Segmentation The Opposing Metrics Method. - Ali Kemal Sinop; Leo J. Grady (ICCV, 2007)

Fast approximate RandomWalker segmentation using eigenvector precomputation. - Leo J. Grady; Ali Kemal Sinop (CVPR, 2008)

Improved Inapproximability Results for Maximum k-Colorable Subgraph. - Venkatesan Guruswami; Ali Kemal Sinop (APPROX-RANDOM, 2009)

Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives. - Venkatesan Guruswami; Ali Kemal Sinop (FOCS, 2011)

The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number. - Venkatesan Guruswami; Ali Kemal Sinop (SODA, 2011)

Certifying Graph Expansion and Non-Uniform Sparsity via Generalized Spectra - Venkatesan Guruswami; Ali Kemal Sinop (CoRR, 2011)

Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives. - Venkatesan Guruswami; Ali Kemal Sinop (Electron. Colloquium Comput. Complex., 2011)

Graph Partitioning and Semi-definite Programming Hierarchies. - Ali Kemal Sinop (2011)

Faster SDP Hierarchy Solvers for Local Rounding Algorithms. - Venkatesan Guruswami; Ali Kemal Sinop (FOCS, 2012)

Optimal column-based low-rank matrix reconstruction. - Venkatesan Guruswami; Ali Kemal Sinop (SODA, 2012)

Towards a Better Approximation for Sparsest Cut? - Sanjeev Arora; Rong Ge 001; Ali Kemal Sinop (FOCS, 2013)

Approximating Non-Uniform Sparsest Cut Via Generalized Spectra. - Venkatesan Guruswami; Ali Kemal Sinop (SODA, 2013)

Rounding Lasserre SDPs using column selection and spectrum-based approximation schemes for graph partitioning and Quadratic IPs. - Venkatesan Guruswami; Ali Kemal Sinop (CoRR, 2013)

Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems. - Venkatesan Guruswami; Ali Kemal Sinop; Yuan Zhou 007 (SIAM J. Optim., 2014)

The Hardness of Approximation of Euclidean k-Means. - Pranjal Awasthi; Moses Charikar; Ravishankar Krishnaswamy; Ali Kemal Sinop (SoCG, 2015)

Spectral Embedding of k-Cliques, Graph Partitioning and k-Means. - Pranjal Awasthi; Moses Charikar; Ravishankar Krishnaswamy; Ali Kemal Sinop (ITCS, 2016)

How to Round Subspaces: A New Spectral Clustering Algorithm. - Ali Kemal Sinop (SODA, 2016)

Spectrally Robust Graph Isomorphism. - Alexandra Kolla; Ioannis Koutis; Vivek Madan; Ali Kemal Sinop (ICALP, 2018)

Weighted Stackelberg Algorithms for Road Traffic Optimization. - Kostas Kollias; Arun Chandrashekharapuram; Lisa Fawcett; Sreenivas Gollapudi; Ali Kemal Sinop (SIGSPATIAL/GIS, 2021)

Robust Routing Using Electrical Flows. - Ali Kemal Sinop; Lisa Fawcett; Sreenivas Gollapudi; Kostas Kollias (SIGSPATIAL/GIS, 2021)

Sketch-based Algorithms for Approximate Shortest Paths in Road Networks. - Gaurav Aggarwal; Sreenivas Gollapudi; Raghavender; Ali Kemal Sinop (WWW, 2021)

Exphormer: Sparse Transformers for Graphs. - Hamed Shirzad; Ameya Velingker; Balaji Venkatachalam; Danica J. Sutherland; Ali Kemal Sinop (ICML, 2023)

Affinity-Aware Graph Networks. - Ameya Velingker; Ali Kemal Sinop; Ira Ktena; Petar Velickovic; Sreenivas Gollapudi (NeurIPS, 2023)

First Passage Percolation with Queried Hints. - Kritkorn Karntikoon; Yiheng Shen 001; Sreenivas Gollapudi; Kostas Kollias; Aaron Schild; Ali Kemal Sinop (AISTATS, 2024)

Fairness and Optimality in Routing. - Sreenivas Gollapudi; Kostas Kollias; Alkmini Sgouritsa; Ali Kemal Sinop (AAMAS, 2025)

Why is My Route Different Today? An Algorithm for Explaining Route Selection. - Aaron Schild; Sreenivas Gollapudi; Anupam Gupta 001; Kostas Kollias; Ali Kemal Sinop (CoRR, 2025)