2009 |
11 | EE | Binh-Minh Bui-Xuan,
Jan Arne Telle,
Martin Vatshelle:
Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions
CoRR abs/0903.4796: (2009) |
2008 |
10 | EE | Binh-Minh Bui-Xuan,
Michel Habib:
A Representation Theorem for Union-Difference Families and Application.
LATIN 2008: 492-503 |
9 | EE | Binh-Minh Bui-Xuan,
Michel Habib,
Christophe Paul:
Competitive graph searches.
Theor. Comput. Sci. 393(1-3): 72-80 (2008) |
2007 |
8 | EE | Binh-Minh Bui-Xuan,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier:
Unifying Two Graph Decompositions with Modular Decomposition.
ISAAC 2007: 52-64 |
2006 |
7 | EE | Binh-Minh Bui-Xuan,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier:
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms.
WG 2006: 278-288 |
6 | EE | Binh-Minh Bui-Xuan,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier:
Homogeneity vs. Adjacency: generalising some graph decomposition algorithms
CoRR abs/cs/0603048: (2006) |
5 | EE | Binh-Minh Bui-Xuan,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier:
Unifying two Graph Decompositions with Modular Decomposition
CoRR abs/cs/0604065: (2006) |
4 | EE | Binh-Minh Bui-Xuan,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier:
Algorithmic Aspects of a Novel Modular Decomposition Theory
CoRR abs/cs/0611019: (2006) |
3 | EE | Binh-Minh Bui-Xuan,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier:
On Modular Decomposition Concepts: the case for Homogeneous Relations.
Electronic Notes in Discrete Mathematics 27: 13-14 (2006) |
2005 |
2 | EE | Binh-Minh Bui-Xuan,
Michel Habib,
Christophe Paul:
Revisiting T. Uno and M. Yagiura's Algorithm .
ISAAC 2005: 146-155 |
2003 |
1 | EE | Binh-Minh Bui-Xuan,
Afonso Ferreira,
Aubin Jarry:
Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks.
Int. J. Found. Comput. Sci. 14(2): 267-285 (2003) |