Tınaz Ekim Aşıcı

Ph.D., Associate Professor
Phone: 
6676
 
B.S. in Math, Univ. Tech. et de Sciences de Lille, 1999; 
B.S. in IE, Galatasaray University, 2001;
M.S. in Sc.Meth in Busn, Dauphine Univ- Paris IX, 2002;
Ph.D. in OR, Ecole Polytech. Féd. de Lausanne, 2006.
Research Interests: 
Algorithmic graph theory and applications, Combinatorial optimization, Complexity theory, Approximation theory

Recent publications

  1. Edge extremal Graphs Under Degree and Matching Number Restrictions, Ekim, Tinaz , 17th Haifa Workshop on Interdisciplinary Applications of Graphs – CRI, (2017)
  2. Recent results on equimatchable graphs, Ekim, Tinaz , Combinatorial Potlatch, (2017)
  3. 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)
  4. 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)
  5. Polar cographs, Ekim, Tinaz, Mahadev NVR, and de Werra Dominique , Discrete Applied Mathematics, Volume 171, Number EPFL-ARTICLE-199582, p.158–158, (2014)
  6. Efficient recognition of equimatchable graphs, Demange, Marc, and Ekim Tinaz , Information Processing Letters, Volume 114, Number 1, p.66–71, (2014)

Recent projects

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