A Compound Graph Layout Algorithm for Biological Pathways. - Ugur Dogrusöz; Erhan Giral; Ahmet Cetintas; Ali Civril; Emek Demir (GD, 2004)

SDE: Graph Drawing Using Spectral Distance Embedding. - Ali Civril; Malik Magdon-Ismail; Eli Bocek-Rivele (GD, 2005)

SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding. - Ali Civril; Malik Magdon-Ismail; Eli Bocek-Rivele (GD, 2006)

The Binary Stress Model for Graph Drawing. - Yehuda Koren; Ali Civril (GD, 2008)

Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD. - Ali Civril; Malik Magdon-Ismail (ISAAC, 2008)

A layout algorithm for undirected compound graphs. - Ugur Dogrusöz; Erhan Giral; Ahmet Cetintas; Ali Civril; Emek Demir (Inf. Sci., 2009)

On selecting a maximum volume sub-matrix of a matrix and related problems. - Ali Çivril; Malik Magdon-Ismail (Theor. Comput. Sci., 2009)

Column subset selection for approximating data matrices. - Ali Çivril (2009)

Column subset selection via sparse approximation of SVD. - Ali Çivril; Malik Magdon-Ismail (Theor. Comput. Sci., 2012)

Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix. - Ali Çivril; Malik Magdon-Ismail (Algorithmica, 2013)

A note on the hardness of sparse approximation. - Ali Çivril (Inf. Process. Lett., 2013)

Column Subset Selection Problem is UG-hard. - Ali Çivril (J. Comput. Syst. Sci., 2014)

Sparse approximation is provably hard under coherent dictionaries. - Ali Çivril (J. Comput. Syst. Sci., 2017)

Approximation of Steiner forest via the bidirected cut relaxation. - Ali Çivril (J. Comb. Optim., 2019)

Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP. - Ali Çivril (CoRR, 2021)

Scheme-theoretic Approach to Computational Complexity II. The Separation of P and NP over C, R, and Z. - Ali Çivril (CoRR, 2021)

An Improved Approximation Algorithm for the Minimum 2-Vertex-Connected Spanning Subgraph Problem. - Ali Çivril (CoRR, 2023)

Scheme-Theoretic Approach to Computational Complexity. III. SETH. - Ali Çivril (CoRR, 2023)

Scheme-Theoretic Approach to Computational Complexity. IV. A New Perspective on Hardness of Approximation. - Ali Çivril (CoRR, 2023)

9/7-Approximation for Two-Edge-Connectivity. - Ali Çivril (CoRR, 2024)

3/2-Approximation for the Matching Augmentation Problem. - Ali Çivril (CoRR, 2024)