Hal Kierstead

About

Hal Kierstead's research is in the area of graph theory, especially graph coloring. This involves modeling the problem of partitioning a set of objects with internal conflicts into conflict-free parts, with many applications in computer science and operations research, including flight scheduling, bandwidth allocation, and register allocation. His work also has deep theoretical interest and involves finding efficient algorithms for partition problems presented with incomplete information, often requiring competitive analysis expressed through mathematical games. He has published more than 100 articles on related subjects.

Research topics

• Mathematics
• Combinatorics
• Computer Science
• Discrete mathematics
• Computer graphics (images)
• Art history
• Art

Selected publications

• Chromatic Numbers of Exact Distance Graphs

  arXiv (Cornell University) · 2016-12-07 · 24 citations

  articleOpen accessCorresponding

  For any graph $G=(V,E)$ and positive integer $p$, the exact distance-$p$ graph $G^{[\natural p]}$ is the graph with vertex set $V$, which has an edge between vertices $x$ and $y$ if and only if $x$ and $y$ have distance $p$ in $G$. For odd $p$, Ne\v{s}et\v{r}il and Ossona de Mendez proved that for any fixed graph class with bounded expansion, the chromatic number of $G^{[\natural p]}$ is bounded by an absolute constant. Using the notion of generalised colouring numbers, we give a much simpler pr…

  PublisherOA PDFDOI

• Improved lower bounds on the number of edges in list critical and online list critical graphs

  Journal of Combinatorial Theory Series B · 2019-07-09 · 10 citations

  preprintOpen access1st authorCorresponding
  PublisherOA PDFDOI

• On coloring numbers of graph powers

  Discrete Mathematics · 2019-11-03 · 8 citations

  articleOpen access1st author
  PublisherOA PDFDOI

• Sharpening an Ore-type version of the Corrádi–Hajnal theorem

  Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg · 2016-12-22 · 8 citations

  article1st author
  PublisherDOI

• Uniform orderings for generalized coloring numbers

  European Journal of Combinatorics · 2020 · 6 citations

  Senior authorCorresponding
  PublisherDOI

Recent grants

• Problems Related to Graph Packing

  NSF · $287k · 2009–2012

Frequent coauthors

• Alexandr Kostochka

  University of Illinois Urbana-Champaign

  25 shared

• W. T. Trotter

  Georgia Institute of Technology

  20 shared

• Andrzej Czygrinow

  12 shared

• Theodore Molla

  9 shared

• B. D. Dunlap

  University of Washington

  8 shared

• Landon Rabern

  7 shared

• Xuding Zhu

  7 shared

• Louis DeBiasio

  6 shared

Education

• Ph.D.

  University of California-San Diego

  1979

Similar researchers at Arizona State University

• Zdzislaw Jackiewiczh-33
• Sharon Crookh-23
• Donatella Daniellih-22