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
-
Partitioning graphs into complete and empty graphs, , Discrete Mathematics, Volume 309, Number 19, p.5849–5856, (2009)
-
Construction of balanced sports schedules using partitions into subleagues, , Operations Research Letters, Volume 36, Number 3, p.279–282, (2008)
-
Minimum maximal matching is NP-hard in regular bipartite graphs, , Theory and Applications of Models of Computation, p.364–374, (2008)
-
Polarity of chordal graphs, , Discrete Applied Mathematics, Volume 156, Number 13, p.2469–2479, (2008)
-
Polar cographs, , Discrete Applied Mathematics, Volume 156, Number 10, p.1652–1660, (2008)
-
On split-coloring problems (vol 10, pg 211, 2005), , JOURNAL OF COMBINATORIAL OPTIMIZATION, Volume 11, Number 1, p.125–125, (2006)
-
On the approximation of Min Split-coloring and Min Cocoloring., , J. Graph Algorithms Appl., Volume 10, Number 2, p.297–315, (2006)
-
Construction of sports schedules with multiple venues, , Discrete Applied Mathematics, Volume 154, Number 1, p.47–58, (2006)
-
(p, k)-coloring problems in line graphs, , Theoretical computer science, Volume 349, Number 3, p.462–474, (2005)
-
Partitioning cographs into cliques and stable sets, , Discrete Optimization, Volume 2, Number 2, p.145–153, (2005)
- ‹ previous
- 5 of 6
- next ›