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, Dauphine-Paris IX, 2002;
Ph.D. in OR, Ecole Polytech. Féd. de Lausanne, 2006.
Faculty Member in the Department since: 2007
Personal Web Site:
Research Interests:
Algorithmic graph theory and applications, Combinatorial optimization, Complexity theory, Approximation theory
Recent publications
-
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II, , Discrete Mathematics and Theoretical Computer Science, Volume 20, p.1b–1b, (2018)
-
On two extensions of equimatchable graphs, , Discrete Optimization, Volume 26, p.112-130, (2017)
-
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs, , Information Processing Letters, Volume 121, p.29-33, (2017)
-
Complexity of the Improper Twin Edge Coloring of Graphs, , Graphs and Combinatorics, Volume 33, p.595–615, (2017)
-
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded, , Discrete Mathematics, Volume 340, p.927 - 934, (2017)
-
On matching extendability of lexicographic products, , RAIRO-Oper. Res., Volume 51, p.857-873, (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)
- ‹ previous
- 2 of 6
- next ›