Tınaz Ekim Aşıcı

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.

Yayınlar

  1. Partitioning graphs into complete and empty graphs, Ekim, Tinaz, and Gimbel John , Discrete Mathematics, Volume 309, Number 19, p.5849–5856, (2009)
  2. 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)
  3. 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)
  4. Polar cographs, Ekim, Tinaz, Mahadev Nadimpalli V. R., and de Werra Dominique , Discrete Applied Mathematics, Volume 156, Number 10, p.1652–1660, (2008)
  5. Construction of balanced sports schedules using partitions into subleagues, Geinoz, A, Ekim Tinaz, and de Werra Dominique , Operations Research Letters, Volume 36, Number 3, p.279–282, (2008)
  6. Construction of sports schedules with multiple venues, de Werra, Dominique, Ekim Tinaz, and Raess C , Discrete Applied Mathematics, Volume 154, Number 1, p.47–58, (2006)
  7. On split-coloring problems (vol 10, pg 211, 2005), Ekim, Tinaz, and de Werra Dominique , JOURNAL OF COMBINATORIAL OPTIMIZATION, Volume 11, Number 1, p.125–125, (2006)
  8. On the approximation of Min Split-coloring and Min Cocoloring., Demange, Marc, Ekim Tinaz, de Werra Dominique, and , J. Graph Algorithms Appl., Volume 10, Number 2, p.297–315, (2006)
  9. Partitioning cographs into cliques and stable sets, Demange, Marc, Ekim Tinaz, and de Werra Dominique , Discrete Optimization, Volume 2, Number 2, p.145–153, (2005)
  10. On split-coloring problems, Ekim, Tinaz, and de Werra Dominique , Journal of Combinatorial Optimization, Volume 10, Number 3, p.211–225, (2005)