Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Kannan, R.
1994.
Markov chains and polynomial time algorithms.
p.
656.
Alon, N.
Frieze, A.
and
Welsh, D.
1994.
Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs.
p.
24.
Sekine, Kyoko
Imai, Hiroshi
and
Tani, Seiichiro
1995.
Algorithms and Computations.
Vol. 1004,
Issue. ,
p.
224.
Alon, Noga
Frieze, Alan
and
Welsh, Dominic
1995.
Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case.
Random Structures & Algorithms,
Vol. 6,
Issue. 4,
p.
459.
Diaconis, Persi
and
Holmes, Susan
1995.
Discrete Probability and Algorithms.
Vol. 72,
Issue. ,
p.
43.
Welsh, Dominic
1995.
Discrete Probability and Algorithms.
Vol. 72,
Issue. ,
p.
133.
Linial, Nathan
London, Eran
and
Rabinovich, Yuri
1995.
The geometry of graphs and some of its algorithmic applications.
Combinatorica,
Vol. 15,
Issue. 2,
p.
215.
Frieze, Alan
and
Jerrum, Mark
1995.
Integer Programming and Combinatorial Optimization.
Vol. 920,
Issue. ,
p.
1.
Imai, Hiroshi
Iwata, Satoru
Sekine, Kyoko
and
Yoshida, Kensyu
1996.
Computing and Combinatorics.
Vol. 1090,
Issue. ,
p.
68.
Haxell, P. E.
and
Loebl, M.
1997.
Algorithms and Computation.
Vol. 1350,
Issue. ,
p.
334.
Frieze, A.
and
Jerrum, M.
1997.
Improved approximation algorithms for MAXk-CUT and MAX BISECTION.
Algorithmica,
Vol. 18,
Issue. 1,
p.
67.
Peinado, Marcus
and
Lengauer, Thomas
1997.
Randomization and Approximation Techniques in Computer Science.
Vol. 1269,
Issue. ,
p.
135.
Hass, J.
Lagarias, J.C.
and
Pippenger, N.
1997.
The computational complexity of knot and link problems.
p.
172.
López, Criel Merino
1997.
Chip firing and the tutte polynomial.
Annals of Combinatorics,
Vol. 1,
Issue. 1,
p.
253.
Goldsmith, Judy
Ogihara, Mitsunori
and
Rothe, Jörg
1998.
Mathematical Foundations of Computer Science 1998.
Vol. 1450,
Issue. ,
p.
483.
Welsh, Dominic
1999.
The Tutte polynomial.
Random Structures and Algorithms,
Vol. 15,
Issue. 3-4,
p.
210.
Cooper, Colin
and
Frieze, Alan M.
1999.
Mixing properties of the Swendsen-Wang process on classes of graphs.
Random Structures and Algorithms,
Vol. 15,
Issue. 3-4,
p.
242.
Borgs, C.
Chayes, J.T.
Frieze, A.
Jeong Han Kim
Tetali, P.
Vigoda, E.
and
Van Ha Vu
1999.
Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics.
p.
218.
Hass, Joel
Lagarias, Jeffrey C.
and
Pippenger, Nicholas
1999.
The computational complexity of knot and link problems.
Journal of the ACM,
Vol. 46,
Issue. 2,
p.
185.
Merino, C.
and
Welsh, D. J. A.
1999.
Forests, colorings and acyclic orientations of the square lattice.
Annals of Combinatorics,
Vol. 3,
Issue. 2-4,
p.
417.
