default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli Çivril
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Ali Çivril:
9/7-Approximation for Two-Edge-Connectivity. CoRR abs/2407.10526 (2024)- [i9]Ali Çivril:
3/2-Approximation for the Matching Augmentation Problem. CoRR abs/2407.11101 (2024) - 2023
- [j10]Ali Çivril
:
A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem. Theor. Comput. Sci. 943: 121-130 (2023) - [j9]Ali Çivril:
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. 963: 113926 (2023) - [i8]Ali Çivril:
An Improved Approximation Algorithm for the Minimum 2-Vertex-Connected Spanning Subgraph Problem. CoRR abs/2305.05398 (2023) - [i7]Ali Çivril:
Scheme-Theoretic Approach to Computational Complexity. III. SETH. CoRR abs/2305.05415 (2023) - [i6]Ali Çivril:
Scheme-Theoretic Approach to Computational Complexity. IV. A New Perspective on Hardness of Approximation. CoRR abs/2305.05676 (2023) - 2021
- [i5]Ali Çivril:
Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP. CoRR abs/2107.07386 (2021) - [i4]Ali Çivril:
Scheme-theoretic Approach to Computational Complexity II. The Separation of P and NP over C, R, and Z. CoRR abs/2107.07387 (2021)
2010 – 2019
- 2019
- [j8]Ali Çivril:
Approximation of Steiner forest via the bidirected cut relaxation. J. Comb. Optim. 38(4): 1196-1212 (2019) - [i3]Ali Çivril:
Approximation of Steiner Forest via the Bidirected Cut Relaxation. CoRR abs/1911.07234 (2019) - 2017
- [j7]Ali Çivril:
Sparse approximation is provably hard under coherent dictionaries. J. Comput. Syst. Sci. 84: 32-43 (2017) - [i2]Ali Çivril:
Sparse Approximation is Provably Hard under Coherent Dictionaries. CoRR abs/1702.02885 (2017) - 2014
- [j6]Ali Çivril:
Column Subset Selection Problem is UG-hard. J. Comput. Syst. Sci. 80(4): 849-859 (2014) - 2013
- [j5]Ali Çivril, Malik Magdon-Ismail:
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix. Algorithmica 65(1): 159-176 (2013) - [j4]Ali Çivril:
A note on the hardness of sparse approximation. Inf. Process. Lett. 113(14-16): 543-545 (2013) - 2012
- [j3]Ali Çivril, Malik Magdon-Ismail:
Column subset selection via sparse approximation of SVD. Theor. Comput. Sci. 421: 1-14 (2012) - 2010
- [i1]Ali Çivril, Malik Magdon-Ismail:
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix. CoRR abs/1006.4349 (2010)
2000 – 2009
- 2009
- [b1]Ali Çivril:
Column subset selection for approximating data matrices. Rensselaer Polytechnic Institute, USA, 2009 - [j2]Ugur Dogrusöz, Erhan Giral, Ahmet Cetintas, Ali Civril, Emek Demir:
A layout algorithm for undirected compound graphs. Inf. Sci. 179(7): 980-994 (2009) - [j1]Ali Çivril, Malik Magdon-Ismail:
On selecting a maximum volume sub-matrix of a matrix and related problems. Theor. Comput. Sci. 410(47-49): 4801-4811 (2009) - 2008
- [c5]Yehuda Koren, Ali Civril:
The Binary Stress Model for Graph Drawing. GD 2008: 193-205 - [c4]Ali Civril, Malik Magdon-Ismail:
Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD. ISAAC 2008: 414-423 - 2006
- [c3]Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele:
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding. GD 2006: 30-41 - 2005
- [c2]Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele:
SDE: Graph Drawing Using Spectral Distance Embedding. GD 2005: 512-513 - 2004
- [c1]Ugur Dogrusöz, Erhan Giral, Ahmet Cetintas, Ali Civril, Emek Demir:
A Compound Graph Layout Algorithm for Biological Pathways. GD 2004: 442-447
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
