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.
Personal Web Site:
Research Interests:
Algorithmic graph theory and applications, Combinatorial optimization, Complexity theory, Approximation theory
Recent publications
-
Polar permutation graphs are polynomial-time recognisable, , European Journal of Combinatorics, Volume 34, Number 3, p.576–592, (2013)
-
A note on the NP-hardness of two matching problems in induced subgrids, , Discrete Mathematics and Theoretical Computer Science, Volume 15, Number 2, p.233–242, (2013)
-
Perfectness of clustered graphs, , Discrete Optimization, Volume 10, Number 4, p.296–303, (2013)
-
Hardness and approximation of minimum maximal matchings, , International Journal of Computer Mathematics, Number ahead-of-print, p.1–20, (2013)
-
Computing minimum geodetic sets of proper interval graphs, , LATIN 2012: Theoretical Informatics, p.279–290, (2012)
-
Integer Programming Formulations for the Minimum Weighted Maximal Matching Problem, , Optimization Letters, Volume 6(6), p.1161-1171, (2012)
-
Split-critical and uniquely split-colorable graphs, , Discrete Mathematics and Theoretical Computer Science, Volume 12, Number 5, p.1–24, (2010)
-
Recognizing line-polar bipartite graphs in time O (n), , Discrete Applied Mathematics, Volume 158, Number 15, p.1593–1598, (2010)
-
A tutorial on the use of graph coloring for some problems in robotics, , European Journal of Operational Research, Volume 192, Number 1, p.41–55, (2009)
- ‹ previous
- 4 of 6
- next ›