327 sonucu aktar:
[ Yazar(Asc)] Başlık Tür Yıl
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 
E
Ekim, T., A. Erey, P. Heggernes, P. van't Hof, and D. Meister, "Computing minimum geodetic sets of proper interval graphs", LATIN 2012: Theoretical Informatics: Springer Berlin Heidelberg, pp. 279–290, 2012.
Ekim, T., and J. Huang, "Recognizing line-polar bipartite graphs in time O (n)", Discrete Applied Mathematics, vol. 158, no. 15: Elsevier, pp. 1593–1598, 2010.
Ekim, T., and A. Erey, "Block decomposition approach to compute a minimum geodetic set", RAIRO-Operations Research, vol. 48, no. 04: EDP Sciences, pp. 497–507, 2014.
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., "Edge extremal Graphs Under Degree and Matching Number Restrictions", 17th Haifa Workshop on Interdisciplinary Applications of Graphs – CRI, 2017.
Ekim, T., P. Heggernes, and D. Meister, "Polar permutation graphs are polynomial-time recognisable", European Journal of Combinatorics, vol. 34, no. 3: Academic Press, pp. 576–592, 2013.
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.
Edali, M., and H. Yasarcan, "The Effect of Semi-Rational Supply Chain Members on the Decision Parameters Used in Managing the Stock of an Echelon", The 32nd International System Dynamics Conference, Delft, Netherlands: System Dynamics Society (http://www.systemdynamics.org/conferences/2014/index.html), 2014.
Edali, M., and H. Yasarcan, "A Mathematical Model of the Beer Game", Journal of Artificial Societies and Social Simulation, vol. 17, no. 4: Journal of Artificial Societies and Social Simulation, pp. jasss–soc, 2014.
E, K., N. Aras, and K. I. Altinel, Optimal Sensor Deployment to Increase the Security of the Maximal Breach Path in Border Surveillance, : Boğaziçi University, 2016.
D
Durmaz, E., N. Aras, and K. I. Altinel, "Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations", Computers & Operations Research, vol. 36, pp. 2139–2148, 2009.
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.
Draman, M., K. I. Altinel, N. Bajgoric, A. Tamer Ünal, and B. Birgören, "A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries", European Journal of Operational Research, vol. 137, pp. 483–496, 2002.
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.
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.
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.
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.
Dingeç, K. Dinçer, and W. Hörmann, "Control variates and conditional Monte Carlo for basket and Asian options", Insurance: Mathematics and Economics, vol. 52, no. 3: North-Holland, pp. 421–434, 2013.
Dibek, C., T. Ekim, D. Gözüpek, and M. Shalom, "Equimatchable graphs are C2k+ 1-free for k≥ 4", Discrete Mathematics, vol. 339, pp. 2964–2969, 2016.
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.
Derflinger, G., and W. Hörmann, "Asymptotically Optimal Design Points for Rejection Algorithms", Communications in Statistics: Simulation and Computation, vol. 34, no. 4, pp. 879-893, 2005.
Derflinger, G., W. Hörmann, J. Leydold, and H. Sak, "Efficient Numerical Inversion for Financial Simulations", Monte Carlo and Quasi-Monte Carlo Methods 2008, Heidelberg, Springer-Verlag, pp. 297–304, 2009.
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., and T. Ekim, "Efficient recognition of equimatchable graphs", Information Processing Letters, vol. 114, no. 1: Elsevier, pp. 66–71, 2014.
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 C. Tanasescu, "Hardness and approximation of minimum maximal matchings", International Journal of Computer Mathematics, no. ahead-of-print: Taylor & Francis, pp. 1–20, 2013.
Demange, M., T. Ekim, D. de Werra, and , "On the approximation of Min Split-coloring and Min Cocoloring.", J. Graph Algorithms Appl., vol. 10, no. 2, pp. 297–315, 2006.
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.
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.

Pages