@article{Bou85, year={1985}, issn={0021-2172}, journal={Israel Journal of Mathematics}, volume={52}, number={1-2}, doi={10.1007/BF02776078}, title={On lipschitz embedding of finite metric spaces in Hilbert space}, url={http://dx.doi.org/10.1007/BF02776078}, publisher={Springer-Verlag}, author={Bourgain, J.}, pages={46-52}, language={English} } @article{Mat96, year={1996}, issn={0021-2172}, journal={Israel Journal of Mathematics}, volume={93}, number={1}, doi={10.1007/BF02761110}, title={On the distortion required for embedding finite metric spaces into normed spaces}, url={http://dx.doi.org/10.1007/BF02761110}, publisher={Springer-Verlag}, author={Matoušek, Jiří}, pages={333-344}, language={English} } @book{Mat02, author = {Matousek, Jiri}, title = {Lectures on Discrete Geometry}, year = {2002}, isbn = {0387953744}, publisher = {Springer-Verlag New York, Inc.}, address = {Secaucus, NJ, USA}, } @article{GS72, added-at = {2013-04-18T00:00:00.000+0200}, author = {Gale, D. and Shapley, L. S.}, biburl = {http://www.bibsonomy.org/bibtex/212c189a930c3901f28055c644fb93406/dblp}, ee = {http://dx.doi.org/10.4169/amer.math.monthly.120.05.386}, interhash = {c41c061c7750433332ea9864243b395f}, intrahash = {12c189a930c3901f28055c644fb93406}, journal = {The American Mathematical Monthly}, keywords = {dblp}, number = 1, pages = {9--15}, timestamp = {2013-04-18T00:00:00.000+0200}, title = {College Admissions and the Stability of Marriage.}, url = {http://dblp.uni-trier.de/db/journals/tamm/tamm120.html#GaleS13}, volume = 69, year = 1972 } @Book{AHU74, author = {A. V. Aho and J. E. Hopcroft and J. D. Ullman}, title = {The Design and Analysis of Computer Algorithms}, publisher = {Addison-Wesley Publishing Company}, year = 1974 } @article{C98, author = {Timothy M. Chan}, title = {Backwards Analysis of the {K}arger-{K}lein-{T}arjan Algorithm for Minimum Spanning}, journal = {Inf. Process. Lett.}, volume = {67}, number = {6}, year = {1998}, pages = {303-304}, ee = {http://dx.doi.org/10.1016/S0020-0190(98)00129-X}, bibsource = {DBLP, http://dblp.uni-trier.de} } @book{CLRS, author = "T.~H. Cormen and C.~E. Leiserson and R.~L. Rivest and C.~Stein", edition = "3rd", publisher = "The MIT Press", title = "Introduction to Algorithms", year = "2009", isbn = "978-0-262-03384-8" } @book{kozen, author = "D. Kozen", publisher = "Springer", title = "The design and analysis of algorithms", year = "1992" } @book{AM12, author = "A. Maheshwari and M. Smid", publisher = "Free Online", title = "Introduction to Theory of Computation", year = "2012" } @article{DG02, author = {Sanjoy Dasgupta and Anupam Gupta}, title = {An elementary proof of a theorem of {J}ohnson and {L}indenstrauss}, journal = {Random Struct. Algorithms}, volume = {22}, number = {1}, year = {2003}, pages = {60-65}, ee = {http://dx.doi.org/10.1002/rsa.10073}, bibsource = {DBLP, http://dblp.uni-trier.de} } @book{DP09, author = "D.P. Dubhashi and A. Panconesi", publisher = "Cambridge University Press", title = "Concentration of measure for the analysis of randomized algorithms", year = "2009" } @book{RLU12, author = {Rajaraman, Anand and Ullman, Jeffrey David}, title = {Mining of Massive Datasets}, year = {2011}, isbn = {1107015359, 9781107015357}, publisher = {Cambridge University Press}, address = {New York, NY, USA}, } @book{Rosen, author = {Rosen, Kenneth H.}, title = {Discrete Mathematics and Its Applications}, year = {2002}, isbn = {0072424346}, edition = {5th}, publisher = {McGraw-Hill Higher Education}, } @book{K1, author = {Knuth, Donald E.}, title = {The art of computer programming, volume 1-3}, year = {1998}, isbn = {0-201-89685-0}, publisher = {Addison Wesley Longman Publishing Co., Inc.}, address = {Redwood City, CA, USA}, } @book{GKP, author = {Graham, Ronald L. and Knuth, Donald E. and Patashnik, Oren}, title = {Concrete Mathematics: A Foundation for Computer Science}, year = {1994}, isbn = {0201558025}, edition = {2nd}, publisher = {Addison-Wesley Longman Publishing Co., Inc.}, address = {Boston, MA, USA}, } @article{HR88, author = {Torben Hagerup and Christine R{\"u}b}, title = {A Guided Tour of {C}hernoff Bounds}, journal = {Inf. Process. Lett.}, volume = {33}, number = {6}, year = {1990}, pages = {305-308}, ee = {http://dx.doi.org/10.1016/0020-0190(90)90214-I}, bibsource = {DBLP, http://dblp.uni-trier.de} } @book{M70, author = {P.L. Meyer}, title = {Introductory probability and statistical applications}, year = {1970}, publisher = {Addison-Wesley}, address = {Boston, MA, USA} } @book{MR95, author = {Motwani, Rajeev and Raghavan, Prabhakar}, title = {Randomized algorithms}, year = {1995}, isbn = {0-521-47465-5, 9780521474658}, publisher = {Cambridge University Press}, address = {New York, NY, USA}, } @article{STRA69, author = {Strassen, V.}, journal = {Numerische Mathematik}, pages = {354-356}, title = {Gaussian Elimination is not Optimal.}, url = {http://eudml.org/doc/131927}, volume = {13}, year = {1969}, } @book{KT05, author = {Kleinberg, Jon and Tardos, Eva}, title = {Algorithm Design}, year = {2005}, isbn = {0321295358}, publisher = {Addison-Wesley Longman Publishing Co., Inc.}, address = {Boston, MA, USA}, } @book{H-Book69, author = {Frank Harary}, title = {Graph theory}, publisher = {Addison-Wesley}, year = {1991}, isbn = {978-0-201-02787-7}, pages = {I-V, 1-274}, bibsource = {DBLP, http://dblp.uni-trier.de} } @book{Bollobas1998, abstract = {The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed account of newer topics, including Szemer\'edi's Regularity Lemma and its use, Shelah's extension of the Hales-Jewett Theorem, the precise nature of the phase transition in a random graph process, the connection between electrical networks and random walks on graphs, and the Tutte polynomial and its cousins in knot theory. In no other branch of mathematics is it as vital to tackle and solve challenging exercises in order to master the subject. To this end, the book contains an unusually large number of well thought-out exercises: over 600 in total. Although some are straightforward, most of them are substantial, and others will stretch even the most able reader.}, added-at = {2011-06-28T13:45:21.000+0200}, address = {Heidelberg}, author = {Bollobás, Béla}, biburl = {http://www.bibsonomy.org/bibtex/25a262529090bf388992c794162c8044f/rincedd}, edition = {corrected}, interhash = {4a6a449570484d4432128b5595ada1fa}, intrahash = {5a262529090bf388992c794162c8044f}, isbn = {038-7-98488-7}, keywords = {graph-theory graphs networks}, publisher = {Springer}, series = {Graduate texts in mathematics}, timestamp = {2011-06-28T13:45:21.000+0200}, title = {Modern Graph Theory}, year = 1998 } @book{Bondy1976, added-at = {2011-03-14T01:01:45.000+0100}, address = {New York}, author = {Bondy, J. A. and Murty, U. S. R.}, biburl = {http://www.bibsonomy.org/bibtex/2fed5fe594dfbd140d2356dd47eef797c/lantiq}, file = {full text:Bondy1976.pdf:PDF}, groups = {public}, interhash = {3c517b0b941bd26c4d28b9f784ba6a7f}, intrahash = {fed5fe594dfbd140d2356dd47eef797c}, keywords = {networks graphs}, publisher = {Elsevier}, timestamp = {2011-03-14T01:01:45.000+0100}, title = {Graph Theory with Applications}, username = {lantiq}, year = 1976 } @BOOK{LP-Matching86, AUTHOR = "L. Lov\'asz and M.D. Plummer", TITLE = "Matching Theory", BOOKTITLE = "Matching Theory", PUBLISHER = "Akad\'emiai Kiad\'o, Budapest", NOTE = "Also published as Vol. 121 of the North-Holland Mathematics Studies, North-Holland Publishing, Amsterdam", YEAR = "1986", } BibTeX | EndNote | ACM Ref @book{Even79, author = {Even, Shimon}, title = {Graph Algorithms}, year = {1979}, isbn = {0716780445}, publisher = {W. H. Freeman \& Co.}, address = {New York, NY, USA}, } @article{LT79, abstract = {Let G be any n-vertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than 2\&\#8730;2\&\#8730;n vertices. We exhibit an algorithm which finds such a partition A, B, C in O(n) time.}, author = {Lipton, Richard J. and Tarjan, Robert E.}, citeulike-article-id = {277347}, citeulike-linkout-0 = {http://www.jstor.org/stable/2100927}, journal = {SIAM Journal on Applied Mathematics}, keywords = {graph}, number = {2}, pages = {177--189}, posted-at = {2005-09-18 19:01:15}, priority = {4}, title = {A Separator Theorem for Planar Graphs}, url = {http://www.jstor.org/stable/2100927}, volume = {36}, year = {1979} } @article{Ir85, author = {Robert W. Irving}, title = {An Efficient Algorithm for the "Stable Roommates" Problem}, journal = {J. Algorithms}, volume = {6}, number = {4}, year = {1985}, pages = {577-595}, ee = {http://dx.doi.org/10.1016/0196-6774(85)90033-1}, bibsource = {DBLP, http://dblp.uni-trier.de} } @book{MU05, author = {Mitzenmacher, Michael and Upfal, Eli}, title = {Probability and Computing: Randomized Algorithms and Probabilistic Analysis}, year = {2005}, isbn = {0521835402}, publisher = {Cambridge University Press}, address = {New York, NY, USA}, } @inproceedings{BKMS15, author ={Biniaz, Ahmad and Kranakis, Evangelos and Maheshwari, Anil and Smid, Michiel}, title = {Plane and Planarity Thresholds for Random Geometric Graphs}, booktitle = {Proc.\ ALGOSENSORS 2015 (Patras, Greece)}, volume = ?, series = {Lecture Notes in Computer Science}, publisher = {Springer}, address = {Berlin, Germany}, year = {2015} }