Ali Çivril

Available identifiers

Publication	Date of Publication	Type
Corrigendum to: ``A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem	2023-06-15	Paper
A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem	2023-01-05	Paper
Approximation of Steiner forest via the bidirected cut relaxation	2019-12-13	Paper
Sparse approximation is provably hard under coherent dictionaries	2016-11-14	Paper
A note on the hardness of sparse approximation	2014-04-11	Paper
Column subset selection problem is UG-hard	2014-02-13	Paper
Exponential inapproximability of selecting a maximum volume sub-matrix	2013-03-05	Paper
Column subset selection via sparse approximation of SVD	2012-03-13	Paper
On selecting a maximum volume sub-matrix of a matrix and related problems	2009-11-06	Paper
The Binary Stress Model for Graph Drawing	2009-03-03	Paper
Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD	2009-01-29	Paper
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding	2007-08-28	Paper
Graph Drawing	2006-11-13	Paper

This page was built for person: Ali Çivril