Oylum Seker

According to our database, Oylum Seker authored at least 7 papers between 2017 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

2022

Generation of random chordal graphs using subtrees of a tree.

Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin

RAIRO Oper. Res., 2022

Digital Annealer for quadratic unconstrained binary optimization: A comparative performance analysis.

Oylum Seker, Neda Tanoumand, Merve Bodur

Appl. Soft Comput., 2022

2021

The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation.

Tínaz Ekim, Mordechai Shalom, Oylum Seker

J. Comb. Optim., 2021

An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs.

Oylum Seker, Tínaz Ekim, Z. Caner Taskin

Eur. J. Oper. Res., 2021

2019

A decomposition approach to solve the selective graph coloring problem in some perfect graph families.

Oylum Seker, Tínaz Ekim, Z. Caner Taskin

Networks, 2019

Small 1-defective Ramsey numbers in perfect graphs.

Tínaz Ekim, John Gimbel, Oylum Seker

Discret. Optim., 2019

2017

Linear-Time Generation of Random Chordal Graphs.

Oylum Seker, Pinar Heggernes, Tínaz Ekim, Z. Caner Taskin

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017