AÇAli Çivril
Ali Çivril
*This is an algorithmically generated author record based on publicly available information.
Ali Çivril has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
Malik Magdon-Ismail
Rensselaer Polytechnic Institute
5 shared publicationsAhmet Cetintas
Computer Engineering Department, Bilkent University, Cankaya, 06800 Ankara, Turkey
2 shared publicationsEli Bocek-Rivele
Computer Science Department, RPI, 110 8th Street, Troy, NY 12180
2 shared publications- Emek Demir
Computational Biology Program, Oregon Health & Science University , Portland , OR , USA
2 shared publications Erhan Giral
Tom Sawyer Software, Oakland, CA, USA
2 shared publicationsUgur Dogrusoz
Computer Engineering Department, Bilkent University, Cankaya, 06800 Ankara, Turkey and Tom Sawyer Software, Oakland, CA, USA
2 shared publications
Latest Publications
- Retracted
- 15 December 2022
- Published by Elsevier in Theoretical Computer Science
- Vol. 943, 121-130
RETRACTED: A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem
- 15 December 2022
- Published by Elsevier in Theoretical Computer Science
- Vol. 943, 121-130
RetractedRETRACTED: A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem
- Open Access
- 30 August 2019
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 38 (4) , 1196-1212
Approximation of Steiner forest via the bidirected cut relaxation
- 30 August 2019
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 38 (4) , 1196-1212
Open AccessApproximation of Steiner forest via the bidirected cut relaxation
- 1 March 2017
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 84, 32-43
Sparse approximation is provably hard under coherent dictionaries
- 1 March 2017
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 84, 32-43
Sparse approximation is provably hard under coherent dictionaries
- 1 June 2014
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 80 (4) , 849-859
Column Subset Selection Problem is UG-hard
- 1 June 2014
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 80 (4) , 849-859
Column Subset Selection Problem is UG-hard
- 1 July 2013
- Published by Elsevier in Information Processing Letters
- Vol. 113 (14-16) , 543-545
A note on the hardness of sparse approximation
- 1 July 2013
- Published by Elsevier in Information Processing Letters
- Vol. 113 (14-16) , 543-545
A note on the hardness of sparse approximation
- 1 March 2012
- Published by Elsevier in Theoretical Computer Science
- Vol. 421, 1-14
Column subset selection via sparse approximation of SVD
- 1 March 2012
- Published by Elsevier in Theoretical Computer Science
- Vol. 421, 1-14
Column subset selection via sparse approximation of SVD
- 27 October 2011
- Published by Springer Nature in Algorithmica
- Vol. 65 (1) , 159-176
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix
- 27 October 2011
- Published by Springer Nature in Algorithmica
- Vol. 65 (1) , 159-176
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix
- Top Cited Papers
- 1 November 2009
- Published by Elsevier in Theoretical Computer Science
- Vol. 410 (47-49) , 4801-4811
On selecting a maximum volume sub-matrix of a matrix and related problems
- 1 November 2009
- Published by Elsevier in Theoretical Computer Science
- Vol. 410 (47-49) , 4801-4811
Top Cited PapersOn selecting a maximum volume sub-matrix of a matrix and related problems
- 1 March 2009
- Published by Elsevier in Information Sciences
- Vol. 179 (7) , 980-994
A layout algorithm for undirected compound graphs
- 1 March 2009
- Published by Elsevier in Information Sciences
- Vol. 179 (7) , 980-994
A layout algorithm for undirected compound graphs