Open questions

[1]  David R. Karger,et al.  Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows , 1995, STOC '95.

[2]  R. Gilliland,et al.  Weakly interacting, massive particles and the solar neutrino flux , 1985 .

[3]  K. Dhingra,et al.  Lipid peroxidation-induced putative malondialdehyde-DNA adducts in human breast tissues. , 1996, Cancer epidemiology, biomarkers & prevention : a publication of the American Association for Cancer Research, cosponsored by the American Society of Preventive Oncology.

[4]  David Benyon,et al.  The skull beneath the skin: entity-relationship models of information artifacts , 1996, Int. J. Hum. Comput. Stud..

[5]  D. Wickerham,et al.  Effect of preoperative chemotherapy on local-regional disease in women with operable breast cancer: findings from National Surgical Adjuvant Breast and Bowel Project B-18. , 1997, Journal of clinical oncology : official journal of the American Society of Clinical Oncology.

[6]  P. McMullen.  The polytope algebra , 1989 .

[7]  C. Taubes.  The geometry of the Seiberg-Witten invariants. , 1996 .

[8]  T. Brown,et al.  Inferring the sun's internal angular velocity from observed p-mode frequency splittings , 1989 .

[9]  Haruko Okamura,et al.  Multicommodity flows in planar graphs , 1981, J. Comb. Theory, Ser. B.

[10]  Wolpert.  The good fairy godmother of science , 1996, Current Biology.

[11]  R. Schneider.  Convex Bodies: The Brunn–Minkowski Theory: Minkowski addition , 1993 .

[12]  Stephen S. Shatz,et al.  Profinite Groups, Arithmetic, and Geometry. , 1972 .

[13]  S. Cappell,et al.  Smooth nontrivial 4-dimensional $s$-cobordisms , 1987 .

[14]  Michio Suzuki.  Group Theory I , 1981 .

[15]  Yuri Engelhardt,et al.  A Meta-Taxonomy for Diagram Research , 2002, Diagrammatic Representation and Reasoning.

[16]  C. Peters,et al.  Automorphisms of Enriques surfaces , 1983 .

[17]  J. Merchant,et al.  Glucose tolerance and endometrial carcinoma. A controlled study. , 1968, Archives of internal medicine.

[18]  Christof Holliger,et al.  Reductive dechlorination in the energy metabolism of anaerobic bacteria , 1998 .

[19]  B. C. Oltikar,et al.  On prosupersolvable groups , 1978 .

[20]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[21]  Jean-Pierre Serre.  Cohomologie des groupes discrets , 1971 .

[22]  A. Myasnikov,et al.  Implicit function theorem over free groups , 2003, math/0312509.

[23]  S. H. Waxler,et al.  Augmentation of mammary tumors in castrated obese C3H mice. , 1966, Cancer research.

[24]  M. L. Price.  THE PRINCIPLE OF LIFE. , 1905 .

[25]  M. Dowsett,et al.  Re: Reversal of relation between body mass and endogenous estrogen concentrations with menopausal status. , 1996, Journal of the National Cancer Institute.

[26]  L. Ribes.  Virtually free factors of pro-p groups , 1991 .

[27]  Joseph A. Wolf.  Spaces of Constant Curvature , 1984 .

[28]  Jean-Pierre Serre.  A Course in Arithmetic , 1973 .

[29]  D. Gough.  Nonradial and nonlinear stellar pulsation , 1979, Nature.

[30]  Alan F. Blackwell,et al.  A Cognitive Dimensions questionnaire optimised for users , 2000, PPIG.

[31]  L. Ribes,et al.  On the cohomology of certain topological colimits of Pro-C-groups , 1974 .

[32]  Alexandre V. Borovik,et al.  On exchange properties for Coxeter matroids and oriented matroids , 1998, Discret. Math..

[33]  Anna L. Brown,et al.  Effect of preoperative chemotherapy on the outcome of women with operable breast cancer. , 1998, Journal of clinical oncology : official journal of the American Society of Clinical Oncology.

[34]  A. Lubotzky.  Group presentation, $p$-adic analytic groups and lattices in $\mathrm{SL}_2(\mathbf{C})$ , 1983 .

[35]  Chung-Kuan Cheng,et al.  Ancestor tree for arbitrary multi-terminal cut functions , 1990, IPCO.

[36]  D. Segal.  Closed Subgroups of Profinite Groups , 2000 .

[37]  P. T. Sokkalingam,et al.  New polynomial-time cycle-canceling algorithms for minimum cost flows , 2000 .

[38]  E. Hewitt,et al.  Abstract Harmonic Analysis , 1963 .

