Browsing Mathematics (Faculty of) by Supervisor "Koenemann, Jochen"
Now showing items 19 of 9

An Algorithm for Stable Matching with Approximation up to the Integrality Gap
(University of Waterloo, 20200710)In the stable matching problem we are given a bipartite graph G = (A ∪ B, E) where A and B represent disjoint groups of agents, each of whom has ordinal preferences over the members of the opposite group. The goal is to ... 
Capacitated Network Design on Outerplanar Graphs
(University of Waterloo, 20200903)Network design problems model the efficient allocation of resources like routers, optical fibres, roads, canals etc. to effectively construct and operate critical infrastructures. In this thesis, we consider the capacitated ... 
Computing the Nucleolus of Matching and bMatching Games
(University of Waterloo, 20210521)In the classical weighted matching problem the optimizer is given a graph with edge weights and their goal is to find a matching which maximizes the sum of the weights of edges in the matching. It is typically assumed in ... 
Craniosynostosis Surgery: A Study of Rearrangement
(University of Waterloo, 20201222)Cranial vault remodeling, a form of skull surgery is currently performed according to intuition developed over years of experience. The problem of how to best perform this surgery has not yet thoroughly been studied by ... 
Routing, Scheduling, and Sorting in Consolidated Networks
(University of Waterloo, 20240425)Modern parcel logistic networks are designed to ship demand between given origin, destination pairs of nodes in an underlying directed network. Efficiency dictates that volume needs to be consolidated at intermediate nodes ... 
Structure in Stable Matching Problems
(University of Waterloo, 20161214)In this thesis we provide two contributions to the study of structure in stable matching problems. The first contribution is a short new proof for the integrality of Rothblum’s linear description of the convex hull of ... 
Transversal Problems In Sparse Graphs
(University of Waterloo, 20220920)Graph transversals are a classical branch of graph algorithms. In such a problem, one seeks a minimumweight subset of nodes in a nodeweighted graph $G$ which intersects all copies of subgraphs~$F$ from a fixed family ... 
Two combinatorial problems from craniosynostosis
(University of Waterloo, 20220908)The art of cranial vault remodelling surgery is amazing and fascinating, but remains much of that, an art, to this day. In this thesis, we provide two mathematical approaches to tackle cranial vault remodelling surgery, ... 
Vertex Stabilizers for Network Bargaining Games
(University of Waterloo, 20220304)Network bargaining games form a prominent class of examples of game theory problems defined on graphs, where vertices represent players, and edges represent their possible interactions. An instance of a \emph{network ...