49 citations · 171 across the 6 of their papers we have counts for
4 papers · 1 filter
Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets
Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu
In a multiple-object auction, every bidder tries to win as many objects as possible with a bidding algorithm. This paper studies position-randomized auctions, which form a special…
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses
Richie Chih-Nan Chuang, Ashim Garg, Xin He +2
Let G be a plane graph of n nodes, m edges, f faces, and no self-loop. G need not be connected or simple (i.e., free of multiple edges). We give three sets of coding schemes for G…
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
Xin He, Ming-Yang Kao, Hsueh-I Lu
Let G be an embedded planar undirected graph that has n vertices, m edges, and f faces but has no self-loop or multiple edge. If G is triangulated, we can encode it using {4/3}m-1…
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
Xin He, Ming-Yang Kao, Hsueh-I Lu
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property pi is called a pi-graph. If pi satisfi…