[39]  D. R. Fulkerson,et al.  An Out-of-Kilter Method for Minimal-Cost Flow Problems , 1960 .

[40]  D. Gildenhuys.  On pro-p-groups with a single defining relator , 1968 .

[41]  Kurt Mehlhorn,et al.  An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow , 1999, Inf. Process. Lett..

[42]  C. H. Giffen.  THE GENERALIZED SMITH CONJECTURE. , 1966 .

[43]  Andrew V. Goldberg,et al.  Beyond the flow decomposition barrier , 1998, JACM.

[44]  RECURSIVE p-ADIC NUMBERS AND ELEMENTARY THEORIES OF FINITELY GENERATED PRO-p-GROUPS , 1988 .

[45]  A. Lubotzky.  Combinatorial group theory for pro-p groups , 1982 .

[46]  Armand Brumer,et al.  Pseudocompact algebras, profinite groups and class formations , 1966 .

[47]  D. Springael,et al.  Tn4371: A modular structure encoding a phage-like integrase, a Pseudomonas-like catabolic pathway, and RP4/Ti-like transfer functions. , 1999, Plasmid.

[48]  Giovanni Rinaldi,et al.  An efficient algorithm for the minimum capacity cut problem , 1990, Math. Program..

[49]  Claus Scheiderer.  Farrell cohomology and Brown theorems for profinite groups , 1996 .

[50]  James B. Orlin.  A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..

[51]  Alexander Schrijver,et al.  On the history of the transportation and maximum flow problems , 2002, Math. Program..

[52]  D. R. Fulkerson,et al.  Constructing Maximal Dynamic Flows from Static Flows , 1958 .

[53]  Lisa Fleischer,et al.  Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..

[54]  Andrew V. Goldberg,et al.  An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow , 1998, IPCO.

[55]  B. Huppert.  Endliche Gruppen I , 1967 .

[56]  M. Mergeay,et al.  Occurrence of Tn4371-Related Mobile Elements and Sequences in (Chloro)biphenyl-Degrading Bacteria , 2001, Applied and Environmental Microbiology.

[57]  Douglas O. Gough,et al.  Book-Review - Seismology of the Sun and the Distant Stars , 1986 .

[58]  S. Kwasik,et al.  Vanishing of whitehead torsion in dimension four , 1992 .

[59]  A. Lubotzky.  Subgroup growth and congruence subgroups , 1995 .

[60]  Pravin M. Vaidya,et al.  Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.

[61]  Éva Tardos,et al.  Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..

[62]  A. Edmonds.  Construction of group actions on four-manifolds , 1987 .

[63]  Peter Elias,et al.  A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.

[64]  Wayne D. Gray,et al.  Damaged Merchandise? A Review of Experiments That Compare Usability Evaluation Methods , 1998, Hum. Comput. Interact..

[65]  K. Hensel,et al.  Theorie der algebraischen Zahlen , 1908 .

[66]  Thomas Weigel,et al.  Cohomology of p-adic Analytic Groups , 2000 .

[67]  P. Linnell,et al.  Bounding the number of generators of a polycyclic group , 1981 .

[68]  Éva Tardos,et al.  “The quickest transshipment problem” , 1995, SODA '95.

[69]  M. I. Kargapolov,et al.  Fundamentals of the theory of groups , 1979 .

[70]  J. Bahcall.  What next with solar neutrinos , 1969 .

[71]  J. Damborský,et al.  Cloning and Expression of the Haloalkane Dehalogenase Gene dhmA from Mycobacterium avium N85 and Preliminary Characterization of DhmA , 2002, Applied and Environmental Microbiology.

[72]  E I Zel'manov,et al.  A SOLUTION OF THE RESTRICTED BURNSIDE PROBLEM FOR 2-GROUPS , 1992 .

[73]  D. Gough.  Asymptotic Sound-Speed Inversions , 1986 .

[74]  Baruch Awerbuch,et al.  Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks , 1994, STOC '94.

[75]  Shaaron Ainsworth,et al.  The functions of multiple representations , 1999, Comput. Educ..

[76]  Michael Jünger,et al.  Practical Performance of Efficient Minimum Cut Algorithms , 2000, Algorithmica.

[77]  K. Fujiwara.  The second bounded cohomology of an amalgamated free product of groups , 1999 .

[78]  J. R. van der Meer,et al.  The Broad Substrate Chlorobenzene Dioxygenase and cis-Chlorobenzene Dihydrodiol Dehydrogenase of Pseudomonas sp. Strain P51 Are Linked Evolutionarily to the Enzymes for Benzene and Toluene Degradation (*) , 1996, The Journal of Biological Chemistry.

