default search action
Tínaz Ekim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j60]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): 57 (2024) - [i21]Tínaz Ekim, Mordechai Shalom, Mehmet Aziz Yirik:
Generation of weighted trees, block trees and block graphs. CoRR abs/2401.09764 (2024) - [i20]Tínaz Ekim, Burak Nur Erdem, John Gimbel:
Sparse Sets in Triangle-free Graphs. CoRR abs/2406.03290 (2024) - 2023
- [j59]Saieed Akbari, Tínaz Ekim, Amir Hossein Ghodrati, Sanaz Zare:
Well-indumatched trees and graphs of bounded girth. Australas. J Comb. 85: 61-81 (2023) - [j58]Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom
Defensive domination in proper interval graphs. Discret. Appl. Math. 331: 59-69 (2023) - [j57]Ali Erdem Banak, Tínaz Ekim, Z. Caner Taskin:
Constructing extremal triangle-free graphs using integer programming. Discret. Optim. 50: 100802 (2023) - [j56]Yunus Emre Demirci, Tínaz Ekim
Defective Ramsey Numbers and Defective Cocolorings in Some Subclasses of Perfect Graphs. Graphs Comb. 39(1): 18 (2023) - [c10]Ömer Burak Onar, Tínaz Ekim, Z. Caner Taskin:
Integer Programming Formulations and Cutting Plane Algorithms for the Maximum Selective Tree Problem. SEA 2023: 13:1-13:18 - [i19]Ali Erdem Banak, Tínaz Ekim, Z. Caner Taskin:
Constructing extremal triangle-free graphs using integer programming. CoRR abs/2304.01729 (2023) - 2022
- [j55]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): 565-582 (2022) - [j54]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: 20-29 (2022) - 2021
- [j53]Selim Bahadir
Well-totally-dominated graphs. Ars Math. Contemp. 20(1): 209-222 (2021) - [j52]Yunus Emre Demirci, Tínaz Ekim, John Gimbel, Mehmet Akif Yildiz
Exact values of defective Ramsey numbers in graph classes. Discret. Optim. 42: 100673 (2021) - [j51]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): 67-83 (2021) - [j50]Tínaz Ekim, Mordechai Shalom
The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation. J. Comb. Optim. 41(3): 710-735 (2021) - 2020
- [j49]Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski:
The complexity of the defensive domination problem in special graph classes. Discret. Math. 343(2): 111665 (2020) - [j48]Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic
Mind the independence gap. Discret. Math. 343(9): 111943 (2020) - [c9]Tínaz Ekim:
The Nobel Prize in Economic Sciences 2012 and Matching Theory. ICORES 2020: 5-16 - [i18]Arman Boyaci, Tínaz Ekim, Mordechai Shalom:
On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes. CoRR abs/2006.03856 (2020) - [i17]Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom:
Defensive Domination in Proper Interval Graphs. CoRR abs/2010.03865 (2020)
2010 – 2019
- 2019
- [j47]Zakir Deniz
Edge-stable equimatchable graphs. Discret. Appl. Math. 261: 136-147 (2019) - [j46]Tínaz Ekim, John Gimbel, Oylum Seker:
Small 1-defective Ramsey numbers in perfect graphs. Discret. Optim. 34 (2019) - [j45]Oylum Seker
A decomposition approach to solve the selective graph coloring problem in some perfect graph families. Networks 73(2): 145-169 (2019) - [c8]Tínaz Ekim
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation. SEA² 2019: 21-34 - [i16]Saieed Akbari, Tínaz Ekim, Amir Hossein Ghodrati, Sanaz Zare:
Well-indumatched Trees and Graphs of Bounded Girth. CoRR abs/1903.03197 (2019) - [i15]Tínaz Ekim, Mordechai Shalom, Oylum Seker:
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation. CoRR abs/1904.04916 (2019) - 2018
- [j44]Saieed Akbari
Equimatchable claw-free graphs. Discret. Math. 341(10): 2859-2871 (2018) - [j43]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) - [j42]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) - [j41]Betül Ahat
Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem. INFORMS J. Comput. 30(1): 43-56 (2018) - [j40]Arman Boyaci, Tínaz Ekim
The maximum cardinality cut problem in co-bipartite chain graphs. J. Comb. Optim. 35(1): 250-265 (2018) - [i14]Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin:
Generation of random chordal graphs using subtrees of a tree. CoRR abs/1810.13326 (2018) - [i13]Oylum Seker, Tínaz Ekim, Z. Caner Taskin:
An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs. CoRR abs/1811.12094 (2018) - [i12]Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
Mind the Independence Gap. CoRR abs/1812.05316 (2018) - 2017
- [j39]Zakir Deniz
On two extensions of equimatchable graphs. Discret. Optim. 26: 112-130 (2017) - [j38]Cemil Dibek
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded. Discret. Math. 340(5): 927-934 (2017) - [j37]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) - [j36]Paniz Abedin, Saieed Akbari
Complexity of the Improper Twin Edge Coloring of Graphs. Graphs Comb. 33(4): 595-615 (2017) - [j35]Arman Boyaci, Tínaz Ekim
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs. Inf. Process. Lett. 121: 29-33 (2017) - [j34]Nina Chiarelli, Cemil Dibek
On matching extendability of lexicographic products. RAIRO Oper. Res. 51(3): 857-873 (2017) - [c7]Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin:
Linear-Time Generation of Random Chordal Graphs. CIAC 2017: 442-453 - [i11]Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
Almost Well-Covered Graphs Without Short Cycles. CoRR abs/1708.04632 (2017) - 2016
- [j33]Marc Demange, Tínaz Ekim
On the minimum and maximum selective graph coloring problems in some graph classes. Discret. Appl. Math. 204: 77-89 (2016) - [j32]Arman Boyaci, Tínaz Ekim
Graphs of edge-intersecting non-splitting paths in a tree: Representations of holes - Part I. Discret. Appl. Math. 215: 47-60 (2016) - [j31]Cemil Dibek
Equimatchable graphs are C2k+1-free for k≥4. Discret. Math. 339(12): 2964-2969 (2016) - [j30]Zakir Deniz
On Three Extensions of Equimatchable Graphs. Electron. Notes Discret. Math. 55: 177-180 (2016) - [j29]Arman Boyaci, Tínaz Ekim
Graphs of edge-intersecting and non-splitting paths. Theor. Comput. Sci. 629: 40-50 (2016) - [i10]Paniz Abedin, Saieed Akbari, Mahsa Daneshmand, Marc Demange, Tínaz Ekim:
Improper Twin Edge Coloring of Graphs. CoRR abs/1601.02267 (2016) - [i9]Zakir Deniz, Tínaz Ekim:
Stable Equimatchable Graphs. CoRR abs/1602.09127 (2016) - [i8]Saieed Akbari, Hadi Alizadeh, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable Claw-Free Graphs. CoRR abs/1607.00476 (2016) - 2015
- [j28]Ahu Akdemir, Tínaz Ekim
Advances on defective parameters in graphs. Discret. Optim. 16: 62-69 (2015) - [j27]Marc Demange, Tínaz Ekim
On some applications of the selective graph coloring problem. Eur. J. Oper. Res. 240(2): 307-314 (2015) - [i7]Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable Graphs are C_2k+1-free for k ≥ 4. CTW 2015: 125-128 - [i6]Marc Demange, Tínaz Ekim, Bernard Ries:
On the Minimum and Maximum Selective Graph Coloring Problems. CTW 2015: 189-192 - [i5]Arman Boyaci, Tínaz Ekim, Mordechai Shalom:
The Maximum Cut Problem in Co-bipartite Chain Graphs. CoRR abs/1504.03666 (2015) - [i4]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid. CoRR abs/1512.06440 (2015) - [i3]Arman Boyaci, Tínaz Ekim, Mordechai Shalom:
The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs. CoRR abs/1512.06893 (2015) - 2014
- [j26]Tínaz Ekim
Corrigendum to "Polar cographs" [Discrete Appl. Math. 156(2008) 1652-1660]. Discret. Appl. Math. 171: 158 (2014) - [j25]Marc Demange, Tínaz Ekim
Hardness and approximation of minimum maximal matchings. Int. J. Comput. Math. 91(8): 1635-1654 (2014) - [j24]Marc Demange, Tínaz Ekim
Efficient recognition of equimatchable graphs. Inf. Process. Lett. 114(1-2): 66-71 (2014) - [j23]Tínaz Ekim
Block decomposition approach to compute a minimum geodetic set. RAIRO Oper. Res. 48(4): 497-507 (2014) - [c6]Arman Boyaci, Tínaz Ekim, Mordechai Shalom, Shmuel Zaks:
Graphs of edge-intersecting and non-splitting paths. ICTCS 2014: 45-58 - 2013
- [j22]Flavia Bonomo, Denis Cornaz, Tínaz Ekim
Perfectness of clustered graphs. Discret. Optim. 10(4): 296-303 (2013) - [j21]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): 233-242 (2013) - [j20]Tínaz Ekim
Polar permutation graphs are polynomial-time recognisable. Eur. J. Comb. 34(3): 576-592 (2013) - [j19]Tínaz Ekim
Some Defective Parameters in Graphs. Graphs Comb. 29(2): 213-224 (2013) - [j18]Merve Bodur
Decomposition algorithms for solving the minimum weight maximal matching problem. Networks 62(4): 273-287 (2013) - [c5]Arman Boyaci, Tínaz Ekim, Mordechai Shalom
Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract). WG 2013: 115-126 - [i2]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 abs/1309.2898 (2013) - [i1]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 abs/1309.6471 (2013) - 2012
- [j17]Z. Caner Taskin
Integer programming formulations for the minimum weighted maximal matching problem. Optim. Lett. 6(6): 1161-1171 (2012) - [c4]R. Mert Yüzsever, Tínaz Ekim, Necati Aras:
A Branch-and-Price Algorithm for Split-Coloring Problem. CTW 2012: 249-253 - [c3]Tínaz Ekim, Aysel Erey, Pinar Heggernes
Computing Minimum Geodetic Sets of Proper Interval Graphs. LATIN 2012: 279-290 - 2010
- [j16]Tínaz Ekim
Recognizing line-polar bipartite graphs in time O(n). Discret. Appl. Math. 158(15): 1593-1598 (2010) - [j15]Tínaz Ekim, Bernard Ries
Split-critical and uniquely split-colorable graphs. Discret. Math. Theor. Comput. Sci. 12(5): 1-24 (2010) - [e1]Boaz Patt-Shamir, Tínaz Ekim:
Structural Information and Communication Complexity, 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010. Proceedings. Lecture Notes in Computer Science 6058, Springer 2010, ISBN 978-3-642-13283-4 [contents]
2000 – 2009
- 2009
- [j14]Tínaz Ekim
Partitioning graphs into complete and empty graphs. Discret. Math. 309(19): 5849-5856 (2009) - [j13]Marc Demange, Tínaz Ekim
A tutorial on the use of graph coloring for some problems in robotics. Eur. J. Oper. Res. 192(1): 41-55 (2009) - [c2]Tínaz Ekim, Pinar Heggernes
Polar Permutation Graphs. IWOCA 2009: 218-229 - 2008
- [j12]Tínaz Ekim
Polar cographs. Discret. Appl. Math. 156(10): 1652-1660 (2008) - [j11]Tínaz Ekim
Polarity of chordal graphs. Discret. Appl. Math. 156(13): 2469-2479 (2008) - [j10]A. Geinoz, Tínaz Ekim
Construction of balanced sports schedules using partitions into subleagues. Oper. Res. Lett. 36(3): 279-282 (2008) - [c1]Marc Demange, Tínaz Ekim:
Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs. TAMC 2008: 364-374 - 2007
- [j9]Tínaz Ekim, Nadimpalli V. R. Mahadev, Dominique de Werra:
Polar cographs. Electron. Notes Discret. Math. 28: 317-323 (2007) - 2006
- [j8]Dominique de Werra, Tínaz Ekim
Construction of sports schedules with multiple venues. Discret. Appl. Math. 154(1): 47-58 (2006) - [j7]Tínaz Ekim
Erratum. J. Comb. Optim. 11(1): 125 (2006) - [j6]Marc Demange, Tínaz Ekim, Dominique de Werra:
On the approximation of Min Split-coloring and Min Cocoloring. J. Graph Algorithms Appl. 10(2): 297-315 (2006) - 2005
- [j5]Marc Demange, Tínaz Ekim, Dominique de Werra:
Partitioning cographs into cliques and stable sets. Discret. Optim. 2(2): 145-153 (2005) - [j4]Marc Demange, Tínaz Ekim, Dominique de Werra:
(p, k)-coloring problems in line graphs. Electron. Notes Discret. Math. 19: 49-55 (2005) - [j3]Tínaz Ekim
On Split-Coloring Problems. J. Comb. Optim. 10(3): 211-225 (2005) - [j2]Marc Demange, Tínaz Ekim
(p, k)-coloring problems in line graphs. Theor. Comput. Sci. 349(3): 462-474 (2005) - 2004
- [j1]Tínaz Ekim
Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximation. Int. J. Comput. Math. 81(5): 569-582 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: