The following pages link to Arnaud Mary (Q507533):
Displaying 19 items.
- Algorithms for \(k\)-meet-semidistributive lattices (Q507534) (← links)
- Token jumping in minor-closed classes (Q1679965) (← links)
- Reconfiguration of graphs with connectivity constraints (Q1757779) (← links)
- An average study of hypergraphs and their minimal transversals (Q2355712) (← links)
- On Maximal Chain Subgraphs and Covers of Bipartite Graphs (Q2819498) (← links)
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs (Q2827808) (← links)
- On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs (Q2872098) (← links)
- Incremental Complexity of a Bi-objective Hypergraph Transversal Problem (Q2947881) (← links)
- Enumeration of Minimal Dominating Sets and Variants (Q3088292) (← links)
- Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs (Q3449842) (← links)
- (Q4601904) (← links)
- Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension (Q4636778) (← links)
- On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets (Q4909546) (← links)
- The Perfect Matching Reconfiguration Problem (Q5092444) (← links)
- (Q5226843) (← links)
- On the Enumeration of Minimal Dominating Sets and Related Notions (Q5246092) (← links)
- A general framework for enumerating equivalence classes of solutions (Q6046942) (← links)
- Making Sense of a Cophylogeny Output: Efficient Listing of Representative Reconciliations (Q6133862) (← links)
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes (Q6145807) (← links)
