E-LIB Suche - Ergebnisse für: Lu, Hsueh-I

1

Three-in-a-tree in near linear time:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,

Lai, Kai-Yuan ; Lu, Hsueh-I ; Thorup, Mikkel - p. 1279-1292 , 2020

Link: https://dl.acm.org/doi/1..

2

Minimum Cuts and Shortest Cycles in Directed Planar Graphs ..:

Liang, Hung-Chun ; Lu, Hsueh-I
SIAM Journal on Discrete Mathematics. 31 (2017) 1 - p. 454-476 , 2017

Link: https://doi.org/10.1137/..

3

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

Chang, Hsien-Chih ; Lu, Hsueh-I
Journal of Combinatorial Theory, Series B. 113 (2015) - p. 141-161 , 2015

Link: https://doi.org/10.1016/..

4

Linear-Time Compression of Bounded-Genus Graphs into Inform..:

Lu, Hsueh-I
SIAM Journal on Computing. 43 (2014) 2 - p. 477-496 , 2014

Link: https://doi.org/10.1137/..

5

Replacement Paths via Row Minima of Concise Matrices:

Lee, Cheng-Wei ; Lu, Hsueh-I
SIAM Journal on Discrete Mathematics. 28 (2014) 1 - p. 206-225 , 2014

Link: https://doi.org/10.1137/..

6

Computing the Girth of a Planar Graph in Linear Time:

Chang, Hsien-Chih ; Lu, Hsueh-I
SIAM Journal on Computing. 42 (2013) 3 - p. 1077-1094 , 2013

Link: https://doi.org/10.1137/..

7

Linear-Time Algorithms for Tree Root Problems:

Chang, Maw-Shang ; Ko, Ming-Tat ; Lu, Hsueh-I
Algorithmica. 71 (2013) 2 - p. 471-495 , 2013

Link: https://doi.org/10.1007/..

8

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

, In: Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms,

Chang, Hsien-Chih ; Lu, Hsueh-I - p. 1286-1297 , 2012

Link: https://dl.acm.org/doi/1..

9

Two-dimensional homing sort:

Wang, Bo-Yi ; Lu, Hsueh-I
Information Processing Letters. 111 (2011) 21-22 - p. 1067-1071 , 2011

Link: https://doi.org/10.1016/..

10

Minimum cycle bases of weighted outerplanar graphs:

Liu, Tsung-Hao ; Lu, Hsueh-I
Information Processing Letters. 110 (2010) 21 - p. 970-974 , 2010

Link: https://doi.org/10.1016/..

11

Improved Compact Routing Tables for Planar Networks via Ord..:

Lu, Hsueh-I
SIAM Journal on Discrete Mathematics. 23 (2010) 4 - p. 2079-2092 , 2010

Link: https://doi.org/10.1137/..

12

Visibility representations of four-connected plane graphs w..:

Chen, Chieh-Yu ; Hung, Ya-Fei ; Lu, Hsueh-I
Computational Geometry. 42 (2009) 9 - p. 865-872 , 2009

Link: https://doi.org/10.1016/..

13

Balanced parentheses strike back:

Lu, Hsueh-I ; Yeh, Chia-Chi
ACM Transactions on Algorithms (TALG). 4 (2008) 3 - p. 1-13 , 2008

Link: https://dl.acm.org/doi/1..

14

Balanced parentheses strike back:

Lu, Hsueh-I ; Yeh, Chia-Chi
ACM Transactions on Algorithms. 4 (2008) 3 - p. 1-13 , 2008

Link: https://doi.org/10.1145/..

15

Fast Algorithms for the Density Finding Problem:

Lee, D. T. ; Lin, Tien-Ching ; Lu, Hsueh-I
Algorithmica. 53 (2007) 3 - p. 298-313 , 2007

Link: https://doi.org/10.1007/..