Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Sibel Özkan
@article{DBLP:journals/dmgt/BuyukcolakGO23,
author = {Yasemin B{\"{u}}y{\"{u}}k{\c{c}}olak and
Didem G{\"{o}}z{\"{u}}pek and
Sibel {\"{O}}zkan},
title = {Equimatchable bipartite graphs},
journal = {Discuss. Math. Graph Theory},
volume = {43},
number = {1},
pages = {77--94},
year = {2023},
url = {https://doi.org/10.7151/dmgt.2356},
doi = {10.7151/DMGT.2356},
timestamp = {Mon, 10 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BuyukcolakGO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/CaliskanMOS22,
author = {Cafer {\c{C}}aliskan and
Stefko Miklavic and
Sibel {\"{O}}zkan and
Primoz Sparl},
title = {Efficient domination in Cayley graphs of generalized dihedral groups},
journal = {Discuss. Math. Graph Theory},
volume = {42},
number = {3},
pages = {823--841},
year = {2022},
url = {https://doi.org/10.7151/dmgt.2309},
doi = {10.7151/DMGT.2309},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/CaliskanMOS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BuyukcolakOG22,
author = {Yasemin B{\"{u}}y{\"{u}}k{\c{c}}olak and
Sibel {\"{O}}zkan and
Didem G{\"{o}}z{\"{u}}pek},
title = {Triangle-free equimatchable graphs},
journal = {J. Graph Theory},
volume = {99},
number = {3},
pages = {461--484},
year = {2022},
url = {https://doi.org/10.1002/jgt.22750},
doi = {10.1002/JGT.22750},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BuyukcolakOG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/KucukcifciLOY19,
author = {Selda K{\"{u}}{\c{c}}{\"{u}}k{\c{c}}if{\c{c}}i and
Charles Curtis Lindner and
Sibel {\"{O}}zkan and
Emine Sule Yazici},
title = {Maximum packings of inside perfect 8-cycle systems},
journal = {Australas. {J} Comb.},
volume = {75},
pages = {146--157},
year = {2019},
url = {http://ajc.maths.uq.edu.au/pdf/75/ajc\_v75\_p146.pdf},
timestamp = {Tue, 23 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/KucukcifciLOY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BuyukcolakGOS19,
author = {Yasemin B{\"{u}}y{\"{u}}k{\c{c}}olak and
Didem G{\"{o}}z{\"{u}}pek and
Sibel {\"{O}}zkan and
Mordechai Shalom},
title = {On one extension of Dirac's theorem on Hamiltonicity},
journal = {Discret. Appl. Math.},
volume = {252},
pages = {10--16},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2017.01.011},
doi = {10.1016/J.DAM.2017.01.011},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BuyukcolakGOS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CaliskanMO19,
author = {Cafer {\c{C}}aliskan and
Stefko Miklavic and
Sibel {\"{O}}zkan},
title = {Domination and efficient domination in cubic and quartic Cayley graphs
on abelian groups},
journal = {Discret. Appl. Math.},
volume = {271},
pages = {15--24},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.08.004},
doi = {10.1016/J.DAM.2019.08.004},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CaliskanMO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BuyukcolakGO19,
author = {Yasemin B{\"{u}}y{\"{u}}k{\c{c}}olak and
Didem G{\"{o}}z{\"{u}}pek and
Sibel {\"{O}}zkan},
title = {Minimum reload cost cycle cover in complete graphs},
journal = {Networks},
volume = {74},
number = {3},
pages = {274--286},
year = {2019},
url = {https://doi.org/10.1002/net.21884},
doi = {10.1002/NET.21884},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BuyukcolakGO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/macis/BuyukcolakGO19,
author = {Yasemin B{\"{u}}y{\"{u}}k{\c{c}}olak and
Didem G{\"{o}}z{\"{u}}pek and
Sibel {\"{O}}zkan},
editor = {Daniel Slamanig and
Elias P. Tsigaridas and
Zafeirakis Zafeirakopoulos},
title = {Edge-Critical Equimatchable Bipartite Graphs},
booktitle = {Mathematical Aspects of Computer and Information Sciences - 8th International
Conference, {MACIS} 2019, Gebze, Turkey, November 13-15, 2019, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {11989},
pages = {280--287},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-43120-4\_21},
doi = {10.1007/978-3-030-43120-4\_21},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/macis/BuyukcolakGO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-09520,
author = {Yasemin B{\"{u}}y{\"{u}}k{\c{c}}olak and
Didem G{\"{o}}z{\"{u}}pek and
Sibel {\"{O}}zkan},
title = {Triangle-Free Equimatchable Graphs},
journal = {CoRR},
volume = {abs/1807.09520},
year = {2018},
url = {http://arxiv.org/abs/1807.09520},
eprinttype = {arXiv},
eprint = {1807.09520},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-09520.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/OdabasiO17,
author = {Ugur Odabasi and
Sibel {\"{O}}zkan},
title = {Uniformly Resolvable Cycle Decompositions with Four Different Factors},
journal = {Graphs Comb.},
volume = {33},
number = {6},
pages = {1591--1606},
year = {2017},
url = {https://doi.org/10.1007/s00373-017-1856-6},
doi = {10.1007/S00373-017-1856-6},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/OdabasiO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GozupekOPSS17,
author = {Didem G{\"{o}}z{\"{u}}pek and
Sibel {\"{O}}zkan and
Christophe Paul and
Ignasi Sau and
Mordechai Shalom},
title = {Parameterized complexity of the {MINCCA} problem on graphs of bounded
decomposability},
journal = {Theor. Comput. Sci.},
volume = {690},
pages = {91--103},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.06.013},
doi = {10.1016/J.TCS.2017.06.013},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GozupekOPSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BuyukcolakGO17,
author = {Yasemin B{\"{u}}y{\"{u}}k{\c{c}}olak and
Didem G{\"{o}}z{\"{u}}pek and
Sibel {\"{O}}zkan},
title = {Minimum Reload Cost Cycle Cover in Complete Graphs},
journal = {CoRR},
volume = {abs/1706.05225},
year = {2017},
url = {http://arxiv.org/abs/1706.05225},
eprinttype = {arXiv},
eprint = {1706.05225},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BuyukcolakGO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/AsplundKKPO16,
author = {John Asplund and
David Kamin and
Melissa S. Keranen and
Adri{\'{a}}n Pastine and
Sibel {\"{O}}zkan},
title = {On the Hamilton-Waterloo problem with triangle factors and C\({}_{\mbox{3x}}\)-factors},
journal = {Australas. {J} Comb.},
volume = {64},
pages = {458--474},
year = {2016},
url = {http://ajc.maths.uq.edu.au/pdf/64/ajc\_v64\_p458.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/AsplundKKPO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/OdabasiO16,
author = {Ugur Odabasi and
Sibel {\"{O}}zkan},
title = {The Hamilton-Waterloo Problem with C\({}_{\mbox{4}}\) and C\({}_{\mbox{m}}\)
factors},
journal = {Discret. Math.},
volume = {339},
number = {1},
pages = {263--269},
year = {2016},
url = {https://doi.org/10.1016/j.disc.2015.08.013},
doi = {10.1016/J.DISC.2015.08.013},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/OdabasiO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GozupekOPSS16,
author = {Didem G{\"{o}}z{\"{u}}pek and
Sibel {\"{O}}zkan and
Christophe Paul and
Ignasi Sau and
Mordechai Shalom},
editor = {Pinar Heggernes},
title = {Parameterized Complexity of the {MINCCA} Problem on Graphs of Bounded
Decomposability},
booktitle = {Graph-Theoretic Concepts in Computer Science - 42nd International
Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9941},
pages = {195--206},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53536-3\_17},
doi = {10.1007/978-3-662-53536-3\_17},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GozupekOPSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GozupekOPSS16,
author = {Didem G{\"{o}}z{\"{u}}pek and
Sibel {\"{O}}zkan and
Christophe Paul and
Ignasi Sau and
Mordechai Shalom},
title = {Parameterized complexity of the {MINCCA} problem on graphs of bounded
decomposability},
journal = {CoRR},
volume = {abs/1605.00532},
year = {2016},
url = {http://arxiv.org/abs/1605.00532},
eprinttype = {arXiv},
eprint = {1605.00532},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GozupekOPSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BuyukcolakGOS16,
author = {Yasemin B{\"{u}}y{\"{u}}k{\c{c}}olak and
Didem G{\"{o}}z{\"{u}}pek and
Sibel {\"{O}}zkan and
Mordechai Shalom},
title = {A Simple Extension of Dirac's Theorem on Hamiltonicity},
journal = {CoRR},
volume = {abs/1606.03687},
year = {2016},
url = {http://arxiv.org/abs/1606.03687},
eprinttype = {arXiv},
eprint = {1606.03687},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BuyukcolakGOS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GoldwasserHHO15,
author = {John L. Goldwasser and
Anthony J. W. Hilton and
Dean G. Hoffman and
Sibel {\"{O}}zkan},
title = {Hall's theorem and extending partial latinized rectangles},
journal = {J. Comb. Theory, Ser. {A}},
volume = {130},
pages = {26--41},
year = {2015},
url = {https://doi.org/10.1016/j.jcta.2014.10.007},
doi = {10.1016/J.JCTA.2014.10.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GoldwasserHHO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/BuyukcolakGO15,
author = {Yasemin B{\"{u}}y{\"{u}}k{\c{c}}olak and
Didem G{\"{o}}z{\"{u}}pek and
Sibel {\"{O}}zkan},
editor = {Ekrem Duman and
Ali Fuat Alkaya},
title = {An Extension of Dirac's Theorem on Hamiltonicity},
booktitle = {13th Cologne Twente Workshop on Graphs and Combinatorial Optimization,
Istanbul, Turkey, May 26-28, 2015},
pages = {149--152},
year = {2015},
timestamp = {Thu, 02 Feb 2017 18:00:28 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/BuyukcolakGO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/OdabasiO15,
author = {Ugur Odabasi and
Sibel {\"{O}}zkan},
editor = {Ekrem Duman and
Ali Fuat Alkaya},
title = {The Hamilton-Waterloo Problem with {C4} and Cm Factors},
booktitle = {13th Cologne Twente Workshop on Graphs and Combinatorial Optimization,
Istanbul, Turkey, May 26-28, 2015},
pages = {239--241},
year = {2015},
timestamp = {Thu, 02 Feb 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/OdabasiO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KeranenO13,
author = {Melissa S. Keranen and
Sibel {\"{O}}zkan},
title = {The Hamilton-Waterloo Problem with 4-Cycles and a Single Factor of
n-Cycles},
journal = {Graphs Comb.},
volume = {29},
number = {6},
pages = {1827--1837},
year = {2013},
url = {https://doi.org/10.1007/s00373-012-1231-6},
doi = {10.1007/S00373-012-1231-6},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KeranenO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/Ozkan11,
author = {Sibel {\"{O}}zkan},
title = {Generalization of the Erdos-Gallai Inequality},
journal = {Ars Comb.},
volume = {98},
pages = {295--302},
year = {2011},
timestamp = {Thu, 02 Feb 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/Ozkan11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/OzkanR10,
author = {Sibel {\"{O}}zkan and
C. A. Rodger},
title = {Hamilton decompositions of balanced complete multipartite graphs with
primitive leaves},
journal = {Discret. Math.},
volume = {310},
number = {13-14},
pages = {1965--1973},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2010.03.006},
doi = {10.1016/J.DISC.2010.03.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/OzkanR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/OzkanR09,
author = {Sibel {\"{O}}zkan and
C. A. Rodger},
title = {Hamilton decompositions of graphs with primitive complements},
journal = {Discret. Math.},
volume = {309},
number = {14},
pages = {4883--4888},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.07.026},
doi = {10.1016/J.DISC.2008.07.026},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/OzkanR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-05-02 23:42 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:
