10 sonucu aktar:
Yazar Başlık Tür [ Yıl(Desc)]
Süzgeçler: Yazar: Demange, Marc  [Clear All Filters]
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.
2006
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.
2008
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.
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.
2013
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, 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.
2014
Demange, M., and T. Ekim, "Efficient recognition of equimatchable graphs", Information Processing Letters, vol. 114, no. 1: Elsevier, pp. 66–71, 2014.
2016
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.
2017
Abedin, P., S. Akbari, M. Demange, and T. Ekim, "Complexity of the Improper Twin Edge Coloring of Graphs", Graphs and Combinatorics, vol. 33, pp. 595–615, 2017.