[79]  E. A. Timofeev,et al.  Efficient algorithm for finding all minimal edge cuts of a nonoriented graph , 1986 .

[80]  E. Bolker.  INVERSE LIMITS OF SOLVABLE GROUPS , 1963 .

[81]  A. Osborn,et al.  When phage, plasmids, and transposons collide: genomic islands, and conjugative- and mobilizable-transposons as a mosaic continuum. , 2002, Plasmid.

[82]  A. Edmonds,et al.  Locally linear group actions on the complex projective plane , 1989 .

[83]  K. Truemper.  On Max Flows with Gains and Pure Min-Cost Flows , 1977 .

[84]  M. Kaufmann,et al.  Histologische Regression des Mammakarzinoms nach primärer (neoadjuvanter) Chemotherapie , 1994 .

[85]  S. Cappell,et al.  On 4-dimensional $s$-cobordisms , 1985 .

[86]  Éva Tardos,et al.  A strongly polynomial minimum cost circulation algorithm , 1985, Comb..

[87]  A. Casellas,et al.  Increased fatty acid re-esterification by PEPCK overexpression in adipose tissue leads to obesity without insulin resistance. , 2002, Diabetes.

[88]  V. Roman’kov.  Width of verbal subgroups in solvable groups , 1982 .

[89]  Maurice Queyranne,et al.  Minimizing symmetric submodular functions , 1998, Math. Program..

[90]  S. Lang.  Rapport sur la cohomologie des groupes , 1966 .

[91]  L. Ribes.  Cohomological characterization of amalgamated products of groups , 1974 .

[92]  Jonathan T. Grudin,et al.  Error Patterns in Novice and Skilled Transcription Typing , 1983 .

[93]  Robert E. Tarjan,et al.  Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem , 1991, Math. Oper. Res..

[94]  David R. Karger,et al.  A new approach to the minimum cut problem , 1996, JACM.

[95]  G. Hortobagyi,et al.  Prospective evaluation of paclitaxel versus combination chemotherapy with fluorouracil, doxorubicin, and cyclophosphamide as neoadjuvant therapy in patients with operable breast cancer. , 1999, Journal of clinical oncology : official journal of the American Society of Clinical Oncology.

[96]  Robert E. Gompf.  A new construction of symplectic manifolds , 1995 .

[97]  David R. Karger,et al.  Random Sampling in Cut, Flow, and Network Design Problems , 1999, Math. Oper. Res..

[98]  R. Schneider.  On asymmetry classes of convex bodies , 1974 .

[99]  A. Lucchini.  On the minimal number of generators of free profinite products of profinite groups , 2001 .

[100]  Tomasz Radzik,et al.  Combinatorial approximation algorithms for generalized flow problems , 1999, SODA '99.

[101]  T. Salthouse.  Perceptual, cognitive, and motoric aspects of transcription typing. , 1986, Psychological bulletin.

[102]  S. Lane.  Categories for the Working Mathematician , 1971 .

[103]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[104]  S. Payne.  A descriptive study of mental models , 1991 .

[105]  D. O. Gough,et al.  Weakly interacting massive particles and solar oscillations , 1986, Nature.

[106]  S. Kwasik,et al.  Ons-cobordisms of metacyclic prism manifolds , 1989 .

[107]  Douglas O. Gough,et al.  Helioseismology: Oscillations as a Diagnostic of the Solar Interior , 1984 .

[108]  A. Lubotzky.  TANNAKA DUALITY FOR DISCRETE GROUPS , 1980 .

[109]  G. Giaccone,et al.  Prognostic role of clinical, pathological and biological characteristics in patients with locally advanced breast cancer. , 1998, British Journal of Cancer.

[110]  N. Steenrod,et al.  Foundations of Algebraic Topology , 1952 .

[111]  Richard M. Young,et al.  Device-Oriented and Task-Oriented Exploratory Learning of Interactive Devices , 2000 .

[112]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[113]  Howard Ochman,et al.  Reconciling the many faces of lateral gene transfer. , 2002, Trends in microbiology.

[114]  G. E. Bredon.  Introduction to compact transformation groups , 1972 .

[115]  Marshall Hall,et al.  A Topology for Free Groups and Related Groups , 1950 .

[116]  Mechthild Stoer,et al.  A simple min-cut algorithm , 1997, JACM.

[117]  Andrew V. Goldberg,et al.  Cut Tree Algorithms: An Experimental Study , 2001, J. Algorithms.

[118]  Z. Chatzidakis.  Torsion in pro-p completions of torsion-free groups , 1999 .

