Abstract is missing.
- Reliable and Efficient Geometric ComputingKurt Mehlhorn. 1-2 [doi]
- Beware of the Model: Reflections on Algorithmic ResearchFranco P. Preparata. 3-4 [doi]
- On Search Problems in Complexity Theory and in Logic (Abstract)Pavel Pudlák. 5 [doi]
- Covering a Set of Points with a Minimum Number of LinesMagdalene Grantson, Christos Levcopoulos. 6-17 [doi]
- Approximation Algorithms for Capacitated Rectangle StabbingGuy Even, Dror Rawitz, Shimon Shahar. 18-29 [doi]
- In-Place Randomized Slope SelectionHenrik Blunck, Jan Vahrenhold. 30-41 [doi]
- Quadratic Programming and Combinatorial Minimum Weight Product ProblemsWalter Kern, Gerhard J. Woeginger. 42-49 [doi]
- Counting All Solutions of Minimum Weight Exact SatisfiabilityStefan Porschen. 50-59 [doi]
- Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT AlgorithmsEvgeny Dantsin, Edward A. Hirsch, Alexander Wolpert. 60-68 [doi]
- Network Discovery and Verification with Distance QueriesThomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák. 69-80 [doi]
- Deciding the FIFO Stability of Networks in Polynomial TimeMaik Weinard. 81-92 [doi]
- Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection RatesDimitrios Koukopoulos, Stavros D. Nikolopoulos. 93-104 [doi]
- Provisioning a Virtual Private Network Under the Presence of Non-communicating GroupsFriedrich Eisenbrand, Edda Happ. 105-114 [doi]
- Gathering Algorithms on Paths Under Interference ConstraintsJean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu. 115-126 [doi]
- On the Hardness of Range Assignment ProblemsBernhard Fuchs. 127-138 [doi]
- Black Hole Search in Asynchronous Rings Using TokensStefan Dobrev, Rastislav Kralovic, Nicola Santoro, Wei Shi. 139-150 [doi]
- On Broadcast Scheduling with Limited EnergyChristian Gunia. 151-162 [doi]
- A Near Optimal Scheduler for On-Demand Data BroadcastsHing-Fung Ting. 163-174 [doi]
- Fair Cost-Sharing Methods for Scheduling Jobs on Parallel MachinesYvonne Bleischwitz, Burkhard Monien. 175-186 [doi]
- Tighter Approximation Bounds for LPT Scheduling in Two Special CasesAnnamária Kovács. 187-198 [doi]
- Inapproximability Results for Orthogonal Rectangle Packing Problems with RotationsMiroslav Chlebík, Janka Chlebíková. 199-210 [doi]
- Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment ProblemsErez Kantor, David Peleg. 211-222 [doi]
- An Approximation Algorithm for a Bottleneck Traveling Salesman ProblemMing-Yang Kao, Manan Sanghi. 223-235 [doi]
- On the Minimum Common Integer Partition ProblemXin Chen, Lan Liu, Zheng Liu, Tao Jiang. 236-247 [doi]
- Matching Subsequences in TreesPhilip Bille, Inge Li Gørtz. 248-259 [doi]
- Distance Approximating Trees: Complexity and AlgorithmsFeodor F. Dragan, Chenyu Yan. 260-271 [doi]
- How to Pack Directed Acyclic Graphs into Small BlocksYuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano. 272-283 [doi]
- On-Line Coloring of H-Free Bipartite GraphsHajo Broersma, Agostino Capponi, Daniël Paulusma. 284-295 [doi]
- Distributed Approximation Algorithms for Planar GraphsAndrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska. 296-307 [doi]
- A New NC-Algorithm for Finding a Perfect Matching in ::::d::::-Regular Bipartite Graphs When ::::d:::: Is SmallRaghav Kulkarni. 308-319 [doi]
- Fixed-Parameter Tractability Results for Feedback Set Problems in TournamentsMichael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß. 320-331 [doi]
- Parameterized Algorithms for Hitting Set: The Weighted CaseHenning Fernau. 332-343 [doi]
- Fixed-Parameter Tractable Generalizations of Cluster EditingPeter Damaschke. 344-355 [doi]
- The Linear Arrangement Problem Parameterized Above Guaranteed ValueGregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo. 356-367 [doi]
- Universal Relations and #P-CompletenessHervé Fournier, Guillaume Malod. 368-379 [doi]
- Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument ClassesKatalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven. 380-391 [doi]