Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks. - Binh-Minh Bui-Xuan; Afonso Ferreira; Aubin Jarry (Int. J. Found. Comput. Sci., 2003)

Revisiting T. Uno and M. Yagiura's Algorithm . - Binh-Minh Bui-Xuan; Michel Habib; Christophe Paul (ISAAC, 2005)

Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. - Binh-Minh Bui-Xuan; Michel Habib; Vincent Limouzy; Fabien de Montgolfier (WG, 2006)

Algorithmic Aspects of a Novel Modular Decomposition Theory - Binh-Minh Bui-Xuan; Michel Habib; Vincent Limouzy; Fabien de Montgolfier (CoRR, 2006)

On Modular Decomposition Concepts: the case for Homogeneous Relations. - Binh-Minh Bui-Xuan; Michel Habib; Vincent Limouzy; Fabien de Montgolfier (Electron. Notes Discret. Math., 2006)

Unifying Two Graph Decompositions with Modular Decomposition. - Binh-Minh Bui-Xuan; Michel Habib; Vincent Limouzy; Fabien de Montgolfier (ISAAC, 2007)

A Representation Theorem for Union-Difference Families and Application. - Binh-Minh Bui-Xuan; Michel Habib (LATIN, 2008)

Competitive graph searches. - Binh-Minh Bui-Xuan; Michel Habib; Christophe Paul (Theor. Comput. Sci., 2008)

Tree-Representation of Set Families in Graph Decompositions and Efficient Algorithms. - Binh-Minh Bui-Xuan (2008)

Feedback Vertex Set on Graphs of Low Cliquewidth. - Binh-Minh Bui-Xuan; Jan Arne Telle; Martin Vatshelle (IWOCA, 2009)

Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions - Binh-Minh Bui-Xuan; Jan Arne Telle; Martin Vatshelle (CoRR, 2009)

Algorithmic aspects of a general modular decomposition theory. - Binh-Minh Bui-Xuan; Michel Habib; Vincent Limouzy; Fabien de Montgolfier (Discret. Appl. Math., 2009)

Unifying the representation of symmetric crossing families and weakly partitive families. - Binh-Minh Bui-Xuan; Michel Habib (Electron. Notes Discret. Math., 2009)

On the Boolean-Width of a Graph: Structure and Applications. - Isolde Adler; Binh-Minh Bui-Xuan; Yuri Rabinovich; Gabriel Renault; Jan Arne Telle; Martin Vatshelle (WG, 2010)

H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. - Binh-Minh Bui-Xuan; Jan Arne Telle; Martin Vatshelle (Discret. Appl. Math., 2010)

A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. - Binh-Minh Bui-Xuan; Pinar Heggernes; Daniel Meister 001; Andrzej Proskurowski (COCOON, 2011)

Boolean-width of graphs. - Binh-Minh Bui-Xuan; Jan Arne Telle; Martin Vatshelle (Theor. Comput. Sci., 2011)

Tree-representation of set families and applications to combinatorial decompositions. - Binh-Minh Bui-Xuan; Michel Habib; Michaël Rao (Eur. J. Comb., 2012)

A Note on Graphs of Linear Rank-Width 1. - Binh-Minh Bui-Xuan; Mamadou Moustapha Kanté; Vincent Limouzy (CoRR, 2013)

How modular structure can simplify tasks on networks - Binh-Minh Bui-Xuan; Nick S. Jones (CoRR, 2013)

Feedback vertex set on graphs of low clique-width. - Binh-Minh Bui-Xuan; Ondrej Suchý 001; Jan Arne Telle; Martin Vatshelle (Eur. J. Comb., 2013)

Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. - Binh-Minh Bui-Xuan; Jan Arne Telle; Martin Vatshelle (Theor. Comput. Sci., 2013)

Lightweight FEC: Rectangular Codes with Minimum Feedback Information. - Binh-Minh Bui-Xuan; Pierre Meyer; Antoine Roux (CoRR, 2019)

Computing Temporal Twins in Time Logarithmic in History Length. - Binh-Minh Bui-Xuan; Hugo Hourcade; Cédric Miachon (COMPLEX NETWORKS (2), 2020)

Temporal matching. - Julien Baste; Binh-Minh Bui-Xuan; Antoine Roux (Theor. Comput. Sci., 2020)

Temporal Matching on Geometric Graph Data. - Timothé Picavet; Ngoc-Trung Nguyen; Binh-Minh Bui-Xuan (CIAC, 2021)

Foremost Non-stop Journey Arrival in Linear Time. - Juan Villacis-Llobet; Binh-Minh Bui-Xuan; Maria Potop-Butucaru (SIROCCO, 2022)

Computing small temporal modules in time logarithmic in history length. - Binh-Minh Bui-Xuan; Hugo Hourcade; Cédric Miachon (Soc. Netw. Anal. Min., 2022)

Distributed computation of temporal twins in periodic undirected time-varying graphs. - Lina Azerouk; Binh-Minh Bui-Xuan; Camille Palisoc; Maria Potop-Butucaru; Massinissa Tighilt (CoRR, 2024)