( en | de | ru )

 

Disambiguation of "Ekim, Tínaz"

Author of the publication

copydeleteadd this publication to your clipboard
Polarity of chordal graphs.

, , , and . Discret. Appl. Math., 156 (13): 2469-2479 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Maria Ekimova

Arkadij Ekimov

Ali Tinazli

 

Other publications of authors with the same name

Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs., and . TAMC, volume 4978 of Lecture Notes in Computer Science, page 364-374. Springer, (2008)The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation., , and . SEA², volume 11544 of Lecture Notes in Computer Science, page 21-34. Springer, (2019)Partitioning cographs into cliques and stable sets., , and . Discret. Optim., 2 (2): 145-153 (2005)Construction of balanced sports schedules using partitions into subleagues., , and . Oper. Res. Lett., 36 (3): 279-282 (2008)On the minimum and maximum selective graph coloring problems in some graph classes., , and . Discret. Appl. Math., (2016)Erratum., and . J. Comb. Optim., 11 (1): 125 (2006)Graphs of edge-intersecting and non-splitting paths., , , and . ICTCS, volume 1231 of CEUR Workshop Proceedings, page 45-58. CEUR-WS.org, (2014)Linear-Time Generation of Random Chordal Graphs., , , and . CIAC, volume 10236 of Lecture Notes in Computer Science, page 442-453. (2017)Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem., , and . SEA, volume 265 of LIPIcs, page 13:1-13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Efficient recognition of equimatchable graphs., and . Inf. Process. Lett., 114 (1-2): 66-71 (2014)