In this monograph the authors survey results from a newly emerging line of research that targets algorithm analysis in the physical interference model. In the main part of our monograph they focus on wireless scheduling: given a set of communication requests, arbitrarily distributed in space, how can these requests be scheduled efficiently? They study the difficulty of this problem and examine algorithms for wireless scheduling with provable performance guarantees. Moreover, they present a few results for related problems and give additional context.