### Table 2. Spill on interval graphs with holes.

"... In PAGE 6: ... Consider for example a furthest-first-like strategy on sub-intervals (see Figure 1 for an illustration of sub-intervals). To design such a heuristic, a spill everywhere solution might be considered to drive decisions: between several candidates that end the furthest, which one is the most suitable to be evicted in the future? Unfortunately, as summarized by Table2 , most instances of spill everywhere with holes are NP-complete for a basic block. We start with a result similar to Theorem 4: even with holes, the spill everywhere problem with few registers is polynomial.... ..."

### Table 4: Interval Graph Statistics (after Spilling).

1992

Cited by 49

### Table 1 Interval graphs Circular-arc graphs

1998

Cited by 7

### Table 1: Results of the paper on interval and chordal graphs

2006

Cited by 5

### Table 1: File-sharing graph characteristics for intervals from 1 to 30 days.

2002

"... In PAGE 3: ...elatively small compared to our envisioned target (e.g., 155 users accessed files through SAM in January), we expect similar usage patterns for larger graphs. Table1 presents the characteristics of the graphs of users who shared data within various time intervals ranging from 1 day to 30 days. The small-world pattern is evident when comparing the clustering coefficient and average path length with those of a random graph of the same size (same number of nodes and edges): the clustering coefficient of a small-world graph is significantly larger than that of a similar random graph, while the average path length is about the same.... ..."

Cited by 31

### Table 5.1: Maximal Intervals for which a radial graph K-surface exists

1996

Cited by 1

### Table 5.1: Maximal Intervals for which a radial graph K-surface exists

1996

Cited by 1