Tínaz Ekim

According to our database, Tínaz Ekim authored at least 77 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Maximum size of a triangle-free graph with bounded maximum degree and matching number.

Milad Ahanjideh, Tínaz Ekim, Mehmet Akif Yildiz

J. Comb. Optim., May, 2024

Sparse Sets in Triangle-free Graphs.

Tínaz Ekim, Burak Nur Erdem, John Gimbel

CoRR, 2024

Generation of weighted trees, block trees and block graphs.

Tínaz Ekim, Mordechai Shalom, Mehmet Aziz Yirik

CoRR, 2024

2023

Constructing extremal triangle-free graphs using integer programming.

Ali Erdem Banak, Tínaz Ekim, Z. Caner Taskin

Discret. Optim., November, 2023

Defensive domination in proper interval graphs.

Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom

Discret. Appl. Math., May, 2023

Defective Ramsey Numbers and Defective Cocolorings in Some Subclasses of Perfect Graphs.

Yunus Emre Demirci, Tínaz Ekim, Mehmet Akif Yildiz

Graphs Comb., February, 2023

Well-indumatched trees and graphs of bounded girth.

Saieed Akbari, Tínaz Ekim, Amir Hossein Ghodrati, Sanaz Zare

Australas. J Comb., 2023

Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem.

Ömer Burak Onar, Tínaz Ekim, Z. Caner Taskin

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

2022

On the maximum cardinality cut problem in proper interval graphs and related graph classes.

Arman Boyaci, Tínaz Ekim, Mordechai Shalom

Theor. Comput. Sci., 2022

Generation of random chordal graphs using subtrees of a tree.

Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin

RAIRO Oper. Res., 2022

2021

The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation.

Tínaz Ekim, Mordechai Shalom, Oylum Seker

J. Comb. Optim., 2021

An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs.

Oylum Seker, Tínaz Ekim, Z. Caner Taskin

Eur. J. Oper. Res., 2021

Exact values of defective Ramsey numbers in graph classes.

Yunus Emre Demirci, Tínaz Ekim, John Gimbel, Mehmet Akif Yildiz

Discret. Optim., 2021

Well-totally-dominated graphs.

Selim Bahadir, Tínaz Ekim, Didem Gözüpek

Ars Math. Contemp., 2021

2020

Mind the independence gap.

Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic

Discret. Math., 2020

The complexity of the defensive domination problem in special graph classes.

Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski

Discret. Math., 2020

The Nobel Prize in Economic Sciences 2012 and Matching Theory.

Tínaz Ekim

Proceedings of the 9th International Conference on Operations Research and Enterprise Systems, 2020

2019

A decomposition approach to solve the selective graph coloring problem in some perfect graph families.

Oylum Seker, Tínaz Ekim, Z. Caner Taskin

Networks, 2019

Small 1-defective Ramsey numbers in perfect graphs.

Tínaz Ekim, John Gimbel, Oylum Seker

Discret. Optim., 2019

Edge-stable equimatchable graphs.

Zakir Deniz, Tínaz Ekim

Discret. Appl. Math., 2019

2018

The maximum cardinality cut problem in co-bipartite chain graphs.

Arman Boyaci, Tínaz Ekim, Mordechai Shalom

J. Comb. Optim., 2018

Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem.

Betül Ahat, Tínaz Ekim, Z. Caner Taskin

INFORMS J. Comput., 2018

On Almost Well-Covered Graphs of Girth at Least 6.

Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic

Discret. Math. Theor. Comput. Sci., 2018

Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II.

Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks

Discret. Math. Theor. Comput. Sci., 2018

Equimatchable claw-free graphs.

Saieed Akbari, Hadi Alizadeh, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom

Discret. Math., 2018

2017

On matching extendability of lexicographic products.

Nina Chiarelli, Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Stefko Miklavic

RAIRO Oper. Res., 2017

A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs.

Arman Boyaci, Tínaz Ekim, Mordechai Shalom

Inf. Process. Lett., 2017

Complexity of the Improper Twin Edge Coloring of Graphs.

Paniz Abedin, Saieed Akbari, Marc Demange, Tínaz Ekim

Graphs Comb., 2017

Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid.

Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks

Discret. Math. Theor. Comput. Sci., 2017

Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded.

Cemil Dibek, Tínaz Ekim, Pinar Heggernes

Discret. Math., 2017

On two extensions of equimatchable graphs.

Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom

Discret. Optim., 2017

Almost Well-Covered Graphs Without Short Cycles.

Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic

CoRR, 2017

Linear-Time Generation of Random Chordal Graphs.

Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Graphs of edge-intersecting and non-splitting paths.

Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks

Theor. Comput. Sci., 2016

On Three Extensions of Equimatchable Graphs.

Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom

Electron. Notes Discret. Math., 2016

Equimatchable graphs are C_2k+1-free for k≥4.

Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom

Discret. Math., 2016

On the minimum and maximum selective graph coloring problems in some graph classes.

Marc Demange, Tínaz Ekim, Bernard Ries

Discret. Appl. Math., 2016

Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I.

Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks

Discret. Appl. Math., 2016

Stable Equimatchable Graphs.

Zakir Deniz, Tínaz Ekim

