Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 18 results in range #1 to #18.
- Which Spheres are Shellable?: Label: en
- Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations: Label: en
- Local Unimodularity in the Matching Polytope: Label: en
- On the Edge-Coloring Property for the Closure of the Complete Hypergraphs: Label: en
- An Analysis of the Greedy Heuristic for Independence Systems: Label: en
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations: Label: en
- A Representation of 2-dimensional Pseudomanifolds and its use in the Design of a Linear-Time Shelling Algorithm: Label: en
- An Inequality on Binomial Coefficients: Label: en
- Subtree Isomorphism in O(n5/2): Label: en
- The Dilworth Number of a Graph: Label: en
- Complexity of Monotone Networks for Computing Conjunctions: Label: en
- Steiner Trees for Ladders: Label: en
- Two Results Concerning Multicoloring: Label: en
- A characterization of Pseudo-Affine Designs and their Relation to a Problem of Cordes: Label: en
- Biased Positional Games: Label: en
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints: Label: en
- A Unified Setting for Selection Algorithms (II): Label: en
- Abstract: Label: en