[119]  William S. Jewell.  New Methods in Mathematical Programming---Optimal Flow Through Networks with Gains , 1962 .

[120]  E. Rhodes,et al.  Testing solar models with global solar oscillations in the 5-minute band , 1983 .

[121]  R. Stanley,et al.  On the foundations of combinatorial theory. VI. The idea of generating function , 1972 .

[122]  J. Orlin,et al.  Distance-Directed Augmenting Path Algorithms for Maximum Flow and Parametric Maximum Flow Problems , 1991 .

[123]  M. Schützenberger,et al.  Treillis et bases des groupes de Coxeter , 1996, Electron. J. Comb..

[124]  D. O. Gough,et al.  Speed of sound in the solar interior , 1985, Nature.

[125]  Stefan Scholtes,et al.  Minimal pairs of convex bodies in two dimensions , 1992 .

[126]  M. Hall.  The Theory Of Groups , 1959 .

[127]  Jean-Pierre Serre,et al.  Topics in Galois Theory , 1992 .

[128]  M. Lazard,et al.  Groupes analytiques p-adiques , 1965 .

[129]  Fred W. Glover,et al.  On the equivalence of some generalized network problems to pure network problems , 1973, Math. Program..

[130]  Derek J. S. Robinson,et al.  Finiteness conditions and generalized soluble groups , 1972 .

[131]  M. Thompson,et al.  On the Implications of the Symmetric Component of the Frequency Splitting Reported by Duvall, Harvey and Pomerantz , 1988 .

[132]  S. Cappell,et al.  Some new four-manifolds , 1976 .

[133]  N. Logothetis,et al.  Activity changes in early visual cortex reflect monkeys' percepts during binocular rivalry , 1996, Nature.

[134]  S. Korzennik,et al.  Seismic analysis of the solar interior. I - Can opacity changes improve the theoretical frequencies? , 1989 .

[135]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[136]  C. Sah,et al.  On a special class of locally compact rings , 1966 .

[137]  Andrew V. Goldberg,et al.  Negative-cycle detection algorithms , 1996, Math. Program..

[138]  Nonarithmetic superrigid groups: Counterexamples to Platonov's conjecture , 2000, math/0005302.

[139]  Paul Tseng,et al.  Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..

[140]  M. Hall.  Coset representations in free groups , 1949 .

[141]  Dan Gusfield,et al.  Very Simple Methods for All Pairs Network Flow Analysis , 1990, SIAM J. Comput..

[142]  Leonid Khachiyan,et al.  Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints , 1994, SIAM J. Optim..

[143]  Fred W. Glover,et al.  An extended abstract of an indepth algorithmic and computational study for maximum flow problems , 1980, Discret. Appl. Math..

[144]  A. Edmonds.  Aspects of group actions on four-manifolds☆ , 1989 .

[145]  Peter Scott.  Subgroups of Surface Groups are Almost Geometric , 1978 .

[146]  Andrew V. Goldberg,et al.  On Implementing the Push—Relabel Method for the Maximum Flow Problem , 1997, Algorithmica.

[147]  Eörs Szathmáry,et al.  The Major Transitions in Evolution , 1997 .

[148]  Toshihide Ibaraki,et al.  Implementing an efficient minimum capacity cut algorithm , 1994, Math. Program..

[149]  W. Gröbner,et al.  Galoissche Theorie der p-Erweiterungen , 1970 .

[150]  Andrew V. Goldberg,et al.  Combinatorial Algorithms for the Generalized Circulation Problem , 1991, Math. Oper. Res..

[151]  Jens Vygen,et al.  Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm , 1998 .

[152]  M. Tsuda,et al.  Mobile catabolic genes in bacteria. , 1999, Journal of bioscience and bioengineering.

[153]  L. Rayleigh,et al.  The theory of sound , 1894 .

[154]  Hiroshi Imai,et al.  ON THE PRACTICAL EFFICIENCY OF VARIOUS MAXIMUM FLOW ALGORITHMS , 1983 .

[155]  R. Lyndon,et al.  Combinatorial Group Theory , 1977 .

[156]  J. Saxl,et al.  A note on powers in simple groups , 1997, Mathematical Proceedings of the Cambridge Philosophical Society.

[157]  M. Jarden.  Normal automorphisms of free profinite groups , 1980 .

[158]  David R. Karger,et al.  Minimum cuts in near-linear time , 1998, JACM.

[159]  Dariusz M. Wilczyński.  Periodic maps on simply connected four-manifolds , 1991 .

[160]  N. Tomizawa,et al.  On some techniques useful for solution of transportation network problems , 1971, Networks.

