Ali Çivril

18 papers Journal 17

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	3/2-Approximation for the Matching Augmentation Problem. CoRR Ali Çivril
2024	J	`jnl`	9/7-Approximation for Two-Edge-Connectivity. CoRR Ali Çivril
2023	J	`jnl`	An Improved Approximation Algorithm for the Minimum 2-Vertex-Connected Spanning Subgraph Problem. CoRR Ali Çivril
2023	J	`jnl`	Scheme-Theoretic Approach to Computational Complexity. III. SETH. CoRR Ali Çivril
2023	J	`jnl`	Scheme-Theoretic Approach to Computational Complexity. IV. A New Perspective on Hardness of Approximation. CoRR Ali Çivril
2021	J	`jnl`	Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP. CoRR Ali Çivril
2021	J	`jnl`	Scheme-theoretic Approach to Computational Complexity II. The Separation of P and NP over C, R, and Z. CoRR Ali Çivril
2019	J	`jnl`	Approximation of Steiner Forest via the Bidirected Cut Relaxation. CoRR Ali Çivril
2019	J	`jnl`	Approximation of Steiner forest via the bidirected cut relaxation. J. Comb. Optim. Ali Çivril
2017	J	`jnl`	Sparse Approximation is Provably Hard under Coherent Dictionaries. CoRR Ali Çivril
2017	J	`jnl`	Sparse approximation is provably hard under coherent dictionaries. J. Comput. Syst. Sci. Ali Çivril
2014	J	`jnl`	Column Subset Selection Problem is UG-hard. J. Comput. Syst. Sci. Ali Çivril
2013	J	`jnl`	A note on the hardness of sparse approximation. Inf. Process. Lett. Ali Çivril
2013	J	`jnl`	Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix. Algorithmica Ali Çivril, Malik Magdon-Ismail
2012	J	`jnl`	Column subset selection via sparse approximation of SVD. Theor. Comput. Sci. Ali Çivril, Malik Magdon-Ismail
2010	J	`jnl`	Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix CoRR Ali Çivril, Malik Magdon-Ismail
2009	—	`—`	Column subset selection for approximating data matrices. Ali Çivril
2009	J	`jnl`	On selecting a maximum volume sub-matrix of a matrix and related problems. Theor. Comput. Sci. Ali Çivril, Malik Magdon-Ismail