Where did Patrick Ryan Morin receive his Ph.D. degree from?
Carleton University
Prosenjit Bose et al.: An Optimal Algorithm for Product Structure in Planar Graphs. (2022) authored by Pat Morin. Saman Bahri et al.: Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended. (2011) authored by Pat Morin. authored by Pat Morin. Saman Bazarghani et al.: 2<unk>n Grids have Unbounded Anagram-Free Chromatic Number. (2022) authored by Pat Morin. Kevin Buchin et al.: Delaunay Triangulation of Imprecise Points Simplified and Extended. (2009) authored by Pat Morin. A. Karim Abu-Affash et al.: Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. (2018) authored by Pat Morin. Vida Dujmovic et al.: Planar Graphs have Bounded Queue-Number. (2019) authored by Pat Morin. Therese Biedl et al.: EPG-representations with Small Grid-Size. (2017) authored by Pat Morin. Prosenjit Bose et al.: Spanners of Complete k-Partite Geometric Graphs. (2009) authored by Pat Morin. Paz Carmi et al.: Anagram-Free Chromatic Number Is Not Pathwidth-Bounded. (2018) authored by Pat Morin. Vida Dujmovic et al.: Proof of the Clustered Hadwiger Conjecture. (2023) was authored by Pat Morin. He has published highly-cited work on geographic routing in geometric graphs, including unit disk graphs and triangulations, with coauthors including Jit Bose, Erik Demaine, Stefan Langerman, and Jorge Urrutia.
[INST]
Utilize the provided context information, to generate answers to the following question: 
- Generate the answer to the question based on the provided context.
- Avoid including any explanations or apologies in your responses.
- Only respond to questions that ask for the answer to the target question without any additional information.
- Strictly provide the answer without any additional text.
Question: Where did Patrick Ryan Morin receive his Ph.D. degree from?
Context: Prosenjit Bose et al.: An Optimal Algorithm for Product Structure in Planar Graphs. (2022) authored by Pat Morin. Saman Bahri et al.: Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended. (2011) authored by Pat Morin. authored by Pat Morin. Saman Bazarghani et al.: 2<unk>n Grids have Unbounded Anagram-Free Chromatic Number. (2022) authored by Pat Morin. Kevin Buchin et al.: Delaunay Triangulation of Imprecise Points Simplified and Extended. (2009) authored by Pat Morin. A. Karim Abu-Affash et al.: Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. (2018) authored by Pat Morin. Vida Dujmovic et al.: Planar Graphs have Bounded Queue-Number. (2019) authored by Pat Morin. Therese Biedl et al.: EPG-representations with Small Grid-Size. (2017) authored by Pat Morin. Prosenjit Bose et al.: Spanners of Complete k-Partite Geometric Graphs. (2009) authored by Pat Morin. Paz Carmi et al.: Anagram-Free Chromatic Number Is Not Pathwidth-Bounded. (2018) authored by Pat Morin. Vida Dujmovic et al.: Proof of the Clustered Hadwiger Conjecture. (2023) was authored by Pat Morin. He has published highly-cited work on geographic routing in geometric graphs, including unit disk graphs and triangulations, with coauthors including Jit Bose, Erik Demaine, Stefan Langerman, and Jorge Urrutia.
[/INST] Answer:
