Lenwood S. Heath

Available identifiers

zbMath Open heath.lenwood-sDBLPh/LenwoodSHeathWikidataQ108129268 ScholiaQ108129268MaRDI QIDQ176420

List of research outcomes

Publication	Date of Publication	Type
Understanding Computation	2024-01-05	Paper
Opal: a system for computing noncommutative Gröbner bases	2017-11-17	Paper
Labeled cuts in graphs	2016-09-12	Paper
Constructing endomorphism rings via duals	2015-11-26	Paper
Mining posets from linear orders.	2014-01-28	Paper
New algorithms for generating Conway polynomials over finite fields	2007-08-24	Paper
The PMU Placement Problem	2006-06-01	Paper
Processor-efficient sparse matrix-vector multiplication	2005-03-08	Paper
Constructing homomorphism spaces and endomorphism rings.	2004-08-06	Paper
Graph separators, with applications	2001-10-15	Paper
The pagenumber of \(k\)-trees is \(O(k)\)	2001-09-25	Paper
Sorting by short block-moves	2000-12-03	Paper
https://portal.mardi4nfdi.de/entity/Q4252317	2000-04-13	Paper
Sorting by bounded block-moves	1999-11-29	Paper
Stack and Queue Layouts of Directed Acyclic Graphs: Part II	1999-10-28	Paper
Stack and Queue Layouts of Directed Acyclic Graphs: Part I	1999-10-28	Paper
Edge-packing in planar graphs	1999-01-03	Paper
Edge-packing planar graphs by cyclic graphs	1998-03-25	Paper
An experimental evaluation of local search heuristics for graph partitioning	1998-03-18	Paper
Stack and Queue Layouts of Posets	1998-02-09	Paper
Graph embeddings and simplicial maps	1997-03-11	Paper
New results for the minimum weight triangulation problem	1995-01-19	Paper
The pagenumber of genus g graphs is O( g )	1994-11-13	Paper
Heuristics for laying out information graphs	1994-09-01	Paper
Representing polyhedra: Faces are better than vertices	1994-02-17	Paper
https://portal.mardi4nfdi.de/entity/Q3138282	1994-01-02	Paper
https://portal.mardi4nfdi.de/entity/Q3138954	1993-10-20	Paper
Comparing Queues and Stacks As Machines for Laying Out Graphs	1993-01-16	Paper
Laying Out Graphs Using Queues	1992-12-06	Paper
Covering a set with arithmetic progressions is NP-complete	1990-01-01	Paper
Optimal embeddings of butterfly-like graphs in the hypercube	1990-01-01	Paper
Embedding Outerplanar Graphs in Small Books	1987-01-01	Paper

Research outcomes over time

This page was built for person: Lenwood S. Heath