Tınaz Ekim Aşıcı

Doç. Dr.
Tel. No.: 
6676
Bölüm Başkan Yardımcısı
 
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.

Dersler

Yayınlar

  1. Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded, Dibek, Cemil, Ekim Tinaz, and Heggernes Pinar , Discrete Mathematics, Volume 340, p.927 - 934, (2017)
  2. Edge extremal Graphs Under Degree and Matching Number Restrictions, Ekim, Tinaz , 17th Haifa Workshop on Interdisciplinary Applications of Graphs – CRI, (2017)
  3. Recent results on equimatchable graphs, Ekim, Tinaz , Combinatorial Potlatch, (2017)
  4. Linear-Time Generation of Random Chordal Graphs, Şeker, Oylum, Heggernes Pinar, Ekim Tinaz, and Z. Taşkın Caner , International Conference on Algorithms and Complexity, (2017)
  5. Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes—Part I, Boyacı, Arman, Ekim Tinaz, Shalom Mordechai, and Zaks Shmuel , Discrete Applied Mathematics, Volume 215, p.47–60, (2016)
  6. 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)
  7. 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)
  8. Efficient recognition of equimatchable graphs, Demange, Marc, and Ekim Tinaz , Information Processing Letters, Volume 114, Number 1, p.66–71, (2014)
  9. On some applications of the selective graph coloring problem, Demange, Marc, Ekim Tinaz, Ries Bernard, and Tanasescu Cerasela , European Journal of Operational Research, (2014)
  10. 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)

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