Un doctorant à Sorbonne Université (Direction de recherche / Co-encadrement)

Deux docteurs (2019 - 2023) à Sorbonne Université

Publications 2003-2024

• 2024
  • L. Azerouk, B.‑M. Bui‑Xuan, C. Palisoc, M. Potop‑Butucaru, M. Tighilt : “Distributed computation of temporal twins in periodic undirected time-varying graphs”, (2024)
• 2023
  • J. Villacis‑Llobet, B.‑M. Bui‑Xuan, M. Potop‑Butucaru : “Marche sans escale dans un graphe temporel”, AlgoTel 2023 - 25^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Cargese, France (2023)
• 2022
  • J. Villacis‑Llobet, B.‑M. Bui‑Xuan, M. Potop‑Butucaru : “Foremost non-stop journey arrival in linear time”, 29^th International Colloquium on Structural Information and Communication Complexity, vol. 13298, Lecture Notes in Computer Science, Paderborn, Germany, pp. 283-301, (Springer) (2022)
  • B.‑M. Bui‑Xuan, H. Hourcade, C. Miachon : “Computing Small Temporal Modules in Time Logarithmic in History Length”, Social Network Analysis and Mining, (Springer) (2022)
• 2021
  • H. Bui Xuan, B.‑M. Bui‑Xuan, L. Van Chua, M. Bien : “Low Diameter Algebraic Graphs”, European Conference on Combinatorics, Graph Theory and Applications, vol. 14, Trends in Mathematics, Barcelona, Spain, pp. 465-471 (2021)
  • T. Picavet, N.‑T. Nguyen, B.‑M. Bui‑Xuan : “Temporal Matching on Geometric Graph Data”, 12^th International Conference on Algorithms and Complexity, Larnaca, Cyprus (2021)
• 2020
  • B.‑M. Bui‑Xuan, H. Hourcade, C. Miachon : “Computing Temporal Twins in Time Logarithmic in History Length”, 9^th International Conference on Complex Networks and their Applications, Madrid, Spain (2020)
  • X. Bui, B.‑M. Bui‑Xuan, L. Chua, M. Hoang Bien : “Intersection graphs of almost subnormal subgroups in general skew linear groups”, (2020)
  • J. Baste, B.‑M. Bui‑Xuan, A. Roux : “Temporal Matching”, Theoretical Computer Science, (Elsevier) (2020)
• 2018
  • J. Baste, B.‑M. Bui‑Xuan : “Temporal matching in link stream: kernel and approximation”, CTW 2018 - 16^th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Paris, France (2018)
• 2016
  • Ch. Huyghues‑Despointes, B.‑M. Bui‑Xuan, C. Magnien : “Forte ∆-connexité dans les flots de liens”, ALGOTEL 2016 - 18^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Bayonne, France (2016)
• 2014
  • B.‑M. Bui‑Xuan, Nick S. Jones : “How modular structure can simplify tasks on networks: parameterizing graph optimization by fast local community detection”, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 470 (2170), pp. 20140224, (Royal Society, The) (2014)
• 2013
  • B.‑M. Bui‑Xuan, J. Telle, M. Vatshelle : “Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems”, Theoretical Computer Science, vol. 511, pp. 66-76, (Elsevier) (2013)
  • B.‑M. Bui‑Xuan, O. Suchy, J. Telle, M. Vatshelle : “Feedback vertex set on graphs of low cliquewidth”, European Journal of Combinatorics, vol. 34 (3), pp. 666-679, (Elsevier) (2013)
• 2012
  • B.‑M. Bui‑Xuan, M. Habib, M. Rao : “Tree-representation of set families and applications to combinatorial decompositions”, European Journal of Combinatorics, vol. 33 (5), pp. 688-711, (Elsevier) (2012)
