The ability to solve a system of linear equations lies at the heart of areas like optimization, scientific computing, and computer science and has traditionally been a central topic of research in the area of numerical linear algebra. An important class of instances that arise in practice has the form Lx=b where L is the Laplacian of an undirected graph. After decades of sustained research and combining tools from disparate areas, we now have Laplacian solvers that run in time nearly-linear in the sparsity of the system, which is a distant goal for general systems. Surprisingly, Laplacian solvers are impacting the theory of fast algorithms for fundamental graph problems.In this monograph, the emerging paradigm of employing Laplacian solvers to design novel fast algorithms for graph problems is illustrated through a small but carefully chosen set of examples. A significant part of this monograph is also dedicated to developing the ideas that go into the construction of near-linear time Laplacian solvers. An understanding of these methods, which marry techniques from linear algebra and graph theory, will not only enrich the tool-set of an algorithm designer but will also provide the ability to adapt these methods to design fast algorithms for other fundamental problems.This monograph can be used as the text for a graduate-level course, or act as a supplement to a course on spectral graph theory or algorithms. The writing style, which deliberately emphasizes the presentation of key ideas over rigor, will make it accessible to advanced undergraduates.