| On selecting a maximum volume sub-matrix of a matrix and related problems A Çivril, M Magdon-Ismail Theoretical Computer Science 410 (47), 4801-4811, 2009 | 291 | 2009 |
| A layout algorithm for undirected compound graphs U Dogrusoz, E Giral, A Cetintas, A Civril, E Demir Information Sciences 179 (7), 980-994, 2009 | 141 | 2009 |
| Column subset selection via sparse approximation of SVD A Çivril, M Magdon-Ismail Theoretical Computer Science, 2011 | 61 | 2011 |
| Exponential inapproximability of selecting a maximum volume sub-matrix A Civril, M Magdon-Ismail Algorithmica 65, 159-176, 2013 | 56 | 2013 |
| A compound graph layout algorithm for biological pathways U Dogrusoz, E Giral, A Cetintas, A Civril, E Demir Graph Drawing, 442-447, 2005 | 54 | 2005 |
| Column subset selection problem is ug-hard A Civril Journal of Computer and System Sciences 80 (4), 849-859, 2014 | 45 | 2014 |
| The binary stress model for graph drawing Y Koren, A Civril International Symposium on Graph Drawing, 193-205, 2008 | 40 | 2008 |
| SDE: Graph drawing using spectral distance embedding A Civril, M Magdon-Ismail, E Bocek-Rivele International Symposium on Graph Drawing, 512-513, 2005 | 36 | 2005 |
| SSDE: Fast graph drawing using sampled spectral distance embedding A Civril, M Magdon-Ismail, E Bocek-Rivele International Symposium on Graph Drawing, 30-41, 2006 | 33 | 2006 |
| Deterministic sparse column based matrix reconstruction via greedy approximation of SVD A Civril, M Magdon-Ismail International Symposium on Algorithms and Computation, 414-423, 2008 | 11 | 2008 |
| A note on the hardness of sparse approximation A Civril Information Processing Letters 113 (14-16), 543-545, 2013 | 6 | 2013 |
| Approximation of Steiner forest via the bidirected cut relaxation A Çivril Journal of Combinatorial Optimization 38, 1196-1212, 2019 | 3 | 2019 |
| Sparse approximation is provably hard under coherent dictionaries A Çivril Journal of Computer and System Sciences 84, 32-43, 2017 | 1 | 2017 |
| PATIKA: An informatics infrastructure for cellular networks Ç Aksay, A Ayaz, Ö Babur, C Bilgin, A Çetintaş, A Çivril, R Çolak, G Çözen, ... ISCB Org, 0 | 1 | |
| Scheme-Theoretic Approach to Computational Complexity. IV. A New Perspective on Hardness of Approximation A Çivril arXiv preprint arXiv:2305.05676, 2023 | | 2023 |
| Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP A Civril arXiv preprint arXiv:2107.07386, 2021 | | 2021 |
| An Improved Integrality Gap for Steiner Tree A Çivril, MM Biçer, BT Tunca, MY Kangal arXiv preprint arXiv:1704.08680, 2017 | | 2017 |
