Tınaz Ekim Aşıcı

Email: 
tinaz.ekim@bogazici.edu.tr
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.
Personal Web Site: 
https://academics.boun.edu.tr/tinaz.ekim/
Research Interests: 
Algorithmic graph theory and applications, Combinatorial optimization, Complexity theory, Approximation theory

Offered courses

Recent publications

  1. Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem, Ahat, Betül, Ekim Tinaz, and Taşkın Z C. , INFORMS Journal on Computing, Volume 30, p.43-56, (2018)
  2. On two extensions of equimatchable graphs, Deniz, Zakir, Ekim Tinaz, Hartinger Tatiana Romina, Milanič Martin, and Shalom Mordechai , Discrete Optimization, Volume 26, p.112-130, (2017)
  3. A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs, Boyacı, Arman, Ekim Tinaz, and Shalom Mordechai , Information Processing Letters, Volume 121, p.29-33, (2017)
  4. Complexity of the Improper Twin Edge Coloring of Graphs, Abedin, Paniz, Akbari Saieed, Demange Marc, and Ekim Tinaz , Graphs and Combinatorics, Volume 33, p.595–615, (2017)
  5. Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded, Dibek, Cemil, Ekim Tinaz, and Heggernes Pinar , Discrete Mathematics, Volume 340, p.927 - 934, (2017)
  6. On matching extendability of lexicographic products, Chiarelli, Nina, Dibek Cemil, Ekim Tinaz, Gözüpek Didem, and Miklavic Stefko , RAIRO-Oper. Res., Volume 51, p.857-873, (2017)
  7. Edge extremal Graphs Under Degree and Matching Number Restrictions, Ekim, Tinaz , 17th Haifa Workshop on Interdisciplinary Applications of Graphs – CRI, (2017)
  8. Recent results on equimatchable graphs, Ekim, Tinaz , Combinatorial Potlatch, (2017)
  9. 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)
  10. Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes—Part I, Boyacı, Arman, Ekim Tinaz, Shalom Mordechai, and Zaks Shmuel , Discrete Applied Mathematics, Volume 215, p.47–60, (2016)