Tınaz Ekim Aşıcı
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, DauphineParis IX, 2002;
Ph.D. in OR, Ecole Polytech. Féd. de Lausanne, 2006.
Personal Web Site:
Research Interests:
Algorithmic graph theory and applications, Combinatorial optimization, Complexity theory, Approximation theory
Recent publications

An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs, , European Journal of Operational Research, Volume 291(1), p.67–83, (2021)

The complexity of the defensive domination problem in special graph classes, , Discrete Mathematics, Volume 343, p.111665, (2020)

Mind the independence gap, , Discrete Mathematics, Volume 343, p.111943, (2020)

A decomposition approach to solve the selective graph coloring problem in some perfect graph families, , Networks, Volume 73, p.145169, (2019)

Small 1defective Ramsey numbers in perfect graphs, , Discrete Optimization, Volume 34, p.100548, (2019)

Edgestable equimatchable graphs, , Discrete Applied Mathematics, Volume 261, p.136147, (2019)

Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem, , INFORMS Journal on Computing, Volume 30, p.4356, (2018)

The maximum cardinality cut problem in cobipartite chain graphs, , Journal of Combinatorial Optimization, Jan, Volume 35, p.250–265, (2018)

On Almost WellCovered Graphs of Girth at Least 6, , Discrete Mathematics & Theoretical Computer Science, Volume 20, (2018)

Graphs of EdgeIntersecting NonSplitting Paths in a Tree: Representations of HolesPart II, , Discrete Mathematics and Theoretical Computer Science, Volume 20, p.1b–1b, (2018)
 1 of 6
 next ›