| 2013 | ||
|---|---|---|
| c10 | Venkatesan Guruswami, Ali Kemal Sinop: Approximating Non-Uniform Sparsest Cut Via Generalized Spectra. SODA 2013: 295-305 | |
| i11 | Sanjeev Arora, Rong Ge, Ali Kemal Sinop: Towards a better approximation for sparsest cut? CoRR abs/1304.3365 (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. Electronic Colloquium on Computational Complexity (ECCC) 19: 111 (2012) | |
| 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. Electronic Colloquium on Computational Complexity (ECCC) 18: 66 (2011) | |
| 2010 | ||
| i3 | Venkatesan Guruswami, Ali Kemal Sinop: The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number. Electronic Colloquium on Computational Complexity (ECCC) 17: 111 (2010) | |
| 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. Electronic Colloquium on Computational Complexity (ECCC) 16: 99 (2009) | |
| 2008 | ||
| c4 | ||
| 2007 | ||
| c3 | ||
| c2 | ||
| 2006 | ||
| c1 | Ali Kemal Sinop, Leo 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. The Journal of Supercomputing 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 Transactions on Image Processing 13(3): 314-325 (2004) | |
| 1 | Tolga Abaci | |
| 2 | Ümit Akkus | |
| 3 | Sanjeev Arora | |
| 4 | Rong Ge | |
| 5 | Leo Grady | |
| 6 | Venkatesan Guruswami | |
| 7 | Ugur Güdükbay | |
| 8 | Attila Gürsoy | |
| 9 | Ediz Saykol | |
| 10 | Özgür Ulusoy | |
| 11 | Yuan Zhou | |
| 12 | A. Enis Çetin |
Colors in the list of coauthors
Last update Thu May 23 01:39:58 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page