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

A list from DBLP

• is available here

Journal

• B.M. Bui-Xuan, H. Hourcade, and C. Miachon. Computing Small Temporal Modules in Time Logarithmic in History Length. Social Network Analysis and Mining, 12(1), 19, 2022
  [text]
• J. Baste, B.M. Bui-Xuan, and A. Roux. Temporal matching. Theoretical Computer Science, 806, 184--196, 2020
  [text]
• B.M. Bui-Xuan and N. S. Jones. How modular structure can simplify tasks on networks: parameterizing graph optimization by fast local community detection. Proceedings of the Royal Society A, 470:20140224, 2014
  [text]
• B.M. Bui-Xuan, J. A. Telle, and M. Vatshelle. Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theoretical Computer Science, 511:66--76, 2013
  [text]
• B.M. Bui-Xuan, O. Suchý, J. A. Telle, and M. Vatshelle. Feedback vertex set on graphs of low cliquewidth. European Journal of Combinatorics, 34(3):666--679, 2013
  [text]
• B.M. Bui-Xuan, M. Habib, and M. Rao. Tree-representation of set families and applications to combinatorial decompositions. European Journal of Combinatorics, 33(5):688--711, 2012
  [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

• J. Villacis-Llobet, B.M. Bui-Xuan, and M. Potop-Butucaru. Foremost non-stop journey arrival in linear time. 29th International Colloquium on Structural Information and Communication Complexity, volume 13298 of LNCS, pages 283--301, 2022
  [text]
• H. Bui Xuan, B.M. Bui-Xuan, V.C Le, and H.B. Mai. Low Diameter Algebraic Graphs. European Conference on Combinatorics, Graph Theory and Applications (EuroComb'21), volume 14 of Trends in Mathematics and Research Perspectives CRM Barcelona, 2021
  [text]
• H. Hourcade, F. Hamissi, C. Miachon, and B.M. Bui-Xuan. Behaviour Recognition Algorithms In Temporal Graphs. Conference on Complex Systems, 2021
  [text]
• T. Picavet, N.T. Nguyen, and B.M. Bui-Xuan. Temporal Matching on Geometric Graph Data. 12th International Conference on Algorithms and Complexity, volume 12701 of LNCS and LNTCS, pages 394--408, 2021
  [text]
• B.M. Bui-Xuan, H. Hourcade, and C. Miachon. Computing Temporal Twins in Time Logarithmic in History Length. 9th International Conference on Complex Networks and their Applications, volume 944 of Studies in Computational Intelligence, pages 651--663, 2020
  
• T. Picavet, N.T. Nguyen, and B.M. Bui-Xuan. Couplage temporel et géométrique. 22e Journées Graphes et Algorithmes (JGA 2020), 2020
  
• J. Baste, B.M. Bui-Xuan, and A. Roux. Temporal matching. Algorithms, Optimization and Learning in dynamic environments (AOL 2019), 2019
  
• J. Baste and B.M. Bui-Xuan. Temporal matching in link stream: kernel and approximation. 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2018), 2018
  
• B.M. Bui-Xuan, C. Magnien, and P. Meyer. Kernelization algorithms for some link stream editing problems. Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2017), 2017
  
• C. Huyghues-Despointes, B.M. Bui-Xuan, and C. Magnien. Forte Delta-connexité dans les flots de lien. 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunication (ALGOTEL 2016), 2016
  [text]
• B.M. Bui-Xuan, P. Heggernes, D. Meister, and A. Proskurowski. A generic approach to decomposition algorithms, with an application to digraph decomposition. 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. 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. 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. 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. 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. 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. 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). 16th Annual International Symposium on Algorithms and Computation (ISAAC'05), volume 3827 of LNCS, pages 146--155, 2005
  
• 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

Thesis

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