
Search the dblp DataBase
BinhMinh BuiXuan:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 BinhMinh BuiXuan, Michel Habib, Christophe Paul
Revisiting T. Uno and M. Yagiura's Algorithm . [Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:146155 [Conf]
 BinhMinh BuiXuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. [Citation Graph (0, 0)][DBLP] WG, 2006, pp:278288 [Conf]
 BinhMinh BuiXuan, 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:267285 [Journal]
 BinhMinh BuiXuan, 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]
 BinhMinh BuiXuan, 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]
 BinhMinh BuiXuan, 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]
Unifying Two Graph Decompositions with Modular Decomposition. [Citation Graph (, )][DBLP]
BooleanWidth of Graphs. [Citation Graph (, )][DBLP]
A Representation Theorem for UnionDifference Families and Application. [Citation Graph (, )][DBLP]
Feedback Vertex Set on Graphs of Low Cliquewidth. [Citation Graph (, )][DBLP]
Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions [Citation Graph (, )][DBLP]
Algorithmic aspects of a general modular decomposition theory. [Citation Graph (, )][DBLP]
Hjoin decomposable graphs and algorithms with runtime single exponential in rankwidth. [Citation Graph (, )][DBLP]
Search in 0.041secs, Finished in 0.042secs
