Bùi Xuân Bình Minh - publications

A list from DBLP

• is available here

Thesis

• B.-M. Bui-Xuan. Tree-representation of set families in graph decompositions and efficient algorithms. Ph. D. thesis, Université Montpellier II, 2008
  [text]

Journal

• B.-M. Bui-Xuan, O. Suchý, J. A. Telle, and M. Vatshelle. Feedback vertex set on graphs of low cliquewidth. to appear in European Journal of Combinatorics
  [text]
• B.-M. Bui-Xuan, M. Habib, and M. Rao. Tree-representation of set families and applications to combinatorial decompositions. to appear in European Journal of Combinatorics. online at doi
  [text]
• B.-M. Bui-Xuan, J. A. Telle, and M. Vatshelle. Boolean-width of graphs. Theoretical Computer Science, 412(39):5187--5204, 2011
  [text]
• B.-M. Bui-Xuan, J. A. Telle, and M. Vatshelle. H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discrete Applied Mathematics, 158(7):809--819, 2010
  [text]
• B.-M. Bui-Xuan, M. Habib, V. Limouzy, and F. de Montgolfier. Algorithmic aspects of a general modular decomposition theory. Discrete Applied Mathematics, 157(9):1993--2009, 2009
  [text]
• B.-M. Bui-Xuan, M. Habib, and C. Paul. Competitive graph searches. Theoretical Computer Science, 393(1-3):72--80, 2008
  [text]
• B. Bui Xuan, A. Ferreira, and A. Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. International Journal of Foundations of Computer Science, 14(2):267--285, 2003
  [text]

Conference

• B.-M. Bui-Xuan, P. Heggernes, D. Meister, and A. Proskurowski. A generic approach to decomposition algorithms, with an application to digraph decomposition. The 17th Annual International Computing and Combinatorics Conference (COCOON'11), volume 6842 of LNCS, pages 331--342, 2011
  [text]
• I. Adler, B.-M. Bui-Xuan, Y. Rabinovich, G. Renault, J. A. Telle, and M. Vatshelle. On the boolean-width of a graph: structure and applications. The 36nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'10), volume 6410 of LNCS, pages 159--170, 2010
  [text]
• B.-M. Bui-Xuan, J. A. Telle, and M. Vatshelle. Boolean-width of graphs. The 4th International Workshop on Parameterized and Exact Computation (IWPEC'09), volume 5917 of LNCS, pages 61--74, 2009
• B.-M. Bui-Xuan, J. A. Telle, and M. Vatshelle. Feedback vertex set on graphs of low cliquewidth. The 20th International Workshop on Combinatorial Algorithms (IWOCA'09), volume 5874 of LNCS, pages 113--124, 2009
• B.-M. Bui-Xuan and M. Habib. Unifying the representation of symmetric crossing families and weakly partitive families. European Conference on Combinatorics, Graph Theory and Applications (EuroComb'09), volume 34 of ENDM, pages 329--333, 2009
• B.-M. Bui-Xuan, M. Habib, and M. Rao. Representation theorems for two set families and applications to combinatorial decompositions. International Conference on Relations, Orders and Graphs: Interaction with Computer Science (ROGICS'08), Nouha editions, pages 532--546, 2008
• B.-M. Bui-Xuan and M. Habib. A representation theorem for union-difference families and application. The 8th Latin American Theoretical Informatics (LATIN'08), volume 4957 of LNCS, pages 492--503, 2008
• B.-M. Bui-Xuan, M. Habib, V. Limouzy, and F. de Montgolfier. Unifying two graph decompositions with modular decomposition. The 18th Annual International Symposium on Algorithms and Computation (ISAAC'07), volume 4835 of LNCS, pages 52--64, 2007
• B.-M. Bui Xuan, M. Habib, V. Limouzy, and F. de Montgolfier. Homogeneity vs. adjacency: generalising some decomposition algorithms. The 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'06), volume 4271 of LNCS, pages 278--288, 2006
• B.-M. Bui Xuan, M. Habib, and C. Paul. Revisiting T. Uno and M. Yagiura's algorithm (extended abstract). The 16th Annual International Symposium on Algorithms and Computation (ISAAC'05), volume 3827 of LNCS, pages 146--155, 2005
  [text]
• B. Bui Xuan, A. Ferreira, and A. Jarry. Evolving graphs and least cost journeys in dynamic networks. Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt'03), INRIA Press, pages 141--150, 2003