Tınaz Ekim Aşıcı

Yrd. Doç. Dr.
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.

Dersler

Yayınlar

  1. Polar cographs, Ekim, Tinaz, Mahadev NVR, and de Werra Dominique , Discrete Applied Mathematics, Volume 171, Number EPFL-ARTICLE-199582, p.158–158, (2014)
  2. Decomposition Algorithms for Solving the Minimum Weight Maximal Matching Problem, Bodur, Merve, Ekim Tinaz, and Taşkın Z C. , Networks, Volume 62, Number 4, p.273–287, (2013)
  3. 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)
  4. 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)
  5. Perfectness of clustered graphs, Bonomo, Flavia, Cornaz Denis, Ekim Tinaz, and Ries Bernard , Discrete Optimization, Volume 10, Number 4, p.296–303, (2013)
  6. Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations, Boyacı, Arman, Ekim Tinaz, Shalom Mordechai, and Zaks Shmuel , (2013)
  7. 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)
  8. Some Defective Parameters in Graphs, Ekim, Tinaz, and Gimbel John , Graphs and Combinatorics, Volume 29, Number 2, p.213–224, (2013)
  9. Integer Programming Formulations for the Minimum Weighted Maximal Matching Problem, Taşkın, Z C., and Ekim Tinaz , Optimization Letters, Volume 6(6), p.1161-1171, (2012)
  10. Computing minimum geodetic sets of proper interval graphs, Ekim, Tinaz, Erey Aysel, Heggernes Pinar, Hof Pim van't, and Meister Daniel , LATIN 2012: Theoretical Informatics, p.279–290, (2012)

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