Pages that link to "Item:Q3852222"
From MaRDI portal
The following pages link to Algorithmic Aspects of Combinatorics (Q3852222):
Displaying 18 items.
- Abstract (Q3852223) (← links)
- A Unified Setting for Selection Algorithms (II) (Q3855214) (← links)
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints (Q4151722) (← links)
- Biased Positional Games (Q4152069) (← links)
- A characterization of Pseudo-Affine Designs and their Relation to a Problem of Cordes (Q4152550) (← links)
- Two Results Concerning Multicoloring (Q4152560) (← links)
- Complexity of Monotone Networks for Computing Conjunctions (Q4163136) (← links)
- Steiner Trees for Ladders (Q4163245) (← links)
- The Dilworth Number of a Graph (Q4170758) (← links)
- An Inequality on Binomial Coefficients (Q4172053) (← links)
- Subtree Isomorphism in O(n5/2) (Q4172071) (← links)
- A Representation of 2-dimensional Pseudomanifolds and its use in the Design of a Linear-Time Shelling Algorithm (Q4172654) (← links)
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations (Q4173359) (← links)
- An Analysis of the Greedy Heuristic for Independence Systems (Q4174528) (← links)
- On the Edge-Coloring Property for the Closure of the Complete Hypergraphs (Q4175571) (← links)
- Local Unimodularity in the Matching Polytope (Q4182243) (← links)
- Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations (Q4182792) (← links)
- Which Spheres are Shellable? (Q4185520) (← links)
