Author(s): Goos, Gerhard; Hartmanis, Juris; Van Leeuwen, Jan
Series: Springer Lecture notes in computer science 2697
Publisher: Springer Berlin Heidelberg
Year: 2003
Language: English
Pages: 572
City: Berlin/Heidelberg
Content: Lecture Notes in Computer Science
Computing and Combinatorics
Copyright
Preface
Table of Contents
LIAR!
Experiments for Algorithm Engineering
Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers
Cylindrical Hierarchy for Deforming Necklaces
Geometric Algorithms for Agglomerative Hierarchical Clustering★
Traveling Salesman Problem of Segments★
Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs★
A Space Efficient Algorithm for Sequence Alignment with Inversions On the Similarity of Sets of Permutations and Its Applications to Genome ComparisonOn All-Substrings Alignment Problems
The Specker-Blatter Theorem Revisited
On the Divergence Bounded Computable Real Numbers
Sparse Parity-Check Matrices over Finite Fields
On the Full and Bottleneck Full Steiner Tree Problems★
The Structure and Number of Global Roundings of a Graph
On Even Triangulations of 2-Connected Embedded Graphs★
Petri Nets with Simple Circuits
Automatic Verification of Multi-queue Discrete Timed Automata
List Total Colorings of Series-Parallel Graphs Finding Hidden Independent Sets in Interval GraphsMatroid Representation of Clique Complexes
On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results★
The Complexity of Boolean Matrix Root Computation
A Fast Bit-Parallel Algorithm for Matching Extended Regular Expressions★
Group Mutual Exclusion Algorithms Based on Ticket Orders
Distributed Algorithm for Better Approximation of the Maximum Matching★
Efficient Mappings for Parity-Declustered Data Layouts
Approximate Rank Aggregation
Perturbation of the Hyper-Linked Environment Fast Construction of Generalized Suffix Trees over a Very Large AlphabetComplexity Theoretic Aspects of Some Cryptographic Functions
Quantum Sampling for Balanced Allocations
Fault-Hamiltonicity of Product Graph of Path and Cycle★
How to Obtain the Complete List of Caterpillars
Randomized Approximation of the Stable Marriage Problem★
Tetris is Hard, Even to Approximate
Approximate MST for UDG Locally
Efficient Construction of Low Weight Bounded Degree Planar Spanner
Isoperimetric Inequalities and the Width Parameters of Graphs★
Graph Coloring and the Immersion Order★ Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs★Scheduling Broadcasts with Deadlines
Improved Competitive Algorithms for Online Scheduling with Partial Job Values
Majority Equilibrium for Public Facility Allocation
On Constrained Minimum Pseudotriangulations
Pairwise Data Clustering and Applications★
Covering a Set of Points with a Minimum Number of Turns
Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees★
Bounds for Convex Crossing Numbers
On Spectral Graph Drawing
On a Conjecture on Wiener Indices in Combinatorial Chemistry
