Abstract is missing.
- Origami, Linkages, and Polyhedra: Folding with AlgorithmsErik D. Demaine. 1 [doi]
- Reliable and Efficient Geometric ComputingKurt Mehlhorn. 2 [doi]
- Some Computational Challenges in Today s Bio-medicineRon Shamir. 3 [doi]
- Kinetic Collision Detection for Convex Fat ObjectsMohammad Ali Abam, Mark de Berg, Sheung-Hung Poon, Bettina Speckmann. 4-15 [doi]
- Dynamic Connectivity for Axis-Parallel RectanglesPeyman Afshani, Timothy M. Chan. 16-27 [doi]
- Single Machine Precedence Constrained Scheduling Is a Vertex Cover ProblemChristoph Ambühl, Monaldo Mastrolilli. 28-39 [doi]
- Cooperative TSPAmitai Armon, Adi Avidor, Oded Schwartz. 40-51 [doi]
- Fréchet Distance for Curves, RevisitedBoris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk. 52-63 [doi]
- Resource Allocation in Bounded Degree TreesReuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz. 64-75 [doi]
- Dynamic Algorithms for Graph SpannersSurender Baswana. 76-87 [doi]
- Latency Constrained Aggregation in Sensor NetworksLuca Becchetti, Peter Korteweg, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti. 88-99 [doi]
- Competitive Analysis of Flash-Memory AlgorithmsAvraham Ben-Aroya, Sivan Toledo. 100-111 [doi]
- Contention Resolution with Heterogeneous Job SizesMichael A. Bender, Jeremy T. Fineman, Seth Gilbert. 112-123 [doi]
- Deciding Relaxed Two-Colorability - A Hardness JumpRobert Berke, Tibor Szabó. 124-135 [doi]
- Negative Examples for Sequential Importance Sampling of Binary Contingency TablesIvona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda. 136-147 [doi]
- Estimating Entropy over Data StreamsLakshminath Bhuvanagiri, Sumit Ganguly. 148-159 [doi]
- Necklaces, Convolutions, and ::::X:::: + ::::Y::::David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian. 160-171 [doi]
- Purely Functional Worst Case Constant Time Catenable Sorted ListsGerth Stølting Brodal, Christos Makris, Kostas Tsichlas. 172-183 [doi]
- Taxes for Linear Atomic Congestion GamesIoannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos. 184-195 [doi]
- Spanners with SlackHubert T.-H. Chan, Michael Dinitz, Anupam Gupta. 196-207 [doi]
- Compressed Indexes for Approximate String MatchingHo-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong. 208-219 [doi]
- Traversing the Machining GraphDanny Z. Chen, Rudolf Fleischer, Jian Li, Haitao Wang, Hong Zhu. 220-231 [doi]
- Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix GamesBruno Codenotti, Mauro Leoncini, Giovanni Resta. 232-243 [doi]
- Distributed Almost Exact Approximations for Minor-Closed FamiliesAndrzej Czygrinow, Michal Hanckowiak. 244-255 [doi]
- Spectral Clustering by Recursive PartitioningAnirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra. 256-267 [doi]
- Finite Termination of Augmenting Path Algorithms in the Presence of Irrational Problem DataBrian C. Dean, Michel X. Goemans, Nicole Immorlica. 268-279 [doi]
- Dynamic Programming and Fast Matrix MultiplicationFrederic Dorn. 280-291 [doi]
- Near-Entropy Hotlink AssignmentsKarim Douïeb, Stefan Langerman. 292-303 [doi]
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based MethodsPetros Drineas, Michael W. Mahoney, S. Muthukrishnan. 304-314 [doi]
- Finding Total Unimodularity in Optimization Problems Solved by Linear ProgramsChristoph Dürr, Mathilde Hurand. 315-326 [doi]
- Preemptive Online Scheduling: Optimal Algorithms for All SpeedsTomás Ebenlendr, Wojciech Jawor, Jiri Sgall. 327-339 [doi]
- On the Complexity of the Multiplication Method for Monotone CNF/DNF DualizationKhaled M. Elbassioni. 340-351 [doi]
- Lower and Upper Bounds on FIFO Buffer Management in QoS SwitchesMatthias Englert, Matthias Westermann. 352-363 [doi]
- Graph Coloring with RejectionLeah Epstein, Asaf Levin, Gerhard J. Woeginger. 364-375 [doi]
- A Doubling Dimension Threshold ::::Theta::::(loglog::::n::::) for Augmented Graph NavigabilityPierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker. 376-386 [doi]
- Violator Spaces: Structure and AlgorithmsBernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron. 387-398 [doi]
- Region-Restricted Clustering for Geographic Data MiningJoachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan. 399-410 [doi]
- An ::::O::::(::::n:::::::3::: (loglog::::n::::/log::::n::::):::5/4:::) Time Algorithm for All Pairs Shortest PathsYijie Han. 411-417 [doi]
- Cheating by Men in the Gale-Shapley Stable Matching AlgorithmChien-Chung Huang. 418-431 [doi]
- Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad ThresholdAlexis C. Kaporis, Lefteris M. Kirousis, Elias C. Stavropoulos. 432-443 [doi]
- Enumerating Spanning and Connected Subsets in Graphs and MatroidsLeonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino. 444-455 [doi]
- Less Hashing, Same Performance: Building a Better Bloom FilterAdam Kirsch, Michael Mitzenmacher. 456-467 [doi]
- A Unified Approach to Approximating Partial Covering ProblemsJochen Könemann, Ojas Parekh, Danny Segev. 468-479 [doi]
- Navigating Low-Dimensional and Hierarchical Population NetworksRavi Kumar, David Liben-Nowell, Andrew Tomkins. 480-491 [doi]
- Popular Matchings in the Capacitated House Allocation ProblemDavid Manlove, Colin T. S. Sng. 492-503 [doi]
- Inner-Product Based Wavelet Synopses for Range-Sum QueriesYossi Matias, Daniel Urieli. 504-515 [doi]
- Approximation in Preemptive Stochastic Online SchedulingNicole Megow, Tjark Vredeveld. 516-527 [doi]
- Greedy in Approximation AlgorithmsJulián Mestre. 528-539 [doi]
- I/O-Efficient Undirected Shortest Paths with Unbounded Edge LengthsUlrich Meyer, Norbert Zeh. 540-551 [doi]
- Stochastic Shortest Paths Via Quasi-convex MaximizationEvdokia Nikolova, Jonathan A. Kelner, Matthew Brand, Michael Mitzenmacher. 552-563 [doi]
- Path Hitting in Acyclic GraphsOjas Parekh, Danny Segev. 564-575 [doi]
- Minimum Transversals in Posi-modular SystemsMariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige. 576-587 [doi]
- An LP-Designed Algorithm for Constraint SatisfactionAlexander D. Scott, Gregory B. Sorkin. 588-599 [doi]
- Approximate ::::k::::-Steiner Forests Via the Lagrangian Relaxation Technique with Internal PreprocessingDanny Segev, Gil Segev. 600-611 [doi]
- Balancing Applied to Maximum Network Flow ProblemsRobert Endre Tarjan, Julie Ward, Bin Zhang, Yunhong Zhou, Jia Mao. 612-623 [doi]
- Out-of-Order Event Processing in Kinetic Data StructuresMohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu. 624-635 [doi]
- Kinetic Algorithms Via Self-adjusting ComputationUmut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Jorge L. Vittes. 636-647 [doi]
- Parallel Machine Scheduling Through Column Generation: Minimax Objective FunctionsMarjan van den Akker, J. A. Hoogeveen, Jules W. van Kempen. 648-659 [doi]
- Reporting Flock PatternsMarc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle. 660-671 [doi]
- On Exact Algorithms for TreewidthHans Leo Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos. 672-683 [doi]
- An Improved Construction for Counting Bloom FiltersFlavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese. 684-695 [doi]
- An MINLP Solution Method for a Water Network ProblemCristiana Bragalli, Claudia D Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth. 696-707 [doi]
- Skewed Binary Search TreesGerth Stølting Brodal, Gabriel Moruz. 708-719 [doi]
- Algorithmic Aspects of Proportional Symbol MapsSergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann. 720-731 [doi]
- Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?Camil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup. 732-743 [doi]
- Multiline Addressing by Network FlowFriedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu. 744-755 [doi]
- The Engineering of a Compression Boosting Library: Theory vs Practice in BWT CompressionPaolo Ferragina, Raffaele Giancarlo, Giovanni Manzini. 756-767 [doi]
- The Price of Resiliency: A Case Study on Sorting with Memory FaultsUmberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano. 768-779 [doi]
- How Branch Mispredictions Affect QuicksortKanela Kaligosi, Peter Sanders. 780-791 [doi]
- Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional SpacesMichal Meyerovitch. 792-803 [doi]
- Engineering Highway HierarchiesPeter Sanders, Dominik Schultes. 804-816 [doi]
- Univariate Polynomial Real Root Isolation: Continued Fractions RevisitedElias P. Tsigaridas, Ioannis Z. Emiris. 817-828 [doi]
- Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution MethodRon Wein. 829-840 [doi]