# Daniel R. PagePageWizard Games Learning & Entertainment

Daniel R. Page

PhD

Studying hard scheduling and graph problems, approximation algorithms.
Creating accessible Computer Science education!

## About

20

Publications

79,491

Reads

**How we measure 'reads'**

A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more

59

Citations

Introduction

My main interests are Theoretical Computer Science, Algorithms (Approximation Algorithms), Combinatorial Optimization (Scheduling and Graph Algorithms).
In the past, I was a Visiting Asst Prof of CS at NCF, Lecturer in CS at U of Regina, Asst Professor at StFX, an Instructor for Uni. of Western Ontario, a Sessional Instr. for the U of Manitoba, a Science Educator/Interpreter for the Royal Aviation Museum of Western Canada, an ex-"Mad Scientist" for Mad Science, and have worked with all ages.

Additional affiliations

August 2023 - May 2024

**New College of Florida**

Position

- Visiting Assistant Professor

Description

- Courses taught include: -Data Structures -Theory of Computation -Cryptography and Data Privacy -Algorithms. Tutorials: -Discrete Mathematics for Computer Science -Advanced Algorithms Independent Study Projects: Fundamentals of 2D Game Development (10 students)

July 2021 - August 2022

Position

- Lecturer

Description

- Courses Taught (Fall 2021): CS 340 Advanced Data Structures and Algorithm Design CS 411 Computability and Formal Languages CS 811 Theory of Computing Courses Taught (Winter 2022): CS 210: Data Structures and Algorithms CS 340 Advanced Data Structures and Algorithm Design Courses Taught (Spring/Summer 2022): CS 210: Data Structures and Algorithms CS 499/900: Seminars

January 2020 - September 2020

Education

January 2015 - June 2019

September 2012 - October 2014

September 2007 - October 2011

## Publications

Publications (20)

In the pursuit of finding subclasses of the makespan minimization problem on unrelated parallel machines that have approximation algorithms with approximation ratio better than 2, the graph balancing problem has been of current interest. In the graph balancing problem each job can be non-preemptively scheduled on one of at most two machines with th...

Consider a set of n jobs and m uniform parallel machines, where each job has a length p_j ∈ Q+ and each machine has a speed s_i ∈ Q+. The goal of the graph balancing problem with speeds is to schedule each job j non-preemptively on one of a subset M_j of at most 2 machines so that the makespan is minimized. This is a NP-hard special case of the mak...

Let there be a set J of n jobs and a set M of m parallel machines, where each job J j takes p i, j∈ Z+ time units on machine M i and assume p i, j=∞ implies job J j cannot be scheduled on machine M i. In makespan minimization on unrelated parallel machines (R|| C m a x), the goal is to schedule each job non-preemptively on a machine so as to minimi...

Let there be a set M of m parallel machines and a set J of n jobs, where each job j takes pi,j time units on machine Mi. In makespan minimization the goal is to schedule each job non-preemptively on a machine such that the length of the schedule, the makespan, is minimum. We investigate a generalization of makespan minimization on unrelated paralle...

We consider the scenario of routing an agent called a thief through a weighted graph from a start vertex s to an end vertex t. A set I of items each with weight w_i and profit p_i is distributed among V \ {s,t}. The thief, who has a knapsack of capacity W, must follow a simple path from s to t within a given time T while packing in the knapsack a s...

This data set concerns Canada Research Chair (CRC) positions in STEM fields that do not include Social Sciences, Health Sciences, and Medical Sciences. Our data set, which specializes the one by Burgess, contains every CRC job advertisement in these fields from July 1, 2023 to December 31, 2023.
We were concerned with what could loosely be called...

Society for Academic Freedom and Scholarship (SAFS) Newsletter No. 97, pages 13-14.
https://safs.ca/newsletters/issues/nl97.pdf

We consider the scenario of routing an agent called a thief through a weighted graph G = (V, E) from a start vertex s to an end vertex t. A set I of items each with weight w_i and profit p_i is distributed among V∖{s,t}. In the thief orienteering problem, the thief, who has a knapsack of capacity W, must follow a simple path from s to t within a gi...

From: Society for Academic Freedom and Scholarship (SAFS) Newsletter 91, pages 5-9.
http://safs.ca/newsletters/issues/nl91.pdf

This book is a collection of lectures notes on Data Structures and Algorithms. The content found in this book supplements the free video lecture series, of the same name, "Advanced Data Structures", by the author, Dr. Daniel Page. This video lecture series is available at http://www.pagewizardgames.com/datastructures. This book:
-Contains Computer...

A fundamental problem in scheduling is makespan minimization on unrelated parallel machines (R||Cmax). Let there be a set J of jobs and a set M of parallel machines, where every job Jj ∈ J has processing time or length pi,j ∈ ℚ+ on machine Mi ∈ M. The goal in R||Cmax is to schedule the jobs non-preemptively on the machines so as to minimize the len...

Let there be a set M of m parallel machines and a set J of n jobs, where each job j takes p_{i,j} time units on machine M_i. In makespan minimization the goal is to schedule each job non-preemptively on a machine such that the length of the schedule, the makespan, is minimum. We investigate a generalization of makespan minimization on unrelated par...

Let there be a set J of n jobs and a set M of m parallel machines, where each job j takes p_{i,j} ∈ ℤ^+ time units on machine i and assume p_{i,j}=∞ implies job j cannot be scheduled on machine i. In makespan minimization on unrelated parallel machines (R||C_{max}), the goal is to schedule each job non-preemptively on a machine so as to minimize th...

Let there be m parallel machines and n jobs, where a job j can be scheduled on machine i to take pi, j ∈ Z+ time units. The makespan Cmax is the completion time of a machine that finishes last. The goal is to produce a schedule with all n jobs that has minimum makespan. This is the makespan problem on unrelated parallel machines, denoted as R||Cmax...

Image processing has been applied for aesthetic or artistic purposes to produce a range of visual effects including abstracted images, painterly renderings, and comic-book, or cartoon effects. In this paper we examine the problem of transforming standard RGB images to having an appearance reminiscent of older console games. This is achieved by way...

In this paper we present a linear-time algorithm for drawing String Graphs in the plane for a restricted type of outerplanar grid drawing called an 8-Grid Outerplanar Grid Drawing. If a Grid Drawing has edges that only intersect integer coordinates and every vertex has at most eight neighbours, then a Grid Drawing is 8-Grid. If an 8-Grid Outerplana...

URL: http://hdl.handle.net/1993/23825
Let there be m parallel machines and n jobs to be scheduled non-preemptively. A job j scheduled on machine i takes p_{i,j} time units to complete, where 1 ≤ i ≤ m and 1 ≤ j ≤ n. For a given schedule, the makespan is the completion time of a machine that finishes last. The goal is to produce a schedule of all n...

In 2012, Page presented a sequential combinatorial generation algorithm for generalized types of restricted weak integer compositions called second–order restricted weak integer compositions. Second–order restricted weak integer compositions cover various types of restricted weak integer compositions of n parts such as integer compositions, bounded...

This paper presents a new algorithm that arrives at a generalized solution for the generation of restricted weak compositions of n-parts. In particular, this generalized algorithm covers many commonly sought compositions such as bounded compositions, restricted compositions, weak compositions, and restricted part compositions. Introduced is an algo...

In this thesis I present two new algorithms that arrive at a generalized solution for the enumeration (generation) of restricted weak compositions of n-parts. In particular, these generalized algorithms cover many common sought compositions such as bounded compositions, restricted compositions, weak compositions, and restricted part compo-sitions....

## Questions

Questions (9)