Hsueh-I Lu

From MaRDI portal
Person:833712

Available identifiers

zbMath Open lu.hsueh-iMaRDI QIDQ833712

List of research outcomes

PublicationDate of PublicationType
A Simple 2-Approximation for Maximum-Leaf Spanning Tree2023-11-16Paper
Finding a shortest even hole in polynomial time2023-10-05Paper
Detecting race conditions in parallel programs that use one semaphore2023-01-18Paper
Three-in-a-tree in near linear time2021-01-19Paper
Three-in-a-Tree in Near Linear Time2019-09-16Paper
https://portal.mardi4nfdi.de/entity/Q57434762019-05-10Paper
Balanced parentheses strike back2018-11-05Paper
Race-condition detection in parallel computation with semaphores (extended abstract)2017-12-05Paper
Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths2017-03-16Paper
A faster algorithm to recognize even-hole-free graphs2015-06-10Paper
Linear-time algorithms for tree root problems2015-05-26Paper
Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits2014-07-30Paper
Replacement Paths via Row Minima of Concise Matrices2014-06-19Paper
Computing the Girth of a Planar Graph in Linear Time2013-09-25Paper
Two-dimensional homing sort2013-04-04Paper
Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors2013-03-21Paper
Computing the Girth of a Planar Graph in Linear Time2011-08-17Paper
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees2010-12-03Paper
Algorithms - ESA 20032010-03-03Paper
An Optimal Labeling for Node Connectivity2009-12-17Paper
Minimum Cycle Bases of Weighted Outerplanar Graphs2009-12-17Paper
Visibility representations of four-connected plane graphs with near optimal heights2009-08-14Paper
Fast algorithms for the density finding problem2009-06-17Paper
Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights2009-03-03Paper
Width-Optimal Visibility Representations of Plane Graphs2008-05-27Paper
Linear-Time Algorithms for Tree Root Problems2007-09-07Paper
Algorithms and Data Structures2006-10-25Paper
Combinatorial Pattern Matching2005-12-14Paper
Computational Science – ICCS 20052005-11-30Paper
Orderly Spanning Trees with Applications2005-09-16Paper
Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications2005-05-12Paper
Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer2005-02-28Paper
An Optimal Algorithm for the Maximum-Density Segment Problem2005-02-21Paper
Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits2004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q48086222004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q30437392004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44723262004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44724822004-08-04Paper
Compact floor-planning via orderly spanning trees2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44222932003-09-03Paper
Detecting race conditions in parallel programs that use semaphores2003-08-19Paper
https://portal.mardi4nfdi.de/entity/Q44186332003-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44101252003-07-02Paper
https://portal.mardi4nfdi.de/entity/Q27683402002-03-24Paper
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs2000-10-18Paper
https://portal.mardi4nfdi.de/entity/Q42284872000-05-28Paper
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings1999-11-23Paper
Operations of interlaced trees and graceful trees1999-11-01Paper
Approximating Maximum Leaf Spanning Trees in Almost Linear Time1998-11-11Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Hsueh-I Lu