Cavallini, D. & Stirpe, F. (1957). Ital. J. Biochem. 6, 1. Dodgson, K. S., Powell, G. M., Rose, F. A. & Tudball, N. (1961). Biochem. J. 79, 209. Dodgson, K. S., Powell, G. M. & Tudball, N. (1960). Biochem. biophy8. Be8. Commun. 2, 130. Dodgson, K. S. & Tudball, N. (1960). Biochem. J. 74, 154. Doy, C. H. (1960). Nature, Lond., 529, 4724. Knox, W. E. & Pitt, B. M. (1957). J. biol. Chem. 225, 675....

Boyland, E., Manson, D. & Sims, P. (1953). J. chem. Soc. p. 3623. Boyland, E., Manson, D., Sims, P. & Williams, D. C. (1956). Biochem. J. 62, 68. Bray, H. G. & Thorpe, W. V. (1954). In Method8 in Biochemical Analysi8, vol. 1, p. 45. Ed. by Glick, D. New York: Interscience. Burkhardt, G. N., Ford, K. W. G. & Singleton, E. (1936). J. chem. Soc. p. 17. Burkhardt, G. N. & Lapworth, A. (1926). J. ch...

We show that, other than for standard complexity theory with known NP-completeness results, the computational complexity of the Dodgson and Young election systems is completely different from a parameterized complexity point of view. That is, on the one hand, we present an efficient fixed-parameter algorithm for determining a Condorcet winner in Dodgson elections by a minimum number of switches...

Baum, H., Dodgson, K. S. & Spencer, B. (1958). Biochem. J. 69, 567. Dawson, C. R. & Tarpley, W. B. (1951). In The Enzymes, vol. 2, part 1, p. 454. Ed. by Sumner, J. B. & Myrback,K. New York: Academic Press Inc. Dixon, G. H. & Neurath, H. (1957). J. biol. Chem. 225, 1049. Dodgson, K. S. & Wynn, C. H. (1958). Biochem. J. 68, 387. Macdonald, C. E. & Balls, A. K. (1957). J. biol. Chem. 227, 727. Ro...

Wemake the statement rigorous that the Robinson–Schensted–Knuth correspondence is a tropicalization of the Dodgson condensation rule.

The voting rules proposed by Dodgson and Young are both designed to find the candidate closest to being a Condorcet winner, according to two different notions of proximity; the score of a given candidate is known to be hard to compute under both rules. In this paper, we put forward an LP-based randomized rounding algorithm which yields an O(logm) approximation ratio for the Dodgson score, where...

The voting rules proposed by Dodgson and Young are both designed to find the candidate closest to being a Condorcet winner, according to two different notions of proximity; the score of a given candidate is known to be hard to compute under both rules. In this paper, we put forward an LP-based randomized rounding algorithm which yields an O(log m) approximation ratio for the Dodgson score, wher...