Tınaz EKİM AŞICI, Ph.D., Assistant Professor
Tınaz Ekim Aşıcı
:: Education
B.S. in Mathematics, Université des Sciences et Technologies de Lille, 1999;
B.S. in Industrial Engineering, Galatasaray University, 2001;
M.S. in Scientific Methods in Business, Université Paris IX-Dauphine, 2002;
Ph.D. in Operational Research, Ecole Polytechnique Fédérale de Lausanne, 2006.
:: Research Interests

Algorithmic Graph Theory and Applications, Generalized Vertex Coloring Problems, Combinatorial Optimization, Sport Scheduling, Complexity Theory, Approximation Theory

:: Conference Organization
17th International Colloquium on Structural Information and Communication Complexity , SIROCCO 2010 . June 7-11, 2010, Şirince/Turkey (Organization Committee Chair), http://www.sirocco2010.boun.edu.tr/;
Workshop on Graph Theory and its Applications II, Bogazici University . October 20-21, 2011, Istanbul/Turkey (co-organizer);
Workshop on Graph Theory and its Applications I, Feza Gursey Institute . October 15-17, 2010, Istanbul/Turkey (co-organizer);
Monthly seminars of Istanbul Discrete Mathematics Meetings (IDMM) at IMBM (http://imbm.org.tr/) since March 2009 (co-organizer with Turker Biyikoglu). Combinatorics and graph theory community is cordially invited for giving a talk. Please contact us if you are interested and/or if you are visiting Istanbul.
:: Research Grants
Tubitak Career Project (111M482): Exploiting Graph Structure to Solve Hard Problems, 2012-2014 (director);
Tubitak-Fransa PIA Bosphorus (111M303): The Selective Graph Coloring Problem, 2012-2013 (director);
BAP (B.U Research Fund) 6461(D): Graph Theoretical Problems in Telecommunication Networks, 2012-2014 (director);
Tubitak - TEYDEB 7100024: Airline Operations and Scheduling Optimization Software, 2010-2011 (consultant);
BAP (B.U Research Fund) 09A302P: Generalized Graph Coloring Problems, 2009-2010 (director);
Tubitak-CNRS Joint Research Project 2505 (108M616): Stable matchings and minimum maximal matching in regular bipartite graphs, 2009-2010 (director);
BAP (B.U Research Fund) 08A301: Graph theoretical approach to stable matching problem applied to university admission system in Turkey, 2008 (director).
:: Offered Courses
  • IE 202  Operations Research I: Linear Models
  • IE 494  Graph Algorithms and Applications
  • IE 59B Special Studies in Advanced Topics in Algorithms
  • IE 598  Special Topics in Advanced Graph Theory
:: Recent Publications
  • Ekim, T., Gimbel, J., (2011), "Some defective parameters in graphs, Graphs and Combinatorics," DOI : 10.1007/s00373-011-1111-5.
  • Taşkın, Z.C. & Ekim, T (2011), "Integer Programming Formulations for the Minimum Weighted Maximal Matching Problem," DOI: 10.1007/s11590-011-0351-x.
  • Ekim, T., Ries, B., de Werra, D., (2010) “Split-critical and uniquely colorable graphs”, Discrete Mathematics and Theoretical Computer Science, 12(5): 1-24
  • Ekim, T., Hoang, J., (2010) “Recognizing line-polar bipartite graphs in time O(n)”, Discrete Applied Mathematics, Vol 158: 1593-1598
  • T. Ekim, P. Heggernes, D. Meister (2009). " Polar Permutation Graphs." J. Fiala, J. Kratochvil, and M. Miller (Eds.): IWOCA 2009, LNCS 5874, 218–229.
  • T. Ekim, J. Gimbel (2009). "Partitioning graphs into complete and empty graphs." Discrete Mathematics. 309: 5849-5856, doi:10.1016/j.disc.2008.06.027
  • M. Demange, T. Ekim, D. de Werra (2009). "A tutorial on the use of graph coloring for some problems in robotics."European Journal of Operational Research.192(1): 41-55.
  • M. Demange, T. Ekim (2008)."Minimum maximal matching is NP-hard in regular bipartite graphs."Proceedings of Theory and Applications of Models of Computation. TAMC 2008, LNCS 4978, 364-374.
  • T. Ekim, P. Hell, J. Stacho, D. de Werra (2008). "Polar chordal graphs."Discrete Applied Mathematics 156(13): 2469-2479.
  • Geinoz, A., T. Ekim and D. de Werra (2008). "Construction of balanced sports schedules using partitions into subleagues." Operations Research Letters. 36(3): 279-282.
  • Ekim, T., N. V. R. Mahadev and D. de Werra (2008). "Polar cographs." Discrete Applied Mathematics 156(10): 1652-1660.
  • de Werra, D., T. Ekim and C. Raess (2006). "Construction of sports schedules with multiple venues." Discrete Applied Mathematics. 154(1): 47-58.
  • Demange, M., T. Ekim and D. de Werra (2006). "On the approximation of min split-coloring and min cocoloring." Journal of Graph Algorithms and Applications. 10(2): 297-315.
  • Demange, M., T. Ekim and D. de Werra (2005). "Partitioning cographs into cliques and stable sets." Discrete Optimization. 2(2): 145-153.
  • Demange, M., T. Ekim and D. de Werra (2005). "(p, k)-coloring problems in line graphs." Theoretical Computer Science. 349(3): 462-474.
  • Ekim, T. and D. de Werra (2005). "On split-coloring problems." Journal of Combinatorial Optimization. 10(3): 211-225.
  • Ekim, T. and V. T. Paschos (2004). "Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximation." International Journal of Computer Mathematics. 81(5): 569-582.

:: Contact Information

Personal URL

 -

e-mail

 tinaz.ekim

Phone (office)

 + 90 (212) 359 6676

Fax (office)

 + 90 (212) 265 1800

Address

 Boğaziçi University
Department of Industrial Engineering
34342, Bebek-Istanbul, Turkey