Ali Çivril

CoRR, 2024

9/7-Approximation for Two-Edge-Connectivity.

[BibT_eX]

[DOI]

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].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

Scheme-Theoretic Approach to Computational Complexity. III. SETH.

[BibT_eX]

[DOI]

CoRR, 2023

4/3-Approximation of Graphic TSP.

[BibT_eX]

[DOI]

CoRR, 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

2021

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

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

2019

Approximation of Steiner forest via the bidirected cut relaxation.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

2017

Sparse approximation is provably hard under coherent dictionaries.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

2014

Column Subset Selection Problem is UG-hard.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

2013

A note on the hardness of sparse approximation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix.

[BibT_eX]

[DOI]

Algorithmica, 2013

2012

Column subset selection via sparse approximation of SVD.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

2009

Column subset selection for approximating data matrices.

[BibT_eX]

[DOI]

PhD thesis, 2009

On selecting a maximum volume sub-matrix of a matrix and related problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A layout algorithm for undirected compound graphs.

[BibT_eX]

[DOI]

Inf. Sci., 2009

2008

Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

The Binary Stress Model for Graph Drawing.

[BibT_eX]

[DOI]

Yehuda Koren

Proceedings of the Graph Drawing, 16th International Symposium, 2008

2006

SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding.

[BibT_eX]

[DOI]

Eli Bocek-Rivele

Proceedings of the Graph Drawing, 14th International Symposium, 2006

2005

SDE: Graph Drawing Using Spectral Distance Embedding.

[BibT_eX]

[DOI]