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. Efficient recognition of equimatchable graphs, Demange, Marc, and Ekim Tinaz , Information Processing Letters, Volume 114, Number 1, p.66–71, (2014)
  2. Block decomposition approach to compute a minimum geodetic set, Ekim, Tinaz, and Erey Aysel , RAIRO-Operations Research, Volume 48, Number 04, p.497–507, (2014)
  3. Polar cographs, Ekim, Tinaz, Mahadev NVR, and de Werra Dominique , Discrete Applied Mathematics, Volume 171, Number EPFL-ARTICLE-199582, p.158–158, (2014)
  4. Some Defective Parameters in Graphs, Ekim, Tinaz, and Gimbel John , Graphs and Combinatorics, Volume 29, Number 2, p.213–224, (2013)
  5. Polar permutation graphs are polynomial-time recognisable, Ekim, Tinaz, Heggernes Pinar, and Meister Daniel , European Journal of Combinatorics, Volume 34, Number 3, p.576–592, (2013)
  6. A note on the NP-hardness of two matching problems in induced subgrids, Demange, Marc, Ekim Tinaz, and , Discrete Mathematics and Theoretical Computer Science, Volume 15, Number 2, p.233–242, (2013)
  7. Perfectness of clustered graphs, Bonomo, Flavia, Cornaz Denis, Ekim Tinaz, and Ries Bernard , Discrete Optimization, Volume 10, Number 4, p.296–303, (2013)

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