Binh-Minh Bui-Xuan

Bùi Xuân Bình Minh

	2012
20		Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao: Tree-representation of set families and applications to combinatorial decompositions. Eur. J. Comb. 33(5): 688-711 (2012)
	2011
19		Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski: A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. COCOON 2011: 331-342
18		Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle: Boolean-width of graphs. Theor. Comput. Sci. 412(39): 5187-5204 (2011)
	2010
17		Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle: On the Boolean-Width of a Graph: Structure and Applications. WG 2010: 159-170
16		Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle: H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discrete Applied Mathematics 158(7): 809-819 (2010)
	2009
15		Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle: Feedback Vertex Set on Graphs of Low Cliquewidth. IWOCA 2009: 113-124
14		Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle: Boolean-Width of Graphs. IWPEC 2009: 61-74
13		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)
12		Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier: Algorithmic aspects of a general modular decomposition theory. Discrete Applied Mathematics 157(9): 1993-2009 (2009)
11		Binh-Minh Bui-Xuan, Michel Habib: Unifying the representation of symmetric crossing families and weakly partitive families. Electronic Notes in Discrete Mathematics 34: 329-333 (2009)
	2008
10		Binh-Minh Bui-Xuan, Michel Habib: A Representation Theorem for Union-Difference Families and Application. LATIN 2008: 492-503
9		Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul: Competitive graph searches. Theor. Comput. Sci. 393(1-3): 72-80 (2008)
	2007
8		Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier: Unifying Two Graph Decompositions with Modular Decomposition. ISAAC 2007: 52-64
	2006
7		Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier: Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. WG 2006: 278-288
6		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		Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier: Unifying two Graph Decompositions with Modular Decomposition CoRR abs/cs/0604065: (2006)
4		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		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		Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul: Revisiting T. Uno and M. Yagiura's Algorithm . ISAAC 2005: 146-155
	2003
1		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)

Coauthor Index

1	Isolde Adler	[17]
2	Afonso Ferreira	[1]
3	Michel Habib	[2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [20]
4	Pinar Heggernes	[19]
5	Aubin Jarry	[1]
6	Vincent Limouzy	[3] [4] [5] [6] [7] [8] [12]
7	Daniel Meister	[19]
8	Fabien de Montgolfier	[3] [4] [5] [6] [7] [8] [12]
9	Christophe Paul	[2] [9]
10	Andrzej Proskurowski	[19]
11	Yuri Rabinovich	[17]
12	Michaël Rao	[20]
13	Gabriel Renault	[17]
14	Jan Arne Telle	[13] [14] [15] [16] [17] [18]
15	Martin Vatshelle	[13] [14] [15] [16] [17] [18]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page