Search the dblp DataBase

Publications of Author

1. Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
   Revisiting T. Uno and M. Yagiura's Algorithm . [Citation Graph (0, 0)][DBLP]
   ISAAC, 2005, pp:146-155 [Conf]
   
2. Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
   Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. [Citation Graph (0, 0)][DBLP]
   WG, 2006, pp:278-288 [Conf]
   
3. Binh-Minh Bui-Xuan, Afonso Ferreira, Aubin Jarry
   Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2003, v:14, n:2, pp:267-285 [Journal]
   
4. Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
   Algorithmic Aspects of a Novel Modular Decomposition Theory [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
5. Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
   Homogeneity vs. Adjacency: generalising some graph decomposition algorithms [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
6. Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
   Unifying two Graph Decompositions with Modular Decomposition [Citation Graph (0, 0)][DBLP]
   CoRR, 2006, v:0, n:, pp:- [Journal]
   
7. 
   Unifying Two Graph Decompositions with Modular Decomposition. [Citation Graph (, )][DBLP]
   
   
8. 
   Boolean-Width of Graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   A Representation Theorem for Union-Difference Families and Application. [Citation Graph (, )][DBLP]
   
   
10. 
    Feedback Vertex Set on Graphs of Low Cliquewidth. [Citation Graph (, )][DBLP]
    
    
11. 
    Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions [Citation Graph (, )][DBLP]
    
    
12. 
    Algorithmic aspects of a general modular decomposition theory. [Citation Graph (, )][DBLP]
    
    
13. 
    H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. [Citation Graph (, )][DBLP]