yusuke1997/dblp-id-title huggingface dataset:
An Online Algorithm for Finding the Longest Previous Factors
Multi-player and Multi-round Auctions with Severely Bounded Communication
I/O-Efficient Construction of Constrained Delaunay Triangulations
Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back
Optimal Parallel Shortest Paths in Small Treewidth Digraphs
Relaxed Models for Adversarial Streaming: The Bounded Interruptions Model and the Advice Model
Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics
Algorithms - ESA '97, 5th Annual European Symposium, Graz, Austria, September 15-17, 1997, Proceedings
An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
Improved Algorithm for Dynamic b-Matching
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
An Experimental Study of New and Known Online Packet Buffering Algorithms
Tight Approximations for Resource Constrained Scheduling Problems
Shared Memory Simulations with Triple-Logarithmic Delay
On Dynamic Shortest Paths Problems
Online Makespan Scheduling Under Scenarios
Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems
Experimental Study of Geometric t -Spanners
Polynomial-Time Approximation Schemes for Shortest Path with Alternatives
Fractional Linear Matroid Matching Is in Quasi-NC
Parallel Weighted Random Sampling
Geometric Spanners for Weighted Point Sets
Computing the Agreement of Trees with Bounded Degrees
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme
SAT Backdoors: Depth Beats Size
Approximability of OFDMA Scheduling
A New Family of Randomized Algorithms for List Accessing
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies
Weighted Model Counting on the GPU by Exploiting Small Treewidth
25th Annual European Symposium on Algorithms, ESA 2017, Vienna, Austria, September 4-6, 2017
Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian
Improved Bounds for Online Stochastic Matching
Data Structures: Time, I/Os, Entropy, Joules!
Hitting and Harvesting Pumpkins
How Branch Mispredictions Affect Quicksort
Minimizing the Maximum Starting Time On-line
Positive Linear Programming, Parallel Approximation and PCP's
On the Most Likely Convex Hull of Uncertain Points
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons
On Computing Straight Skeletons by Means of Kinetic Triangulations
Interval Graphs with Side (and Size) Constraints
All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables
Competitive Online Approximation of the Optimal Search Ratio
Representative Sets of Product Families
Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping
Spanners with Slack
Fine-Grained Classification of Detecting Dominating Patterns
The Centroid of Points with Approximate Weights
Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations
Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet
Authenticated Data Structures
Going Beyond Surfaces in Diameter Approximation
On-line Competive Algorithms for Call Admission in Optical Networks
FPT Algorithms for Embedding into Low Complexity Graphic Metrics
An Approximation Algorithm for MAX-2-SAT with Cardinality Constraint
Packing Directed Circuits Quarter-Integrally
Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
k-Center Clustering with Outliers in the Sliding-Window Model
Finding Branch-Decompositions and Rank-Decompositions
ℓ p -Norm Multiway Cut
Longest Common Substring Made Fully Dynamic
On Isolating Points Using Disks
A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands
On Hashing by (Random) Equations (Invited Talk)
Linear-Time Recognition of Probe Interval Graphs
New Lower and Upper Bounds for Representing Sequences
Near Optimal Dual Fault Tolerant Distance Oracle
Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points
Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time
Polynomial Decompositions in Polynomial Time
On the Expansion and Diameter of Bluetooth-Like Topologies
Revisiting the Random Subset Sum Problem
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
On the Number of Spanning Trees a Planar Graph Can Have
Deterministic Approximation Algorithm for Graph Burning
Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
Can You Solve Closest String Faster Than Exhaustive Search?
Optimal Resilient Dynamic Dictionaries
Locally Correct Fréchet Matchings
Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs
Workload-Optimal Histograms on Streams
Preemptive Weighted Completion Time Scheduling of Parallel Jobs
Algorithms for Playing Games with Limited Randomness
Finding and Counting Given Length Cycles (Extended Abstract)
A Method for Creating Near-Optimal Instances of a Certified Write-All Algorithm (Extended Abstract)
Fréchet Distance of Surfaces: Some Simple Hard Cases
External Memory Algorithms
Linear-Time Enumeration of Isolated Cliques
A Software Library for Elliptic Curve Cryptography
Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs
Outlier Robust Multivariate Polynomial Regression
Mixing Color Coding-Related Techniques
Data Structures Lower Bounds and Popular Conjectures
Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming
Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts
Local Optimization Algorithms for Maximum Planar Subgraph
New Parameterized Algorithms for APSP in Directed Graphs
Economic 3-Colored Subdivision of Triangulations
Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better
(No) Quantum Space-Time Tradeoff for USTCON
Better Diameter Algorithms for Bounded VC-Dimension Graphs and Geometric Intersection Graphs
Self-Simulation for the Passive Optical Star Model
Minimum Common String Partition: Exact Algorithms
Local Max-Cut on Sparse Graphs
Equilibrium Computation in Atomic Splittable Routing Games
Incremental Algorithms for Facility Location and k-Median
Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes
Worst-Case to Expander-Case Reductions: Derandomized and Generalized
Fully Dynamic Algorithms for Bin Packing: Being (mostly) Myopic Helps
An Experimental Study of Dynamic Algorithms for Directed Graphs
Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures
Mixed-Criticality Scheduling of Sporadic Task Systems
Coloring Sparse Random Graphs in Polynominal Average Time
Optimizing a 2D Function Satisfying Unimodality Properties
Polynomial Time Algorithms for Minimum Energy Scheduling
Efficient Parallel Output-Sensitive Edit Distance
A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs
Uniform Algorithms for Deterministic Construction of Efficient Dictionaries
Efficient Block Approximate Matrix Multiplication
Matching Point Sets with Respect to the Earth Mover's Distance
Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary
SimBa: An Efficient Tool for Approximating Rips-Filtration Persistence via Simplicial Batch-Collapse
The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions
Computing Equilibria in Markets with Budget-Additive Utilities
An Approximation Scheme for Cake Division with a Linear Number of Cuts
An Approximate Kernel for Connected Feedback Vertex Set
epsilon-Kernel Coresets for Stochastic Points
A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs
Maximum Coverage in Random-Arrival Streams
Exponential Time Paradigms Through the Polynomial Time Lens
Graph Modification of Bounded Size to Minor-Closed Classes as Fast as Vertex Deletion
A Faster Query Algorithm for the Text Fingerprinting Problem
A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
Efficient Computation of Middle Levels Gray Codes
An Efficient Algorithm for Edge-Ranking Trees
Bilu-Linial Stability, Certified Algorithms and the Independent Set Problem
Approximation Algorithms and Network Games
On the Equivalence among Problems of Bounded Width
Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism
Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs
Secluded Connectivity Problems
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy
Computing Maximum Agreement Forests without Cluster Partitioning is Folly
Additive Sparsification of CSPs
An Experimental Study of Random Knapsack Problems
Solving k-SUM Using Few Linear Queries
Approximate CVP p in Time 2 0.802 n
Hierarchical Hub Labelings for Shortest Paths
Laminar Matroid Secretary: Greedy Strikes Back
Labeling Smart Dust
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique
Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance
An Algorithm for Node-Capacitated Ring Routing
Dynamic Plane Transitive Closure
Simple Streaming Algorithms for Edge Coloring
n -Level Graph Partitioning
Sketching for Geometric Problems (Invited Talk)
Parameterized Complexity of MinCSP over the Point Algebra
BICO: BIRCH Meets Coresets for k-Means Clustering
Coloring in Sublinear Time
Improved Approximation Algorithms for Label Cover Problems
Fine-grained Lower Bounds on Cops and Robbers
The Complexity of Sorting with Networks of Stacks and Queues
Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors
Two-Bounded-Space Bin Packing Revisited
Seventeen Lines and One-Hundred-and-One Points
On-Demand Broadcasting Under Deadline
Property Testing with Geometric Queries
Streaming Diameter of High-Dimensional Points
Approximation Algorithms for Connected Maximum Cut and Related Problems
Oblivious Randomized Direct Search for Real-Parameter Optimization
An Optimal Randomized Algorithm for Finding the Saddlepoint
Knowledge, Level of Symmetry, and Time of Leader Election
On Estimating the Quantum 𝓁 α Distance
Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees
When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting
Stochastic Shortest Paths Via Quasi-convex Maximization
Search-Space Reduction via Essential Vertices
Augmenting the Algebraic Connectivity of Graphs
Structural Parameterizations for Two Bounded Degree Problems Revisited
Linear Time Construction of Cover Suffix Tree and Applications
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
Algorithmic Aspects of Proportional Symbol Maps
0/1-Integer Programming: Optimization and Augmentation are Equivalent
Kinetic Dictionaries: How to Shoot a Moving Target
One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay
Dynamic Matching Algorithms in Practice
Preemptive Scheduling with Rejection
Enumerating Minimal Connected Dominating Sets
The 3-Server Problem in the Plane
On-line and Off-line Approximation Algorithms for Vector Covering Problems
The Visibility Center of a Simple Polygon
Practical Access to Dynamic Programming on Tree Decompositions
Connectivity Inference in Mass Spectrometry Based Structure Determination
Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels
Generalized Max-Flows and Min-Cuts in Simplicial Complexes
Competitive Auctions for Multiple Digital Goods
Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path Problem
Cauchy's Theorem for Orthogonal Polyhedra of Genus 0
Bayesian Generalized Network Design
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
Computing the 4-Edge-Connected Components of a Graph in Linear Time
Algorithms for Dominating Set in Disk Graphs: Breaking the log n Barrier - (Extended Abstract)
Correlating Theory and Practice in Finding Clubs and Plexes
A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles
Estimating the Average of a Lipschitz-Continuous Function from One Sample
Direct Routing: Algorithms and Complexity
Invertible Bloom Lookup Tables with Less Memory and Randomness
The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial
Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions
On the Value of Job Migration in Online Makespan Minimization
Eager st-Ordering
Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time
Efficient Searching for Multi-dimensional Data Made Simple
Submodular Max-SAT
A Characterization of Visibility Graphs for Pseudo-polygons
Multi-parameter Mechanism Design under Budget and Matroid Constraints
External Memory Data Structures
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
Half-Integral Linkages in Highly Connected Directed Graphs
Pareto Sums of Pareto Sets
From Balanced Graph Partitioning to Balanced Metric Labeling
An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
A Linear Time Algorithm for L (2, 1)-Labeling of Trees
Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings
I/O-Efficient Well-Separated Pair Decomposition and Its Applications
A New Approach to Optimal Planning of Robot Motion on a Tree with Obstacles
Hardness of Computation of Quantum Invariants on 3-Manifolds with Restricted Topology
Super Scalar Sample Sort
How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results
Hyperbolic Random Graphs: Separators and Treewidth
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract)
Combinatorial n-fold Integer Programming and Applications
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs
On the Stability of Multiple Partner Stable Marriages with Ties
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization
Parallel Algorithms for Series Parallel Graphs
Optimal Graph Exploration without Good Maps
Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph
An Empirical Evaluation of k-Means Coresets
Improved Approximation Algorithms for Relay Placement
Optimal Distance Labeling for Interval and Circular-Arc Graphs
Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries
On R-trees with Low Stabbing Number
Quartet Cleaning: Improved Algorithms and Simulations
On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract)
Linear-Time Reconstruction of Delaunay Triangulations with Applications
Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings
Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method
Tractable Parameterizations for the Minimum Linear Arrangement Problem
Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear Time
Multicommodity Multicast, Wireless and Fast
Cooperative TSP
Packing Trees
A QPTAS for Gapless MEC
Slack Optimization of Timing-Critical Nets
Two-Stage Robust Network Design with Exponential Scenarios
Flip Distance between Triangulations of a Simple Polygon is NP-Complete
Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs
Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs
On a Problem of Danzer
New Bounds on Augmenting Steps of Block-Structured Integer Programs
Scheduling Kernels via Configuration LP
Enumeration of 2-Level Polytopes
Fast Sparse Matrix Multiplication
Data Structures on Event Graphs
Graph Coloring with Rejection
Maxent-Stress Optimization of 3D Biomolecular Models
Resource Buying Games
Scalable Distributed String Sorting
Trekking in the Alps Without Freezing or Getting Tired
There and Back Again: On Applying Data Reduction Rules by Undoing Others
New Bounds for Oblivious Mesh Routing
Denesting by Bounded Degree Radicals
Maximizing Symmetric Submodular Functions
Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting
Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles (Extended Abstract)
Roll Cutting in the Curtain Industry
Improved Approximation Algorithms for the Expanding Search Problem
Online Algorithms for Caching Multimedia Streams
Combining Predicted and Live Traffic with Time-Dependent A* Potentials
k-Distinct Branchings Admits a Polynomial Kernel
Kernelization of Whitney Switches
A Fully Dynamic Data Structure for Reachability in Planar Digraphs
The Planted Orthogonal Vectors Problem
Three-Dimensional Layers of Maxima
Bicriteria Approximation for k-Edge-Connectivity
Profit Sharing and Efficiency in Utility Games
Smoothed Performance Guarantees for Local Search
Computing the Similarity Between Moving Curves
Pricing Social Goods
Approximate Deadline-Scheduling with Precedence Constraints
The Online House Numbering Problem: Min-Max Online List Labeling
A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties
Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis
Maximizing Barrier Coverage Lifetime with Mobile Sensors
An Improved Approximation Algorithm for the Max-3-Section Problem
A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
Collecting Garbage Pages in a Distributed Shared Memory with Reduced Memory and Communication Overhead
Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow
Fault-Tolerant Real-Time Scheduling
Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem
The Minimum Generalized Vertex Cover Problem
Competive Analysis of Randomized Paging Algorithms
Stochastic Streams: Sample Complexity vs. Space Complexity
Dial a Ride from k -Forest
Bucket Game with Applications to Set Multicover and Dynamic Page Migration
Online Hitting Sets for Disks of Bounded Radii
When Is String Reconstruction Using de Bruijn Graphs Hard?
Beating Competitive Ratio 4 for Graphic Matroid Secretary
Computing the Chromatic Number Using Graph Decompositions via Matrix Rank
A Streaming Algorithm for the Undirected Longest Path Problem
Estimating Clustering Indexes in Data Streams
Radio Labeling with Pre-assigned Frequencies
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
Correlated Stochastic Knapsack with a Submodular Objective
Lyndon Arrays in Sublinear Time
Planarity for Clustered Graphs
An Algorithm for Computing DNA Walks
Incremental SCC Maintenance in Sparse Graphs
Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays
Maximum Weight b-Matchings in Random-Order Streams
Hamilton Triangulations for Fast Rendering
A Textbook Solution for Dynamic Strings
How Experts Can Solve LPs Online
On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3
Graph Spanners for Group Steiner Distances
How Helpers Hasten h -Relations
Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution
Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication
Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations
A Unified Local Ratio Approximation of Node-Deletion Problems (Extended Abstract)
FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees
Algorithmic Aspects of Web Search Engines
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink
DNA Physical Mapping: Three Ways Difficult
Constructing Long Paths in Graph Streams
A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane
The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
Dynamic Data Structures for Realtime Management of Large Geormetric Scences (Extended Abstract)
Buffered Count-Min Sketch on SSD: Theory and Experiments
New Algorithms for Two-Label Point Labeling
Optimal Cover of Points by Disks in a Simple Polygon
Optimizing Throughput and Makespan of Queuing Systems by Information Design
On Min-Power Steiner Tree
Design and Analysis of Dynamic Processes: A Stochastic Approach
On Computing the Hyperbolicity of Real-World Graphs
Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines
I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries
Stability of epsilon -Kernels
Network Planning and Routing Problems over Time: Models, Complexity and Algorithms (Invited Talk)
Resource Sharing Revisited: Local Weak Duality and Optimal Convergence
Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting
Steiner Forest Orientation Problems
Going Far From Degeneracy
Towards Communication-Efficient Peer-To-Peer Networks
Fully-Dynamic Approximation of Betweenness Centrality
Fleet Assignment with Connection Dependent Ground Times
Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
Obviously Strategyproof Mechanisms for Machine Scheduling
Beating Ratio 0.5 for Weighted Oblivious Matching Problems
The Structure of Circular Decomposable Metrics
Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds
A Functional Approach to External Graph Algorithms
The Parameterized Complexity of Graph Cyclability
Online Scheduling of Equal-Length Jobs on Parallel Machines
Improved Quantum Boosting
Graph Balancing with Orientation Costs
Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings
Matching Convex Shapes with Respect to the Symmetric Difference
Semi-clairvoyant Scheduling
Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems
Towards Bypassing Lower Bounds for Graph Shortcuts
Art Galleries and Mobile Guards: Revisiting O'Rourke's Proof
On Mixed Connectivity Certificates (Extended Abstract)
Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication
Approximate Circular Pattern Matching
Edge Clique Partition and Cover Beyond Independence
Solving Traveling Salesman Problems
Bounded Degree Spanning Trees (Extended Abstract)
Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles
GRASP. Extending Graph Separators for the Single-Source Shortest-Path Problem
Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract)
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree
Computational Aspacts of Organization Theory (Extended Abstract)
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
Fast and Lightweight Distributed Suffix Array Construction
On the Complexity of Optimal Hotlink Assignment
Grouping Techniques for Scheduling Problems: Simpler and Faster
Vertex Sparsifiers for Hyperedge Connectivity
ParGeo: A Library for Parallel Computational Geometry
Probabilistic Routing for On-Street Parking Search
Improved Approximations for Flexible Network Design
k -Mismatch with Don't Cares
Disconnected Cuts in Claw-free Graphs
Interval Selection in Sliding Windows
Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem
Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets