Items where department is "Mathematics"

University Structure (106206) LSE (106206) Academic Departments (62869) Mathematics (1461)
Number of items: 67.
2009
  • Allen, Peter (2009). Forbidden induced bipartite graphs. Journal of Graph Theory, 60(3), 219-241. https://doi.org/10.1002/jgt.20355
  • Allen, Peter, Böttcher, Julia, Hladký, Jan, Cooley, Oliver (2009). Minimum degree conditions for large subgraphs. Electronic Notes in Discrete Mathematics, 34, 75-79. https://doi.org/10.1016/j.endm.2009.07.013
  • Allen, Peter, Lozin, Vadim, Rao, Michaël (2009). Clique-width and the speed of hereditary properties. Electronic Journal of Combinatorics, 16(1), R35.
  • Alpern, Steve, Baston, Vic, Gal, Shmuel (2009). Searching symmetric networks with Utilitarian-Postman paths. Networks, 53(4), 392-402. https://doi.org/10.1002/net.20314
  • Alpern, Steve, Fokkink, Robbert (2009-01-01) How to hide information for later use on networks [Paper]. Game Theory for Networks (GameNets 2009).
  • Alpern, Steve, Gal, Shmuel (2009). Analysis and design of selection committees: a game theoretic secretary problem. International Journal of Game Theory, 38(3), 377-394. https://doi.org/10.1007/s00182-009-0159-4
  • Anthony, Martin (2009). On constructing threshold networks for pattern classification. In Franco, Leonardo, Elizondo, David A., Jerez, José M. (Eds.), Constructive Neural Networks (pp. 71-82). Springer Berlin / Heidelberg.
  • Balthasar, Anne (2009). Geometry and equilibria in bimatrix games [Doctoral thesis]. London School of Economics and Political Science. picture_as_pdf
  • Batu, Tugkan, Berenbrink, Petra, Sohler, Christian (2009). A sublinear-time approximation scheme for bin packing. Theoretical Computer Science, 410(47-49), 5082-5092. https://doi.org/10.1016/j.tcs.2009.08.006
  • Bauer, D., Broersma, H. J., van den Heuvel, J., Kahl, N., Schmeichel, E. (2009). Degree sequences and the existence of k-factors. arXiv.
  • Benevides, Fabricio Siqueira, Skokan, Jozef (2009). The 3-colored Ramsey number of even cycles. Journal of Combinatorial Theory, Series B, 99(4), 690-708. https://doi.org/10.1016/j.jctb.2008.12.002
  • Biggs, Norman (2009). Families of parameters for SRNT graphs. arXiv.
  • Biggs, Norman (2009). Mathematics of currency and exchange: arithmetic at the end of the thirteenth century. BSHM: British Society for the History of Mathematics Bulletin, 24(2), 67-77. https://doi.org/10.1080/17498430902820861
  • Biggs, Norman (2009). Strongly regular graphs with no triangles. arXiv.
  • Biggs, Norman (2009). Tutte polynomials of bracelets. (CDAM research reports series LSE-CDAM 2009-01). CDAM: Computational, Discrete and Applicable Mathematics@LSE.
  • Biggs, Norman, Hutchinson, Jenny (2009). Knowles' patent yarn balance. Textile History, 40(1), 97-102. https://doi.org/10.1179/174329509x424640
  • Bingham, N. H. (2009). Five questions. In Hajek, Alan, Hendricks, Vincent F. (Eds.), Probability and Statistics: 5 Questions (pp. 1-11). Automatic/ VIP Press.
  • Bingham, N. H., Ostaszewski, A. J. (2009). Automatic continuity: subadditivity, convexity, uniformity. Aequationes Mathematicae, 78(3), 257-270. https://doi.org/10.1007/s00010-009-2982-x
  • Bingham, N. H., Ostaszewski, A. J. (2009). The Index Theorem of topological regular variation and its applications. Journal of Mathematical Analysis and Applications, 358(2), 238-248. https://doi.org/10.1016/j.jmaa.2009.03.071
  • Bingham, N. H., Ostaszewski, A. J. (2009). Infinite combinatorics in function spaces: category methods. Publications de L’institut Mathématique, 86(100), 55-73. https://doi.org/10.2298/PIM0900055B
  • Bingham, N. H., Ostaszewski, Adam (2009). Beyond Lebesgue and Baire: generic regular variation. Colloquium Mathematicum, 116(1), 119-138. https://doi.org/10.4064/cm116-1-6
  • Bingham, N. H., Ostaszewski, Adam (2009). Infinite combinatorics and the foundations of regular variation. Journal of Mathematical Analysis and Applications, 360(2), 518-529. https://doi.org/10.1016/j.jmaa.2009.04.061
  • Bingham, N. H., Ostaszewski, Adam (2009). Very slowly varying functions. II. Colloquium Mathematicum, 116(1), 105 - 117. https://doi.org/10.4064/cm116-1-5
  • Bollobas, Bela, Brightwell, Graham, Morris, Robert (2009). Shadows of ordered graphs. arXiv.
  • Brightwell, Graham (2009). A result in 2d causal set theory: the emergence of spacetime. Journal of Physics: Conference Series, 174(012049), 1-6. https://doi.org/10.1088/1742-6596/174/1/012049
  • Brightwell, Graham, Luczak, Malwina (2009). Order-invariant measures on fixed causal sets. arXiv.
  • Brightwell, Graham, Panagiotou, Konstantinos, Steger, Angelika (2009). Extremal subgraphs of random graphs: an extended version. arXiv.
  • Brightwell, Graham, Winkler, Peter (2009). Submodular percolation. SIAM Journal on Discrete Mathematics, 23(3), 1149-1178. https://doi.org/10.1137/07069078X
  • Brudnyi, Alexander, Sasane, Amol (2009). Sufficient conditions for the projective freeness of Banach algebras. Journal of Functional Analysis, 257(12), 4003-4014. https://doi.org/10.1016/j.jfa.2009.05.003
  • Böttcher, Julia, Hladký, Jan, Piguet, Diana (2009). The tripartite Ramsey number for trees. Electronic Notes in Discrete Mathematics, 34, 597-601. https://doi.org/10.1016/j.endm.2009.07.101
  • Böttcher, Julia, Kohayakawa, Yoshiharu, Taraz, Anusch (2009). Almost spanning subgraphs of random graphs after adversarial edge removal. Electronic Notes in Discrete Mathematics, 35, 335-340. https://doi.org/10.1016/j.endm.2009.11.055
  • Böttcher, Julia, Müller, Sybille (2009). Forcing spanning subgraphs via Ore type conditions. Electronic Notes in Discrete Mathematics, 34, 255-259. https://doi.org/10.1016/j.endm.2009.07.042
  • Böttcher, Julia, Schacht, Mathais, Taraz, Anusch (2009). Proof of the bandwidth conjecture of Bollobás and Komlós. Mathematische Annalen, 343(1), 175-205. https://doi.org/10.1007/s00208-008-0268-6
  • Cereceda, Luis, van den Heuvel, Jan, Johnson, Matthew (2009). Mixing 3-colourings in bipartite graphs. European Journal of Combinatorics, 30(7), 1593-1606. https://doi.org/10.1016/j.ejc.2009.03.011
  • Csikós, Balázs, Kiss, György, Swanepoel, Konrad, Oloff de Wet, P. (2009). Large antipodal families. Periodica Mathematica Hungarica, 58(2), 129-138. https://doi.org/10.1007/s10998-009-10129-9
  • Danilova, Albina, Monoyios, Michael, Ng, Andrew (2009). Optimal investment with inside information and parameter uncertainty. arXiv.
  • Dütting, Paul, Henzinger, Monika, Weber, Ingmar (2009). Bidder optimal assignments for general utilities. In Leonardi, Stefano (Ed.), Proceedings of the 5th International Workshop on Internet and Network Economics (pp. 575-582). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-3-642-10841-9_58
  • Gapeev, Pavel V., Jeanblanc, Monique (2009). Pricing of contingent claims in a two-dimensional model with random dividends. International Journal of Theoretical and Applied Finance, 12(8), 1091-1104. https://doi.org/10.1142/S0219024909005592
  • Gapeev, Pavel V., Lerche, Hans Rudolf (2009). Discounted optimal stopping for diffusions: free-boundary versus martingale approach. (CDAM research report LSE-CDAM-2009-03). CDAM@LSE.
  • Gobbino, Massimo, Simon, Robert Samuel (2009). How many times can a function be iterated? arXiv.
  • Gossner, Olivier, Kalai, Ehud, Weber, Robert (2009). Information independence and common knowledge. Econometrica, 77(4), 1317-1328. https://doi.org/10.3982/ECTA7469
  • Gossner, Olivier, Laraki, Rida, Tomala, Tristan (2009). Informationally optimal correlation. Mathematical Programming, 116(1-2), 147-172. https://doi.org/10.1007/s10107-007-0129-1
  • Gossner, Olivier, Tomala, Tristan (2009). Repeated games with complete information. In Meyers, Robert A. (Ed.), Encyclopedia of Complexity and Systems Science . Springer Berlin / Heidelberg.
  • Goyal, Navin, Olver, Neil, Shepherd, Bruce (2009-09-07 - 2009-09-09) Dynamic vs oblivious routing in network design [Paper]. 17th Annual European Symposium on Algorithms, University of Copenhagen, Copenhagen, Denmark, DNK.
  • Haxell, Penny, Łucak, T, Peng, Y, Rodl, V, Rucinski, Andrzej, Skokan, Jozef (2009). The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. Combinatorics, Probability and Computing, 18(1-2), 165-203. https://doi.org/10.1017/S096354830800967X
  • Janson, Svante, Luczak, Malwina J. (2009). A new approach to the giant component problem. Random Structures and Algorithms, 34(2), 197-216. https://doi.org/10.1002/rsa.20231
  • Kumabe, Masahiro, Lewis-Pye, Andrew (2009). A fixed-point-free minimal degree. Journal of the London Mathematical Society, 80(3), 785-797. https://doi.org/10.1112/jlms/jdp049
  • Lewis-Pye, Andrew (2009). Strong minimal covers and a question of Yates: the story so far. In Cooper, Barry, Geuvers, Herman, Pillay, Anand, Väänänen, Jouko (Eds.), Logic Colloquium 2006 (pp. 213-228). Cambridge University Press. https://doi.org/10.1017/CBO9780511605321.011
  • Lewis-Pye, Andrew, Nies, André, Sorbi, Andrea (2009). The first order theories of the Medvedev and Muchnik lattices. In Ambos-Spies, Klaus, Löwe, Benedikt, Merkle, Wolfgang (Eds.), Mathematical Theory and Computational Practice: 5th Conference on Computability in Europe, Cie 2009, Heidelberg, Germany, July 1 (pp. 324-331). Springer Berlin / Heidelberg. https://doi.org/10.1007/978-3-642-03073-4_33
  • Marciniszyn, Martin, Skokan, Jozef, Spöhel, Reto, Steger, Angelika (2009). Asymmetric Ramsey properties of random graphs involving cliques. Random Structures and Algorithms, 34(4), 419-453. https://doi.org/10.1002/rsa.20239
  • Mortini, Raymond, Sasane, Amol (2009). Ideals of denominators in the disk-algebra. The Bulletin of the London Mathematical Society, 41(4), 669-675. https://doi.org/10.1112/blms/bdp057
  • Patel, Viresh (2009). Partitions of combinatorial structures. [Doctoral thesis]. London School of Economics and Political Science. picture_as_pdf
  • Pretorius, Lou M., Swanepoel, Konrad (2009). The Sylvester-Gallai theorem, colourings and algebra. Discrete Mathematics, 309(2), 385-399. https://doi.org/10.1016/j.disc.2007.12.027
  • Rupp, R., Sasane, A. (2009). Reducibility in AR(K), CR(K), and A(K). Canadian Journal of Mathematics, 62(3), 646-667. https://doi.org/10.4153/CJM-2010-025-9
  • Rupp, Rudolf, Sasane, Amol (2009). Ideal structure and stable rank of Ce+l2(I) with the Hadamard product. Complex Analysis and Operator Theory, 4(4), 881-899. https://doi.org/10.1007/s11785-009-0027-z
  • Rupp, Rudolf, Sasane, Amol (2009). On the density of stabilizable plants in the class of unstabilizable plants: the real symmetric disk algebra case. Journal of the Franklin Institute, 346(8), 784-793. https://doi.org/10.1016/j.jfranklin.2009.04.004
  • Sasane, Amol (2009). Algebras of holomorphic functions and control theory. Dover Publications, Inc..
  • Sasane, Amol J. (2009). Stable ranks of Banach algebras of operator-valued analytic functions. Complex Analysis and Operator Theory, 3(1), 323-330. https://doi.org/10.1007/s11785-008-0046-1
  • Sobel, Joel, von Stengel, Bernhard (2009). In memoriam: David Gale (1921–2008). Games and Economic Behavior, 66(2), p. 581. https://doi.org/10.1016/j.geb.2009.03.006
  • Subasi, M., Subasi, E., Anthony, Martin, Hammer, P. L. (2009). Using a similarity measure for credible classification. Discrete Applied Mathematics, 157(5), 1104-1112. https://doi.org/10.1016/j.dam.2008.04.007
  • Subasi, Mine, Subasi, Ersoy, Anthony, Martin, Hammer, P.L. (2009). A new imputation method for incomplete binary data. (RUTCOR research report RRR 15-2009). RUTCOR, Rutgers University.
  • Swanepoel, Konrad (2009). Simultaneous packing and covering in sequence spaces. Discrete and Computational Geometry, 42(2), 335-340. https://doi.org/10.1007/s00454-009-9189-8
  • Swanepoel, Konrad (2009). Triangle-free minimum distance graphs in the plane. Geombinatorics Quarterly, 19(1), 28-30.
  • Swanepoel, Konrad (2009). Unit distances and diameters in Euclidean spaces. Discrete and Computational Geometry, 41(1), 1-27. https://doi.org/10.1007/s00454-008-9082-x
  • Swanepoel, Konrad, Martini, Horst, Oloff de Wet, P. (2009). Absorbing angles, Steiner minimal trees and antipodality. Journal of Optimization Theory and Applications, 143(1), 149-157. https://doi.org/10.1007/s10957-009-9552-1
  • Volz, M. G., Brazil, M., Swanepoel, Konrad, Thomas, D. A. (2009). Designing optimal flow networks. In Ao, S. I., Gelman, L., Hukins, David W. L., Korsunsky, A. M., Hunter, Andrew (Eds.), Proceedings of the World Congress on Engineering 2009 (pp. 1235-1240). Newswood Ltd..
  • van den Heuvel, Jan, Thomassé, Stéphane (2009). Cyclic orderings and cyclic arboricity of matroids. arXiv.