Sciweavers

ISAAC
2001
Springer
87views Algorithms» more  ISAAC 2001»
13 years 8 months ago
On Removing the Pushdown Stack in Reachability Constructions
A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been shown recently that the binary reachability of a discrete pushdown timed automaton...
Oscar H. Ibarra, Zhe Dang
ISAAC
2001
Springer
98views Algorithms» more  ISAAC 2001»
13 years 8 months ago
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
Hideaki Hori, Shinichi Shimozono, Masayuki Takeda,...
ISAAC
2001
Springer
123views Algorithms» more  ISAAC 2001»
13 years 8 months ago
Labeling Subway Lines
Abstract. Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to convey their meaning. In this paper we focus on a pr...
Maria Angeles Garrido, Claudia Iturriaga, Alberto ...
ISAAC
2001
Springer
116views Algorithms» more  ISAAC 2001»
13 years 8 months ago
On-Line Multicasting in All-Optical Networks
We consider the routing for a special type of communication requests, called a multicast, consisting of a fixed source and a multiset of destinations in a wavelength division mult...
Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
13 years 8 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...
ISAAC
2001
Springer
102views Algorithms» more  ISAAC 2001»
13 years 8 months ago
Multiprocess Time Queue
Andrej Brodnik, Johan Karlsson
ISAAC
2001
Springer
125views Algorithms» more  ISAAC 2001»
13 years 8 months ago
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)
Evolutionary trees describing the relationship for a set of species are central in evolutionary biology, and quantifying differences between evolutionary trees is an important tas...
Gerth Stølting Brodal, Rolf Fagerberg, Chri...
ISAAC
2001
Springer
104views Algorithms» more  ISAAC 2001»
13 years 8 months ago
Algorithms for Pattern Involvement in Permutations
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
Michael H. Albert, Robert E. L. Aldred, Mike D. At...