|
|||||||
|
|
EUROPEAN SYMPOSIUM ON ALGORITHMS 2013 - Accepted papers
Design and Analysis track Compressed Cache-Oblivious String B-tree Tight Kernel Bounds for Problems on Graphs with Small Degeneracy On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility Friendship and Stable Matching Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph Frechet queries in geometric trees Maximizing a Submodular Function with a Non-Downward Closed Constraint
An optimal online algorithm for weighted bipartite matching
and extensions to combinatorial auctions
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures Dynamic Graphs in the Sliding-Window Model On the Most Likely Convex Hull of Uncertain Points Logit Dynamics with Concurrent Updates for Local Interaction Games On the computational complexity of Erd\H os-Szekeres and related problems in $\R^3$ Secluded Connectivity Problems Tractable Parameterizations for the Minimum Linear Arrangement Problem List H-Coloring a Graph by Removing Few Vertices Long Circuits and Large Euler Subgraphs Versatile succinct representations of the bidirectional Burrows-Wheeler transform Top-k Document Retrieval in External Memory Economic 3-Colored Subdivision of Triangulations Flip Distance Between Triangulations of a Simple Polygon is NP-Complete PTAS for Minimizing Earth Mover's Distance under Rigid Transformations Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet Parameterized Complexity of Directed Steiner Tree on Sparse Graphs Rumor Spreading in Random Evolving Graphs On Resilient Graph Spanners Balls into Bins made Faster Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling Limitations of deterministic auction design for correlated bidders Largest chordal and interval subgraphs faster than 2^n Computing the Fréchet Distance with a Retractable Leash The Online Replacement Path Problem Exclusive Graph Searching Network bargaining with general capacities Euclidean Greedy Drawings of Trees Sparse Fault-Tolerant BFS Trees Better Approximation Algorithms for Technology Diffusion A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree Table Cartograms Revisiting the Problem of Searching on a Line On the existence of 0/1 polytopes with high semidefinite extension complexity The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial Inefficiency of Standard Multi-Unit Auctions Nearly Optimal Private Convolution Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement A Quantization Framework for Smoothed Analysis on Euclidean Optimization Problems Maximizing Barrier Coverage Lifetime with Mobile Sensors Encodings for Range Selection and Top-k Queries Optimal Color Range Reporting in One Dimension Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections Kernelization Using Structural Parameters on Sparse Graph Classes The Encoding Complexity of Two Dimensional Range Minimum Data Structures Improved Approximation Algorithms for Projection Games
Engineering and Applications track An Alternative Approach to Alternative Routes: HiDAR Vertex Deletion for 3D Delaunay Triangulations Connectivity Inference in Mass Spectrometry based Structure Determination A Practical FPTAS for Convex Stochastic Dynamic Programs Computing the Greedy Spanner in Linear Space
An Implementation of I/O-efficient Dynamic Breadth-First
Search using level-aligned hierarchical Clustering
An optimal and practical cache-oblivious algorithm for computing multiresolution rasters Shell: A Spatial Decomposition Data Structure for 3D Curve Traversal on Many-core Architectures Parallel String Sample Sort BICO: BIRCH meets Coresets for k-means The Compressed Annotation Matrix: an Efficient Data Structure for Computing Persistent Cohomology Theory and Implementation of Online Multiselection Algorithms Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets Labeling Moving Points with a Trade-Off Between Label Speed and Label Overlap Balanced Neighbor Selection for BitTorrent-like Networks
|
||||||
|
|
||||||
| webmaster - credits | |||||||