Algorithms and Computation Book

	Solving NP-hard combinatorial problems in the practical sense	1
	Airline crew-scheduling problem with many irregular flights	2
	Practical approach to a facility location problem for Large-Scale Logistics	12
	Hard instance generation for SAT	22
	Playing tetris on meshes and multi-dimensional SHEARSORT	32
	Formulation of the addition-shift-sequence problem and its complexity	42
	Weighted and unweighted selection algorithms for k sorted sequences	52
	An adaptive distributed fault-tolerant routing algorithm for the start graph	62
	Multi-color routing in the undirected hypercube	72
	Competitive source routing on tori and meshes	82
	Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs	92
	Augmenting edge and vertex connectivities simultaneously	102
	Two-face Horn extensions	112
	Decremental maintenance of reachability in hypergraphs and minimum models of Horn formulae	122
	Algorithmic analysis of multithreaded algorithms	132
	A characterization of planar graphs by pseudo-line arrangements	133
	Optimal fault-tolerant broadcasting in trees	143
	A theoretical framework of hybrid approaches to MAX SAT	153
	Exponential lower bounds on the size of OBDDs representing integer division	163
	On-line versus off-line in money-making strategies with BROKERAGE	173
	Decision-making by hierarchies of discordant agents	183
	A new efficient off-line anonymous cash scheme	193
	Approximating unweighted connectivity problems in parallel	202
	A randomized linear work EREW PRAM algorithm to find a minimum spanning forest	212
	Efficient parallel algorithms for planar st-graphs	223
	Peg-solitaire, string rewriting systems and finite automata	233
	On the size of probabilistic formulae	243
	Homophonic coding with logarithmic memory size	253
	Complexity and modeling aspects of mesh refinement into quadrilaterals	263
	Topology oriented vs exact arithmetic - experience in implementing the three-dimensional convex hull algorithm	273
	The complexity of learning branches and strategies from queries	283
	Singularities make spatial join scheduling hard	293
	A faster one-dimensional topological compaction algorithm	303
	Algorithms for finding optimal disjoint paths around a rectangle	314
	An Algorithm for finding a region with the minimum total L[subscript 1] distance from prescribed terminals	324
	On defect sets in bipartite graphs	334
	Dynamic programming on distance-hereditary graphs	344
	On the equivalence in complexity among basic problems on bipartite and parity graphs	354
	All-cavity maximum matchings	364
	Fast algorithms for computer [beta]-skeletons and their relatives	374
	A branch-and-cut approach for minimum weight triangulation	384
	An efficient approximation scheme for the subset-sum problem	394
	Competitive call control in mobile networks	404
	Generalized swap-with-parent schemes for self-organizing sequential linear lists	414
	Author Index	425