[161]  J. R. van der Meer,et al.  Evolution of a Pathway for Chlorobenzene Metabolism Leads to Natural Attenuation in Contaminated Groundwater , 1998, Applied and Environmental Microbiology.

[162]  A Cohomological Transfer Map for Profinite Groups , 1997 .

[163]  D. R. Fulkerson,et al.  Computation of maximal flows in networks , 1955 .

[164]  S. Morris.  Pontryagin Duality and the Structure of Locally Compact Abelian Groups , 1977 .

[165]  Philip N. Klein,et al.  Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts , 1994, SIAM J. Comput..

[166]  Klaus Doerk,et al.  Finite Soluble Groups , 1992 .

[167]  Éva Tardos,et al.  Simple Generalized Maximum Flow Algorithms , 1998, IPCO.

[168]  Margaret S. Wu,et al.  Role of AMP-activated protein kinase in mechanism of metformin action. , 2001, The Journal of clinical investigation.

[169]  J. Bielas,et al.  Proliferation is necessary for both repair and mutation in transgenic mouse cells. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[170]  G. Grätzer,et al.  Lattice Theory: First Concepts and Distributive Lattices , 1971 .

[171]  Andrew V. Goldberg,et al.  An efficient implementation of a scaling minimum-cost flow algorithm , 1993, IPCO.

[172]  F. Grunewald,et al.  Zeta functions of groups: zeros and friendly ghosts , 2002 .

[173]  Ido Efrat.  Free pro- $p$ product decompositions of Galois groups , 1997 .

[174]  Alan F. Blackwell,et al.  Investment of attention as an analytic approach to cognitive dimensions , 1999, PPIG.

[175]  K. Gruenberg,et al.  Cohomological topics in group theory , 1970 .

[176]  D. Focht,et al.  Genetic exchange in soil between introduced chlorobenzoate degraders and indigenous biphenyl degraders , 1996, Applied and environmental microbiology.

[177]  C. Koch,et al.  Are we aware of neural activity in primary visual cortex? , 1995, Nature.

[178]  R. Baserga,et al.  The insulin-like growth factor I receptor: a key to tumor growth? , 1995, Cancer research.

[179]  R. Dicke,et al.  The oblateness of the Sun , 1974 .

[180]  Éva Tardos,et al.  Note on Weintraub's Minimum-Cost Circulation Algorithm , 1989, SIAM J. Comput..

[181]  A. Luini,et al.  Primary chemotherapy to avoid mastectomy in tumors with diameters of three centimeters or more. , 1990, Journal of the National Cancer Institute.

[182]  C. Scheiderer.  Real and Étale cohomology , 1994 .

[183]  Robert E. Tarjan,et al.  Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..

[184]  M. Doudoroff,et al.  The aerobic pseudomonads: a taxonomic study. , 1966, Journal of general microbiology.

[185]  Nathan Reading,et al.  Order Dimension, Strong Bruhat Order and Lattice Properties for Posets , 2002, Order.

[186]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[187]  Noga Alon,et al.  A Graph-Theoretic Game and Its Application to the k-Server Problem , 1995, SIAM J. Comput..

[188]  Marian Petre,et al.  Usability Analysis of Visual Programming Environments: A 'Cognitive Dimensions' Framework , 1996, J. Vis. Lang. Comput..

[189]  J. Mennicke.  Finite Factor Groups of the Unimodular Group , 1965 .

[190]  E. Szathmáry,et al.  Coding coenzyme handles: a hypothesis for the origin of the genetic code. , 1993, Proceedings of the National Academy of Sciences of the United States of America.

[191]  James B. Orlin,et al.  A polynomial time primal network simplex algorithm for minimum cost flows , 1996, SODA '96.

[192]  A. Weintraub.  A Primal Algorithm to Solve Network Flow Problems with Convex Costs , 1974 .

[193]  L. Portugal,et al.  A truncated primal‐infeasible dual‐feasible network interior point method , 2000 .

[194]  Ann Blandford,et al.  Group and Individual Time Management Tools: What You Get is Not What You Need , 2001, Personal and Ubiquitous Computing.

[195]  Robert Baier,et al.  Differences of Convex Compact Sets in the Space of Directed Sets. Part I: The Space of Directed Sets , 2001 .

[196]  D. R. Sherbert.  The structure of ideals and point derivations in Banach algebras of Lipschitz functions , 1964 .

[197]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[198]  J. R. E. O’Malley.  A More Direct Solution of the Nearly Singular Linear Regulator Problem , 1976 .

[199]  Dan Segal,et al.  The finite images of finitely generated groups , 2001 .

[200]  Cappell-Shaneson's 4-dimensional s-cobordism , 2002, math/0208092.

