Binh-Minh Bui-Xuan

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 8

Top Venues

CoRR

Soc. Netw. Anal. Min.

COMPLEX NETWORKS (2)

CIAC

Montpellier 2 University, France (PHD)

Education History

Montpellier 2 University, France

PHD

Publications

Lina Azerouk, Binh-Minh Bui-Xuan, Camille Palisoc, Maria Potop-Butucaru, Massinissa Tighilt
Distributed computation of temporal twins in periodic undirected time-varying graphs. CoRR (2024)
Binh-Minh Bui-Xuan, Hugo Hourcade, Cédric Miachon
Computing small temporal modules in time logarithmic in history length. Soc. Netw. Anal. Min. 12 (1) (2022)
Juan Villacis-Llobet, Binh-Minh Bui-Xuan, Maria Potop-Butucaru
Foremost Non-stop Journey Arrival in Linear Time. SIROCCO (2022)
Timothe Picavet, Ngoc-Trung Nguyen, Binh-Minh Bui-Xuan
Temporal Matching on Geometric Graph Data. CIAC (2021)
Binh-Minh Bui-Xuan, Hugo Hourcade, Cédric Miachon
Computing Temporal Twins in Time Logarithmic in History Length. COMPLEX NETWORKS (2) (2020)
Julien Baste, Binh-Minh Bui-Xuan, Antoine Roux
Temporal matching. Theor. Comput. Sci. 806 (2020)
Binh-Minh Bui-Xuan, Pierre Meyer, Antoine Roux
Lightweight FEC: Rectangular Codes with Minimum Feedback Information. CoRR (2019)
Julien Baste, Binh-Minh Bui-Xuan, Antoine Roux
Temporal Matching. CoRR (2018)
Binh-Minh Bui-Xuan, Nick S. Jones
How modular structure can simplify tasks on networks CoRR (2013)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theor. Comput. Sci. 511 (2013)
Binh-Minh Bui-Xuan, Mamadou Moustapha Kanté, Vincent Limouzy
A Note on Graphs of Linear Rank-Width 1. CoRR (2013)
Binh-Minh Bui-Xuan, Ondrej Suchý, Jan Arne Telle, Martin Vatshelle
Feedback vertex set on graphs of low clique-width. Eur. J. Comb. 34 (3) (2013)
Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao
Tree-representation of set families and applications to combinatorial decompositions. Eur. J. Comb. 33 (5) (2012)
Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski
A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. COCOON (2011)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
Boolean-width of graphs. Theor. Comput. Sci. 412 (39) (2011)
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)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discret. Appl. Math. 158 (7) (2010)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions CoRR (2009)
Binh-Minh Bui-Xuan, Michel Habib
Unifying the representation of symmetric crossing families and weakly partitive families. Electron. Notes Discret. Math. 34 (2009)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
Feedback Vertex Set on Graphs of Low Cliquewidth. IWOCA (2009)
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle
Boolean-Width of Graphs. IWPEC (2009)
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
Algorithmic aspects of a general modular decomposition theory. Discret. Appl. Math. 157 (9) (2009)
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
Competitive graph searches. Theor. Comput. Sci. 393 (1-3) (2008)
Binh-Minh Bui-Xuan, Michel Habib
A Representation Theorem for Union-Difference Families and Application. LATIN (2008)
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
Unifying Two Graph Decompositions with Modular Decomposition. ISAAC (2007)
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. WG (2006)
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
Homogeneity vs. Adjacency: generalising some graph decomposition algorithms CoRR (2006)
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
On Modular Decomposition Concepts: the case for Homogeneous Relations. Electron. Notes Discret. Math. 27 (2006)
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
Algorithmic Aspects of a Novel Modular Decomposition Theory CoRR (2006)
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
Unifying two Graph Decompositions with Modular Decomposition CoRR (2006)
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
Revisiting T. Uno and M. Yagiura's Algorithm . ISAAC (2005)
Binh-Minh Bui-Xuan, Afonso Ferreira, Aubin Jarry
Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks. Int. J. Found. Comput. Sci. 14 (2) (2003)

Binh-Minh Bui-Xuan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Binh-Minh Bui-Xuan