The following pages link to (Q3116854):
Displaying 29 items.
- On geometric posets and partial matroids (Q783288) (← links)
- Games on concept lattices: Shapley value and core (Q897583) (← links)
- Order quasisymmetric functions distinguish rooted trees (Q1686218) (← links)
- Aggregation and residuation (Q1943691) (← links)
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
- Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity (Q2012049) (← links)
- Cuts of poset-valued functions in the framework of residuated maps (Q2035272) (← links)
- A study of algorithms relating distributive lattices, median graphs, and Formal Concept Analysis (Q2076999) (← links)
- Distributive lattices and Auslander regular algebras (Q2078872) (← links)
- Congruences on lattices and lattice-valued functions (Q2093984) (← links)
- Invariant computation in a poset. Convergence to a chain (Q2140989) (← links)
- Unit representation of semiorders. I: Countable sets (Q2244623) (← links)
- \(d\)-complete posets: local structural axioms, properties, and equivalent definitions (Q2279674) (← links)
- Complexity results for extensions of median orders to different types of remoteness (Q2348767) (← links)
- Dichotomic lattices and local discretization for Galois lattices (Q2418288) (← links)
- Finite dimensional scattered posets (Q2434747) (← links)
- On the number of non-dominated points of a multicriteria optimization problem (Q2446874) (← links)
- Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree. (Q2454050) (← links)
- Embedding ordered sets into distributive lattices (Q2520717) (← links)
- A theoretical look at \textsc{Electre Tri}-nB and related sorting models (Q2688878) (← links)
- Quantified Conjunctive Queries on Partially Ordered Sets (Q2946013) (← links)
- From Meaningful Orderings in the Web of Data to Multi-level Pattern Structures (Q3388221) (← links)
- Model checking existential logic on partially ordered sets (Q4635604) (← links)
- Towards Distributivity in FCA for Phylogenetic Data (Q5054987) (← links)
- Benchmarking over Distributive Lattices (Q5115733) (← links)
- A Note on Candeal and Induráin’s Semiorder Separability Condition (Q5132597) (← links)
- Bacterial phylogeny in the Cayley graph (Q5242833) (← links)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
- Information lattice learning (Q6488796) (← links)
