The following pages link to Lenwood S. Heath (Q176420):
Displaying 32 items.
- Labeled cuts in graphs (Q313962) (← links)
- Constructing homomorphism spaces and endomorphism rings. (Q597116) (← links)
- (Q675854) (redirect page) (← links)
- Graph embeddings and simplicial maps (Q675855) (← links)
- Covering a set with arithmetic progressions is NP-complete (Q910219) (← links)
- Edge-packing in planar graphs (Q1272595) (← links)
- Sorting by bounded block-moves (Q1281770) (← links)
- Representing polyhedra: Faces are better than vertices (Q1314534) (← links)
- Heuristics for laying out information graphs (Q1332692) (← links)
- New results for the minimum weight triangulation problem (Q1343467) (← links)
- Edge-packing planar graphs by cyclic graphs (Q1382263) (← links)
- An experimental evaluation of local search heuristics for graph partitioning (Q1382773) (← links)
- Sorting by short block-moves (Q1587783) (← links)
- Processor-efficient sparse matrix-vector multiplication (Q1767967) (← links)
- New algorithms for generating Conway polynomials over finite fields (Q2643550) (← links)
- (Q2748499) (← links)
- MINING POSETS FROM LINEAR ORDERS (Q2874042) (← links)
- (Q3138282) (← links)
- (Q3138954) (← links)
- Optimal embeddings of butterfly-like graphs in the hypercube (Q3355251) (← links)
- Constructing endomorphism rings via duals (Q3454753) (← links)
- Embedding Outerplanar Graphs in Small Books (Q3749074) (← links)
- Laying Out Graphs Using Queues (Q4015976) (← links)
- Comparing Queues and Stacks As Machines for Laying Out Graphs (Q4018851) (← links)
- (Q4252317) (← links)
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I (Q4268720) (← links)
- Stack and Queue Layouts of Directed Acyclic Graphs: Part II (Q4268810) (← links)
- The pagenumber of genus <i>g</i> graphs is O( <i>g</i> ) (Q4302800) (← links)
- Stack and Queue Layouts of Posets (Q4377447) (← links)
- Opal: A system for computing noncommutative gröbner bases (Q4594240) (← links)
- The PMU Placement Problem (Q5470792) (← links)
- The pagenumber of \(k\)-trees is \(O(k)\) (Q5931789) (← links)
