Michael A. Langston

Available identifiers

zbMath Open langston.michael-aWikidataQ6832085 ScholiaQ6832085MaRDI QIDQ293396

List of research outcomes

Publication	Date of Publication	Type
Time-space optimal parallel merging and sorting	2018-09-14	Paper
Constructivity issues in graph algorithms	2017-11-17	Paper
https://portal.mardi4nfdi.de/entity/Q5365030	2017-09-29	Paper
Approximating the pathwidth of outerplanar graphs	2016-06-09	Paper
https://portal.mardi4nfdi.de/entity/Q5403032	2014-03-25	Paper
Charge and reduce: A fixed-parameter algorithm for string-to-string correction	2012-10-16	Paper
https://portal.mardi4nfdi.de/entity/Q2918407	2012-10-06	Paper
Fixed-Parameter Tractability, A Prehistory,	2012-09-05	Paper
Quadratic kernelization for convex recoloring of trees	2011-09-20	Paper
Graph Coloring and the Immersion Order	2011-03-18	Paper
A Hybrid Graph Representation for Recursive Backtracking Algorithms	2010-09-07	Paper
Linear-time algorithms for problems on planar graphs with fixed disk dimension	2010-01-29	Paper
Quadratic Kernelization for Convex Recoloring of Trees	2009-03-06	Paper
A bounded search tree algorithm for parameterized face cover	2009-02-23	Paper
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel	2008-06-03	Paper
Crown structures for vertex cover kernelization	2007-12-19	Paper
An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem	2007-12-19	Paper
Scalable parallel algorithms for FPT problems	2006-09-12	Paper
Computing and Combinatorics	2006-01-11	Paper
Computing and Combinatorics	2006-01-11	Paper
Parameterized and Exact Computation	2005-08-23	Paper
MIMD VERSUS SIMD COMPUTATION: EXPERIENCE WITH NON-NUMERIC PARALLEL ALGORITHMS∗ †	2004-10-06	Paper
On computing graph minor obstruction sets	2000-08-23	Paper
Obstruction set isolation for the gate matrix layout problem	2000-08-01	Paper
On search, decision, and the efficiency of polynomial-time algorithms	2000-06-21	Paper
Fast Algorithms forK4Immersion Testing	1999-03-30	Paper
On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory	1998-02-25	Paper
https://portal.mardi4nfdi.de/entity/Q4845370	1995-09-11	Paper
https://portal.mardi4nfdi.de/entity/Q4273874	1994-01-06	Paper
Parallel methods for solving fundamental file rearrangement problems	1993-01-17	Paper
Polynomial-time self-reducibility: theoretical motivations and practical results∗	1992-09-27	Paper
Constructive complexity	1992-06-28	Paper
On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design	1992-06-28	Paper
Stable set and multiset operations in optimal time and space	1992-06-27	Paper
Analysis of a Compound Bin Packing Algorithm	1991-01-01	Paper
Resource allocation under limited sharing	1990-01-01	Paper
Stable duplicate-key extraction with optimal time and space bounds	1989-01-01	Paper
Online variable-sized bin packing	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3833615	1989-01-01	Paper
On finding optimal and near-optimal lineal spanning trees	1988-01-01	Paper
On a proposed divide-and-conquer minimal spanning tree algorithm	1988-01-01	Paper
On a special case of uniform processor scheduling	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3798235	1988-01-01	Paper
Nonconstructive tools for proving polynomial-time decidability	1988-01-01	Paper
Nonconstructive advances in polynomial-time complexity	1987-01-01	Paper
A Study of Composite Heuristic Algorithms	1987-01-01	Paper
Variable Sized Bin Packing	1986-01-01	Paper
Evaluation of a MULTIFIT-based scheduling algorithm	1986-01-01	Paper
A performance guarantee for the greedy set-partitioning algorithm	1984-01-01	Paper
A storage-size selection problem	1984-01-01	Paper
Performance of Heuristics for a Computer Resource Allocation Problem	1984-01-01	Paper
Bounds for Multifit Scheduling on Uniform Processors	1983-01-01	Paper
Improved 0/1-interchange scheduling	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3942389	1982-01-01	Paper
Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System	1982-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Michael A. Langston