Pages that link to "Item:Q2706174"

The following pages link to SIAM Journal on Discrete Mathematics (Q2706174):

Displaying 50 items.

• Lattice 3-polytopes with six lattice points (Q161309) (← links)
• Lattice 3-polytopes with few lattice points (Q161310) (← links)
• Bipartitions of highly connected tournaments (Q322194) (← links)
• Subset-restricted interchange for dynamic min-max scheduling problems (Q2706175) (← links)
• Exact analysis of exact change: The \(k\)-payment problem (Q2706177) (← links)
• Graph searching and interval completion (Q2706178) (← links)
• Learning deterministic finite automata from smallest counterexamples (Q2706180) (← links)
• Bounds for codes identifying vertices in the hexagonal grid (Q2706181) (← links)
• Approximating fractional multicommodity flow independent of the number of commodities (Q2706182) (← links)
• Well-spaced labelings of points in rectangular grids (Q2706183) (← links)
• Learning polynomials with queries: The highly noisy case (Q2706184) (← links)
• Uniqueness of some resolution IV two-level regular fractional factorial designs (Q2706185) (← links)
• Improved algorithms and analysis for secretary problems and generalizations (Q2706186) (← links)
• Labeling products of complete graphs with a condition at distance two (Q2706187) (← links)
• Sufficient conditions for two tree reconstruction techniques to succeed on sufficiently long sequences (Q2706188) (← links)
• Compact representations of cuts (Q2706189) (← links)
• Better approximation guarantees for job-shop scheduling (Q2706190) (← links)
• Enumeration of equicolorable trees (Q2706191) (← links)
• A note on a question of C. D. Savage (Q2706193) (← links)
• Cyclic chromatic number of 3-connected plane graphs (Q2706194) (← links)
• Approximate edge splitting (Q2706195) (← links)
• Extremal properties for dissections of convex 3-polytopes (Q2706196) (← links)
• On the distribution of Diffie-Hellman triples with sparse exponents (Q2706197) (← links)
• Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph (Q2706198) (← links)
• Compact representations of the intersection structure of families of finite sets (Q2706199) (← links)
• Sorting strings by reversals and by transpositions (Q2706200) (← links)
• The wakeup problem in synchronous broadcast systems (Q2719162) (← links)
• A new property and a faster algorithm for baseball elimination (Q2719163) (← links)
• A lower bound for Heilbronn's triangle problem in \(d\) dimensions (Q2719164) (← links)
• A note on iterating an \(\alpha\)-ary Gray code (Q2719165) (← links)
• The number of irreducible polynomials and Lyndon words with given trace (Q2719166) (← links)
• A 0. 5-approximation algorithm for MAX DICUT with given sizes of parts (Q2719167) (← links)
• Optimal \((9v,4,1)\) optical orthogonal codes (Q2719168) (← links)
• On the optimality of general lower bounds for broadcasting and gossiping (Q2719169) (← links)
• Construction of Ferrero pairs of all possible orders (Q2719170) (← links)
• Monochromatic partitions of complete uniform hypergraphs (Q2719171) (← links)
• An efficient algorithm for the ring loading problem with integer demand splitting (Q2719172) (← links)
• On lower bounds for selecting the median (Q2719173) (← links)
• Median selection requires \((2+\varepsilon)n\) comparisons (Q2719174) (← links)
• The maximum edge-disjoint paths problem in bidirected trees (Q2753529) (← links)
• Partitions and (\(m\) and \(n\)) sums of products -- two cell partition (Q2753530) (← links)
• Minimum span of no-hole \((r+1)\)-distant colorings (Q2753531) (← links)
• Transformations on regular nondominated coteries and their applications (Q2753532) (← links)
• On approximating the achromatic number (Q2753533) (← links)
• A hypergraph approach to the identifying parent property: The case of multiple parents (Q2753534) (← links)
• Forcing structures and cliques in uniquely vertex colorable graphs (Q2753535) (← links)
• Blocking semiovals of type \((1,m+1,n+1)\) (Q2753536) (← links)
• An optimal online algorithm for bounded space variable-sized bin packing (Q2753537) (← links)
• Classification of homomorphisms to oriented cycles and of \(k\)-partite satisfiability (Q2753538) (← links)
• Equireplicate balanced binary codes for oligo arrays (Q2753539) (← links)