Tınaz Ekim Aşıcı

Email:

tinaz.ekim@bogazici.edu.tr

Tel. No.:

6676

Lisans, Mat, Univ. Tech. et de Sciences de Lille, 1999;

Lisans, EM, Galatasaray Üniversitesi, 2001;

Y. Lisans, İşl.Bil.Yön., Dauphine Univ.- Paris IX, 2002;

Doktora, YA, Ecole Polytech. Féd. de Lausanne, 2006.

Web:

https://academics.boun.edu.tr/tinaz.ekim/

Dersler

Yayınlar

On Almost Well-Covered Graphs of Girth at Least 6, Milanič, Martin, Hujdurović Ademir, Gözüpek Didem, and Ekim Tinaz , Discrete Mathematics & Theoretical Computer Science, Volume 20, (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, Boyacı, Arman, Ekim Tinaz, and Shalom Mordechai , Information Processing Letters, Volume 121, p.29-33, (2017)
Complexity of the Improper Twin Edge Coloring of Graphs, Abedin, Paniz, Akbari Saieed, Demange Marc, and Ekim Tinaz , 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, Dibek, Cemil, Ekim Tinaz, and Heggernes Pinar , Discrete Mathematics, Volume 340, p.927 - 934, (2017)
On matching extendability of lexicographic products, Chiarelli, Nina, Dibek Cemil, Ekim Tinaz, Gözüpek Didem, and Miklavic Stefko , RAIRO-Oper. Res., Volume 51, p.857-873, (2017)
Edge extremal Graphs Under Degree and Matching Number Restrictions, Ekim, Tinaz , 17th Haifa Workshop on Interdisciplinary Applications of Graphs – CRI, (2017)
Recent results on equimatchable graphs, Ekim, Tinaz , Combinatorial Potlatch, (2017)
Linear-Time Generation of Random Chordal Graphs, Şeker, Oylum, Heggernes Pinar, Ekim Tinaz, and Z. Taşkın Caner , International Conference on Algorithms and Complexity, (2017)
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes—Part I, Boyacı, Arman, Ekim Tinaz, Shalom Mordechai, and Zaks Shmuel , Discrete Applied Mathematics, Volume 215, p.47–60, (2016)