Giriş YapKayıt Ol
©2010-2026 Evrim Ağacı

Ali Çivril

Akademisyen
Alan
Mühendislik
Üniversite
İstanbul Atlas Üniversitesi
Fakülte ve Bölüm
Mühendislik ve Doğa Bilimleri Fakültesi

Bu Sayfa Senin mi?

Sayfanı sahiplenirsen bilgilerini kendin güncelleyebilir, okurlardan mesaj alabilirsin.

Bir hata mı var?

Bu sayfa henüz sahiplenilmedi. İletişim bilgisi gösterilmiyor.
Bu sayfadaki bilgiler kamuya açık kaynaklardan derlendi.

Akademik Profiller

ORCID

Yayınlar

Tüm Yayınlar
  1. 1
    Approximation of Steiner forest via the bidirected cut relaxationJournal of Combinatorial Optimization
    2019
  2. 2
    Sparse approximation is provably hard under coherent dictionariesJournal of Computer and System Sciences
    2017
  3. 3
    Column subset selection problem is UG-hardJournal of Computer and System Sciences
    2014
  4. 4
    A note on the hardness of sparse approximationInformation Processing Letters
    2013
  5. 5
    Exponential inapproximability of selecting a maximum volume sub-matrixAlgorithmica
    2013
  6. 6
    Column subset selection via sparse approximation of SVDTheoretical Computer Science
    2012
  7. 7
    A layout algorithm for undirected compound graphsInformation Sciences
    2009
  8. 8
    On selecting a maximum volume sub-matrix of a matrix and related problemsTheoretical Computer Science
    2009
  9. 9
    The binary stress model for graph drawingLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    2009
  10. 10
    Deterministic sparse column based matrix reconstruction via greedy approximation of SVDLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    2008

Yayın listesi ORCID kaydından alındı.