DescriptionThis thesis is about some recent work on computational aspects of problems in geometry and analysis. We consider some problems about the hardness of approximation of discrete Steiner trees, computation of explicit signings in the Kadison-Singer problem for graphs, contact dimensions of graphs in Hamming metric, lower bounds on depth for decision tree clustering, soft-rounding variant of k-modes algorithm for clustering categorical data and fairness aspects of linear regression.