Tınaz Ekim Aşıcı

Vice-Chair
Email:
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 Univ- 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
-
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded, , Discrete Mathematics, Volume 340, p.927 - 934, (2017)
-
Edge extremal Graphs Under Degree and Matching Number Restrictions, , 17th Haifa Workshop on Interdisciplinary Applications of Graphs – CRI, (2017)
-
Recent results on equimatchable graphs, , Combinatorial Potlatch, (2017)
-
Linear-Time Generation of Random Chordal Graphs, , International Conference on Algorithms and Complexity, (2017)
-
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes—Part I, , Discrete Applied Mathematics, Volume 215, p.47–60, (2016)
-
On the minimum and maximum selective graph coloring problems in some graph classes, , Discrete Applied Mathematics, Volume 204, p.77–89, (2016)
-
Equimatchable graphs are C2k+ 1-free for k≥ 4, , Discrete Mathematics, Volume 339, p.2964–2969, (2016)
-
Polar cographs, , Discrete Applied Mathematics, Volume 171, Number EPFL-ARTICLE-199582, p.158–158, (2014)
-
Efficient recognition of equimatchable graphs, , Information Processing Letters, Volume 114, Number 1, p.66–71, (2014)
-
On some applications of the selective graph coloring problem, , European Journal of Operational Research, (2014)
- 1 of 4
- next ›