The following pages link to ``Integer-making'' theorems (Q1158443):
Displaying 50 items.
- A note on the discrepancy of matrices with bounded row and column sums (Q488272) (← links)
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- The cycle discrepancy of three-regular graphs (Q659662) (← links)
- Semidefinite optimization in discrepancy theory (Q715251) (← links)
- Balancing matrices with line shifts (Q795048) (← links)
- Multiterminal global routing: A deterministic approximation scheme (Q916369) (← links)
- Coloring the projective plane (Q922552) (← links)
- Discrepancy and signed domination in graphs and hypergraphs (Q982615) (← links)
- Discrepancy of set-systems and matrices (Q1084393) (← links)
- Probabilistic methods (Q1091406) (← links)
- The smallest n-uniform hypergraph with positive discrepancy (Q1093653) (← links)
- Global wire routing in two-dimensional arrays (Q1097238) (← links)
- Probabilistic construction of deterministic algorithms: approximating packing integer programs (Q1112724) (← links)
- Balanced two-colorings of finite sets in the cube (Q1113937) (← links)
- Discrete ham sandwich theorems (Q1160184) (← links)
- Balanced two-colorings of finite sets in the square. I (Q1167205) (← links)
- Irregularities of two-colourings of the NxN square lattice (Q1172093) (← links)
- Transmitting in the \(n\)-dimensional cube (Q1199408) (← links)
- Integer programming in VLSI design (Q1201818) (← links)
- Signed domination in regular graphs and set-systems (Q1306310) (← links)
- On sparse approximations to randomized strategies and convex combinations (Q1322876) (← links)
- On some geometric methods in scheduling theory: A survey (Q1337673) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- A note on the Beck-Fiala theorem (Q1375063) (← links)
- The Kadison-Singer problem in discrepancy theory. (Q1427482) (← links)
- The convexification effect of Minkowski summation (Q1755914) (← links)
- A Beck-Fiala-type theorem for Euclidean norms (Q1814084) (← links)
- Typical rounding problems (Q1884960) (← links)
- The continuous Beck-Fiala theorem is optimal (Q1903712) (← links)
- Polychromatic colorings and cover decompositions of hypergraphs (Q2007510) (← links)
- Gaussian discrepancy: a probabilistic relaxation of vector balancing (Q2081474) (← links)
- Upper and lower bounds for matrix discrepancy (Q2090579) (← links)
- Polychromatic colorings of hypergraphs with high balance (Q2129929) (← links)
- Improved distributed degree splitting and edge coloring (Q2189174) (← links)
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) (Q2373936) (← links)
- On the \(L_{2}\)-discrepancy (Q2381825) (← links)
- On balanced colorings of sparse hypergraphs (Q2439128) (← links)
- Non-independent randomized rounding and coloring (Q2489958) (← links)
- A combinatorial proof of Fisher's inequality (Q2657061) (← links)
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
- On the number of zero-patterns of a sequence of polynomials (Q2719034) (← links)
- Better Bin Packing Approximations via Discrepancy Theory (Q2816297) (← links)
- Constructive Discrepancy Minimization for Convex Sets (Q2968153) (← links)
- Approximation-Friendly Discrepancy Rounding (Q3186517) (← links)
- Integral approximation sequences (Q3343105) (← links)
- Constructive Discrepancy Minimization by Walking on the Edges (Q3449569) (← links)
- Edge Coloring and Decompositions of Weighted Graphs (Q3541103) (← links)
- Six Standard Deviations Suffice (Q3698810) (← links)
- (Q3967613) (← links)
- An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound (Q4634029) (← links)