[201]  B. Asselain,et al.  Breast tumour response to primary chemotherapy predicts local and distant control as well as survival. , 1995, European journal of cancer.

[202]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[203]  Wolfgang Krull.  Galoissche Theorie der unendlichen algebraischen Erweiterungen , 1928 .

[204]  An embedding theorem for certain residually finite groups , 1996 .

[205]  On the structure of compact torsion groups , 1983 .

[206]  Paul D. Seymour.  A short proof of the two-commodity flow theorem , 1979, J. Comb. Theory, Ser. B.

[207]  M. Wiernowolski.  Minimality in asymmetry classes , 1997 .

[208]  Donald Goldfarb,et al.  A polynomial dual simplex algorithm for the generalized circulation problem , 2002, Math. Program..

[209]  Jonathan L. Alperin,et al.  Sylow intersections and fusion , 1967 .

[210]  V. Platonov.  Periodic and compact subgroups of topological groups , 1966 .

[211]  Norman L. Biggs.  A proof of Serre's theorem , 1989, Discret. Math..

[212]  E. J. Rolfe,et al.  Seismology of the Sun and Sun-Like Stars , 1988 .

[213]  R. Stebbins,et al.  Intrinsic visual oblateness of the Sun , 1975 .

[214]  David L. Jensen,et al.  On the computational behavior of a polynomial-time network flow algorithm , 1992, Math. Program..

[215]  D. O. Gough,et al.  Is the Sun helium-deficient? , 1980, Nature.

[216]  Hans L. Bodlaender.  On the Complexity of Some Coloring Games , 1991, Int. J. Found. Comput. Sci..

[217]  Finitely generated groups, $p$-adic analytic groups and Poincaré series , 1993 .

[218]  Thomas R. G. Green.  The Cognitive Dimensions of Information Structures , 1994 .

[219]  C. Bauer.  Minimal and reduced pairs of convex bodies , 1996 .

[220]  R. Bieri,et al.  Homological dimension of discrete groups , 1981 .

[221]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[222]  D. Gildenhuys,et al.  Free pro-C-groups , 1972 .

[223]  Andrei S. Rapinchuk,et al.  Algebraic groups and number theory , 1992 .

[224]  Éva Tardos,et al.  A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..

[225]  D. Morrison.  On K3 surfaces with large Picard number , 1984 .

[226]  John N. Bahcall,et al.  Solar models, neutrino experiments, and helioseismology , 1988 .

[227]  Rudolf Ahlswede,et al.  Strong converse for identification via quantum channels , 2000, IEEE Trans. Inf. Theory.

[228]  M. Tassoul,et al.  Asymptotic approximations for stellar nonradial pulsations , 1980 .

[229]  Toshihide Ibaraki,et al.  Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..

[230]  E. Zelmanov.  On periodic compact groups , 1992 .

[231]  J. Guzik,et al.  Oscillations of Solar Models with Internal Element Diffusion , 1989 .

[232]  Symmetry groups of four-manifolds , 1999, math/9907180.

[233]  C. Nakatsu,et al.  Distribution of the tfdA Gene in Soil Bacteria That Do Not Degrade 2,4-Dichlorophenoxyacetic Acid (2,4-D) , 1997, Microbial Ecology.

[234]  E. Shchepin.  TOPOLOGY OF LIMIT SPACES OF UNCOUNTABLE INVERSE SPECTRA , 1976 .

[235]  Lyle Jenkins,et al.  The genetics of language , 1979 .

[236]  Fiona J Gilbert,et al.  Neoadjuvant chemotherapy in breast cancer: significantly enhanced response with docetaxel. , 2002, Journal of clinical oncology : official journal of the American Society of Clinical Oncology.

[237]  T. C. Hu.  Multi-Commodity Network Flows , 1963 .

[238]  Chris Roast,et al.  Dimension Driven Re-Design - Applying Systematic Dimensional Analysis , 2002, PPIG.

[239]  S. N. Maheshwari,et al.  Analysis of Preflow Push Algorithms for Maximum Network Flow , 1988, SIAM J. Comput..

[240]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

[241]  S. Lubow,et al.  Standard Solar Models and the Uncertainties in Predicted Capture Rates of Solar Neutrinos , 1982 .

[242]  K. Libbrecht,et al.  The Radial Gradient in the Sun's Rotation , 1989 .

[243]  D. Kurtz.  Rapidly Oscillating Ap Stars , 1982 .

[244]  Kevin D. Wayne,et al.  A new property and a faster algorithm for baseball elimination , 2001, SODA '99.

[245]  G. Xiao.  Galois covers between $K3$ surfaces , 1996 .

