The following pages link to Binh-Minh Bui-Xuan (Q392024):
Displaying 16 items.
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- Boolean-width of graphs (Q719257) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- Feedback vertex set on graphs of low clique-width (Q1933648) (← links)
- Foremost non-stop journey arrival in linear time (Q2097355) (← links)
- Temporal matching (Q2285132) (← links)
- Competitive graph searches (Q2481952) (← links)
- Temporal matching on geometric graph data (Q2692739) (← links)
- On the Boolean-Width of a Graph: Structure and Applications (Q3057622) (← links)
- A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition (Q3087961) (← links)
- On Modular Decomposition Concepts: the case for Homogeneous Relations (Q3439506) (← links)
- Feedback Vertex Set on Graphs of Low Cliquewidth (Q3651539) (← links)
- Boolean-Width of Graphs (Q3656851) (← links)
- Unifying Two Graph Decompositions with Modular Decomposition (Q5387745) (← links)
- Algorithms and Computation (Q5897848) (← links)
