Students | Tınaz Ekim

Title

Professor

Email Address

tinaz.ekim [at]

[at]

bogazici.edu.tr

Phone Number

+90 212 359 66 76

About

I am a Prof. in the Dept. of Industrial Engineering at Boğaziçi University, Turkey. I completed my Ms thesis at the Université Paris Dauphine in the Computer Science and Mathematics Dept. under the supervision of Vangelis Paschos. In 2006, I obtained my PhD in Operations Research from Ecole Polytechnique Fédérale de Lausanne (EPFL), supervised by Dominique de Werra. After one year of postdoc at EPFL, I started to work in my current position at Boğaziçi University.

My research focuses on Structural and Algorithmic Graph Theory, Combinatorial Optimization, Computational Complexity and Mathematical Programming. More specifically, I have been working on the following topics: graph classes, computational complexity of graph problems, generelized graph coloring (e.g. split-coloring, cocoloring, defective coloring, (p,k)-coloring, polar graphs, selective-coloring), matching theory (minimum maximal matching, equimatchable graphs, induced matchings), domination problems, defective Ramsey numbers, efficient graph generation, IP formulation based methods to solve graph problems.

NEWS and ANNOUNCEMENTS

Proud to be one of the beneficiaries of the (C)ombinatorial (O)ptimisation for (V)ersatile Applications to (E)merging u(R)ban problems (COVER) project awarded the Horizon Europe MSCA-SE funding. This 3-years interdisciplinary project is coordinated by GTU (Turkey) and includes 15 institutions and 48 researchers from 6 countries. It aims to bridge the gap between theory and practice in terms of urbanization problems using integer programming, structural graph theory, operations research and network optimization methods. More info.
Graphs, Groups, and Automata. We invite you to a day of talks around the concept of computation in Mathematics and Theoretical Computer Science. Join us on Thursday, May 16, Boğaziçi University, Kandilli Campus. Check the web site for abstracts and directiıons to reach Kandilli Campus.
GCGT 2024 , The 9th Gdansk Conference on Graph Theory (GCGT), June 16-21, Gdansk, Poland. Honored to be an Invited Speaker in such a distinguished conference! Online or in person registration is OPEN. Tutorials and poster sessions for young scientists.
Pavol Hell from Simon Fraser University (Canada), Computer Science, will be visiting our department between May 13-17, 2024. He will be giving a talk entitled ''One Graph-Theorist's Perspective on the Quest for Dichotomy, a Personal Account''. Follow the details here.
We are organizing Workshop on Graph Theory and its Applications (WGT) yearly in October/November. It's a free 2 days workshop (always on Friday and Saturday), taking place at Boğaziçi University and having two invited lectures and contributed talks by MS/Phd students and young researchers. Last edition is here. DO NOT MISS THE NEXT ONE if you are in network science, graph theory, combinatorial optimization or related areas.

Useful Links

Students

PhD Students

Bilge Varol, Integer Programming Formulations for the Defensive Domination Problem, ongoing.
Oylum Şeker, Decomposition Methods for Selective Coloring Problem, (co-supervised with Z. Caner Taşkın) October 2018.
Arman Boyacı, Graphs of Edge Intersectıng Non-Splitting Paths, June 2015.
R. Mert Yüzsever, Minimum Split Coloring, 2012 (co-supervised with Necati Aras)

MS Students

Burak Nur Erdem, Integer Programming Formulations to construct structured graphs, ongoing.
Gulce Baysal, Majority Coloring Game, ongoing.
Kadir Pehlivan, Generating random perfect graphs, August 2024.
Hatice Pinar Yildirim, Priority Management in Ride Hailing Problems, June 2024.
Ali Erdem Banak, (co-supervisor), IP formulations for extremal graph problems, Jan 2023.
Elif Erdem, Money Laundering Detection in Crypto Currency Networks, Sept 2022.
Cemre Celebi, The Maximum Acyclic Matching Problem, Sept 2022.
Ömer Burak Onar, The Selective Tree Problem, Jan 2022.
Gizem Taş, Network Based Methods for Anti-Money Laundering, July 2020.
Ahmet Çağrı Düzgün, Finding Maximum Stable Sets in Perfect Graphs, (co-supervised with Z. Caner Taşkın), 2017. (PhD from Princeton University, Operations Research and Financial Engineering)
Cemil Dibek, Edge-Extremal Graphs Under Degree and Matching Number Restrictions, 2016. (PhD from Princeton University, Operations Research and Financial Engineering)
Betül Ahat, Integer programming formulations for the Maximum Induced Matching Problem, (co-supervised with Z. Caner Taşkın), 2016. (PhD from Boğaziçi University, Industrial Engineering Department)
Ayberk Çalık, The Selective Graph Coloring Problem, 2013. (currently Senior Product Manager at Turkcell)
Ahu Akdemir (Göral), Defective Ramsey Numbers and Defective Cocolorings, 2012. (currently Thermal Optimization and Planning Team Lead at Enerjisa Üretim)
Aysel Erey, Convexity in graphs, 2011. (currently Assist. Prof. at Gebze Technical University, Department of Mathematics)
Arman Boyacı, Unit Disc Graph Coloring and its Reoptimization, 2009.

Postdocs

Zakir Deniz (October 2015 - May 2016, now Assist. Prof. at Düzce University, Turkey)
Carl Feghali (visiting April 2019)
Milad Ahanjideh (March 2020-August 2021)