1![Shiping Liu Curriculum Vitae Personal Data Date of Birth: 21 July, 1984 Place of Birth: Shandong Province, China Shiping Liu Curriculum Vitae Personal Data Date of Birth: 21 July, 1984 Place of Birth: Shandong Province, China](https://www.pdfsearch.io/img/023de6002977a32ce740a3f00499866d.jpg) | Add to Reading ListSource URL: www.maths.dur.ac.ukLanguage: English - Date: 2015-05-03 17:17:11
|
---|
2![Cheeger’s inequality revisited Daniel Grieser In this talk, I presented the ideas and results from the preprint ’The first eigenvalue of the Laplacian, isoperimetric constants, and the Max Flow Min Cut Theorem’, ar Cheeger’s inequality revisited Daniel Grieser In this talk, I presented the ideas and results from the preprint ’The first eigenvalue of the Laplacian, isoperimetric constants, and the Max Flow Min Cut Theorem’, ar](https://www.pdfsearch.io/img/56405e1eff0b4fcf98b045b114597dec.jpg) | Add to Reading ListSource URL: www.staff.uni-oldenburg.deLanguage: English - Date: 2014-03-19 05:34:42
|
---|
3![arXiv:1303.4222v3 [math.DG] 3 AprIsoperimetric domains of large volume in homogeneous three-manifolds William H. Meeks III arXiv:1303.4222v3 [math.DG] 3 AprIsoperimetric domains of large volume in homogeneous three-manifolds William H. Meeks III](https://www.pdfsearch.io/img/e09f867f189169510c9ab1027d957c16.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2013-04-04 22:15:57
|
---|
4![Spectral Analysis of Communication Networks Using Dirichlet Eigenvalues ∗ Alexander Tsiatas Spectral Analysis of Communication Networks Using Dirichlet Eigenvalues ∗ Alexander Tsiatas](https://www.pdfsearch.io/img/61bff13f71b09ed49b17bb3e37d6f9c5.jpg) | Add to Reading ListSource URL: www2013.wwwconference.orgLanguage: English - Date: 2014-07-21 08:47:04
|
---|
5![Advanced Algorithms 2012A – Problem Set 4 Robert Krauthgamer December 23, Prove that the number of connected components in a graph G is equal to the multiplicity of 0 among the eigenvalues of LG (the Laplacian Advanced Algorithms 2012A – Problem Set 4 Robert Krauthgamer December 23, Prove that the number of connected components in a graph G is equal to the multiplicity of 0 among the eigenvalues of LG (the Laplacian](https://www.pdfsearch.io/img/3655f39c3873d76ffa3e76668f5684f1.jpg) | Add to Reading ListSource URL: www.wisdom.weizmann.ac.ilLanguage: English |
---|
6![Knot Fingerprints Resolve Knot Complexity and Knotting Pathways in Tight Knots David A B Hyde & Kenneth C Millett Knot Fingerprints Resolve Knot Complexity and Knotting Pathways in Tight Knots David A B Hyde & Kenneth C Millett](https://www.pdfsearch.io/img/2a1d48558a953fbb9071be0d9b21de99.jpg) | Add to Reading ListSource URL: www.math.ucsb.eduLanguage: English - Date: 2013-05-22 13:15:49
|
---|
7![Jason Rosenhouse Contact Information Jason Rosenhouse Contact Information](https://www.pdfsearch.io/img/322961819b5ad3ef33e1144cf1971409.jpg) | Add to Reading ListSource URL: educ.jmu.eduLanguage: English - Date: 2013-02-06 16:56:54
|
---|
8![](https://www.pdfsearch.io/img/94163aebcd7c5cda26a59740f2dd0837.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2008-02-02 01:23:55
|
---|