Douglas M. King

Orcid: 0000-0003-3846-9755

According to our database1, Douglas M. King authored at least 12 papers between 2012 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Finding Shortest Flip Sequences Between Connected Graph Partitions.
INFORMS J. Optim., 2026

2025
A framework for analyzing the periodically-observed time-homogeneous Poisson process.
J. Oper. Res. Soc., December, 2025

2024
An Optimization Case Study in Analyzing Missouri Redistricting.
INFORMS J. Appl. Anal., 2024

Facilitating Compromise in Redistricting with Transfer Distance Midpoints.
INFORMS J. Optim., 2024

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods.
CoRR, 2024

2023
Redistricting optimization with recombination: A local search case study.
Comput. Oper. Res., December, 2023

3D geo-graphs: Efficient flip verification for the spherical zoning problem.
Discret. Appl. Math., October, 2023

A Bisection Protocol for Political Redistricting.
INFORMS J. Optim., July, 2023

Multiobjective Optimization for Politically Fair Districting: A Scalable Multilevel Approach.
Oper. Res., March, 2023

2018
The geo-graph in practice: creating United States Congressional Districts from census blocks.
Comput. Optim. Appl., 2018

2015
Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning.
Math. Program., 2015

2012
Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning.
Oper. Res., 2012


  Loading...