Ali Çivril
Ali Çivril
Istinye University
istinye.edu.tr üzerinde doğrulanmış e-posta adresine sahip
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
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
2212009
A layout algorithm for undirected compound graphs
U Dogrusoz, E Giral, A Cetintas, A Civril, E Demir
Information Sciences 179 (7), 980-994, 2009
912009
Column subset selection via sparse approximation of SVD
A Çivril, M Magdon-Ismail
Theoretical Computer Science, 2011
492011
A compound graph layout algorithm for biological pathways
U Dogrusoz, E Giral, A Cetintas, A Civril, E Demir
Graph Drawing, 442-447, 2005
472005
Exponential inapproximability of selecting a maximum volume sub-matrix
A Civril, M Magdon-Ismail
Algorithmica 65 (1), 159-176, 2013
362013
SDE: Graph drawing using spectral distance embedding
A Civril, M Magdon-Ismail, E Bocek-Rivele
International Symposium on Graph Drawing, 512-513, 2005
322005
The binary stress model for graph drawing
Y Koren, A Civril
International Symposium on Graph Drawing, 193-205, 2008
312008
Column subset selection problem is ug-hard
A Civril
Journal of Computer and System Sciences 80 (4), 849-859, 2014
292014
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
272006
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
112008
A note on the hardness of sparse approximation
A Civril
Information Processing Letters 113 (14-16), 543-545, 2013
42013
Approximation of Steiner forest via the bidirected cut relaxation
A Çivril
Journal of Combinatorial Optimization 38 (4), 1196-1212, 2019
12019
Sparse approximation is provably hard under coherent dictionaries
A Çivril
Journal of Computer and System Sciences 84, 32-43, 2017
12017
PATIKA: An informatics infrastructure for cellular networks
Ç Aksay, A Ayaz, Ö Babur, C Bilgin, A Çetintaş, A Çivril, R Çolak, G Çözen, ...
Proceedings 12th ISMB/3. ECCB 2004, 2004
12004
Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP
A Civril
2021
Dual Growth with Variable Rates: An Improved Integrality Gap for Steiner Tree
A Civril
arXiv preprint arXiv:1704.08680, 2017
2017
New Spectral Algorithms for Graph Drawing
A Çivril
Rensselaer Polytechnic Institute, 2007
2007
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–17