The following pages link to Ali Çivril (Q1034597):
Displaying 14 items.
- (Q340553) (redirect page) (← links)
- Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
- Column subset selection via sparse approximation of SVD (Q764372) (← links)
- On selecting a maximum volume sub-matrix of a matrix and related problems (Q1034598) (← links)
- Exponential inapproximability of selecting a maximum volume sub-matrix (Q1939669) (← links)
- Approximation of Steiner forest via the bidirected cut relaxation (Q2279758) (← links)
- A note on the hardness of sparse approximation (Q2444766) (← links)
- Column subset selection problem is UG-hard (Q2637653) (← links)
- A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem (Q2680988) (← links)
- SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding (Q3595496) (← links)
- Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD (Q3596737) (← links)
- The Binary Stress Model for Graph Drawing (Q3611852) (← links)
- Graph Drawing (Q5897655) (← links)
- Corrigendum to: ``A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem'' (Q6162055) (← links)
