Tínaz Ekim

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