CoRR, 2016

Improper Twin Edge Coloring of Graphs.

Paniz Abedin, Saieed Akbari, Mahsa Daneshmand, Marc Demange, Tínaz Ekim

CoRR, 2016

2015

On some applications of the selective graph coloring problem.

Marc Demange, Tínaz Ekim, Bernard Ries, Cerasela Tanasescu

Eur. J. Oper. Res., 2015

Advances on defective parameters in graphs.

Ahu Akdemir, Tínaz Ekim

Discret. Optim., 2015

The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs.

Arman Boyaci, Tínaz Ekim, Mordechai Shalom

CoRR, 2015

The Maximum Cut Problem in Co-bipartite Chain Graphs.

Arman Boyaci, Tínaz Ekim, Mordechai Shalom

CoRR, 2015

Equimatchable Graphs are C_2k+1-free for k ≥ 4.

Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

On the Minimum and Maximum Selective Graph Coloring Problems.

Marc Demange, Tínaz Ekim, Bernard Ries

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Block decomposition approach to compute a minimum geodetic set.

Tínaz Ekim, Aysel Erey

RAIRO Oper. Res., 2014

Efficient recognition of equimatchable graphs.

Marc Demange, Tínaz Ekim

Inf. Process. Lett., 2014

Hardness and approximation of minimum maximal matchings.

Marc Demange, Tínaz Ekim, Cerasela Tanasescu

Int. J. Comput. Math., 2014

Corrigendum to "Polar cographs" [Discrete Appl. Math. 156(2008) 1652-1660].

Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra

Discret. Appl. Math., 2014

2013

Decomposition algorithms for solving the minimum weight maximal matching problem.

Merve Bodur, Tínaz Ekim, Z. Caner Taskin

Networks, 2013

Some Defective Parameters in Graphs.

Tínaz Ekim, John Gimbel

Graphs Comb., 2013

Polar permutation graphs are polynomial-time recognisable.

Tínaz Ekim, Pinar Heggernes, Daniel Meister

Eur. J. Comb., 2013

A note on the NP-hardness of two matching problems in induced subgrids.

Marc Demange, Tínaz Ekim

Discret. Math. Theor. Comput. Sci., 2013

Perfectness of clustered graphs.

Flavia Bonomo, Denis Cornaz, Tínaz Ekim, Bernard Ries

Discret. Optim., 2013

Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards Hole Representations-Part I.

Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks

CoRR, 2013

Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract).

Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

2012

Integer programming formulations for the minimum weighted maximal matching problem.

Z. Caner Taskin, Tínaz Ekim

Optim. Lett., 2012

Computing Minimum Geodetic Sets of Proper Interval Graphs.

Tínaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

A Branch-and-Price Algorithm for Split-Coloring Problem.

R. Mert Yüzsever, Tínaz Ekim, Necati Aras

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2010

Split-critical and uniquely split-colorable graphs.

Tínaz Ekim, Bernard Ries, Dominique de Werra

Discret. Math. Theor. Comput. Sci., 2010

Recognizing line-polar bipartite graphs in time O(n).

Tínaz Ekim, Jing Huang

Discret. Appl. Math., 2010

2009

A tutorial on the use of graph coloring for some problems in robotics.

Marc Demange, Tínaz Ekim, Dominique de Werra

Eur. J. Oper. Res., 2009

Partitioning graphs into complete and empty graphs.

Tínaz Ekim, John Gimbel

Discret. Math., 2009

Polar Permutation Graphs.

Tínaz Ekim, Pinar Heggernes, Daniel Meister

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Construction of balanced sports schedules using partitions into subleagues.

A. Geinoz, Tínaz Ekim, Dominique de Werra

Oper. Res. Lett., 2008

Polar cographs.

Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra

Discret. Appl. Math., 2008

Polarity of chordal graphs.

Tínaz Ekim, Pavol Hell, Juraj Stacho, Dominique de Werra

Discret. Appl. Math., 2008

Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs.

Marc Demange, Tínaz Ekim

Proceedings of the Theory and Applications of Models of Computation, 2008

2006

On the approximation of Min Split-coloring and Min Cocoloring.

Marc Demange, Tínaz Ekim, Dominique de Werra

J. Graph Algorithms Appl., 2006

Erratum.

Tínaz Ekim, Dominique de Werra

J. Comb. Optim., 2006

Construction of sports schedules with multiple venues.

Dominique de Werra, Tínaz Ekim, C. Raess

Discret. Appl. Math., 2006

2005

(<i>p</i>, <i>k</i>)-coloring problems in line graphs.

Marc Demange, Tínaz Ekim, Dominique de Werra

Theor. Comput. Sci., 2005

On Split-Coloring Problems.

Tínaz Ekim, Dominique de Werra

J. Comb. Optim., 2005

(p, k)-coloring problems in line graphs.

Marc Demange, Tínaz Ekim, Dominique de Werra

Electron. Notes Discret. Math., 2005

Partitioning cographs into cliques and stable sets.

Marc Demange, Tínaz Ekim, Dominique de Werra

Discret. Optim., 2005

2004

Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximation.

Tínaz Ekim, Vangelis Th. Paschos

Int. J. Comput. Math., 2004