Adapting Arthur: The transformations and adaptations of Wirnt von Graffenberg's Wigalois

The stories of King Arthur and his noble knights have fascinated audiences for many centuries and continue to being retold and fashioned to attract modern audiences. Amongst these stories is the tale of Wigalois, the son of the reputable Gawain. This dissertation traces the story of Wigalois across different languages, cultures, and media in order to show how this is a shared German-Yiddish narrative. Furthermore, this dissertations challenges traditional understanding of adaptation within a diachronic and teleological framework by uncovering dialogical and dynamic processes inherent in this narrative tradition. Using the theoretical framework of a combined Adaptation Studies and Medieval Literature Studies’ notions of unstable texts my argumentation focuses on eight specific examples: Wirnt von Grafenberg’s Wigalois (1st half 13th ct.), Italian murals from the fourteenth century, Wigoleis von dem Rade (1483/93), Viduvilt (Yiddish, 16th ct.), Johann Christoph Wagenseil’s Belehrung der Jüdisch-Teutschen Red- und Schreibart (Yiddish and German, 1715), Gabein (Yiddish, 1789), the illustrations by Ludwig Richter (before 1851), and Die phantastischen Abenteuer der Glücksritters Wigalois (Comic, German, 2011).

Algorithms for Geometric Matching, Clustering, and Covering

With the popularization of GPS-enabled devices such as mobile phones, location data are becoming available at an unprecedented scale. The locations may be collected from many different sources such as vehicles moving around a city, user check-ins in social networks, and geo-tagged micro-blogging photos or messages. Besides the longitude and latitude, each location record may also have a timestamp and additional information such as the name of the location. Time-ordered sequences of these locations form trajectories, which together contain useful high-level information about people's movement patterns.

The first part of this thesis focuses on a few geometric problems motivated by the matching and clustering of trajectories. We first give a new algorithm for computing a matching between a pair of curves under existing models such as dynamic time warping (DTW). The algorithm is more efficient than standard dynamic programming algorithms both theoretically and practically. We then propose a new matching model for trajectories that avoids the drawbacks of existing models. For trajectory clustering, we present an algorithm that computes clusters of subtrajectories, which correspond to common movement patterns. We also consider trajectories of check-ins, and propose a statistical generative model, which identifies check-in clusters as well as the transition patterns between the clusters.

The second part of the thesis considers the problem of covering shortest paths in a road network, motivated by an EV charging station placement problem. More specifically, a subset of vertices in the road network are selected to place charging stations so that every shortest path contains enough charging stations and can be traveled by an EV without draining the battery. We first introduce a general technique for the geometric set cover problem. This technique leads to near-linear-time approximation algorithms, which are the state-of-the-art algorithms for this problem in either running time or approximation ratio. We then use this technique to develop a near-linear-time algorithm for this

shortest-path cover problem.