ISAAC 2014 Accepted Papers
The Price of Order
Approximating Maximum Internal Spanning Tree Via Maximum Path-Cycle Cover
Average-Case Complexity of the Min-Sum Matrix Product Problem
Faster Algorithms for Computing the R* Consensus Tree
Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs
The Power and Limitations of Static Binary Search Trees with Lazy Finger
Depth-First Search Using O(n) bits
Minimum-Cost b-Edge Dominating Sets on Trees
Range Queries on Uncertain Data
An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem
Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay
A Short Implicant of a CNF Formula with Many Satisfying Assignments
Dynamic Interval Scheduling for Multiple Machines
Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography
Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs
Efficiently Correcting Matrix Products
Linear-time Algorithms for Proportional Apportionment
Euclidean TSP with few inner points in linear space
Decremenal ALL-Pairs ALL Shortest Paths and Betweenness Centrality.
Planar Matchings for Weighted Straight Skeletons
On the Computational Complexity of Vertex Integrity and Component Order Connectivity
Vertex Cover Reconfiguration and Beyond
Reconstructing Point Set Order Types from Radial Orderings
Co-Clustering Under the Maximum Norm
Rank-Maximal Matchings - Structure and Algorithms
On the Most Likely Voronoi Diagram and Nearest Neighbor Searching
Orienting Dynamic Graphs, With Applications to Maximal Matchings and Adjacency Queries
Minimal Obstructions for Partial Representations of Interval Graphs
The Generalized Popular Condensation Problem
Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotone Submodular Maximization
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph
An FPTAS for The Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution Integral
Faster Existential FO Model Checking on Posets
3D rectangulations and geometric matrix multiplication
Hashing and Indexing: succinct data structures and smoothed analysis
Bottleneck Partial-Matching Voronoi Diagrams and Applications
A Geometric Approach to Graph Isomorphism
Ham-Sandwich Cuts for Abstract Order Types
Planar Embeddings with Small and Uniform Faces
A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams
Covering Problems for Partial Words and for Indeterminate Strings
Throughput Maximization in Multiprocessor Speed-Scaling
Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift
An Efficient Method for Indexing All Topological Orders of a Directed Graph
Graph Orientation and Flows Over Time
Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties
Tradeoff between label space and auxiliary space for representation of equivalence classes
Dynamic and Multi-functional Labeling Schemes
Speed-scaling with no Preemptions
Approximation Algorithms Inspired by Kernelization Methods
Top-k Term-Proximity in Succinct Space
Polynomial-Time Algorithm for Sliding Tokens on Trees
An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol
Fixed-Parameter Tractability of Token Jumping on Planar Graphs
Lower Bounds for On-line Graph Colorings
A Simple Efficient Interior Point Method for Min-Cost Flow
Dynamic Path Counting and Reporting in Linear Space
On-line competitive coloring algorithms for bipartite graphs without long induced paths