Export 53 results:
Author Title [ Type(Asc)] Year
Filters: First Letter Of Last Name is D  [Clear All Filters]
Journal Article
Dingeç, K. Dinçer, and W. Hörmann, "Using the continuous price as control variate for discretely monitored options", Mathematics and Computers in Simulation, vol. 82, no. 4: North-Holland, pp. 691–704, 2011.
Döyen, A., N. Aras, and G. Barbarosoğlu, "A two-echelon stochastic facility location model for humanitarian relief logistics", Optimization Letters, vol. 6, no. 6: Springer-Verlag, pp. 1123–1145, 2012.
Demange, M., T. Ekim, and D. de Werra, "A tutorial on the use of graph coloring for some problems in robotics", European Journal of Operational Research, vol. 192, no. 1: North-Holland, pp. 41–55, 2009.
Demange, M., T. Ekim, and D. de Werra, "A tutorial on the use of graph coloring for some problems in robotics", European Journal of Operational Research, vol. 192, no. 1: North-Holland, pp. 41–55, 2009.
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.
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.
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., and D. de Werra, "On split-coloring problems", Journal of Combinatorial Optimization, vol. 10, no. 3: Kluwer Academic Publishers, pp. 211–225, 2005.
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.
Demange, M., T. Ekim, B. Ries, and C. Tanasescu, "On some applications of the selective graph coloring problem", European Journal of Operational Research: North-Holland, 2014.
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.
Hörmann, W., and G. Derflinger, "Rejection-Inversion to Generate Variates from Monotone Discrete Distributions", ACMTOMACS, vol. 6, no. 3, pp. 169–184, 1996.
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, A Portable Random Number Generator Well Suited for the Rejection Method, , vol. 19, no. 4, pp. 489–495, 1993.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
I. Altinel, K., E. Durmaz, N. Aras, and K. Can Özkisacik, "A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations", European Journal of Operational Research, vol. 198, pp. 790–799, 2009.
Demange, M., T. Ekim, and C. Tanasescu, "Hardness and approximation of minimum maximal matchings", International Journal of Computer Mathematics, no. ahead-of-print: Taylor & Francis, pp. 1–20, 2013.
Dingeç, K. Dinçer, and W. Hörmann, "A general control variate method for option pricing under Lévy processes", European Journal of Operational Research, vol. 221, no. 2: North-Holland, pp. 368–377, 2012.

Pages