Tínaz Ekim

According to our database1, Tínaz Ekim authored at least 69 papers between 2004 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Mind the independence gap.
Discret. Math., 2020

The complexity of the defensive domination problem in special graph classes.
Discret. Math., 2020

Defensive Domination in Proper Interval Graphs.
CoRR, 2020

On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes.
CoRR, 2020

The Nobel Prize in Economic Sciences 2012 and Matching Theory.
Proceedings of the 9th International Conference on Operations Research and Enterprise Systems, 2020

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

Small 1-defective Ramsey numbers in perfect graphs.
Discret. Optim., 2019

Edge-stable equimatchable graphs.
Discret. Appl. Math., 2019

Well-indumatched Trees and Graphs of Bounded Girth.
CoRR, 2019

The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

The maximum cardinality cut problem in co-bipartite chain graphs.
J. Comb. Optim., 2018

Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem.
INFORMS J. Comput., 2018

On Almost Well-Covered Graphs of Girth at Least 6.
Discret. Math. Theor. Comput. Sci., 2018

Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II.
Discret. Math. Theor. Comput. Sci., 2018

Equimatchable claw-free graphs.
Discret. Math., 2018

An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs.
CoRR, 2018

Generation of random chordal graphs using subtrees of a tree.
CoRR, 2018

On matching extendability of lexicographic products.
RAIRO Oper. Res., 2017

A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs.
Inf. Process. Lett., 2017

Complexity of the Improper Twin Edge Coloring of Graphs.
Graphs Comb., 2017

Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid.
Discret. Math. Theor. Comput. Sci., 2017

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

On two extensions of equimatchable graphs.
Discret. Optim., 2017

Almost Well-Covered Graphs Without Short Cycles.
CoRR, 2017

Linear-Time Generation of Random Chordal Graphs.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Graphs of edge-intersecting and non-splitting paths.
Theor. Comput. Sci., 2016

On Three Extensions of Equimatchable Graphs.
Electron. Notes Discret. Math., 2016

Equimatchable graphs are C<sub>2k+1</sub>-free for k≥4.
Discret. Math., 2016

On the minimum and maximum selective graph coloring problems in some graph classes.
Discret. Appl. Math., 2016

Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I.
Discret. Appl. Math., 2016

Stable Equimatchable Graphs.
CoRR, 2016

Improper Twin Edge Coloring of Graphs.
CoRR, 2016

On some applications of the selective graph coloring problem.
Eur. J. Oper. Res., 2015

Advances on defective parameters in graphs.
Discret. Optim., 2015

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

The Maximum Cut Problem in Co-bipartite Chain Graphs.
CoRR, 2015

Equimatchable Graphs are C_2k+1-free for k ≥ 4.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

On the Minimum and Maximum Selective Graph Coloring Problems.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Block decomposition approach to compute a minimum geodetic set.
RAIRO Oper. Res., 2014

Efficient recognition of equimatchable graphs.
Inf. Process. Lett., 2014

Hardness and approximation of minimum maximal matchings.
Int. J. Comput. Math., 2014

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

Decomposition algorithms for solving the minimum weight maximal matching problem.
Networks, 2013

Some Defective Parameters in Graphs.
Graphs Comb., 2013

Polar permutation graphs are polynomial-time recognisable.
Eur. J. Comb., 2013

A note on the NP-hardness of two matching problems in induced subgrids.
Discret. Math. Theor. Comput. Sci., 2013

Perfectness of clustered graphs.
Discret. Optim., 2013

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

Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Integer programming formulations for the minimum weighted maximal matching problem.
Optim. Lett., 2012

Computing Minimum Geodetic Sets of Proper Interval Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

A Branch-and-Price Algorithm for Split-Coloring Problem.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Split-critical and uniquely split-colorable graphs.
Discret. Math. Theor. Comput. Sci., 2010

Recognizing line-polar bipartite graphs in time O(n).
Discret. Appl. Math., 2010

A tutorial on the use of graph coloring for some problems in robotics.
Eur. J. Oper. Res., 2009

Partitioning graphs into complete and empty graphs.
Discret. Math., 2009

Polar Permutation Graphs.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Construction of balanced sports schedules using partitions into subleagues.
Oper. Res. Lett., 2008

Polarity of chordal graphs.
Discret. Appl. Math., 2008

Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2008

Polar cographs.
Electron. Notes Discret. Math., 2007

On the approximation of Min Split-coloring and Min Cocoloring.
J. Graph Algorithms Appl., 2006

J. Comb. Optim., 2006

Construction of sports schedules with multiple venues.
Discret. Appl. Math., 2006

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

On Split-Coloring Problems.
J. Comb. Optim., 2005

(p, k)-coloring problems in line graphs.
Electron. Notes Discret. Math., 2005

Partitioning cographs into cliques and stable sets.
Discret. Optim., 2005

Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximation.
Int. J. Comput. Math., 2004