Binh-Minh Bui-Xuan

发表

Link Stream Edition: Sparse Split and Bi-Sparse Split ?

Clémence Magnien, Binh-Minh Bui-Xuan, Pierre Meyer, 2019 .

Fast algorithms for vertex subset and vertex partitioning problems on graphs of low boolean-width ⋆

J. A. Telle, M. Vatshelle, Binh-Minh Bui-Xuan, 2009 .

A new tractable combinatorial decomposition

Michel Habib, Fabien de Montgolfier, Binh-Minh Bui-Xuan, 2007 .

Algorithms for vertex subset and vertex partitioning problems with runtime single exponential in rankwidth

J. A. Telle, M. Vatshelle, Binh-Minh Bui-Xuan, 2008 .

Representation theorems for two set families and applications to combinatorial decompositions

Michel Habib, Michaël Rao, Binh-Minh Bui-Xuan, 2008 .

Divide and Conquer Revisited. Application to Graph Algorithms

M. Habib, C. Paul, Binh-Minh Bui-Xuan, 2020 .

Intersection graphs of almost subnormal subgroups in general skew linear groups

M. H. Bien, Binh-Minh Bui-Xuan, B. X. Hai, 2020, 2002.06522.

How modular structure can simplify tasks on networks: parameterizing graph optimization by fast local community detection

Nick S. Jones, Binh-Minh Bui-Xuan, N. Jones, 2013, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

fast local community detection networks: parameterizing graph optimization by How modular structure can simplify tasks on

Nick S. Jones, Binh-Minh Bui-Xuan, N. Jones, 2014 .

Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks

Afonso Ferreira, Aubin Jarry, Binh-Minh Bui-Xuan, 2003, Int. J. Found. Comput. Sci..

Evolving graphs and least cost journeys in dynamic networks

Afonso Ferreira, Aubin Jarry, Binh-Minh Bui-Xuan, 2003 .

Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems

Jan Arne Telle, Martin Vatshelle, Binh-Minh Bui-Xuan, 2013, Theor. Comput. Sci..

Algorithmic aspects of a general modular decomposition theory

Michel Habib, Fabien de Montgolfier, Binh-Minh Bui-Xuan, 2006, Discret. Appl. Math..

Boolean-width of graphs

Jan Arne Telle, Martin Vatshelle, Binh-Minh Bui-Xuan, 2009, Theor. Comput. Sci..

On the Boolean-Width of a Graph: Structure and Applications

Gabriel Renault, Jan Arne Telle, Martin Vatshelle, 2009, WG.

Feedback vertex set on graphs of low clique-width

Jan Arne Telle, Ondrej Suchý, Martin Vatshelle, 2013, Eur. J. Comb..

H-join decomposable graphs and algorithms with runtime single exponential in rankwidth

Jan Arne Telle, Martin Vatshelle, Binh-Minh Bui-Xuan, 2010, Discret. Appl. Math..

Lightweight FEC: Rectangular Codes with Minimum Feedback Information pdf

Binh-Minh Bui-Xuan, Antoine Roux, Pierre Meyer, 2019, ArXiv.

Computing small temporal modules in time logarithmic in history length

Binh-Minh Bui-Xuan, Cédric Miachon, Hugo Hourcade, 2021, Social Network Analysis and Mining.

Temporal Matching on Geometric Graph Data

Binh-Minh Bui-Xuan, Timothe Picavet, Ngoc-Trung Nguyen, 2021, CIAC.

Computing Temporal Twins in Time Logarithmic in History Length

Binh-Minh Bui-Xuan, C. Miachon, Hugo Hourcade, 2020, COMPLEX NETWORKS.

Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms pdf

Michel Habib, Fabien de Montgolfier, Binh-Minh Bui-Xuan, 2006, WG.

Algorithmic Aspects of a Novel Modular Decomposition Theory pdf

Michel Habib, Fabien de Montgolfier, Binh-Minh Bui-Xuan, 2006, ArXiv.

Unifying Two Graph Decompositions with Modular Decomposition

Michel Habib, Fabien de Montgolfier, Binh-Minh Bui-Xuan, 2006, ISAAC.

Tree-Representation of Set Families in Graph Decompositions and Efficient Algorithms

Binh-Minh Bui-Xuan, Binh-Minh Bui-Xuan, 2008 .

Temporal Matching

Binh-Minh Bui-Xuan, Julien Baste, Antoine Roux, 2018, Theor. Comput. Sci..

Revisiting T. Uno and M. Yagiura's Algorithm

Michel Habib, Christophe Paul, Binh-Minh Bui-Xuan, 2005, ISAAC.