Tınaz Ekim Aşıcı

Email: 
tinaz.ekim@bogazici.edu.tr
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.
2007'den beri Bölümde Öğretim Üyesi
Web: 
https://academics.boun.edu.tr/tinaz.ekim/

Dersler

Yayınlar

  1. On the minimum and maximum selective graph coloring problems in some graph classes, Demange, Marc, Ekim Tinaz, and Ries Bernard , Discrete Applied Mathematics, Volume 204, p.77–89, (2016)
  2. Equimatchable graphs are C2k+ 1-free for k≥ 4, Dibek, Cemil, Ekim Tinaz, Gözüpek Didem, and Shalom Mordechai , Discrete Mathematics, Volume 339, p.2964–2969, (2016)
  3. Graphs of edge-intersecting and non-splitting paths, , Theoretical Computer Science, Volume 629, p.40-50, (2016)
  4. On some applications of the selective graph coloring problem, Demange, Marc, Ekim Tinaz, Ries Bernard, and Tanasescu Cerasela , European Journal of Operational Research, Volume 240, p.307-314, (2015)
  5. Advances on defective parameters in graphs, Akdemir, Ahu, and Ekim Tinaz , Discrete Optimization, Volume 16, p.62-69, (2015)
  6. 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)
  7. Polar cographs, Ekim, Tinaz, Mahadev NVR, and de Werra Dominique , Discrete Applied Mathematics, Volume 171, Number EPFL-ARTICLE-199582, p.158–158, (2014)
  8. Efficient recognition of equimatchable graphs, Demange, Marc, and Ekim Tinaz , Information Processing Letters, Volume 114, Number 1, p.66–71, (2014)
  9. Perfectness of clustered graphs, Bonomo, Flavia, Cornaz Denis, Ekim Tinaz, and Ries Bernard , Discrete Optimization, Volume 10, Number 4, p.296–303, (2013)
  10. Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations, Boyacı, Arman, Ekim Tinaz, Shalom Mordechai, and Zaks Shmuel , (2013)