Algorithmic Aspects in Information and Management Book

	Further reflections on a theory for basic algorithms	1
	Algorithmic DNA self-assembly	10
	Online scheduling on parallel machines with two GoS levels	11
	Online dial-a-ride problem with time-windows under a restricted information model	22
	Online scheduling with hard deadlines on parallel machines	32
	Maximizing the throughput of multiple machines on-line	43
	Lattice embedding of direction-preserving correspondence over integrally convex set	53
	Linear programming polytope and algorithm for mean payoff games	64
	Atomic routing games on maximum congestion	79
	Equilibrium distribution of advertising prices	92
	Finding faithful Boyce-Codd normal form decompositions	102
	Instant service policy and its application to deficit round Robin	114
	A compression-boosting transform for two-dimensional data	126
	Non-metric multicommodity and multilevel facility location	138
	Sublinear time width-bounded separators and their application to the protein side-chain packing problem	149
	Polygonal curve approximation using grid points with application to a triangular mesh generation with small number of different edge lengths	161
	Distributions of points and large convex hulls of k points	173
	Throwing stones inside simple polygons	185
	Some basics on tolerances	194
	Note on a class of admission control policies for the stochastic knapsack problem	207
	Inverse bottleneck optimization problems on networks	220
	An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity	231
	Connected set cover problem and its applications	243
	A branch and bound algorithm for exact, upper, and lower bounds on treewidth	255
	Recognition of probe cographs and partitioned probe distance hereditary graphs	267
	A new approach for solving the maximum clique problem	279
	The approximability of the exemplar breakpoint distance problem	291
	Computing the [lambda]-seeds of a string	303
	Subsequence packing : complexity, approximation, and application	314
	Decomposition based heuristic approach to frequency reassignment problem	324
	Approximation algorithms for minimum span channel assignment problems	334
	Weighted broadcast in linear radio networks	343
	Secure overlay network design	354
	A portfolio selection method based on possibility theory	367
	Branch on price : a fast winner determination algorithm for discount auctions	375
	Note on an auction procedure for a matching game in polynomial time	387