The following pages link to Hsueh-I Lu (Q833712):
Displaying 48 items.
- Visibility representations of four-connected plane graphs with near optimal heights (Q833713) (← links)
- Fast algorithms for the density finding problem (Q1024779) (← links)
- Detecting race conditions in parallel programs that use semaphores (Q1402212) (← links)
- Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications (Q1776373) (← links)
- Operations of interlaced trees and graceful trees (Q1806074) (← links)
- Two-dimensional homing sort (Q1944203) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- (Q2768340) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- (Q3043739) (← links)
- Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees (Q3058546) (← links)
- Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights (Q3611838) (← links)
- An Optimal Labeling for Node Connectivity (Q3652218) (← links)
- Minimum Cycle Bases of Weighted Outerplanar Graphs (Q3652243) (← links)
- Approximating Maximum Leaf Spanning Trees in Almost Linear Time (Q4217304) (← links)
- (Q4228487) (← links)
- (Q4410125) (← links)
- (Q4418633) (← links)
- (Q4422293) (← links)
- Compact floor-planning via orderly spanning trees (Q4458889) (← links)
- (Q4472326) (← links)
- (Q4472482) (← links)
- A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs (Q4507374) (← links)
- Race-condition detection in parallel computation with semaphores (extended abstract) (Q4595506) (← links)
- An Optimal Algorithm for the Maximum-Density Segment Problem (Q4651540) (← links)
- Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer (Q4652618) (← links)
- Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings (Q4699160) (← links)
- (Q4808622) (← links)
- Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits (Q4828935) (← links)
- Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors (Q4909519) (← links)
- Balanced parentheses strike back (Q4962732) (← links)
- Replacement Paths via Row Minima of Concise Matrices (Q4979837) (← links)
- Detecting race conditions in parallel programs that use one semaphore (Q5060138) (← links)
- Three-in-a-tree in near linear time (Q5145012) (← links)
- Orderly Spanning Trees with Applications (Q5317182) (← links)
- Width-Optimal Visibility Representations of Plane Graphs (Q5387754) (← links)
- Algorithms and Data Structures (Q5394262) (← links)
- Computational Science – ICCS 2005 (Q5709403) (← links)
- Combinatorial Pattern Matching (Q5713550) (← links)
- (Q5743476) (← links)
- Linear-Time Algorithms for Tree Root Problems (Q5757900) (← links)
- Computing the Girth of a Planar Graph in Linear Time (Q5891165) (← links)
- Algorithms - ESA 2003 (Q5897241) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree (Q6066463) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6490972) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)
