138 sonucu aktar:
Yazar Başlık Tür [ Yıl(Desc)]
Süzgeçler: First Letter Of Last Name: E  [Clear All Filters]
2017
Boyacı, A., T. Ekim, and M. Shalom, "A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs", Information Processing Letters, vol. 121, pp. 29-33, 2017.
Ekim, T., "Recent results on equimatchable graphs", Combinatorial Potlatch, 2017.
2018
Milanič, M., A. Hujdurović, D. Gözüpek, and T. Ekim, "On Almost Well-Covered Graphs of Girth at Least 6", Discrete Mathematics & Theoretical Computer Science, vol. 20, 2018.
Edali, M., and G. Yücel, "Automated Analysis of Regularities Between Model Parameters and Output Using Support Vector Regression in Conjunction with Decision Trees", Journal of Artificial Societies and Social Simulation, vol. 21, pp. 1, 2018.
Akbari, S., H. Alizadeh, T. Ekim, D. Gözüpek, and M. Shalom, "Equimatchable claw-free graphs", Discrete Mathematics, vol. 341, pp. 2859-2871, 2018.
Boyacı, A., T. Ekim, M. Shalom, and S. Zaks, "Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II", Discrete Mathematics and Theoretical Computer Science, vol. 20, pp. 1b–1b, 2018.
Ahat, B., T. Ekim, and Z. C. Taşkın, "Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem", INFORMS Journal on Computing, vol. 30, pp. 43-56, 2018.
Ekim, T., A. Boyacı, and M. Shalom, "The maximum cardinality cut problem in co-bipartite chain graphs", Journal of Combinatorial Optimization, vol. 35, pp. 250–265, Jan, 2018.
2019
Edali, M., M. Gokce Baydogan, and G. Yücel, "Classification of generic system dynamics model outputs via supervised time series pattern discovery", Turkish Journal of Electrical Engineering & Computer Sciences, vol. 27, pp. 832–846, 2019.
Şeker, O., T. Ekim, and Z. C. Taşkın, "A decomposition approach to solve the selective graph coloring problem in some perfect graph families", Networks, vol. 73, pp. 145-169, 2019.
Deniz, Z., and T. Ekim, "Edge-stable equimatchable graphs", Discrete Applied Mathematics, vol. 261, pp. 136-147, 2019.
Edali, M., and G. Yücel, "Exploring the behavior space of agent-based simulation models using random forest metamodels and sequential sampling", Simulation Modelling Practice and Theory, vol. 92, pp. 62-81, 2019.
Baktır, A. Cihat, B. Ahat, N. Aras, A. Özgövde, and C. Ersoy, "SLA-aware optimal resource allocation for service-oriented networks", Future Generation Computer Systems, vol. 101, pp. 959-974, 2019.
Ekim, T., J. Gimbel, and O. Şeker, "Small 1-defective Ramsey numbers in perfect graphs", Discrete Optimization, vol. 34, pp. 100548, 2019.
2020
Edali, M., and G. Yücel, "Analysis of an individual-based influenza epidemic model using random forest metamodels and adaptive sequential sampling", Systems Research and Behavioral Science, vol. 37, pp. 936-958, 2020.
Ekim, T., A. M. Farley, and A. Proskurowski, "The complexity of the defensive domination problem in special graph classes", Discrete Mathematics, vol. 343, pp. 111665, 2020.
Ekim, T., D. Gözüpek, A. Hujdurović, and M. Milanič, "Mind the independence gap", Discrete Mathematics, vol. 343, pp. 111943, 2020.
2021
Şeker, O., T. Ekim, and Z. C. Taşkın, "An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs", European Journal of Operational Research, vol. 291(1), pp. 67–83, 2021.

Pages