Daniel R. Page

According to our database, Daniel R. Page authored at least 8 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Algorithms for the thief orienteering problem on directed acyclic graphs.

Andrew Bloch-Hansen, Roberto Solis-Oba, Daniel R. Page

Theor. Comput. Sci., 2025

2023

A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs.

Andrew Bloch-Hansen, Daniel R. Page, Roberto Solis-Oba

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2020

Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments.

Daniel R. Page, Roberto Solis-Oba, Marten Maack

Theor. Comput. Sci., 2020

Makespan minimization on unrelated parallel machines with a few bags.

Daniel R. Page, Roberto Solis-Oba

Theor. Comput. Sci., 2020

2019

Approximation algorithms for the graph balancing problem with two speeds and two job lengths.

Daniel R. Page, Roberto Solis-Oba

J. Comb. Optim., 2019

2016

A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights.

Daniel R. Page, Roberto Solis-Oba

Algorithms, 2016

2013

Parallel Algorithm for Second-Order Restricted Weak Integer Composition Generation for Shared Memory Machines.

Daniel R. Page

Parallel Process. Lett., 2013

Generalized Algorithm for Restricted Weak Composition Generation - Generation Algorithm for Second-Order Restricted Weak Compositions.

Daniel R. Page

J. Math. Model. Algorithms Oper. Res., 2013