Assistant Professor and Alley Heaps Associate, Department of Computer Science, St. Francis Xavier University
Office: Annex AX9D
Email (St. Francis Xavier University): dpage[a___t]stfx.ca
Email (Personal): drpage[a___t]pagewizardgames.com
Prospective M.Sc. Students: Funding is available to help support qualified individuals interested in studying under me in Theoretical Computer Science, within the scope of the research areas outlined below. For more information about and how to apply to the M.Sc. program at St. FX, please see http://www2.mystfx.ca/computer-science/thesis-based-msc.
Recently, I have been interested in scheduling theory and its ties with graph theory in the development of approximation algorithms and computational complexity results. Widely I have interests in algorithmic problems of Theoretical Computer Science and Combinatorial Optimization, with a specific focus at the crossroads of approximation algorithms, scheduling problems, and parameterized complexity. At the present time I am investigating parallel machine scheduling problems, and attempting to further unravel why parallel machine scheduling is so hard. Many of the algorithmic problems I investigate have applications in Operations Research.Degrees
2015 - 2019 Doctor of Philosophy (University of Western Ontario)
2012 - 2014 Master of Science (University of Manitoba)
2007 - 2011 Bachelor of Computer Science (Honours) (University of Manitoba)
Some of my current investigations:
Makespan Minimization on Unrelated Parallel Machines with a Few Bags.
D.R. Page, Roberto Solis-Oba. Submitted to Theoretical Computer Science (December 2018) , Elsevier (invitation for special issue, AAIM 2018)
Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job Assignments.
D.R. Page, Roberto Solis-Oba, Marten Maack. Theoretical Computer Science, Volume 809 (24 February 2020), pages 204-217. Elsevier. DOI: https://doi.org/10.1016/j.tcs.2019.12.009
Approximation Algorithms for the Graph Balancing Problem with Two Speeds and Two Job Lengths [SharedIt - View Only*].
D.R. Page, Roberto Solis-Oba. Journal of Combinatorial Optimization (JOCO), Volume 37 (1 April 2019), pages 1045-1070. Springer. DOI: https://doi.org/10.1007/s10878-018-0339-x
A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights [Open Access].
D.R. Page, Roberto Solis-Oba. Algorithms, Volume 9 (Issue 2), 38 - June 2016. MDPI. DOI: https://doi.org/10.3390/a9020038
Approximation Algorithms for Subclasses of the Makespan Problem on Unrelated Parallel Machines with Restricted Processing Times [Mirror][Accepted Version, has a minor correction].
D. R. Page. SOP Transactions on Applied Mathematics, Scientific Online Publishing, Volume 2 (Issue 1) - January 2015.
Parallel Algorithm for Second-Order Restricted Weak Integer Composition Generation for Shared Memory Machines [Accepted Version*].
D. R. Page. Parallel Processing Letters (PPL), Volume 23 (Issue 3) - September 2013. World Scientific. DOI: https://doi.org/10.1142/S0129626413500102
Generalized Algorithm for Restricted Weak Composition Generation [Accepted Version*].
D. R. Page. Journal of Mathematical Modelling and Algorithms in Operations Research (JMMA), Volume 12 (Issue 4), pages 345-372 - December 2013. Springer. DOI: https://doi.org/10.1007/s10852-012-9194-4
Makespan Minimization on Unrelated Parallel Machines with a Few Bags [Accepted Version*].
D.R. Page, Roberto Solis-Oba. In: Algorithmic Aspects in Information and Management. AAIM 2018. Lecture Notes in Computer Science, Volume 11343, pages 24-35. Springer. DOI: https://doi.org/10.1007/978-3-030-04618-7_3 (AAIM 2018).
Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job Assignments [Accepted Version*].
D.R. Page, Roberto Solis-Oba, Marten Maack. In: Combinatorial Optimization and Applications. COCOA 2018. Lecture Notes in Computer Science, Volume 11346, pages 341-356. Springer. DOI: https://doi.org/10.1007/978-3-030-04651-4_23 (COCOA 2018).
Ph.D. Thesis: Approximation Algorithms for Problems in Makespan Minimization on Unrelated Parallel Machines.
D. R. Page, Supervisor: Dr. Roberto Solis-Oba, Ph.D. Thesis, Electronic Thesis and Dissertation Repository. 6109. April 2019, The University of Western Ontario
M.Sc. Thesis: Tractability and Approximability for Subclasses of the Makespan Problem on Unrelated Parallel Machines.
D. R. Page, Supervisor: Dr. Ben Pak Ching Li, M.Sc. Thesis, August 2014, University of Manitoba.
Thesis: Generalized Methods for Restricted Weak Composition Enumeration, (not online) (August 2011).
D.R. Page, Supervisor: Dr. John van Rees, University of Manitoba, Summer 2011. (Undergraduate Thesis)
Non-refereed articles and reports
Drawing String Graphs for 8-Grid Outerplanar Grid Drawings [ResearchGate].
D.R. Page, Self-published Oct. 2, 2014, research completed May 2013. ResearchGate DOI: 10.13140/2.1.1496.9602
Survey: Enumeration Algorithms for Unrestricted and Restricted Compositions and Words, (online) (January 2011).
D. R. Page, originally completed at University of Manitoba, Winter 2011.
I have reviewed for the following conferences and journals:
The following is my current teaching experience:
|University||Course||Term||# of Students|
|StFX||CSCI 277 [Discrete Structures]||Winter 2020||
|StFX||CSCI 128 [Computing Literacy and Coding for Problem Solving]||Winter 2020||
|UWO||COMPSCI 2210B [Data Structures and Algorithms]||Winter 2019||
|UM||COMP 2080 [Analysis of Algorithms]||Summer Session 2014||46|
|UM||COMP 1260 [Introductory Computer Usage 1]||Winter 2014||72|
|UM||COMP 1260 [Introductory Computer Usage 1]||Fall 2013||
|UM||COMP 2080 [Analysis of Algorithms]||Summer Session 2013||44|
|UM||COMP 1260 [Introductory Computer Usage 1]||Winter 2013||
|UM||COMP 1260 [Introductory Computer Usage 1]||Fall 2012||
|UM||COMP 1260 [Introductory Computer Usage 1]||Summer Session 2012||
Rate My Professors (UM/UWO): 4.8 out of 5 overall (as of May 2019).
Due to my obligations, I will not be taking any clients. I have tutored the following courses in the past:
Secondary School Level:
Post Secondary School Level:
Red River College
- MATH1007 - Calculus
University of Manitoba
- COMP1010 - Introduction to Computer Science 1
- COMP1020 - Introduction to Computer Science 2
- COMP2130 - Discrete Mathematics for Computer Science
- COMP2140 - Data Structures and Algorithms
- COMP2080 - Analysis of Algorithms
- COMP3170 - Analysis of Algorithms and Data Structures
- MATH1500 - Introduction to Calculus
- MATH1700 - Calculus 2
- STAT1000 - Basic Statistical Analysis
I am a member of SAFS, the Society for Academic Freedom and Scholarship (2018-current).
Here you will find a small set of examples of software I have worked outside my academic work, independently: