Tínaz Ekim

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 50

Top Topics

Integer Program

Cutting Plane Algorithm

Top Venues

Discret. Optim.

Discret. Appl. Math.

Publications

Tínaz Ekim, Burak Nur Erdem, John Gimbel
Sparse Sets in Triangle-free Graphs. CoRR (2024)
Tínaz Ekim, Mordechai Shalom, Mehmet Aziz Yirik
Generation of weighted trees, block trees and block graphs. CoRR (2024)
Milad Ahanjideh, Tínaz Ekim, Mehmet Akif Yildiz
Maximum size of a triangle-free graph with bounded maximum degree and matching number. J. Comb. Optim. 47 (4) (2024)
Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom
Defensive domination in proper interval graphs. Discret. Appl. Math. 331 (2023)
Ali Erdem Banak, Tínaz Ekim, Z. Caner Taskin
Constructing extremal triangle-free graphs using integer programming. CoRR (2023)
Yunus Emre Demirci, Tínaz Ekim, Mehmet Akif Yildiz
Defective Ramsey Numbers and Defective Cocolorings in Some Subclasses of Perfect Graphs. Graphs Comb. 39 (1) (2023)
Ömer Burak Onar, Tínaz Ekim, Z. Caner Taskin
Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem. SEA (2023)
Saieed Akbari, Tínaz Ekim, Amir Hossein Ghodrati, Sanaz Zare
Well-indumatched trees and graphs of bounded girth. Australas. J Comb. 85 (2023)
Ali Erdem Banak, Tínaz Ekim, Z. Caner Taskin
Constructing extremal triangle-free graphs using integer programming. Discret. Optim. 50 (2023)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
On the maximum cardinality cut problem in proper interval graphs and related graph classes. Theor. Comput. Sci. 898 (2022)
Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin
Generation of random chordal graphs using subtrees of a tree. RAIRO Oper. Res. 56 (2) (2022)
Selim Bahadir, Tínaz Ekim, Didem Gözüpek
Well-totally-dominated graphs. Ars Math. Contemp. 20 (1) (2021)
Yunus Emre Demirci, Tínaz Ekim, John Gimbel, Mehmet Akif Yildiz
Exact values of defective Ramsey numbers in graph classes. Discret. Optim. 42 (2021)
Tínaz Ekim, Mordechai Shalom, Oylum Seker
The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation. J. Comb. Optim. 41 (3) (2021)
Oylum Seker, Tínaz Ekim, Z. Caner Taskin
An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs. Eur. J. Oper. Res. 291 (1) (2021)
Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski
The complexity of the defensive domination problem in special graph classes. Discret. Math. 343 (2) (2020)
Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
Mind the independence gap. Discret. Math. 343 (9) (2020)
Tínaz Ekim
The Nobel Prize in Economic Sciences 2012 and Matching Theory. ICORES (2020)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes. CoRR (2020)
Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom
Defensive Domination in Proper Interval Graphs. CoRR (2020)
Tínaz Ekim, John Gimbel, Oylum Seker
Small 1-defective Ramsey numbers in perfect graphs. Discret. Optim. 34 (2019)
Saieed Akbari, Tínaz Ekim, Amir Hossein Ghodrati, Sanaz Zare
Well-indumatched Trees and Graphs of Bounded Girth. CoRR (2019)
Tínaz Ekim, Mordechai Shalom, Oylum Seker
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation. CoRR (2019)
Oylum Seker, Tínaz Ekim, Z. Caner Taskin
A decomposition approach to solve the selective graph coloring problem in some perfect graph families. Networks 73 (2) (2019)
Tínaz Ekim, Mordechai Shalom, Oylum Seker
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation. SEA² (2019)
Zakir Deniz, Tínaz Ekim
Edge-stable equimatchable graphs. Discret. Appl. Math. 261 (2019)
Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin
Generation of random chordal graphs using subtrees of a tree. CoRR (2018)
Saieed Akbari, Hadi Alizadeh, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
Equimatchable claw-free graphs. Discret. Math. 341 (10) (2018)
Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
Mind the Independence Gap. CoRR (2018)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
The maximum cardinality cut problem in co-bipartite chain graphs. J. Comb. Optim. 35 (1) (2018)
Oylum Seker, Tínaz Ekim, Z. Caner Taskin
An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs. CoRR (2018)
Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
On Almost Well-Covered Graphs of Girth at Least 6. Discret. Math. Theor. Comput. Sci. 20 (2) (2018)
Betül Ahat, Tínaz Ekim, Z. Caner Taskin
Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem. INFORMS J. Comput. 30 (1) (2018)
Paniz Abedin, Saieed Akbari, Marc Demange, Tínaz Ekim
Complexity of the Improper Twin Edge Coloring of Graphs. Graphs Comb. 33 (4) (2017)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs. Inf. Process. Lett. 121 (2017)
Cemil Dibek, Tínaz Ekim, Pinar Heggernes
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded. Discret. Math. 340 (5) (2017)
Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
Almost Well-Covered Graphs Without Short Cycles. CoRR (2017)
Nina Chiarelli, Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Stefko Miklavic
On matching extendability of lexicographic products. RAIRO Oper. Res. 51 (3) (2017)
Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin
Linear-Time Generation of Random Chordal Graphs. CIAC (2017)
Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom
On two extensions of equimatchable graphs. Discret. Optim. 26 (2017)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of edge-intersecting and non-splitting paths. Theor. Comput. Sci. 629 (2016)
Saieed Akbari, Hadi Alizadeh, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
Equimatchable Claw-Free Graphs. CoRR (2016)
Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom
On Three Extensions of Equimatchable Graphs. Electron. Notes Discret. Math. 55 (2016)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I. Discret. Appl. Math. 215 (2016)
Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
-free for k≥4. Discret. Math. 339 (12) (2016)
Marc Demange, Tínaz Ekim, Bernard Ries
On the minimum and maximum selective graph coloring problems in some graph classes. Discret. Appl. Math. 204 (2016)
Paniz Abedin, Saieed Akbari, Mahsa Daneshmand, Marc Demange, Tínaz Ekim
Improper Twin Edge Coloring of Graphs. CoRR (2016)
Zakir Deniz, Tínaz Ekim
Stable Equimatchable Graphs. CoRR (2016)
Marc Demange, Tínaz Ekim, Bernard Ries, Cerasela Tanasescu
On some applications of the selective graph coloring problem. Eur. J. Oper. Res. 240 (2) (2015)
Marc Demange, Tínaz Ekim, Bernard Ries
On the Minimum and Maximum Selective Graph Coloring Problems. CTW (2015)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid. CoRR (2015)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
The Maximum Cut Problem in Co-bipartite Chain Graphs. CoRR (2015)
Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
Equimatchable Graphs are C_2k+1-free for k ≥ 4. CTW (2015)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom
The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs. CoRR (2015)
Ahu Akdemir, Tínaz Ekim
Advances on defective parameters in graphs. Discret. Optim. 16 (2015)
Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra
Corrigendum to "Polar cographs" [Discrete Appl. Math. 156(2008) 1652-1660]. Discret. Appl. Math. 171 (2014)
Marc Demange, Tínaz Ekim
Efficient recognition of equimatchable graphs. Inf. Process. Lett. 114 (1-2) (2014)
Marc Demange, Tínaz Ekim, Cerasela Tanasescu
Hardness and approximation of minimum maximal matchings. Int. J. Comput. Math. 91 (8) (2014)
Tínaz Ekim, Aysel Erey
Block decomposition approach to compute a minimum geodetic set. RAIRO Oper. Res. 48 (4) (2014)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of edge-intersecting and non-splitting paths. ICTCS (2014)
Tínaz Ekim, Pinar Heggernes, Daniel Meister
Polar permutation graphs are polynomial-time recognisable. Eur. J. Comb. 34 (3) (2013)
Marc Demange, Tínaz Ekim
A note on the NP-hardness of two matching problems in induced subgrids. Discret. Math. Theor. Comput. Sci. 15 (2) (2013)
Tínaz Ekim, John Gimbel
Some Defective Parameters in Graphs. Graphs Comb. 29 (2) (2013)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II. CoRR (2013)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract). WG (2013)
Merve Bodur, Tínaz Ekim, Z. Caner Taskin
Decomposition algorithms for solving the minimum weight maximal matching problem. Networks 62 (4) (2013)
Flavia Bonomo, Denis Cornaz, Tínaz Ekim, Bernard Ries
Perfectness of clustered graphs. Discret. Optim. 10 (4) (2013)
Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I. CoRR (2013)
R. Mert Yüzsever, Tínaz Ekim, Necati Aras
A Branch-and-Price Algorithm for Split-Coloring Problem. CTW (2012)
Z. Caner Taskin, Tínaz Ekim
Integer programming formulations for the minimum weighted maximal matching problem. Optim. Lett. 6 (6) (2012)
Tínaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister
Computing Minimum Geodetic Sets of Proper Interval Graphs. LATIN (2012)
Tínaz Ekim, Jing Huang
Recognizing line-polar bipartite graphs in time O(n). Discret. Appl. Math. 158 (15) (2010)
Tínaz Ekim, Bernard Ries, Dominique de Werra
Split-critical and uniquely split-colorable graphs. Discret. Math. Theor. Comput. Sci. 12 (5) (2010)
Tínaz Ekim, Pinar Heggernes, Daniel Meister
Polar Permutation Graphs. IWOCA (2009)
Tínaz Ekim, John Gimbel
Partitioning graphs into complete and empty graphs. Discret. Math. 309 (19) (2009)
Marc Demange, Tínaz Ekim, Dominique de Werra
A tutorial on the use of graph coloring for some problems in robotics. Eur. J. Oper. Res. 192 (1) (2009)
Marc Demange, Tínaz Ekim
Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs. TAMC (2008)
Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra
Polar cographs. Discret. Appl. Math. 156 (10) (2008)
Tínaz Ekim, Pavol Hell, Juraj Stacho, Dominique de Werra
Polarity of chordal graphs. Discret. Appl. Math. 156 (13) (2008)
A. Geinoz, Tínaz Ekim, Dominique de Werra
Construction of balanced sports schedules using partitions into subleagues. Oper. Res. Lett. 36 (3) (2008)
Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra
Polar cographs. Electron. Notes Discret. Math. 28 (2007)
Dominique de Werra, Tínaz Ekim, C. Raess
Construction of sports schedules with multiple venues. Discret. Appl. Math. 154 (1) (2006)
Marc Demange, Tínaz Ekim, Dominique de Werra
On the approximation of Min Split-coloring and Min Cocoloring. J. Graph Algorithms Appl. 10 (2) (2006)
Tínaz Ekim, Dominique de Werra
Erratum. J. Comb. Optim. 11 (1) (2006)
Marc Demange, Tínaz Ekim, Dominique de Werra
(p, k)-coloring problems in line graphs. Electron. Notes Discret. Math. 19 (2005)
Tínaz Ekim, Dominique de Werra
On Split-Coloring Problems. J. Comb. Optim. 10 (3) (2005)
Marc Demange, Tínaz Ekim, Dominique de Werra
Partitioning cographs into cliques and stable sets. Discret. Optim. 2 (2) (2005)
Marc Demange, Tínaz Ekim, Dominique de Werra
)-coloring problems in line graphs. Theor. Comput. Sci. 349 (3) (2005)
Tínaz Ekim, Vangelis Th. Paschos
Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximation. Int. J. Comput. Math. 81 (5) (2004)