The following pages link to Mamadou Moustapha Kanté (Q344850):
Displaying 50 items.
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs (Q449209) (← links)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- (Q896652) (redirect page) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Computing small pivot-minors (Q1627161) (← links)
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476) (← links)
- Maximal strongly connected cliques in directed graphs: algorithms and bounds (Q1983136) (← links)
- Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (Q1985603) (← links)
- Between clique-width and linear clique-width of bipartite graphs (Q2185929) (← links)
- On the parameterized complexity of the geodesic hull number (Q2272396) (← links)
- Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs (Q2301741) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- On the geodetic rank of a graph (Q2364865) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph (Q2412406) (← links)
- Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640) (← links)
- Vertex-minor reductions can simulate edge contractions (Q2457014) (← links)
- Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) (Q2692778) (← links)
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs (Q2827808) (← links)
- Finding Paths in Grids with Forbidden Transitions (Q2827809) (← links)
- Linear Rank-Width and Linear Clique-Width of Trees (Q2864286) (← links)
- On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs (Q2872098) (← links)
- An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions (Q2927651) (← links)
- Linear Rank-Width of Distance-Hereditary Graphs (Q2945179) (← links)
- Counting Minimal Dominating Sets (Q2988832) (← links)
- $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs (Q3014938) (← links)
- Enumeration of Minimal Dominating Sets and Variants (Q3088292) (← links)
- Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs (Q3449842) (← links)
- Efficient First-Order Model-Checking Using Short Labels (Q3507329) (← links)
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions (Q3508555) (← links)
- On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets (Q4909546) (← links)
- Trees in Graphs with Conflict Edges or Forbidden Transitions (Q4922140) (← links)
- Enumerating Minimal Transversals of Hypergraphs without Small Holes (Q5005157) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- Letter Graphs and Geometric Grid Classes of Permutations (Q5048304) (← links)
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
- (Q5075752) (← links)
- (Q5092436) (← links)
- (Q5136240) (← links)
- On the Enumeration of Minimal Dominating Sets and Related Notions (Q5246092) (← links)
- Connectivity check in 3-connected planar graphs with obstacles (Q5300999) (← links)
- An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion (Q5363767) (← links)
- Directed Rank-Width and Displit Decomposition (Q5851107) (← links)
