Ali Çivril

Orcid: 0000-0002-0334-4330

According to our database1, Ali Çivril authored at least 24 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
3/2-Approximation for the Matching Augmentation Problem.
CoRR, 2024

9/7-Approximation for Two-Edge-Connectivity.
CoRR, 2024

2023
Corrigendum to "A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem" [Theor. Comput. Sci. 943 (2023) 121-130].
Theor. Comput. Sci., 2023

A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem.
Theor. Comput. Sci., 2023

Scheme-Theoretic Approach to Computational Complexity. IV. A New Perspective on Hardness of Approximation.
CoRR, 2023

Scheme-Theoretic Approach to Computational Complexity. III. SETH.
CoRR, 2023

4/3-Approximation of Graphic TSP.
CoRR, 2023

An Improved Approximation Algorithm for the Minimum 2-Vertex-Connected Spanning Subgraph Problem.
CoRR, 2023

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

Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP.
CoRR, 2021

2019
Approximation of Steiner forest via the bidirected cut relaxation.
J. Comb. Optim., 2019

2017
Sparse approximation is provably hard under coherent dictionaries.
J. Comput. Syst. Sci., 2017

2014
Column Subset Selection Problem is UG-hard.
J. Comput. Syst. Sci., 2014

2013
A note on the hardness of sparse approximation.
Inf. Process. Lett., 2013

Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix.
Algorithmica, 2013

2012
Column subset selection via sparse approximation of SVD.
Theor. Comput. Sci., 2012

2009
Column subset selection for approximating data matrices.
PhD thesis, 2009

On selecting a maximum volume sub-matrix of a matrix and related problems.
Theor. Comput. Sci., 2009

A layout algorithm for undirected compound graphs.
Inf. Sci., 2009

2008
Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

The Binary Stress Model for Graph Drawing.
Proceedings of the Graph Drawing, 16th International Symposium, 2008

2006
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding.
Proceedings of the Graph Drawing, 14th International Symposium, 2006

2005
SDE: Graph Drawing Using Spectral Distance Embedding.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

2004
A Compound Graph Layout Algorithm for Biological Pathways.
Proceedings of the Graph Drawing, 12th International Symposium, 2004


  Loading...