67 sonucu aktar:
Yazar [ Başlık(Desc)] Tür Yıl
Süzgeçler: First Letter Of Last Name: D  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
M
Dibek, C., T. Ekim, and P. Heggernes, "Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded", Discrete Mathematics, vol. 340, pp. 927 - 934, 2017.
Zou, N., G. Chetelat, M. Gokce Baydogan, J. Li, F. U. Fischer, D. Titov, J. Dukart, A. Fellgiebel, M. Schreckenberger, and I. Yakushev, "Metabolic connectivity as index of verbal working memory", Journal of cerebral blood flow and metabolism, vol. 35, pp. 1122—1126, July, 2015.
Demange, M., T. Ekim, and B. Ries, "On the minimum and maximum selective graph coloring problems in some graph classes", Discrete Applied Mathematics, vol. 204, pp. 77–89, 2016.
Demange, M., and T. Ekim, "Minimum maximal matching is NP-hard in regular bipartite graphs", Theory and Applications of Models of Computation: Springer, pp. 364–374, 2008.
N
Dingeç, K. Dinçer, and W. Hörmann, "New control variates for Lévy process models", Proceedings of the Winter Simulation Conference: Winter Simulation Conference, pp. 15, 2012.
Demange, M., T. Ekim, and , "A note on the NP-hardness of two matching problems in induced subgrids", Discrete Mathematics and Theoretical Computer Science, vol. 15, no. 2, pp. 233–242, 2013.
O
Taşkın, Z. C., C. J. Smith, E. H. Romeijn, and J. F. Dempsey, "Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning", Operations Research, vol. 58, no. 3, pp. 674–690, 2010.
P
Demange, M., T. Ekim, and D. de Werra, "(p, k)-coloring problems in line graphs", Theoretical computer science, vol. 349, no. 3: Elsevier, pp. 462–474, 2005.
Demange, M., T. Ekim, and D. de Werra, "(p, k)-coloring problems in line graphs", Theoretical computer science, vol. 349, no. 3: Elsevier, pp. 462–474, 2005.
Demange, M., T. Ekim, and D. de Werra, "Partitioning cographs into cliques and stable sets", Discrete Optimization, vol. 2, no. 2: Elsevier, pp. 145–153, 2005.
Demange, M., T. Ekim, and D. de Werra, "Partitioning cographs into cliques and stable sets", Discrete Optimization, vol. 2, no. 2: Elsevier, pp. 145–153, 2005.
Sertdemir, S., A. Tamer Ünal, and ZEHRA. DÜZGİT, "Periodic Due Date Assignment with Family Setups", INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, vol. 26, pp. 0–0, 2019.
Ekim, T., N. V. R. Mahadev, and D. de Werra, "Polar cographs", Discrete Applied Mathematics, vol. 156, no. 10: North-Holland, pp. 1652–1660, 2008.
Ekim, T., NVR. Mahadev, and D. de Werra, "Polar cographs", Discrete Applied Mathematics, vol. 171, no. EPFL-ARTICLE-199582: Elsevier Science Bv, pp. 158–158, 2014.
Ekim, T., P. Hell, J. Stacho, and D. de Werra, "Polarity of chordal graphs", Discrete Applied Mathematics, vol. 156, no. 13: Elsevier, pp. 2469–2479, 2008.
Hörmann, W., and G. Derflinger, A Portable Random Number Generator Well Suited for the Rejection Method, , vol. 19, no. 4, pp. 489–495, 1993.
Kumbaroğlu, G., C. Canaz, J. Deason, and E. Shittu, "Profitable Decarbonization through E-Mobility", Energies, vol. 13, 2020.
Q
Korugan, A., K. Dinçer Dingeç, T. Önen, and N. Y. Ateş, "On the quality variation impact of returns in remanufacturing", Computers & Industrial Engineering, vol. 64, pp. 929–936, Apr, 2013.
R
Kumbaroğlu, G., R. Madlener, and M. Demirel, "A real options evaluation model for the diffusion prospects of new renewable power generation technologies", Energy Economics, vol. 30, pp. 1882-1908, 2008.
Demiröz, B. Evrim, K. I. Altinel, and L. Akarun, "Rectangle blanket problem: Binary integer linear programming formulation and solution algorithms", European Journal of Operational Research, vol. 277, pp. 62-83, 2019.
Duan, H., L. Zhu, G. Kumbaroğlu, Y. Fan, and , "Regional opportunities for China to go low-carbon: results from the REEC model", The Energy Journal, vol. 37, 2016.
Hörmann, W., and G. Derflinger, "Rejection-Inversion to Generate Variates from Monotone Discrete Distributions", ACMTOMACS, vol. 6, no. 3, pp. 169–184, 1996.
S
Deng, H., M. Gokce Baydogan, and G. Runger, "SMT: Sparse multivariate tree", Statistical Analysis and Data Mining, vol. 7, issue 1, pp. 53-69, 02/2014.
Demange, M., T. Ekim, B. Ries, and C. Tanasescu, "On some applications of the selective graph coloring problem", European Journal of Operational Research, vol. 240, pp. 307-314, 2015.
Bajgoric, N., K. I. Altinel, M. Draman, and A. Tamer Ünal, "Some aspects of using CASE tools in a Fusion-based application development project for production optimization", Industrial Management and Data Systems, vol. 102, pp. 463–471, 2002.
Ekim, T., and D. de Werra, "On split-coloring problems", Journal of Combinatorial Optimization, vol. 10, no. 3: Kluwer Academic Publishers, pp. 211–225, 2005.
Ekim, T., and D. de Werra, "On split-coloring problems (vol 10, pg 211, 2005)", JOURNAL OF COMBINATORIAL OPTIMIZATION, vol. 11, no. 1: SPRINGER VAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS, pp. 125–125, 2006.
Ekim, T., B. Ries, D. de Werra, and , "Split-critical and uniquely split-colorable graphs", Discrete Mathematics and Theoretical Computer Science, vol. 12, no. 5, pp. 1–24, 2010.
Dingeç, K. Dinçer, and A. Korugan, "A stochastic analysis of asynchronous demand in disassembly processes of remanufacturing systems", European Journal of Industrial Engineering, vol. 7, pp. 175–205, 2013.
T
Hörmann, W., and G. Derflinger, "The transformed rejection method for generating random variables, an alternative to the ratio of uniforms method", Commun. Stat., Simulation Comput., vol. 23, no. 3, pp. 847-860, 1994.

Pages