17 results on '"Bui-Xuan, Binh-Minh"'
Search Results
2. Temporal Matching on Geometric Graph Data
3. Computing Temporal Twins in Time Logarithmic in History Length
4. Computing small temporal modules in time logarithmic in history length
5. A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition
6. On the Boolean-Width of a Graph: Structure and Applications
7. Feedback Vertex Set on Graphs of Low Cliquewidth
8. Temporal matching
9. Unifying Two Graph Decompositions with Modular Decomposition
10. How modular structure can simplify tasks on networks: parameterizing graph optimization by fast local community detection
11. Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
12. Feedback vertex set on graphs of low clique-width
13. Tree-representation of set families and applications to combinatorial decompositions
14. Boolean-width of graphs
15. H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
16. Competitive graph searches
17. On Modular Decomposition Concepts: the case for Homogeneous Relations
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.