Binh-Minh Bui-Xuan

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

Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle · Theoretical Computer Science · 2013 · 85 citations

Natural Sciences, Computer Science, Mathematics +12

Boolean-width of graphs

Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle · Theoretical Computer Science · 2011 · 75 citations

<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>H</mml:mi></mml:math>-join decomposable graphs and algorithms with runtime single exponential in rankwidth

Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle · Discrete Applied Mathematics · 2009 · 43 citations

Computing, Computer Science, Mathematics +8

Evolving graphs and least cost journeys in dynamic networks

Binh-Minh Bui-Xuan, Afonso Ferreira, Aubin Jarry · HAL (Le Centre pour la Communication Scientifique Directe) · 2003 · 35 citations · Full text

Computing, Transportation Planning, Computer Networks +16

Feedback vertex set on graphs of low clique-width

Binh-Minh Bui-Xuan, Ondřej Suchý, Jan Arne Telle et al. · European Journal of Combinatorics · 2012 · 17 citations

Computing, Computer Science, Combinatorics +7