Tınaz Ekim Aşıcı

Ph.D., Assistant 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. 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. 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)
  3. 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)
  4. 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)
  5. Partitioning graphs into complete and empty graphs, Ekim, Tinaz, and Gimbel John , Discrete Mathematics, Volume 309, Number 19, p.5849–5856, (2009)
  6. 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)
  7. 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)
  8. Polar cographs, Ekim, Tinaz, Mahadev Nadimpalli V. R., and de Werra Dominique , Discrete Applied Mathematics, Volume 156, Number 10, p.1652–1660, (2008)

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