[246]  E. Fossat,et al.  Solar oscillations: full disk observations from the geographic South Pole , 1980, Nature.

[247]  Richard M. Karp,et al.  A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..

[248]  G. C. Shephard.  Decomposable convex polyhedra , 1963 .

[249]  Vos,et al.  Molecular mechanisms of genetic adaptation to xenobiotic compounds , 1992, Microbiological reviews.

[250]  S. Campbell.  Optimal Control of Autonomous Linear Processes with Singular Matrices in the Quadratic Cost Functional , 1976 .

[251]  O. V. Mel’nikov.  Characteristic subgroups and automorphisms of free profinite groups , 1982 .

[252]  G. Hortobagyi,et al.  Clinical course of breast cancer patients with complete pathologic primary tumor and axillary lymph node response to doxorubicin-based neoadjuvant chemotherapy. , 1999, Journal of clinical oncology : official journal of the American Society of Clinical Oncology.

[253]  J. Neukirch,et al.  A subgroup theorem for free products of pro-finite groups , 1971 .

[254]  A. J. Hoffman,et al.  Surveys in combinatorics 1985: On greedy algorithms that succeed , 1985 .

[255]  S. Mukai.  Finite groups of automorphisms of K3 surfaces and the Mathieur group , 1988 .

[256]  R. Prentice.  Surrogate endpoints in clinical trials: definition and operational criteria. , 1989, Statistics in medicine.

[257]  Jean-Pierre Serre,et al.  Cohomology of group extensions , 1953 .

[258]  E. Zelmanov.  SOLUTION OF THE RESTRICTED BURNSIDE PROBLEM FOR GROUPS OF ODD EXPONENT , 1991 .

[259]  S. Yau,et al.  Scalar curvature, non-abelian group actions, and the degree of symmetry of exotic spheres , 1974 .

[260]  H. Rådström.  An embedding theorem for spaces of convex sets , 1952 .

[261]  W. Weil.  Decomposition of convex bodies , 1974 .

[262]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[263]  M. Klein.  A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems , 1966 .

[264]  A. Claverie,et al.  Solar structure from global studies of the 5-minute oscillation , 1979, Nature.

[265]  A. M. Rubinov,et al.  Difference of compact sets in the sense of demyanov and its application to non-smooth analysis , 1992 .

[266]  James B. Orlin,et al.  A Faster Algorithm for Finding the Minimum Cut in a Directed Graph , 1994, J. Algorithms.

[267]  Dan Segal,et al.  New Horizons in pro-p Groups , 2000 .

[268]  B. Huppert.  Normalteiler und maximale Untergruppen endlicher Gruppen , 1954 .

[269]  K. Onaga.  Optimum flows in general communication networks , 1967 .

[270]  S. H. Waxler,et al.  Obesity and the time of appearance of spontaneous mammary carcinoma in C3H mice. , 1953, Cancer research.

[271]  E. Zelmanov.  On Groups Satisfying the Golod—Shafarevich Condition , 2000 .

[272]  Kevin D. Wayne.  A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow , 2002, Math. Oper. Res..

[273]  J. Kuhn.  Helioseismological splitting measurements and the nonspherical solar temperature structure , 1988 .

[274]  Ravindra K. Ahuja,et al.  Chapter IV Network flows , 1989 .

[275]  R. Tootell,et al.  Anatomical evidence for MT and additional cortical visual areas in humans. , 1995, Cerebral cortex.

[276]  Cohomologie des groupes compacts totalement discontinus , 1960 .

[277]  Bounded cohomology of group constructions , 1996 .

[278]  R. Camina.  Subgroups of the Nottingham Group , 1997 .

[279]  M. Mergeay,et al.  Community shifts in a seeded 3-chlorobenzoate degrading membrane biofilm reactor: indications for involvement of in situ horizontal transfer of the clc-element from inoculum to contaminant bacteria. , 2002, Environmental microbiology.

[280]  D. L. Johnson.  The group of formal power series under substitution , 1988, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[281]  J. Christensen-Dalsgaard,et al.  Differential asymptotic sound-speed inversions , 1989 .

[282]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[283]  R. Urbanski.  Pairs of sets with convex union , 1997 .

[284]  Narain Gupta,et al.  On the Burnside problem for periodic groups , 1983 .

[285]  Eric Fossat,et al.  Full-disk observations of solar oscillations from the geographic South Pole: Latest results , 1983 .

[286]  C. Taubes.  SW ⇒ Gr: From the Seiberg-Witten equations to pseudo-holomorphic curves , 1996 .

