Author

A. Benkouar

Institution: Laboratoire de Recherche en Informatique

Observed institutions: Université Paris-Est Créteil, Lamsade, Laboratoire de Recherche en Informatique, Université Paris Dauphine-PSL

OpenAlex ID: A5034094112

Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results

1996 · A. Benkouar, Y. Manoussakis, et al. · RAIRO - Operations Research · 27

On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs: Extended abstract

1991 · A. Benkouar, Y. G. Manoussakis, et al. · Lecture notes in computer science · 19

The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle

2003 · A. Benkouar, Y. Manoussakis, et al. · Discrete Mathematics · 5

Compléxité et parallélisation d'algorithmes de graphes arêtes-colorés

1995 · A. Benkouar

Works count: 4

Citation count: 51

H-index: 3

I10-index: 2