Titlebook: WALCOM: Algorithms and Computation; Third International Sandip Das,Ryuhei Uehara Conference proceedings 2009 Springer-Verlag Berlin Heidel

勾引

Line Transversals and Pinning NumbersA . to a family of convex objects in ?. is a line intersecting each member of the family. There is a rich theory of geometric transversals, see for instance the surveys of Danzer et al. [6], Eckhoff [7], Goodman et al. [8] and Wenger [11].

背信

有說服力

Efficient Enumeration of Ordered Trees with , Leaves (Extended Abstract)In this paper, we give a simple algorithm to generate all ordered trees with exactly . vertices including exactly . leaves. The best known algorithm generates such trees in .(.???.) time for each, while our algorithm generates such trees in .(1) time for each in worst case.

coddle

Efficient Enumeration of Ordered Trees with , Leaves (Extended Abstract)In this paper, we give a simple algorithm to generate all ordered trees with exactly . vertices including exactly . leaves. The best known algorithm generates such trees in .(.???.) time for each, while our algorithm generates such trees in .(1) time for each in worst case.

冰河期

A Fully Dynamic Graph Algorithm for Recognizing Proper Interval GraphsWe present a fully dynamic graph algorithm to recognize proper interval graphs that runs in .(log.) worst case time per edge update, where . is the number of vertices in the graph. The algorithm also maintains the connected components and supports connectivity queries in .(log.) time.