Tınaz Ekim Aşıcı

Yrd. Doç. Dr.
Tel. No.: 
6676
 
Lisans, Mat, Univ. Tech. et de Sciences de Lille, 1999; 
Lisans, EM, Galatasaray Üniversitesi, 2001;
Y. Lisans, İşl.Bil.Yön., Dauphine Univ.- Paris IX, 2002;
Doktora, YA, Ecole Polytech. Féd. de Lausanne, 2006.

Yayınlar

  1. Hardness and approximation of minimum maximal matchings, Demange, Marc, Ekim Tinaz, and Tanasescu Cerasela , International Journal of Computer Mathematics, Number ahead-of-print, p.1–20, (2013)
  2. Split-critical and uniquely split-colorable graphs, Ekim, Tinaz, Ries Bernard, de Werra Dominique, and , Discrete Mathematics and Theoretical Computer Science, Volume 12, Number 5, p.1–24, (2010)
  3. Recognizing line-polar bipartite graphs in time O (n), Ekim, Tinaz, and Huang Jing , Discrete Applied Mathematics, Volume 158, Number 15, p.1593–1598, (2010)
  4. Partitioning graphs into complete and empty graphs, Ekim, Tinaz, and Gimbel John , Discrete Mathematics, Volume 309, Number 19, p.5849–5856, (2009)
  5. A tutorial on the use of graph coloring for some problems in robotics, Demange, Marc, Ekim Tinaz, and de Werra Dominique , European Journal of Operational Research, Volume 192, Number 1, p.41–55, (2009)
  6. Construction of balanced sports schedules using partitions into subleagues, Geinoz, A, Ekim Tinaz, and de Werra Dominique , Operations Research Letters, Volume 36, Number 3, p.279–282, (2008)
  7. Minimum maximal matching is NP-hard in regular bipartite graphs, Demange, Marc, and Ekim Tinaz , Theory and Applications of Models of Computation, p.364–374, (2008)
  8. Polarity of chordal graphs, Ekim, Tinaz, Hell Pavol, Stacho Juraj, and de Werra Dominique , Discrete Applied Mathematics, Volume 156, Number 13, p.2469–2479, (2008)

Projeler

  1. New Trends in Matching Theory , TÜBİTAK , Başlama: 01/07/2014 , Bitiş: 01/01/2017
  2. Exploiting Graph Structure to Solve Hard Problems , TÜBİTAK , Başlama: 01/10/2012 , Bitiş: 01/04/2015
  3. The Selective Graph Coloring Problem , TÜBİTAK , Başlama: 01/02/2012 , Bitiş: 01/02/2014
  4. Generalized Graph Coloring Problems , BAP , Başlama: 25/02/2009 , Bitiş: 04/05/2011
  5. Stable matchings and minimum maximal matching in regular bipartite graphs , TÜBİTAK , Başlama: 01/02/2009 , Bitiş: 01/08/2011