[287]  S. Andreadakis.  On the Automorphisms of Free Groups and Free Nilpotent Groups , 1965 .

[288]  Kôji Uchida.  Isomorphisms of Galois groups , 1976 .

[289]  J. Cossey,et al.  Maximal Frattini extensions , 1980 .

[290]  C. Ronson,et al.  Evolution of rhizobia by acquisition of a 500-kb symbiosis island that integrates into a phe-tRNA gene. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[291]  R. Passingham,et al.  Praxic and nonverbal cognitive deficits in a large family with a genetically transmitted speech and language disorder. , 1995, Proceedings of the National Academy of Sciences of the United States of America.

[292]  Thomas R. G. Green,et al.  Perceptual Structure Cueing in a Simple Command Language , 1984, Int. J. Man Mach. Stud..

[293]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[294]  Daniel Ruberman.  Involutions on spin 4-manifolds , 1995 .

[295]  Kenneth S. Brown,et al.  Cohomology of Groups , 1982 .

[296]  Dan Diaper,et al.  Desirable features of educational theorem provers - a cognitive dimensions viewpoint , 1999, PPIG.

[297]  Andrew V. Goldberg,et al.  Finding Minimum-Cost Circulations by Successive Approximation , 1990, Math. Oper. Res..

[298]  Peter G. Doyle,et al.  Random Walks and Electric Networks: REFERENCES , 1987 .

[299]  Jørgen Christensen-Dalsgaard,et al.  Advances in Helio- and Asteroseismology , 1988 .

[300]  M. Kulomaa,et al.  Evidence for Natural Horizontal Transfer of the pcpB Gene in the Evolution of Polychlorophenol-Degrading Sphingomonads , 2002, Applied and Environmental Microbiology.

[301]  Donald Goldfarb,et al.  A Faster Combinatorial Algorithm for the Generalized Circulation Problem , 1996, Math. Oper. Res..

[302]  John Millar Carroll.  The Nurnberg Funnel: Designing Minimalist Instruction for Practical Computer Skill , 1990 .

[303]  J. Harvey,et al.  Internal rotation of the Sun , 1984, Nature.

[304]  Gada F. Kadoda.  A Cognitive Dimensions view of the differences between designers and users of theorem proving assistants , 2000, PPIG.

[305]  Frobenius subgroups of free products of prosolvable groups , 1989 .

[306]  Ulrich Derigs,et al.  Implementing Goldberg's max-flow-algorithm — A computational investigation , 1989, ZOR Methods Model. Oper. Res..

[307]  To-Yat Cheung,et al.  Computational Comparison of Eight Methods for the Maximum Network Flow Problem , 1980, TOMS.

[308]  B. L. Schwartz.  Possible Winners in Partially Completed Tournaments , 1966 .

[309]  James B. Orlin,et al.  Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem , 1997, Math. Oper. Res..

[310]  Klaus Truemper,et al.  An efficient scaling procedure for gain networks , 1976, Networks.

[311]  John McCleary,et al.  User's Guide to Spectral Sequences , 1985 .

[312]  Don Zagier,et al.  The Atiyah-Singer Theorem and Elementary Number Theory , 1974 .

[313]  A. Shalev.  Characterization of p-adic analytic groups in terms of wreath products , 1992 .

[314]  F. Olver.  Asymptotics and Special Functions , 1974 .

[315]  Jakob Nielsen,et al.  Heuristic evaluation of user interfaces , 1990, CHI '90.

[316]  Stephen J. Pride,et al.  Groups with two More Generators Than Relators , 1978 .

[317]  Thomas R. G. Green,et al.  The cognitive dimension of viscosity: A sticky problem for HCI , 1990, INTERACT.

[318]  Lisa Fleischer.  Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time , 1999, J. Algorithms.

[319]  Chris Roast.  Designing for delay in interactive information retrieval , 1998, Interact. Comput..

[320]  A. Krener.  The High Order Maximal Principle and Its Application to Singular Extremals , 1977 .

[321]  Edith Cohen,et al.  New algorithms for generalized network flows , 1994, Math. Program..

[322]  W. Weil.  Eine Charakterisierung von Summanden konvexer Körper , 1980 .

[323]  Satoru Fujishige,et al.  ANOTHER SIMPLE PROOF OF THE VALIDITY OF NAGAMOCHI AND IBARAKI'S MIN-CUT ALGORITHM AND QUEYRANNE'S EXTENSION TO SYMMETRIC SUBMODULAR FUNCTION MINIMIZATION , 1998 .

[324]  Maria Kutar,et al.  Cognitive Dimensions of Notations: Design Tools for Cognitive Technology , 2001, Cognitive Technology.