BibTeX records: Tinaz Ekim

download as .bib file

@article{DBLP:journals/dm/AkbariAEGS18,
  author    = {Saieed Akbari and
               Hadi Alizadeh and
               Tinaz Ekim and
               Didem G{\"{o}}z{\"{u}}pek and
               Mordechai Shalom},
  title     = {Equimatchable claw-free graphs},
  journal   = {Discrete Mathematics},
  volume    = {341},
  number    = {10},
  pages     = {2859--2871},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.disc.2018.06.043},
  doi       = {10.1016/j.disc.2018.06.043},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/dm/AkbariAEGS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BoyaciESZ18,
  author    = {Arman Boyaci and
               Tinaz Ekim and
               Mordechai Shalom and
               Shmuel Zaks},
  title     = {Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations
               of Holes-Part {II}},
  journal   = {Discrete Mathematics {\&} Theoretical Computer Science},
  volume    = {20},
  number    = {1},
  year      = {2018},
  url       = {http://dmtcs.episciences.org/4197},
  timestamp = {Tue, 23 Jan 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/dmtcs/BoyaciESZ18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/EkimGHM18,
  author    = {Tinaz Ekim and
               Didem G{\"{o}}z{\"{u}}pek and
               Ademir Hujdurovic and
               Martin Milanic},
  title     = {On Almost Well-Covered Graphs of Girth at Least 6},
  journal   = {Discrete Mathematics {\&} Theoretical Computer Science},
  volume    = {20},
  number    = {2},
  year      = {2018},
  url       = {http://dmtcs.episciences.org/4982},
  timestamp = {Thu, 03 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/dmtcs/EkimGHM18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/AhatET18,
  author    = {Bet{\"{u}}l Ahat and
               Tinaz Ekim and
               Z. Caner Taskin},
  title     = {Integer Programming Formulations and Benders Decomposition for the
               Maximum Induced Matching Problem},
  journal   = {{INFORMS} Journal on Computing},
  volume    = {30},
  number    = {1},
  pages     = {43--56},
  year      = {2018},
  url       = {https://doi.org/10.1287/ijoc.2017.0764},
  doi       = {10.1287/ijoc.2017.0764},
  timestamp = {Tue, 28 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/informs/AhatET18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BoyaciES18,
  author    = {Arman Boyaci and
               Tinaz Ekim and
               Mordechai Shalom},
  title     = {The maximum cardinality cut problem in co-bipartite chain graphs},
  journal   = {J. Comb. Optim.},
  volume    = {35},
  number    = {1},
  pages     = {250--265},
  year      = {2018},
  url       = {https://doi.org/10.1007/s10878-015-9963-x},
  doi       = {10.1007/s10878-015-9963-x},
  timestamp = {Thu, 11 Jan 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/jco/BoyaciES18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-13326,
  author    = {Oylum Seker and
               Pinar Heggernes and
               Tinaz Ekim and
               Z. Caner Taskin},
  title     = {Generation of random chordal graphs using subtrees of a tree},
  journal   = {CoRR},
  volume    = {abs/1810.13326},
  year      = {2018},
  url       = {http://arxiv.org/abs/1810.13326},
  archivePrefix = {arXiv},
  eprint    = {1810.13326},
  timestamp = {Thu, 08 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1810-13326},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-12094,
  author    = {Oylum Seker and
               Tinaz Ekim and
               Z. Caner Taskin},
  title     = {An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring
               Problem in Perfect Graphs},
  journal   = {CoRR},
  volume    = {abs/1811.12094},
  year      = {2018},
  url       = {http://arxiv.org/abs/1811.12094},
  archivePrefix = {arXiv},
  eprint    = {1811.12094},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1811-12094},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-05316,
  author    = {Tinaz Ekim and
               Didem G{\"{o}}z{\"{u}}pek and
               Ademir Hujdurovic and
               Martin Milanic},
  title     = {Mind the Independence Gap},
  journal   = {CoRR},
  volume    = {abs/1812.05316},
  year      = {2018},
  url       = {http://arxiv.org/abs/1812.05316},
  archivePrefix = {arXiv},
  eprint    = {1812.05316},
  timestamp = {Thu, 03 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1812-05316},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/DenizEHMS17,
  author    = {Zakir Deniz and
               Tinaz Ekim and
               Tatiana Romina Hartinger and
               Martin Milanic and
               Mordechai Shalom},
  title     = {On two extensions of equimatchable graphs},
  journal   = {Discrete Optimization},
  volume    = {26},
  pages     = {112--130},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.disopt.2017.08.002},
  doi       = {10.1016/j.disopt.2017.08.002},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/disopt/DenizEHMS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DibekEH17,
  author    = {Cemil Dibek and
               Tinaz Ekim and
               Pinar Heggernes},
  title     = {Maximum number of edges in claw-free graphs whose maximum degree and
               matching number are bounded},
  journal   = {Discrete Mathematics},
  volume    = {340},
  number    = {5},
  pages     = {927--934},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.disc.2017.01.010},
  doi       = {10.1016/j.disc.2017.01.010},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/DibekEH17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BoyaciESZ17,
  author    = {Arman Boyaci and
               Tinaz Ekim and
               Mordechai Shalom and
               Shmuel Zaks},
  title     = {Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a
               Grid},
  journal   = {Discrete Mathematics {\&} Theoretical Computer Science},
  volume    = {19},
  number    = {1},
  year      = {2017},
  url       = {http://dmtcs.episciences.org/3708},
  timestamp = {Tue, 27 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dmtcs/BoyaciESZ17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AbedinADE17,
  author    = {Paniz Abedin and
               Saieed Akbari and
               Marc Demange and
               Tinaz Ekim},
  title     = {Complexity of the Improper Twin Edge Coloring of Graphs},
  journal   = {Graphs and Combinatorics},
  volume    = {33},
  number    = {4},
  pages     = {595--615},
  year      = {2017},
  url       = {https://doi.org/10.1007/s00373-017-1782-7},
  doi       = {10.1007/s00373-017-1782-7},
  timestamp = {Tue, 27 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/gc/AbedinADE17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BoyaciES17,
  author    = {Arman Boyaci and
               Tinaz Ekim and
               Mordechai Shalom},
  title     = {A polynomial-time algorithm for the maximum cardinality cut problem
               in proper interval graphs},
  journal   = {Inf. Process. Lett.},
  volume    = {121},
  pages     = {29--33},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.ipl.2017.01.007},
  doi       = {10.1016/j.ipl.2017.01.007},
  timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/BoyaciES17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/ChiarelliDEGM17,
  author    = {Nina Chiarelli and
               Cemil Dibek and
               Tinaz Ekim and
               Didem G{\"{o}}z{\"{u}}pek and
               Stefko Miklavic},
  title     = {On matching extendability of lexicographic products},
  journal   = {{RAIRO} - Operations Research},
  volume    = {51},
  number    = {3},
  pages     = {857--873},
  year      = {2017},
  url       = {https://doi.org/10.1051/ro/2016072},
  doi       = {10.1051/ro/2016072},
  timestamp = {Thu, 26 Oct 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/rairo/ChiarelliDEGM17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/SekerHET17,
  author    = {Oylum Seker and
               Pinar Heggernes and
               Tinaz Ekim and
               Z. Caner Taskin},
  title     = {Linear-Time Generation of Random Chordal Graphs},
  booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
               2017, Athens, Greece, May 24-26, 2017, Proceedings},
  pages     = {442--453},
  year      = {2017},
  crossref  = {DBLP:conf/ciac/2017},
  url       = {https://doi.org/10.1007/978-3-319-57586-5\_37},
  doi       = {10.1007/978-3-319-57586-5\_37},
  timestamp = {Wed, 10 May 2017 15:25:26 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/ciac/SekerHET17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-04632,
  author    = {Tinaz Ekim and
               Didem G{\"{o}}z{\"{u}}pek and
               Ademir Hujdurovic and
               Martin Milanic},
  title     = {Almost Well-Covered Graphs Without Short Cycles},
  journal   = {CoRR},
  volume    = {abs/1708.04632},
  year      = {2017},
  url       = {http://arxiv.org/abs/1708.04632},
  archivePrefix = {arXiv},
  eprint    = {1708.04632},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1708-04632},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DemangeER16,
  author    = {Marc Demange and
               Tinaz Ekim and
               Bernard Ries},
  title     = {On the minimum and maximum selective graph coloring problems in some
               graph classes},
  journal   = {Discrete Applied Mathematics},
  volume    = {204},
  pages     = {77--89},
  year      = {2016},
  url       = {https://doi.org/10.1016/j.dam.2015.10.005},
  doi       = {10.1016/j.dam.2015.10.005},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/dam/DemangeER16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BoyaciESZ16,
  author    = {Arman Boyaci and
               Tinaz Ekim and
               Mordechai Shalom and
               Shmuel Zaks},
  title     = {Graphs of edge-intersecting non-splitting paths in a tree: Representations
               of holes - Part {I}},
  journal   = {Discrete Applied Mathematics},
  volume    = {215},
  pages     = {47--60},
  year      = {2016},
  url       = {https://doi.org/10.1016/j.dam.2015.07.024},
  doi       = {10.1016/j.dam.2015.07.024},
  timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/BoyaciESZ16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DibekEGS16,
  author    = {Cemil Dibek and
               Tinaz Ekim and
               Didem G{\"{o}}z{\"{u}}pek and
               Mordechai Shalom},
  title     = {Equimatchable graphs are C\({}_{\mbox{2k+1}}\)-free for k{\(\geq\)}4},
  journal   = {Discrete Mathematics},
  volume    = {339},
  number    = {12},
  pages     = {2964--2969},
  year      = {2016},
  url       = {https://doi.org/10.1016/j.disc.2016.06.003},
  doi       = {10.1016/j.disc.2016.06.003},
  timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/DibekEGS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DenizEHMS16,
  author    = {Zakir Deniz and
               Tinaz Ekim and
               Tatiana Romina Hartinger and
               Martin Milanic and
               Mordechai Shalom},
  title     = {On Three Extensions of Equimatchable Graphs},
  journal   = {Electronic Notes in Discrete Mathematics},
  volume    = {55},
  pages     = {177--180},
  year      = {2016},
  url       = {https://doi.org/10.1016/j.endm.2016.10.044},
  doi       = {10.1016/j.endm.2016.10.044},
  timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/endm/DenizEHMS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyaciESZ16,
  author    = {Arman Boyaci and
               Tinaz Ekim and
               Mordechai Shalom and
               Shmuel Zaks},
  title     = {Graphs of edge-intersecting and non-splitting paths},
  journal   = {Theor. Comput. Sci.},
  volume    = {629},
  pages     = {40--50},
  year      = {2016},
  url       = {https://doi.org/10.1016/j.tcs.2015.10.004},
  doi       = {10.1016/j.tcs.2015.10.004},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/BoyaciESZ16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbedinADDE16,
  author    = {Paniz Abedin and
               Saieed Akbari and
               Mahsa Daneshmand and
               Marc Demange and
               Tinaz Ekim},
  title     = {Improper Twin Edge Coloring of Graphs},
  journal   = {CoRR},
  volume    = {abs/1601.02267},
  year      = {2016},
  url       = {http://arxiv.org/abs/1601.02267},
  archivePrefix = {arXiv},
  eprint    = {1601.02267},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/AbedinADDE16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DenizE16,
  author    = {Zakir Deniz and
               Tinaz Ekim},
  title     = {Stable Equimatchable Graphs},
  journal   = {CoRR},
  volume    = {abs/1602.09127},
  year      = {2016},
  url       = {http://arxiv.org/abs/1602.09127},
  archivePrefix = {arXiv},
  eprint    = {1602.09127},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/DenizE16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AkbariAEGS16,
  author    = {Saieed Akbari and
               Hadi Alizadeh and
               Tinaz Ekim and
               Didem G{\"{o}}z{\"{u}}pek and
               Mordechai Shalom},
  title     = {Equimatchable Claw-Free Graphs},
  journal   = {CoRR},
  volume    = {abs/1607.00476},
  year      = {2016},
  url       = {http://arxiv.org/abs/1607.00476},
  archivePrefix = {arXiv},
  eprint    = {1607.00476},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/AkbariAEGS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/AkdemirE15,
  author    = {Ahu Akdemir and
               Tinaz Ekim},
  title     = {Advances on defective parameters in graphs},
  journal   = {Discrete Optimization},
  volume    = {16},
  pages     = {62--69},
  year      = {2015},
  url       = {https://doi.org/10.1016/j.disopt.2015.01.002},
  doi       = {10.1016/j.disopt.2015.01.002},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/disopt/AkdemirE15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/DemangeERT15,
  author    = {Marc Demange and
               Tinaz Ekim and
               Bernard Ries and
               Cerasela Tanasescu},
  title     = {On some applications of the selective graph coloring problem},
  journal   = {European Journal of Operational Research},
  volume    = {240},
  number    = {2},
  pages     = {307--314},
  year      = {2015},
  url       = {https://doi.org/10.1016/j.ejor.2014.05.011},
  doi       = {10.1016/j.ejor.2014.05.011},
  timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eor/DemangeERT15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/DibekEGS15,
  author    = {Cemil Dibek and
               Tinaz Ekim and
               Didem G{\"{o}}z{\"{u}}pek and
               Mordechai Shalom},
  title     = {Equimatchable Graphs are C{\_}2k+1-free for k {\(\geq\)} 4},
  booktitle = {13th Cologne Twente Workshop on Graphs and Combinatorial Optimization,
               Istanbul, Turkey, May 26-28, 2015.},
  pages     = {125--128},
  year      = {2015},
  crossref  = {DBLP:conf/colognetwente/2015},
  timestamp = {Thu, 02 Feb 2017 18:00:28 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/colognetwente/DibekEGS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/DemangeER15,
  author    = {Marc Demange and
               Tinaz Ekim and
               Bernard Ries},
  title     = {On the Minimum and Maximum Selective Graph Coloring Problems},
  booktitle = {13th Cologne Twente Workshop on Graphs and Combinatorial Optimization,
               Istanbul, Turkey, May 26-28, 2015.},
  pages     = {189--192},
  year      = {2015},
  crossref  = {DBLP:conf/colognetwente/2015},
  timestamp = {Thu, 02 Feb 2017 18:00:28 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/colognetwente/DemangeER15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyaciES15,
  author    = {Arman Boyaci and
               Tinaz Ekim and
               Mordechai Shalom},
  title     = {The Maximum Cut Problem in Co-bipartite Chain Graphs},
  journal   = {CoRR},
  volume    = {abs/1504.03666},
  year      = {2015},
  url       = {http://arxiv.org/abs/1504.03666},
  archivePrefix = {arXiv},
  eprint    = {1504.03666},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BoyaciES15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyaciESZ15,
  author    = {Arman Boyaci and
               Tinaz Ekim and
               Mordechai Shalom and
               Shmuel Zaks},
  title     = {Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a
               Grid},
  journal   = {CoRR},
  volume    = {abs/1512.06440},
  year      = {2015},
  url       = {http://arxiv.org/abs/1512.06440},
  archivePrefix = {arXiv},
  eprint    = {1512.06440},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BoyaciESZ15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyaciES15a,
  author    = {Arman Boyaci and
               Tinaz Ekim and
               Mordechai Shalom},
  title     = {The Maximum Cardinality Cut Problem is Polynomial in Proper Interval
               Graphs},
  journal   = {CoRR},
  volume    = {abs/1512.06893},
  year      = {2015},
  url       = {http://arxiv.org/abs/1512.06893},
  archivePrefix = {arXiv},
  eprint    = {1512.06893},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BoyaciES15a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EkimMW14,
  author    = {Tinaz Ekim and
               Nadimpalli V. R. Mahadev and
               Dominique de Werra},
  title     = {Corrigendum to "Polar cographs" [Discrete Appl. Math. 156(2008)
               1652-1660]},
  journal   = {Discrete Applied Mathematics},
  volume    = {171},
  pages     = {158},
  year      = {2014},
  url       = {https://doi.org/10.1016/j.dam.2014.01.020},
  doi       = {10.1016/j.dam.2014.01.020},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/EkimMW14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/DemangeET14,
  author    = {Marc Demange and
               Tinaz Ekim and
               Cerasela Tanasescu},
  title     = {Hardness and approximation of minimum maximal matchings},
  journal   = {Int. J. Comput. Math.},
  volume    = {91},
  number    = {8},
  pages     = {1635--1654},
  year      = {2014},
  url       = {https://doi.org/10.1080/00207160.2013.853052},
  doi       = {10.1080/00207160.2013.853052},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijcm/DemangeET14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DemangeE14,
  author    = {Marc Demange and
               Tinaz Ekim},
  title     = {Efficient recognition of equimatchable graphs},
  journal   = {Inf. Process. Lett.},
  volume    = {114},
  number    = {1-2},
  pages     = {66--71},
  year      = {2014},
  url       = {https://doi.org/10.1016/j.ipl.2013.08.002},
  doi       = {10.1016/j.ipl.2013.08.002},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/DemangeE14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/EkimE14,
  author    = {Tinaz Ekim and
               Aysel Erey},
  title     = {Block decomposition approach to compute a minimum geodetic set},
  journal   = {{RAIRO} - Operations Research},
  volume    = {48},
  number    = {4},
  pages     = {497--507},
  year      = {2014},
  url       = {https://doi.org/10.1051/ro/2014019},
  doi       = {10.1051/ro/2014019},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/rairo/EkimE14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/BoyaciESZ14,
  author    = {Arman Boyaci and
               Tinaz Ekim and
               Mordechai Shalom and
               Shmuel Zaks},
  title     = {Graphs of edge-intersecting and non-splitting paths},
  booktitle = {Proceedings of the 15th Italian Conference on Theoretical Computer
               Science, Perugia, Italy, September 17-19, 2014.},
  pages     = {45--58},
  year      = {2014},
  crossref  = {DBLP:conf/ictcs/2014},
  url       = {http://ceur-ws.org/Vol-1231/long3.pdf},
  timestamp = {Mon, 30 May 2016 16:28:38 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/ictcs/BoyaciESZ14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BonomoCER13,
  author    = {Flavia Bonomo and
               Denis Cornaz and
               Tinaz Ekim and
               Bernard Ries},
  title     = {Perfectness of clustered graphs},
  journal   = {Discrete Optimization},
  volume    = {10},
  number    = {4},
  pages     = {296--303},
  year      = {2013},
  url       = {https://doi.org/10.1016/j.disopt.2013.07.006},
  doi       = {10.1016/j.disopt.2013.07.006},
  timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/disopt/BonomoCER13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/EkimD13,
  author    = {Marc Demange and
               Tinaz Ekim},
  title     = {A note on the NP-hardness of two matching problems in induced subgrids},
  journal   = {Discrete Mathematics {\&} Theoretical Computer Science},
  volume    = {15},
  number    = {2},
  pages     = {233--242},
  year      = {2013},
  url       = {http://dmtcs.episciences.org/606},
  timestamp = {Mon, 02 Oct 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dmtcs/EkimD13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/EkimHM13,
  author    = {Tinaz Ekim and
               Pinar Heggernes and
               Daniel Meister},
  title     = {Polar permutation graphs are polynomial-time recognisable},
  journal   = {Eur. J. Comb.},
  volume    = {34},
  number    = {3},
  pages     = {576--592},
  year      = {2013},
  url       = {https://doi.org/10.1016/j.ejc.2011.12.007},
  doi       = {10.1016/j.ejc.2011.12.007},
  timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ejc/EkimHM13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/EkimG13,
  author    = {Tinaz Ekim and
               John Gimbel},
  title     = {Some Defective Parameters in Graphs},
  journal   = {Graphs and Combinatorics},
  volume    = {29},
  number    = {2},
  pages     = {213--224},
  year      = {2013},
  url       = {https://doi.org/10.1007/s00373-011-1111-5},
  doi       = {10.1007/s00373-011-1111-5},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/gc/EkimG13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BodurET13,
  author    = {Merve Bodur and
               Tinaz Ekim and
               Z. Caner Taskin},
  title     = {Decomposition algorithms for solving the minimum weight maximal matching
               problem},
  journal   = {Networks},
  volume    = {62},
  number    = {4},
  pages     = {273--287},
  year      = {2013},
  url       = {https://doi.org/10.1002/net.21516},
  doi       = {10.1002/net.21516},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/networks/BodurET13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BoyaciESZ13,
  author    = {Arman Boyaci and
               Tinaz Ekim and
               Mordechai Shalom and
               Shmuel Zaks},
  title     = {Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards
               Hole Representations - (Extended Abstract)},
  booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International
               Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
               Revised Papers},
  pages     = {115--126},
  year      = {2013},
  crossref  = {DBLP:conf/wg/2013},
  url       = {https://doi.org/10.1007/978-3-642-45043-3\_11},
  doi       = {10.1007/978-3-642-45043-3\_11},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wg/BoyaciESZ13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyaciESZ13,
  author    = {Arman Boyaci and
               Tinaz Ekim and
               Mordechai Shalom and
               Shmuel Zaks},
  title     = {Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards
               Hole Representations-Part {I}},
  journal   = {CoRR},
  volume    = {abs/1309.2898},
  year      = {2013},
  url       = {http://arxiv.org/abs/1309.2898},
  archivePrefix = {arXiv},
  eprint    = {1309.2898},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BoyaciESZ13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyaciESZ13a,
  author    = {Arman Boyaci and
               Tinaz Ekim and
               Mordechai Shalom and
               Shmuel Zaks},
  title     = {Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations
               of Holes-Part {II}},
  journal   = {CoRR},
  volume    = {abs/1309.6471},
  year      = {2013},
  url       = {http://arxiv.org/abs/1309.6471},
  archivePrefix = {arXiv},
  eprint    = {1309.6471},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BoyaciESZ13a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/TaskinE12,
  author    = {Z. Caner Taskin and
               Tinaz Ekim},
  title     = {Integer programming formulations for the minimum weighted maximal
               matching problem},
  journal   = {Optimization Letters},
  volume    = {6},
  number    = {6},
  pages     = {1161--1171},
  year      = {2012},
  url       = {https://doi.org/10.1007/s11590-011-0351-x},
  doi       = {10.1007/s11590-011-0351-x},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ol/TaskinE12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/YuzseverEA12,
  author    = {R. Mert Y{\"{u}}zsever and
               Tinaz Ekim and
               Necati Aras},
  title     = {A Branch-and-Price Algorithm for Split-Coloring Problem},
  booktitle = {11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
               Munich, Germany, May 29-31, 2012. Extended Abstracts.},
  pages     = {249--253},
  year      = {2012},
  crossref  = {DBLP:conf/colognetwente/2012},
  timestamp = {Thu, 16 May 2013 15:41:40 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/colognetwente/YuzseverEA12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/EkimEHHM12,
  author    = {Tinaz Ekim and
               Aysel Erey and
               Pinar Heggernes and
               Pim van 't Hof and
               Daniel Meister},
  title     = {Computing Minimum Geodetic Sets of Proper Interval Graphs},
  booktitle = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
               Arequipa, Peru, April 16-20, 2012. Proceedings},
  pages     = {279--290},
  year      = {2012},
  crossref  = {DBLP:conf/latin/2012},
  url       = {https://doi.org/10.1007/978-3-642-29344-3\_24},
  doi       = {10.1007/978-3-642-29344-3\_24},
  timestamp = {Sun, 04 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/latin/EkimEHHM12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EkimH10,
  author    = {Tinaz Ekim and
               Jing Huang},
  title     = {Recognizing line-polar bipartite graphs in time O(n)},
  journal   = {Discrete Applied Mathematics},
  volume    = {158},
  number    = {15},
  pages     = {1593--1598},
  year      = {2010},
  url       = {https://doi.org/10.1016/j.dam.2010.05.019},
  doi       = {10.1016/j.dam.2010.05.019},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/EkimH10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/EkimRW10,
  author    = {Tinaz Ekim and
               Bernard Ries and
               Dominique de Werra},
  title     = {Split-critical and uniquely split-colorable graphs},
  journal   = {Discrete Mathematics {\&} Theoretical Computer Science},
  volume    = {12},
  number    = {5},
  pages     = {1--24},
  year      = {2010},
  url       = {http://dmtcs.episciences.org/484},
  timestamp = {Thu, 11 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dmtcs/EkimRW10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sirocco/2010,
  editor    = {Boaz Patt{-}Shamir and
               Tinaz Ekim},
  title     = {Structural Information and Communication Complexity, 17th International
               Colloquium, {SIROCCO} 2010, Sirince, Turkey, June 7-11, 2010. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6058},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-13284-1},
  doi       = {10.1007/978-3-642-13284-1},
  isbn      = {978-3-642-13283-4},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/sirocco/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EkimG09,
  author    = {Tinaz Ekim and
               John Gimbel},
  title     = {Partitioning graphs into complete and empty graphs},
  journal   = {Discrete Mathematics},
  volume    = {309},
  number    = {19},
  pages     = {5849--5856},
  year      = {2009},
  url       = {https://doi.org/10.1016/j.disc.2008.06.027},
  doi       = {10.1016/j.disc.2008.06.027},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/EkimG09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/DemangeEW09,
  author    = {Marc Demange and
               Tinaz Ekim and
               Dominique de Werra},
  title     = {A tutorial on the use of graph coloring for some problems in robotics},
  journal   = {European Journal of Operational Research},
  volume    = {192},
  number    = {1},
  pages     = {41--55},
  year      = {2009},
  url       = {https://doi.org/10.1016/j.ejor.2007.09.018},
  doi       = {10.1016/j.ejor.2007.09.018},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eor/DemangeEW09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/EkimHM09,
  author    = {Tinaz Ekim and
               Pinar Heggernes and
               Daniel Meister},
  title     = {Polar Permutation Graphs},
  booktitle = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009,
               Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009,
               Revised Selected Papers},
  pages     = {218--229},
  year      = {2009},
  crossref  = {DBLP:conf/iwoca/2009},
  url       = {https://doi.org/10.1007/978-3-642-10217-2\_23},
  doi       = {10.1007/978-3-642-10217-2\_23},
  timestamp = {Sun, 04 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/iwoca/EkimHM09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EkimMW08,
  author    = {Tinaz Ekim and
               Nadimpalli V. R. Mahadev and
               Dominique de Werra},
  title     = {Polar cographs},
  journal   = {Discrete Applied Mathematics},
  volume    = {156},
  number    = {10},
  pages     = {1652--1660},
  year      = {2008},
  url       = {https://doi.org/10.1016/j.dam.2007.08.025},
  doi       = {10.1016/j.dam.2007.08.025},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/EkimMW08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EkimHSW08,
  author    = {Tinaz Ekim and
               Pavol Hell and
               Juraj Stacho and
               Dominique de Werra},
  title     = {Polarity of chordal graphs},
  journal   = {Discrete Applied Mathematics},
  volume    = {156},
  number    = {13},
  pages     = {2469--2479},
  year      = {2008},
  url       = {https://doi.org/10.1016/j.dam.2008.01.026},
  doi       = {10.1016/j.dam.2008.01.026},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/EkimHSW08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GeinozEW08,
  author    = {A. Geinoz and
               Tinaz Ekim and
               Dominique de Werra},
  title     = {Construction of balanced sports schedules using partitions into subleagues},
  journal   = {Oper. Res. Lett.},
  volume    = {36},
  number    = {3},
  pages     = {279--282},
  year      = {2008},
  url       = {https://doi.org/10.1016/j.orl.2007.09.007},
  doi       = {10.1016/j.orl.2007.09.007},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/orl/GeinozEW08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/DemangeE08,
  author    = {Marc Demange and
               Tinaz Ekim},
  title     = {Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs},
  booktitle = {Theory and Applications of Models of Computation, 5th International
               Conference, {TAMC} 2008, Xi'an, China, April 25-29, 2008. Proceedings},
  pages     = {364--374},
  year      = {2008},
  crossref  = {DBLP:conf/tamc/2008},
  url       = {https://doi.org/10.1007/978-3-540-79228-4\_32},
  doi       = {10.1007/978-3-540-79228-4\_32},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tamc/DemangeE08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/EkimMW07,
  author    = {Tinaz Ekim and
               Nadimpalli V. R. Mahadev and
               Dominique de Werra},
  title     = {Polar cographs},
  journal   = {Electronic Notes in Discrete Mathematics},
  volume    = {28},
  pages     = {317--323},
  year      = {2007},
  url       = {https://doi.org/10.1016/j.endm.2007.01.045},
  doi       = {10.1016/j.endm.2007.01.045},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/endm/EkimMW07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WerraER06,
  author    = {Dominique de Werra and
               Tinaz Ekim and
               C. Raess},
  title     = {Construction of sports schedules with multiple venues},
  journal   = {Discrete Applied Mathematics},
  volume    = {154},
  number    = {1},
  pages     = {47--58},
  year      = {2006},
  url       = {https://doi.org/10.1016/j.dam.2005.03.011},
  doi       = {10.1016/j.dam.2005.03.011},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/WerraER06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/EkimW06,
  author    = {Tinaz Ekim and
               Dominique de Werra},
  title     = {Erratum},
  journal   = {J. Comb. Optim.},
  volume    = {11},
  number    = {1},
  pages     = {125},
  year      = {2006},
  url       = {https://doi.org/10.1007/s10878-006-6267-1},
  doi       = {10.1007/s10878-006-6267-1},
  timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jco/EkimW06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/DemangeEW06,
  author    = {Marc Demange and
               Tinaz Ekim and
               Dominique de Werra},
  title     = {On the approximation of Min Split-coloring and Min Cocoloring},
  journal   = {J. Graph Algorithms Appl.},
  volume    = {10},
  number    = {2},
  pages     = {297--315},
  year      = {2006},
  url       = {http://jgaa.info/accepted/2006/DemangeEkimWerra2006.10.2.pdf},
  timestamp = {Mon, 24 Nov 2008 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/jgaa/DemangeEW06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/DemangeEW05,
  author    = {Marc Demange and
               Tinaz Ekim and
               Dominique de Werra},
  title     = {Partitioning cographs into cliques and stable sets},
  journal   = {Discrete Optimization},
  volume    = {2},
  number    = {2},
  pages     = {145--153},
  year      = {2005},
  url       = {https://doi.org/10.1016/j.disopt.2005.03.003},
  doi       = {10.1016/j.disopt.2005.03.003},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/disopt/DemangeEW05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DemangeEW05,
  author    = {Marc Demange and
               Tinaz Ekim and
               Dominique de Werra},
  title     = {(p, k)-coloring problems in line graphs},
  journal   = {Electronic Notes in Discrete Mathematics},
  volume    = {19},
  pages     = {49--55},
  year      = {2005},
  url       = {https://doi.org/10.1016/j.endm.2005.05.008},
  doi       = {10.1016/j.endm.2005.05.008},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/endm/DemangeEW05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/EkimW05,
  author    = {Tinaz Ekim and
               Dominique de Werra},
  title     = {On Split-Coloring Problems},
  journal   = {J. Comb. Optim.},
  volume    = {10},
  number    = {3},
  pages     = {211--225},
  year      = {2005},
  url       = {https://doi.org/10.1007/s10878-005-4103-7},
  doi       = {10.1007/s10878-005-4103-7},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jco/EkimW05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DemangeEW05,
  author    = {Marc Demange and
               Tinaz Ekim and
               Dominique de Werra},
  title     = {(\emph{p}, \emph{k})-coloring problems in line graphs},
  journal   = {Theor. Comput. Sci.},
  volume    = {349},
  number    = {3},
  pages     = {462--474},
  year      = {2005},
  url       = {https://doi.org/10.1016/j.tcs.2005.09.037},
  doi       = {10.1016/j.tcs.2005.09.037},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/DemangeEW05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/EkimP04,
  author    = {Tinaz Ekim and
               Vangelis Th. Paschos},
  title     = {Approximation preserving reductions for set covering, vertex covering
               and independent set hierarchies under differential approximation},
  journal   = {Int. J. Comput. Math.},
  volume    = {81},
  number    = {5},
  pages     = {569--582},
  year      = {2004},
  url       = {https://doi.org/10.1080/00207160410001688592},
  doi       = {10.1080/00207160410001688592},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijcm/EkimP04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2017,
  editor    = {Dimitris Fotakis and
               Aris Pagourtzis and
               Vangelis Th. Paschos},
  title     = {Algorithms and Complexity - 10th International Conference, {CIAC}
               2017, Athens, Greece, May 24-26, 2017, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10236},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-57586-5},
  doi       = {10.1007/978-3-319-57586-5},
  isbn      = {978-3-319-57585-8},
  timestamp = {Wed, 10 May 2017 15:25:26 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/ciac/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/colognetwente/2015,
  editor    = {Ekrem Duman and
               Ali Fuat Alkaya},
  title     = {13th Cologne Twente Workshop on Graphs and Combinatorial Optimization,
               Istanbul, Turkey, May 26-28, 2015},
  year      = {2015},
  timestamp = {Thu, 02 Feb 2017 18:00:28 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/colognetwente/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ictcs/2014,
  editor    = {Stefano Bistarelli and
               Andrea Formisano},
  title     = {Proceedings of the 15th Italian Conference on Theoretical Computer
               Science, Perugia, Italy, September 17-19, 2014},
  series    = {{CEUR} Workshop Proceedings},
  volume    = {1231},
  publisher = {CEUR-WS.org},
  year      = {2014},
  url       = {http://ceur-ws.org/Vol-1231},
  urn       = {urn:nbn:de:0074-1231-0},
  timestamp = {Mon, 30 May 2016 16:28:38 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/ictcs/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2013,
  editor    = {Andreas Brandst{\"{a}}dt and
               Klaus Jansen and
               R{\"{u}}diger Reischuk},
  title     = {Graph-Theoretic Concepts in Computer Science - 39th International
               Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
               Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {8165},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-45043-3},
  doi       = {10.1007/978-3-642-45043-3},
  isbn      = {978-3-642-45042-6},
  timestamp = {Fri, 26 May 2017 00:48:29 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wg/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/colognetwente/2012,
  editor    = {Andreas Brieden and
               Zafer{-}Korcan G{\"{o}}rg{\"{u}}l{\"{u}} and
               Tino Krug and
               Erik Kropat and
               Silja Meyer{-}Nieberg and
               Goran Mihelcic and
               Stefan Wolfgang Pickl},
  title     = {11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
               Munich, Germany, May 29-31, 2012. Extended Abstracts},
  year      = {2012},
  isbn      = {978-3-943207-05-7},
  timestamp = {Thu, 16 May 2013 15:41:40 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/colognetwente/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/latin/2012,
  editor    = {David Fern{\'{a}}ndez{-}Baca},
  title     = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
               Arequipa, Peru, April 16-20, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7256},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-29344-3},
  doi       = {10.1007/978-3-642-29344-3},
  isbn      = {978-3-642-29343-6},
  timestamp = {Tue, 23 May 2017 01:11:27 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/latin/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwoca/2009,
  editor    = {Jir{\'{\i}} Fiala and
               Jan Kratochv{\'{\i}}l and
               Mirka Miller},
  title     = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009,
               Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009,
               Revised Selected Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {5874},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-10217-2},
  doi       = {10.1007/978-3-642-10217-2},
  isbn      = {978-3-642-10216-5},
  timestamp = {Wed, 17 May 2017 10:54:37 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/iwoca/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tamc/2008,
  editor    = {Manindra Agrawal and
               Ding{-}Zhu Du and
               Zhenhua Duan and
               Angsheng Li},
  title     = {Theory and Applications of Models of Computation, 5th International
               Conference, {TAMC} 2008, Xi'an, China, April 25-29, 2008. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4978},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-79228-4},
  doi       = {10.1007/978-3-540-79228-4},
  isbn      = {978-3-540-79227-7},
  timestamp = {Sun, 21 May 2017 00:19:54 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tamc/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI, founded at University of Trier