22 results on '"KANTÉ, MAMADOU MOUSTAPHA"'
Search Results
2. Computing Small Pivot-Minors
3. Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph
4. An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width
5. Counting Minimal Dominating Sets
6. Minimal Dominating Set Enumeration
7. Finding Paths in Grids with Forbidden Transitions
8. A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
9. Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
10. Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
11. Linear Rank-Width of Distance-Hereditary Graphs
12. Linear Rank-Width and Linear Clique-Width of Trees
13. On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs
14. Trees in Graphs with Conflict Edges or Forbidden Transitions
15. An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions
16. Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs
17. On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets
18. Enumeration of Minimal Dominating Sets and Variants
19. -Rank-Width of (Edge-Colored) Graphs
20. Directed Rank-Width and Displit Decomposition
21. Efficient First-Order Model-Checking Using Short Labels
22. Graph Operations Characterizing Rank-Width and Balanced Graph Expressions
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.