Oylum Seker

Publication Activity (10 Years)

Years Active: 2017-2023
Publications (10 Years): 13

Top Topics

Cutting Plane Algorithm

Top Venues

Discret. Optim.

J. Comb. Optim.

RAIRO Oper. Res.

Publications

Oylum Seker, Mucahit Cevik, Merve Bodur, Young Lee, Mark Ruschin
A Multiobjective Approach for Sector Duration Optimization in Stereotactic Radiosurgery Treatment Planning. INFORMS J. Comput. 35 (1) (2023)
Oylum Seker, Neda Tanoumand, Merve Bodur
Digital Annealer for quadratic unconstrained binary optimization: A comparative performance analysis. Appl. Soft Comput. 127 (2022)
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) (2022)
Tínaz Ekim, Mordechai Shalom, Oylum Seker
The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation. J. Comb. Optim. 41 (3) (2021)
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) (2021)
Oylum Seker, Neda Tanoumand, Merve Bodur
Digital Annealer for quadratic unconstrained binary optimization: a comparative performance analysis. CoRR (2020)
Tínaz Ekim, John Gimbel, Oylum Seker
Small 1-defective Ramsey numbers in perfect graphs. Discret. Optim. 34 (2019)
Tínaz Ekim, Mordechai Shalom, Oylum Seker
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation. CoRR (2019)
Oylum Seker, Tínaz Ekim, Z. Caner Taskin
A decomposition approach to solve the selective graph coloring problem in some perfect graph families. Networks 73 (2) (2019)
Tínaz Ekim, Mordechai Shalom, Oylum Seker
The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation. SEA² (2019)
Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin
Generation of random chordal graphs using subtrees of a tree. CoRR (2018)
Oylum Seker, Tínaz Ekim, Z. Caner Taskin
An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs. CoRR (2018)
Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin
Linear-Time Generation of Random Chordal Graphs. CIAC (2017)