Wiley‐Interscience Series in Discrete Mathematics and Optimization

382 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

The chromatic number of the square of subcubic planar graphs (2016, methodology): “Conjecture 7 was also made by Jensen and Toft [20].”
Topology of random simplicial complexes: a survey (2013, methodology): “See, for example, Chapter 8 of [3] to learn how to prove limit theorems like this using the method of moments.”
Railway Track Allocation: Models and Algorithms (2012, methodology): “We use in this thesis the definitions and notation of Grötschel, Lovász & Schrijver (1988) [104] and Nemhauser & Wolsey (1988) [167] for graphs, linear programs (LPs), and mixed integer programs (MIPs).”
Error estimates and convergence rates for the stochastic homogenization of Hamilton-Jacobi equations (2012, methodology): “See McDiarmind [27] and Alon and Spencer [2] for an overview of this probabilistic method, as well as a proof of Azuma’s inequality, which is stated as follows.”
Gumbel fluctuations for cover times in the discrete torus (2012, background): “99 in [4]) to the martingale Yτn we get that the first probability on the right-hand side is bounded above by cN ce−cN λ , and by a standard large deviations bound the second probability is bounded above by e−cN 2+λ , so since cN ce−cN λ ≤ (r1/r2) d−2 for N ≥ c(λ) we get (1.”