The following pages link to (Q3768905):
Displaying 25 items.
- The convolution ring of arithmetic functions and symmetric polynomials (Q370858) (← links)
- Application of entropy compression in pattern avoidance (Q405191) (← links)
- The interlace polynomial of a graph (Q705880) (← links)
- Central configurations in the spatial \(n\)-body problem for \(n=5,6\) with equal masses (Q828900) (← links)
- Parametric stable marriage and minimum cuts (Q913621) (← links)
- Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties (Q1018085) (← links)
- Experiments with parallel algorithms for combinatorial problems (Q1095034) (← links)
- An algorithm for determining an opaque minimal forest of a convex polygon (Q1107998) (← links)
- Linear programming brings marital bliss (Q1122480) (← links)
- A fast algorithm for the generalized parametric minimum cut problem and applications (Q1186785) (← links)
- The complexity of circuit value and network stability (Q1190989) (← links)
- On characterization of state transition graph of additive cellular automata based on depth (Q1194252) (← links)
- Stirling networks: A versatile combinatorial topology for multiprocessor systems (Q1199419) (← links)
- A new fixed point approach for stable networks and stable marriages (Q1201153) (← links)
- Network flow and 2-satisfiability (Q1317481) (← links)
- Spectral properties of some matrices close to the Toeplitz triangular form (Q1323624) (← links)
- Approximating the negative moments of the Poisson distribution. (Q1423031) (← links)
- Hierarchical enumeration of Kekulé's benzenes, Ladenburg's benzenes, Dewar's benzenes, and benzvalenes by using combined-permutation representations (Q1617565) (← links)
- Characterization of rankings generated by linear discriminant analysis (Q1765619) (← links)
- Combinatorial approach to group hierarchy for stereoskeletons of ligancy 4 (Q2353556) (← links)
- Polynomial time algorithm for an optimal stable assignment with multiple partners (Q2373720) (← links)
- Sphericities of double cosets, double coset representations, and Fujita's proligand method for combinatorial enumeration of stereoisomers (Q2385387) (← links)
- Minimizing maximum fiber requirement in optical networks (Q2581759) (← links)
- Multi-Center Clinical Trials with Random Enrollment: Theoretical Approximations (Q4681059) (← links)
- On the set of stable matchings in a bipartite graph (Q6078002) (← links)
