Hsueh-I Lu

发表

Space-eecient Approximation Algorithms for Maxcut and Coloring Semideenite Programs

P. Klein, Hsueh-I Lu, 1996 .

Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING

Hsueh-I Lu, Philip N. Klein, Hsueh-I Lu, 1996, STOC '96.

Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths

Hsueh-I Lu, Hung-Chun Liang, Hsueh-I Lu, 2017, SIAM J. Discret. Math..

Minimum Cycle Bases of Weighted Outerplanar Graphs

Hsueh-I Lu, Tsung-Hao Liu, Hsueh-I Lu, 2009, ISAAC.

Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs

Hsueh-I Lu, Philip N. Klein, Hsueh-I Lu, 1998, ISAAC.

Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer

Hsueh-I Lu, Ching-Chi Lin, I-Fan Sun, 2002, SIAM J. Discret. Math..

Some Appli ations of Orderly Spanning Trees inGraph Drawing ?

Hsu-Chun Yen, Chien-Chih Liao, Ho-Lin Chen, 2002 .

The Power of Local Optimizations: Approximation Algorithms for Maximun-leaf Spanning Tree (DRAFT)*

Hsueh-I Lu, R. Ravi, 1996 .

The Power of Local Optimization: Approximation Algorithms for Maximum-Leaf Spanning Tree

Hsueh-I Lu, R. Raviy, 2007 .

A Near-linear-time Approximation Algorithm for Maximum-leaf Spanning Tree

Hsueh-I Lu, R. Ravi, 1996 .

2 J ul 2 00 1 Orderly Spanning Trees with Applications ∗

Hsueh-I Lu, 2008 .

Improved Algorithms for Recognizing Perfect Graphs and Finding Shortest Odd and Even Holes

Hsueh-I Lu, Yung-Chung Chiu, Kai-Yuan Lai, 2022, ArXiv.

Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses

Xin He, Ming-Yang Kao, Hsueh-I Lu, 1998, ICALP.

Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications

Ming-Yang Kao, Hsueh-I Lu, Michael H. Goldwasser, 2002, J. Comput. Syst. Sci..

An Optimal Algorithm for the Maximum-Density Segment Problem

Hsueh-I Lu, Kai-Min Chung, Hsueh-I Lu, 2003, SIAM J. Comput..

Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics

Ming-Yang Kao, Hsueh-I Lu, Michael H. Goldwasser, 2002, WABI.

An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract

Hsueh-I Lu, T. Tsou, T. Fan, 2003, CIAA.

Fast Algorithms for the Density Finding Problem

Hsueh-I Lu, D. T. Lee, Tien-Ching Lin, 2009, Algorithmica.

Detecting Race Conditions in Parallel Programs that Use Semaphores

Hsueh-I Lu, Philip N. Klein, Robert H. B. Netzer, 2002, Algorithmica.

Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract)

Hsueh-I Lu, Philip N. Klein, Robert H. B. Netzer, 1996, ESA.

Detecting Race Conditions in Parallel Programs that Use One Semaphore

Hsueh-I Lu, Philip N. Klein, Robert H. B. Netzer, 1993, WADS.

Three-in-a-tree in near linear time

Hsueh-I Lu, M. Thorup, Kai-Yuan Lai, 2019, STOC.

Linear-Time Algorithms for Tree Root Problems

Hsueh-I Lu, Ming-Tat Ko, Maw-Shang Chang, 2006, Algorithmica.

An Optimal Labeling for Node Connectivity

Hsueh-I Lu, Tai-Hsin Hsu, Hsueh-I Lu, 2009, ISAAC.

Computing the Girth of a Planar Graph in Linear Time

Hsueh-I Lu, Hsien-Chih Chang, Hsueh-I Lu, 2011, SIAM J. Comput..

A faster algorithm to recognize even-hole-free graphs pdf

Hsueh-I Lu, Hsien-Chih Chang, Hsueh-I Lu, 2012, J. Comb. Theory, Ser. B.

Approximating Maximum Leaf Spanning Trees in Almost Linear Time

R. Ravi, Hsueh-I Lu, Hsueh-I Lu, 1998, J. Algorithms.

Balanced parentheses strike back

Hsueh-I Lu, Chia-Chi Yeh, Hsueh-I Lu, 2008, TALG.

Orderly Spanning Trees with Applications

Yi-Ting Chiang, Hsueh-I Lu, Ching-Chi Lin, 2001, SIAM J. Comput..

An Optimal Multiple-Class Encoding Scheme for a Graph of Bounded Hadwiger Number

Hsueh-I Lu, 2023, arXiv.org.

Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits pdf

Hsueh-I Lu, Hsueh-I Lu, 2002, SODA '02.

Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings

Xin He, Ming-Yang Kao, Hsueh-I Lu, 1999, SIAM J. Discret. Math..

A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs

Xin He, Ming-Yang Kao, Hsueh-I Lu, 1999, ESA.

Approximation Algorithms for Multiprocessor Energy-Efficient Scheduling of Periodic Real-Time Tasks with Uncertain Task Execution Time

Tei-Wei Kuo, Hsueh-I Lu, Jian-Jia Chen, 2008, 2008 IEEE Real-Time and Embedded Technology and Applications Symposium.

A fast approximation algorithm for maximum-leaf spanning tree

R. Ravi, Hsueh-I Lu, Hsueh-I Lu, 1997, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).

Orderly spanning trees with applications to graph encoding and graph drawing

Yi-Ting Chiang, Hsueh-I Lu, Ching-Chi Lin, 2001, SODA '01.

Width-Optimal Visibility Representations of Plane Graphs

Hsueh-I Lu, Hsu-Chun Yen, Chun-Cheng Lin, 2007, ISAAC.

Flow Time Minimization under Energy Constraints

Tei-Wei Kuo, Hsueh-I Lu, Jian-Jia Chen, 2007, 2007 Asia and South Pacific Design Automation Conference.

Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices

Tei-Wei Kuo, Hsueh-I Lu, Jian-Jia Chen, 2005, WADS.

A Simple 2-Approximation for Maximum-Leaf Spanning Tree

Hsueh-I Lu, Isaac Liao, 2023, Int. J. Found. Comput. Sci..

Minimum cycle bases of weighted outerplanar graphs

Hsueh-I Lu, Tsung-Hao Liu, Hsueh-I Lu, 2009, Inf. Process. Lett..