Showing items related by title and author.

• A new single model and derived algorithms for the satellite shots planning problem using graph theory concepts 

  Gabrel, Virginie; Moulet, Alain; Murat, Cécile; Paschos, Vangelis (1997) Article accepté pour publication ou publié
• 

  Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n,p)$ random model 

  Bourgeois, N.; Catellier, Rémi; Denat, T.; Paschos, Vangelis (2015) Document de travail / Working paper
• Hamiltonian problems in edge-colored complete graphs and Eulerian cycles in edge-colored graphs: some complexity results 

  Benkouar, A.; Manoussakis, Yannis; Paschos, Vangelis; Saad, Rachid (1996) Article accepté pour publication ou publié
• On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs (Extended abstract) 

  Benkouar, A.; Manoussakis, Yannis; Paschos, Vangelis; Saad, Rachid (1991) Communication / Conférence
• Worst-case complexity of exact algorithms for NP-hard problems 

  Della Croce, Federico; Escoffier, Bruno; Kaminski, Marcin; Paschos, Vangelis (2008) Chapitre d'ouvrage