• 2011
  • B.‑M. Bui‑Xuan, P. Heggernes, D. Meister, A. Proskurowski : “A generic approach to decomposition algorithms, with an application to digraph decomposition”, The 17^th Annual International Computing and Combinatorics Conference (COCOON'11), vol. 6842, Lecture Notes in Computer Science, Dallas, TX, United States, pp. 331-342 (2011)
  • B.‑M. Bui‑Xuan, J.‑F. Raymond, Ph. Trébuchet : “Implantation des algorithmes Oum-Seymour et Oum”, 13^es Journées Graphes et Algorithmes 2011, Lyon, France, pp. 1-23 (2011)
  • B.‑M. Bui‑Xuan, J. Telle, M. Vatshelle : “Boolean-width of graphs”, Theoretical Computer Science, vol. 412 (39), pp. 5187-5204, (Elsevier) (2011)
• 2010
  • B.‑M. Bui‑Xuan, J. Telle, M. Vatshelle : “H-join decomposable graphs and algorithms with runtime single exponential in rankwidth”, Discrete Applied Mathematics, vol. 158 (7), pp. 809-819, (Elsevier) (2010)
  • I. Adler, B.‑M. Bui‑Xuan, Y. Rabinovich, G. Renault, J. Telle, M. Vatshelle : “On the boolean-width of a graph: structure and applications”, Graph Theoretic Concepts in Computer Science - 36^th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers, vol. 6410, Lecture Notes in Computer Science, Zarós, Crete, Greece, pp. 159-170, (Springer) (2010)
• 2009
  • B.‑M. Bui‑Xuan, M. Habib, V. Limouzy, F. De Montgolfier : “Algorithmic aspects of a general modular decomposition theory”, Discrete Applied Mathematics, vol. 157 (9), pp. 1993-2009, (ISBN: 0166-218X) (2009)
  • B.‑M. Bui‑Xuan, J. Telle, M. Vatshelle : “Boolean-width of graphs”, 4^th International Workshop on Parameterized and Exact Computation (IWPEC'09), vol. 5917, Lecture Notes in Computer Science, Denmark, pp. 61-74 (2009)
  • B.‑M. Bui‑Xuan, J. Telle, M. Vatshelle : “Feedback vertex set on graphs of low cliquewidth”, 20^th International Workshop on Combinatorial Algorithms (IWOCA'09), vol. 5874, Lecture Notes in Computer Science, Czech Republic, pp. 113-124 (2009)
  • B.‑M. Bui‑Xuan, M. Habib : “Unifying the representation of symmetric crossing families and weakly partitive families”, European Conference on Combinatorics, Graph Theory and Applications (Eurocomb'09), vol. 34, Electronic Notes in Discrete Mathematics, France, pp. 329-333 (2009)
• 2008
  • B.‑M. Bui‑Xuan, M. Habib, Ch. Paul : “Competitive graph searches”, Theoretical Computer Science, vol. 393 (1-3), pp. 72-80, (ISBN: 0304-3975) (2008)
  • B.‑M. Bui‑Xuan, M. Habib : “A representation theorem for union-difference families and application”, 8^th Latin American Theoretical Informatics (LATIN'08), vol. 4957, Lecture Notes in Computer Science, Brazil, pp. 492-503 (2008)
• 2007
  • B.‑M. Bui‑Xuan, M. Habib, V. Limouzy, F. De Montgolfier : “Unifying two graph decompositions with modular decomposition”, 18^th Annual International Symposium on Algorithms and Computation (ISAAC'07), vol. 4835, Lecture Notes in Computer Science, Japan, pp. 52-64 (2007)
• 2006
  • B.‑M. Bui‑Xuan, M. Habib, V. Limouzy, F. De Montgolfier : “Homogeneity vs. adjacency: generalising some decomposition algorithms”, 32^nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'06), vol. 4271, Lecture Notes in Computer Science, Norway, pp. 278-288 (2006)
• 2005
  • B.‑M. Bui‑Xuan, M. Habib, Ch. Paul : “Revisiting T. Uno and M. Yagiura’s algorithm (extended abstract)”, 16^th Annual International Symposium on Algorithms and Computation (ISAAC'05), vol. 3827, Lecture Notes in Computer Science, China, pp. 146-155 (2005)
• 2003
  • B.‑M. Bui‑Xuan, A. Ferreira, A. Jarry : “Computing shortest, fastest, and foremost journeys in dynamic networks”, International Journal of Foundations of Computer Science, vol. 14 (2), pp. 267-285 (2003)
  • B.‑M. Bui‑Xuan, A. Ferreira, A. Jarry : “Evolving graphs and least cost journeys in dynamic networks”, Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt'03), France, pp. 141-150, (INRIA Press) (2003)