The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- On shellsort and the Frobenius problem (Q1825677) (← links)
- Minimax relations for the partial q-colorings of a graph (Q1825878) (← links)
- Regular non-additive measure and Choquet integral (Q1826623) (← links)
- Poset-valued sets or how to build models for linear logics (Q1826627) (← links)
- Possible worlds and resources: The semantics of \(\mathbf{BI}\) (Q1826634) (← links)
- Symmetric Pascal matrices modulo \(p\) (Q1826963) (← links)
- Steinitz classes of unimodular lattices (Q1826966) (← links)
- Separating NC along the \(\delta\) axis (Q1827390) (← links)
- An infinite family of cubic edge- but not vertex-transitive graphs (Q1827676) (← links)
- Competition polysemy (Q1827753) (← links)
- A note on edge-decompositions of planar graphs (Q1827795) (← links)
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins (Q1827853) (← links)
- An optimal test on finite unavoidable sets of words (Q1836993) (← links)
- On the complexity of locating linear facilities in the plane (Q1837617) (← links)
- On spherical t-designs in \(R^ 2\). (Q1837694) (← links)
- Compactness results in extremal graph theory (Q1837701) (← links)
- A data structure for dynamic trees (Q1838310) (← links)
- Log-logarithmic worst-case range queries are possible in space theta(N) (Q1838333) (← links)
- An extension of Christofides heuristic to the k-person travelling salesman problem (Q1838426) (← links)
- On the existence of Hamiltonian cycles in a class of random graphs (Q1838982) (← links)
- Subtle cardinals and linear orderings (Q1840455) (← links)
- Provable security against a differential attack (Q1842516) (← links)
- On the number of latent subsets of intersecting collections (Q1843569) (← links)
- Computer methods for sampling from gamma, beta, Poisson and binomial distributions (Q1845456) (← links)
- Solution of a problem of A. Ehrenfeucht and J. Mycielski (Q1846871) (← links)
- Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound (Q1847179) (← links)
- Heuristics for the container loading problem (Q1847185) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- Local analysis of a new multipliers method (Q1848393) (← links)
- A Data Complexity Analysis of Comparative Advantages of Decision Forest Constructors (Q1849233) (← links)
- Bagging, boosting and the random subspace method for linear classifiers (Q1849236) (← links)
- The mathematics of playing golf, or: A new class of difficult nonlinear mixed integer programs (Q1849260) (← links)
- History of mathematical programming in the USSR: Analyzing the phenomenon (Q1849523) (← links)
- The many facets of linear programming (Q1849524) (← links)
- Passive robust fault detection using fuzzy parity equations (Q1849816) (← links)
- Hamilton cycles in random subgraphs of pseudo-random graphs (Q1849919) (← links)
- Kleitman and combinatorics: A celebration (Q1850008) (← links)
- On the number of vertices belonging to all maximum stable sets of a graph (Q1850112) (← links)
- The excluded minors for GF(4)-representable matroids (Q1850480) (← links)
- Kneser graphs are Hamiltonian for \(n\geq 3k\) (Q1850485) (← links)
- Chromatic roots and Hamiltonian paths (Q1850497) (← links)
- On the dissection of rectangles into right-angled isosceles triangles (Q1850503) (← links)
- Some results related to the evasiveness conjecture. (Q1850513) (← links)
- A characterisation of Pfaffian near bipartite graphs (Q1850543) (← links)
- Covering non-uniform hypergraphs (Q1850546) (← links)
- Decomposing a planar graph into an independent set and a 3-degenerate graph (Q1850567) (← links)
- Long cycles in 3-connected graphs (Q1850624) (← links)
- On matroids of branch-width three. (Q1850629) (← links)
- Downward sets and their separation and approximation properties (Q1850830) (← links)
- On monopolistic licensing strategies under asymmetric information (Q1851234) (← links)
