10 sonucu aktar:
Yazar [ Başlık(Desc)] Tür Yıl
Süzgeçler: Yazar: Demange, Marc  [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 
A
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.
E
Demange, M., and T. Ekim, "Efficient recognition of equimatchable graphs", Information Processing Letters, vol. 114, no. 1: Elsevier, pp. 66–71, 2014.
H
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.
M
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
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.
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, "Partitioning cographs into cliques and stable sets", Discrete Optimization, vol. 2, no. 2: Elsevier, pp. 145–153, 2005.
S
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.
T
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.