The following pages link to Michael A. Langston (Q293396):
Displayed 50 items.
- Approximating the pathwidth of outerplanar graphs (Q293398) (← links)
- Charge and reduce: A fixed-parameter algorithm for string-to-string correction (Q456695) (← links)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- Resource allocation under limited sharing (Q750312) (← links)
- Item:Q293396 (redirect page) (← links)
- A performance guarantee for the greedy set-partitioning algorithm (Q790814) (← links)
- A storage-size selection problem (Q795502) (← links)
- Linear-time algorithms for problems on planar graphs with fixed disk dimension (Q845887) (← links)
- A bounded search tree algorithm for parameterized face cover (Q1002098) (← links)
- Nonconstructive advances in polynomial-time complexity (Q1098635) (← links)
- Stable duplicate-key extraction with optimal time and space bounds (Q1103387) (← links)
- On finding optimal and near-optimal lineal spanning trees (Q1105381) (← links)
- Online variable-sized bin packing (Q1111472) (← links)
- On a proposed divide-and-conquer minimal spanning tree algorithm (Q1115202) (← links)
- Improved 0/1-interchange scheduling (Q1169295) (← links)
- Stable set and multiset operations in optimal time and space (Q1182083) (← links)
- Constructive complexity (Q1182305) (← links)
- Parallel methods for solving fundamental file rearrangement problems (Q1200135) (← links)
- Obstruction set isolation for the gate matrix layout problem (Q1336625) (← links)
- On search, decision, and the efficiency of polynomial-time algorithms (Q1342869) (← links)
- On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory (Q1379838) (← links)
- On computing graph minor obstruction sets (Q1575945) (← links)
- Crown structures for vertex cover kernelization (Q2464323) (← links)
- An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem (Q2464330) (← links)
- Scalable parallel algorithms for FPT problems (Q2502279) (← links)
- Fixed-Parameter Tractability, A Prehistory, (Q2908528) (← links)
- (Q2918407) (← links)
- Graph Coloring and the Immersion Order (Q3082946) (← links)
- Analysis of a Compound Bin Packing Algorithm (Q3200540) (← links)
- Performance of Heuristics for a Computer Resource Allocation Problem (Q3313258) (← links)
- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel (Q3499737) (← links)
- A Hybrid Graph Representation for Recursive Backtracking Algorithms (Q3587345) (← links)
- Quadratic Kernelization for Convex Recoloring of Trees (Q3608834) (← links)
- Bounds for Multifit Scheduling on Uniform Processors (Q3660919) (← links)
- Variable Sized Bin Packing (Q3718155) (← links)
- Evaluation of a MULTIFIT-based scheduling algorithm (Q3725543) (← links)
- A Study of Composite Heuristic Algorithms (Q3754441) (← links)
- On a special case of uniform processor scheduling (Q3777448) (← links)
- (Q3798235) (← links)
- Nonconstructive tools for proving polynomial-time decidability (Q3798236) (← links)
- (Q3833615) (← links)
- (Q3942389) (← links)
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System (Q3951534) (← links)
- On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design (Q3989017) (← links)
- Polynomial-time self-reducibility: theoretical motivations and practical results<sup>∗</sup> (Q4009694) (← links)
- Fast Algorithms forK4Immersion Testing (Q4238533) (← links)
- (Q4273874) (← links)
- Constructivity issues in graph algorithms (Q4594259) (← links)
- MIMD VERSUS SIMD COMPUTATION: EXPERIENCE WITH NON-NUMERIC PARALLEL ALGORITHMS∗ † (Q4819986) (← links)
- (Q4845370) (← links)