Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus

Jonathan A. Kelner. Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus. SIAM Journal on Computing, 35(4):882-902, 2006. [doi]

@article{Kelner06,
  title = {Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus},
  author = {Jonathan A. Kelner},
  year = {2006},
  url = {http://epubs.siam.org/SICOMP/volume-35/art_44724.html},
  tags = {graph-rewriting, rewriting, partitioning},
  researchr = {https://researchr.org/publication/Kelner06},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {35},
  number = {4},
  pages = {882-902},
}