Oylum Seker

13 papers C 1Journal 11Unranked 1
YearRankTypeTitle / Venue / Authors
2023 J jnl
A Multiobjective Approach for Sector Duration Optimization in Stereotactic Radiosurgery Treatment Planning.
INFORMS J. Comput.
Oylum Seker, Mucahit Cevik, Merve Bodur, Young Lee, Mark Ruschin
2022 J jnl
Digital Annealer for quadratic unconstrained binary optimization: A comparative performance analysis.
Appl. Soft Comput.
Oylum Seker, Neda Tanoumand, Merve Bodur
2022 J jnl
Generation of random chordal graphs using subtrees of a tree.
RAIRO Oper. Res.
Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin
2021 J jnl
An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs.
Eur. J. Oper. Res.
Oylum Seker, Tínaz Ekim, Z. Caner Taskin
2021 J jnl
The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation.
J. Comb. Optim.
Tínaz Ekim, Mordechai Shalom, Oylum Seker
2020 J jnl
Digital Annealer for quadratic unconstrained binary optimization: a comparative performance analysis.
CoRR
Oylum Seker, Neda Tanoumand, Merve Bodur
2019 J jnl
A decomposition approach to solve the selective graph coloring problem in some perfect graph families.
Networks
Oylum Seker, Tínaz Ekim, Z. Caner Taskin
2019 J jnl
Small 1-defective Ramsey numbers in perfect graphs.
Discret. Optim.
Tínaz Ekim, John Gimbel, Oylum Seker
2019 — conf
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation.
SEA²
Tínaz Ekim, Mordechai Shalom, Oylum Seker
2019 J jnl
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation.
CoRR
Tínaz Ekim, Mordechai Shalom, Oylum Seker
2018 J jnl
An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs.
CoRR
Oylum Seker, Tínaz Ekim, Z. Caner Taskin
2018 J jnl
Generation of random chordal graphs using subtrees of a tree.
CoRR
Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin
2017 C conf
Linear-Time Generation of Random Chordal Graphs.
CIAC
Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin