Pat Morin |
|
Jan. 2001–Dec. 2001 | NSERC Post-doctoral fellow at McGill University |
Jan. 1998–Jan. 2001 | PhD (Computer Science) from Carleton University |
Sep. 1996–Jan. 1998 | M.C.S. degree from Carleton University |
Sep. 1991–May 1996 | B.C.S. degree (highest honours) from Carleton University |
January 2021 |
|
|||
January 2017 |
|
|||
January 2009 |
|
|||
June 2001 |
|
|||
Jan. 2001–Dec. 2001 |
|
|||
May 2001 |
|
|||
May 1999–Apr. 2001 |
|
|||
May 1997–Apr. 1999 |
|
2024–2027 |
|
||||
2024–2029 |
|
||||
2018–2024 |
|
||||
2017–2018 |
|
||||
2013–2017 |
|
||||
2012–2013 |
|
||||
2012–2013 |
|
||||
2009 |
|
||||
2008–2010 |
|
||||
2008–2012 |
|
||||
2008 |
|
||||
2008 |
|
||||
2008 |
|
||||
2008 |
|
||||
2007 |
|
||||
2007 |
|
||||
2006 |
|
||||
2003–2007 |
|
||||
2004 |
|
||||
2004 |
|
||||
2002 |
|
Professor |
|
|||
Professor of computer science | ||||
Associate Professor |
|
|||
Associate professor of computer science | ||||
Assistant Professor |
|
|||
Assistant professor of computer science | ||||
Postdoctoral Fellow |
|
|||
NSERC-funded postdoctoral fellow | ||||
Graph theory and algorithms |
The study of combinatorial, structural, and algorithmic problems on graphs [#!lpw!#,#!fasttri!#,#!labelling!#,#!clustered!#,#!k-planar!#,#!queue-best!#,#!layeredpathwidth!#,#!freecoll!#,#!turantype!#,#!alantree!#,#!orthogonaltreedecomp!#,#!interference2!#,#!layeredseparators!#,#!facial!#,#!augmentation!#,#!collsets!#,#!drawing-spanners!#] |
Geometric computing | The study of algorithmic and combinatorial geometry problems motivated by application areas such as robust statistics [#!zonoidd!#,#!zonoid!#,#!tukey!#,#!outliers!#,#!sums!#,#!minimalist!#], geographic information systems [#!grids!#,#!traversal!#,#!pm!#,#!tomlin!#], molecular biology and polymer physics [#!detour2!#,#!convexification!#,#!deflation!#,#!flipturns!#,#!detour!#], manufacturing [#!carpentry!#,#!quality!#,#!clamshell3d!#,#!clamshell2d!#], facility location [#!covering!#,#!2disks!#,#!sums!#,#!minimalist!#,#!bichromaticmst!#], automated cartography [#!dotmaps!#], machine learning [#!boundary!#], and visualization [#!onebend!#,#!treewidth!#,#!maxedges3d!#,#!straight3d!#] |
---|---|
Data structures | The design and analysis of efficient dictionaries [#!hashtables!#,#!robinhood!#,#!cuckoo!#,#!diet!#,#!biased-pred!#,#!arraylayouts!#] and geometric data structures [#!sums!#,#!minimalist!#] |
Online and distributed computing |
The design and analysis of communication protocols and distributed algorithms [#!routing_competitive!#,#!routing_triangs!#,#!asymmetric!#,#!routing_convex!#,#!routing_adhoc!#,#!traversal!#,#!streaming!#,#!avgtheta!#,#!interference2!#,#!alantree!#] |
Program Committees | ISAAC 2002, CCCG 2004, Adhoc Now 2005, AAIM 2006, ISAAC 2006, Adhoc Now 2006, CCCG 2006, SoCG 2007, Adhoc Now 2007, SWAT 2008, CCCG 2008, ISAAC 2008, CCCG 2009, EuroCG 2009, CATS 2009, CCCG 2010, CCCG 2012, COCOON 2012, ISAAC 2013, CCCG 2014, CCCG 2015, SoCG 2017, CCCG 2020, STACS 2021, WADS 2021, CCCG 2022, WADS 2023, SoCG 2023, CCCG 2024, ESA 2024 (Track S), WADS 2025, GD 2025 |
---|---|
Organizing Committee | CCCG 2007, Workshop on Geometry and Graphs (2013, 2014, 2015, 2016, 2017, 2018), CCCG 2017 |
Steering Committee Chair | WADS (2023–2028) |
Program Chair | CCCG 2008, WADS 2023 (co-chair), WADS 2025 (co-chair) |
Review Boards |
MITACS College of Reviewers (2008), Ontario Graduate Scholarship Selection Committee (2008), MRI Early Researcher Awards Adjudication Committee (2010, 2011, 2013, 2014, 2017, 2018, 2021), NSERC DG Evaluation Group 1507 (2021–2023), NSERC Discovery Horizons Fit Advisor 2023 |
Managing Editor | Journal of Computational Geometry (2009–2024, also co-founder, with Joachim Gudmundsson) |
|
Students and Postdocs | David R. Wood (Postdoc 2002–2004), Greg Aloupis (FCAR Postdoc 2005–2006), Meng He (Postdoc 2007–2008), Mohammad Farshi (Postdoc 2007–2008), Vida Dujmović (Postdoc 2008), Paz Carmi (Postdoc 2006–2008), Vida Dujmović (NSERC Postdoc 2004–2005, 2008–2009), Yihui Tang (Ph.D, 2008), Stefanie Wuhrer (M.C.S., 2006), Harish Gopala (M.C.S., 2004), John Howat (MCS, 2009), John Howat (PhD, 2012), Dan Chen (PhD, 2013), Zhamila Abdranova (MCS, 2013), Daniel Minor (MCS, 2015), Andre van Renssen (PhD, 2014), Sander Verdonschot (PhD, 2015), Tommy Reddad (MCS, 2015), Lucas Rioux-Maldague (MCS 2015), Luis Barba (PhD, 2016), Cory Fraser (MCS, 2016), Alexis Beingessner (MCS, 2016), Luis Fernando Schulz Xavier de Silveira (PhD 2020), Céline Yelle (MCS 2020), Hugo Akitaya (Postdoc, 2019–2020), Saeed Mehrabi (Postdoc, 2018–2020), Mehrnoosh Javarsineh (PhD, 2019–), Saman Bazarghani (PhD, 2019–), Saeed Odak (PhD, 2020–), Hussein Houdrouge (PhD, 2021–), David Worley (PhD, 2021–), Kaya Gouin (MCS 2023–), Bobby Miraftab (Postdoc, 2022–) |
---|---|
Honours Projects | Michael Hodge (Diameter Finding Algorithms, W2002), Jake Denley (Generation of Random Scenery, W2004), Darcy Dunne (A Fast Algorithm for Finding the Minimum Circular Half-Covering of a 2D Point Set), Tair Bilyalov (Random 3D Terrain in Computer Games, W2005), Jeremy Gribben (Procedural Generation of Random 3D Vehicles, W2005), Christopher Johnson (Randomized Scenery in 3D Gaming, W2005), Dmitry Karasik (IOUs in BitTorrent, W2005), Vladimir Bradateanu (Dynamically Generated Random Terrain and Trees, S2005), Jamie Suomela (Random Generation of Billboard Advertising for Use in Racing Games, S2005), Gi Wu (BitTorrent IOU Extensions, S2005), Mykola Konyk (Polyhedral Surface Reconstruction, W2006), Richard Poulin (Dynamic Workflow — Graph Drawing, S2007), Irwin Zaid (Graph Hierarchies which Approximate the Complete Euclidean Graph, F2007), Shayan Negari (Application Sharing Over the Public Internet, F2007), Rajinder Wasson (A Mediawiki Sports League Extension, W2008), Daniel Minor (Cuckoo Hashing in Python, W2008), Yini He (Fast Searching in the HTML DOM, W2008), Paul Cumming (MediaWiki 2.0, W2008), Vlad Rubinov (Fast HDR, F2009), Bryan Waite (Open Source decompression algorithms, W2010), Edward Duong (Real-time HDR, W2010), Calvin Wiebe (Halia: A JavaScript DOM Querying Algorithm, F2010), Nima Hoda (Visibility-Monotonic Polygon Deflation, W2013), Troy Hildebrandt (Robust Constructive Solid Geometry, W2013), Christian Delahouse (Data Structures for Approximate String Searching, W2015) Joel Scarfone (A C++ Eytzinger Library, F2017), Basim Ramadhan (The Lovelace Engine: A Simple & Secure Submission Server, W2018), Omar Ben Ismail (Interactive Visualization of Data Structures, W2018), William Dullemond (Using Bloom Filters to Test Set Differences over a Network, F2018), Noah Steinberg (Performance of Hash Table Implementations, W2019), Nathaniel Arnill (An Implementation of Product Structure, W2021), Kaya Gouin (Tripod Decompositions of Planar Graphs, W2023) |
|
Committees | Lab Committee (2002, 2003, 2004) |
---|---|
Hiring Commitee (2003, 2004, 2005, 2006, 2007, 2014, 2020, 2021, 2023) | |
Curriculum Committee (2003) | |
Departmental Promotions and Tenure Committee (2003, 2007, 2014, 2020, 2021, 2023) | |
Faculty Promotions and Tenure Committee (2020) | |
RAA Evaluation Committee (2013, 2014, 2016) | |
Development Grant Review Committee (2017) | |
Tenure and Promotion Appeals Committee (2019, 2020) | |
Field Institute Activities Committee (2019–2021, 2023) | |
SCS Executive Committe (2021) | |
SCS Tenure and Promotion Committee Chair (2020, 2021, 2023) | |
Faculty of Science Tenure and Promotion Committee (2020, 2021, 2023) | |
Courses Taught | COMP5408 Advanced Data Structures (W2002, F2003, F2004, W2006, W2007, W2008, F2009, W2011, W2012, W2013, W2014, F2021) |
COMP4804 Algorithms II (W2003, W2004, W2005, W2006, W2010, W2017) | |
COMP4900/5900 Computational Molecular Biology (W2006, W2007) | |
COMP3804 Algorithms I (W2006) | |
COMP3002 Compiler Construction (W2003, W2004, W2005, W2008, F2009, W2011, F2011) | |
COMP2804 Discrete Structures II (F20194#42, W2020, F2020, W2022) | |
COMP2405 Internet Application Programming (W2007, W2008) | |
COMP2402 Data Structures (F2010, F2011, F2012, F2013, F2014, F2016, F2018, F2020) | |
COMP5804 OCICS Graduate Seminar (2004, 2005, 2006, 2007, 2008) | |
COMP1405 Introduction to Programming (F2012, F2013, F2014) |
5#5
6#6
7#7
8#8
9#9
10#10
11#11
12#12