Tınaz Ekim Aşıcı

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-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. 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)
  2. 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)
  3. Perfectness of clustered graphs, Bonomo, Flavia, Cornaz Denis, Ekim Tinaz, and Ries Bernard , Discrete Optimization, Volume 10, Number 4, p.296–303, (2013)
  4. 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)
  5. 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)
  6. 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)
  7. 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)