Follow
Ali Çivril
Ali Çivril
Istanbul Atlas University
Verified email at atlas.edu.tr - Homepage
Title
Cited by
Cited by
Year
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
2862009
A layout algorithm for undirected compound graphs
U Dogrusoz, E Giral, A Cetintas, A Civril, E Demir
Information Sciences 179 (7), 980-994, 2009
1372009
Column subset selection via sparse approximation of SVD
A Çivril, M Magdon-Ismail
Theoretical Computer Science, 2011
592011
Exponential inapproximability of selecting a maximum volume sub-matrix
A Civril, M Magdon-Ismail
Algorithmica 65, 159-176, 2013
552013
A compound graph layout algorithm for biological pathways
U Dogrusoz, E Giral, A Cetintas, A Civril, E Demir
Graph Drawing, 442-447, 2005
532005
Column subset selection problem is ug-hard
A Civril
Journal of Computer and System Sciences 80 (4), 849-859, 2014
442014
The binary stress model for graph drawing
Y Koren, A Civril
International Symposium on Graph Drawing, 193-205, 2008
382008
SDE: Graph drawing using spectral distance embedding
A Civril, M Magdon-Ismail, E Bocek-Rivele
International Symposium on Graph Drawing, 512-513, 2005
362005
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
332006
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 new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem
A Çivril
Theoretical Computer Science 943, 121-130, 2023
62023
A note on the hardness of sparse approximation
A Civril
Information Processing Letters 113 (14-16), 543-545, 2013
62013
Approximation of Steiner forest via the bidirected cut relaxation
A Çivril
Journal of Combinatorial Optimization 38, 1196-1212, 2019
32019
Corrigendum to “A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem”[Theor. Comput. Sci. 943 (2023) 121–130]
A Çivril
12023
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, ...
ISCB Org, 0
1
A Unified Approach for Approximating 2-Edge-Connected Spanning Subgraph and 2-Vertex-Connected Spanning Subgraph
A Çivril
arXiv preprint arXiv:2305.05398, 2023
2023
4/3-Approximation of Graphic TSP
A Çivril
arXiv preprint arXiv:2305.05411, 2023
2023
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
The system can't perform the operation now. Try again later.
Articles 1–20