You have Guest access.
Log In
Gerth Stølting Brodal and Stefano Leonardi
Front matter
1-8
Designing Reliable Algorithms in Unreliable Memories
9
From Balanced Graph Partitioning to Balanced Metric Labeling
10
Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism
11-22
Exploring an Unknown Graph Efficiently
23-34
Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio
35-46
Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut
47-58
Relax-and-Cut for Capacitated Network Design
59-70
On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,,
71-82
The Complexity of Games on Highly Regular Graphs
83-94
Computing Equilibrium Prices: Does Theory Meet Practice?
95-106
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions
107-118
An Algorithm for the SAT Problem for Formulae of Linear Length
119-130
Linear-Time Enumeration of Isolated Cliques
131-142
Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs
143-154
Delineating Boundaries for Imprecise Regions
155-166
Exacus: Efficient and Exact Algorithms for Curves and Surfaces
167-178
Min Sum Clustering with Penalties
179-190
Improved Approximation Algorithms for Metric Max TSP
191-202
Unbalanced Graph Cuts
203-214
Low Degree Connectivity in Ad-Hoc Networks
215-225
5-Regular Graphs are 3-Colorable with Positive Probability
226-237
Optimal Integer Alphabetic Trees in Linear Time
238-248
Predecessor Queries in Constant Time?
249-258
An Algorithm for Node-Capacitated Ring Routing
259-270
On Degree Constrained Shortest Paths
271-282
A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time (Extended Abstract)
283-292
Roll Cutting in the Curtain Industry (Extended Abstract)
293-304
Space Efficient Algorithms for the Burrows-Wheeler Backtransformation
305-316
Cache-Oblivious Comparison-Based Algorithms on Multisets
317-328
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
329-342
Allocating Memory in a Lock-Free Manner
343-354
Generating Realistic Terrains with Higher-Order Delaunay Triangulations
355-366
I/O-Efficient Construction of Constrained Delaunay Triangulations
367-378
Convex Hull and Voronoi Diagram of Additively Weighted Points
379-390
New Tools and Simpler Algorithms for Branchwidth
391-402
Treewidth Lower Bounds with Brambles
403-414
Minimal Interval Completions
415-425
A 2-Approximation Algorithm for Sorting by Prefix Reversals
426-437
Approximating the 2-Interval Pattern Problem
438-447
A Loopless Gray Code for Minimal Signed-Binary Representations
448-459
Efficient Approximation Schemes for Geometric Problems?
460-471
Geometric Clustering to Minimize the Sum of Cluster Sizes
472-483
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
484-495
Packet Routing and Information Gathering in Lines, Rings and Trees
496-507
Jitter Regulation for Multiple Streams (Extended Abstract)
508-519
Efficient c-Oriented Range Searching with DOP-Trees
520-531
Matching Point Sets with Respect to the Earth Mover’s Distance
532-543
Small Stretch Spanners on Dynamic Graphs
544-555
An Experimental Study of Algorithms for Fully Dynamic Transitive Closure
556-567
Experimental Study of Geometric t-Spanners
568-579
Highway Hierarchies Hasten Exact Shortest Path Queries
580-591
Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays
592-603
Fairness-Free Periodic Scheduling with Vacations
604-615
Online Bin Packing with Cardinality Constraints
616-627
Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines
628-639
Engineering Planar Separator Algorithms
640-651
Stxxl: Standard Template Library for XXL Data Sets
652-663
Negative Cycle Detection Problem
664-676
An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees
677-688
Online View Maintenance Under a Response-Time Constraint
689-701
Online Primal-Dual Algorithms for Covering and Packing Problems
702-713
Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information
714-725
Using Fractional Primal-Dual to Schedule Split Intervals with Demands
726-733
An Approximation Algorithm for the Minimum Latency Set Cover Problem
734-745
Workload-Optimal Histograms on Streams
746-757
Finding Frequent Patterns in a String in Sublinear Time
758-769
Online Occlusion Culling
770-778
Shortest Paths in Matrix Multiplication Time [Extended Abstract]
779-790
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
791-802
Greedy Routing in Tree-Decomposed Graphs
803-814
Making Chord Robust to Byzantine Attacks
815-826
Bucket Game with Applications to Set Multicover and Dynamic Page Migration
827-838
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
839-849
Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs
850-861
A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem
862-873
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
874-886
Robust Approximate Zeros
887-898
Optimizing a 2D Function Satisfying Unimodality Properties
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info