Binh-Minh Bui-Xuan

发表

Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms pdf

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

Boolean-width of graphs

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

Competitive graph searches

Michel Habib, Christophe Paul, Binh-Minh Bui-Xuan, 2008, Theor. Comput. Sci..

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..

Implantation des algorithmes Oum-Seymour et Oum

Binh-Minh Bui-Xuan, Philippe Trébuchet, Jean-Florent Raymond, 2011 .

On Modular Decomposition Concepts: the case for Homogeneous Relations

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

Algorithmic Aspects of a Novel Modular Decomposition Theory pdf

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

Unifying the representation of symmetric crossing families and weakly partitive families

Michel Habib, Binh-Minh Bui-Xuan, 2009, Electron. Notes Discret. Math..

Evolving graphs and least cost journeys in dynamic networks

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

Feedback vertex set on graphs of low clique-width

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

Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms

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

Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions pdf

Jan Arne Telle, Martin Vatshelle, Binh-Minh Bui-Xuan, 2009, ArXiv.

Revisiting T. Uno and M. Yagiura's Algorithm

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

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

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

Tree-representation of set families and applications to combinatorial decompositions

Michel Habib, Michaël Rao, Binh-Minh Bui-Xuan, 2012, Eur. J. Comb..

Feedback Vertex Set on Graphs of Low Cliquewidth

Jan Arne Telle, Martin Vatshelle, Binh-Minh Bui-Xuan, 2009, IWOCA.

Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks

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

A Representation Theorem for Union-Difference Families and Application

Michel Habib, Binh-Minh Bui-Xuan, 2008, LATIN.

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

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

Algorithmic aspects of a general modular decomposition theory

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

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..

Boolean-Width of Graphs

Jan Arne Telle, Martin Vatshelle, Binh-Minh Bui-Xuan, 2009, IWPEC.

Temporal Matching

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

Unifying Two Graph Decompositions with Modular Decomposition

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

A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition

Pinar Heggernes, Daniel Meister, Binh-Minh Bui-Xuan, 2011, COCOON.

Lightweight FEC: Rectangular Codes with Minimum Feedback Information pdf

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

A Note on Graphs of Linear Rank-Width 1 pdf

Mamadou Moustapha Kanté, Binh-Minh Bui-Xuan, Vincent Limouzy, 2013, ArXiv.

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.

Temporal Matching on Geometric Graph Data

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

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.

Representation theorems for two set families and applications to combinatorial decompositions

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

H-join and algorithms on graphs of bounded rankwidth (SODA submission) a

Jan Arne Telle, Binh-Minh Bui-Xuan, 2008 .

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 .

A new tractable combinatorial decomposition

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