yusuke1997/dblp-id-title huggingface dataset:
Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
Achieving Envy-Freeness Through Items Sale
Faster Dynamic 2-Edge Connectivity in Directed Graphs
A Simple Deterministic Near-Linear Time Approximation Scheme for Transshipment with Arbitrary Positive Edge Costs
Straight Skeletons of Three-Dimensional Polyhedra
Efficient Tree Layout in a Multilevel Memory Hierarchy
Optimized Binary Search and Text Retrieval
Truthful Prompt Scheduling for Minimizing Sum of Completion Times
Engineering Multilevel Graph Partitioning Algorithms
Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles
Every Property Is Testable on a Natural Class of Scale-Free Multigraphs
Seven Problems: So Different yet Close
A Faster Algorithm for the Fréchet Distance in 1D for the Imbalanced Case
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
Analysis of the Period Recovery Error Bound
A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs
Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
On-Line Dial-a-Ride Problems under a Restricted Information Model
Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters
Approximate Distance Labeling Schemes
Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract)
Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators
The Bit Complexity of Distributed Sorting (Extended Abstract)
Dynamic Additively Weighted Voronoi Diagrams in 2D
Algorithms for Inverse Optimization Problems
Augmenting Suffix Trees, with Applications
Fast Algorithms for Computing the Smallest k-Enclosing Disc
Approximating Multi-criteria Max-TSP
Determinants from Homomorphisms
Competitive Algorithms for Restricted Caching and Matroid Caching
Algorithms for Graph Rigidity and Scene Analysis
On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity
Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast
Fast Computation of k-Runs, Parameterized Squares, and Other Generalised Squares
Welfare Maximization with Deferred Acceptance Auctions in Reallocation Problems
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles
An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees
Convex Hulls under Uncertainty
Robust Approximate Zeros
Sorting Finite Automata via Partition Refinement
A Characterization of Consistent Digital Line Segments in ℤ2
Incremental Text Editing: A New Data Structure
Axis-Parallel Right Angle Crossing Graphs
Near-Optimal Distributed Edge Coloring
Drawing with Colors (Extended Abstract)
On the Performance of Approximate Equilibria in Congestion Games
Better Bounds for Graph Bisection
Three-Clustering of Points in the Plane
A Faster Algorithm for the 4-Coloring Problem
The Robustness of Level Sets
Stability and Recovery for Independence Systems
Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms
Restricted Adaptivity in Stochastic Scheduling
Optimal Staged Self-Assembly of General Shapes
Efficient c-Oriented Range Searching with DOP-Trees
On the Configuration-LP for Scheduling on Unrelated Machines
Fitting Points on the Real Line and Its Application to RH Mapping
Solving Simple Stochastic Games with Few Coin Toss Positions
Fault-Tolerant Matroid Bases
: Standard Template Library for XXL Data Sets
Constructing Street Networks from GPS Trajectories
On the Size of Succinct Indices
Height-Bounded Lempel-Ziv Encodings
Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility
Streaming Property Testing of Visibly Pushdown Languages
Smallest Color-Spanning Objects
Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem
Frequency Estimation of Internet Packet Streams with Limited Space
Online Metric Allocation and Time-Varying Regularization
Median Trajectories
Saving Comparisons in the Crochemore-Perrin String Matching Algorithm
Two-Center Problems for a Convex Polygon (Extended Abstract)
A New and Improved Algorithm for Online Bin Packing
Stackelberg Strategies for Atomic Congestion Games
Approximation Schemes for Multi-Budgeted Independence Systems
Optimal CREW-PRAM Algorithms for Direct Dominance Problems
Sometimes Reliable Spanners of Almost Linear Size
Binary Space Partition for Orthogonal Fat Rectangles
Frequency Channel Assignment on Planar Networks
Maximum Skew-Symmetric Flows
Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs
Greedy Routing in Tree-Decomposed Graphs
Counting Matchings with k Unmatched Vertices in Planar Graphs
Determining the Smallest k Such That G Is k -Outerplanar
Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings
Light Euclidean Spanners with Steiner Points
A General Model of Undirected Web Graphs
Real-Time Streaming Multi-Pattern Search for Constant Alphabet
Sparse Temporal Spanners with Low Stretch
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
On Space Efficient Two Dimensional Range Minimum Data Structures
Approximate Turing Kernelization for Problems Parameterized by Treewidth
On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs
Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves
Finding an Optimal Path without Growing the Tree
Comparing Real Algebraic Numbers of Small Degree
Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums
Separation of Cycle Inequalities for the Periodic Timetabling Problem
On Multicriteria Online Problems
A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull
The Impact of Knowledge on Broadcasting Time in Radio Networks
On Connections Between k-Coloring and Euclidean k-Means
Min-Cost Flow in Unit-Capacity Planar Graphs
Maximizing Sums of Non-Monotone Submodular and Linear Functions: Understanding the Unconstrained Case
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane
Distributed O(Delta log(n))-Edge-Coloring Algorithm
Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths
Parameterized Algorithms for Node Connectivity Augmentation Problems
The Complexity of Scheduling Trees with Communication Delays (Extended Abstract)
Enumerating Maximal Induced Subgraphs
Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification
Fast Prefix Search in Little Space, with Applications
Optimal Quantum Algorithm for Estimating Fidelity to a Pure State
Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?
How Reliable Are Practical Point-in-Polygon Strategies?
Some Lower Bounds for Comparison-Based Algorithms
Linear-Time Ranking of Permutations
An Efficient Reduction of a Gammoid to a Partition Matroid
Translating a Planar Object to Maximize Point Containment
Dynamic Graphs in the Sliding-Window Model
Parallel String Sample Sort
Cardinality Estimation Using Gumbel Distribution
Non-additive Shortest Paths
Improved Approximation Algorithms for Stochastic Matching
Succinct Data Structures for Path Queries
Coupling Variable Fixing Algorithms for the Automatic Recording Problem
On the Giant Component of Geometric Inhomogeneous Random Graphs
28th Annual European Symposium on Algorithms, ESA 2020, Pisa, Italy (Virtual Conference), September 7-9, 2020
Upper and Lower Bounds for Online Routing on Delaunay Triangulations
Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold
Line System Design and a Generalized Coloring Problem
K-Dominance in Multidimensional Data: Theory and Applications
Practical Performance of Space Efficient Data Structures for Longest Common Extensions
Piercing Translates and Homothets of a Convex Body
A Separation Bound for Real Algebraic Expressions
Parameterized Approximability for Modular Linear Equations
Reconfiguration of Spanning Trees with Many or Few Leaves
ε-Net Algorithm Implementation on Hyperbolic Surfaces
Two Simplified Algorithms for Maintaining Order in a List
Faster Detours in Undirected Graphs
A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees
Hypergraph Connectivity Augmentation in Strongly Polynomial Time
Finding a Maximum Restricted t-Matching via Boolean Edge-CSP
Planar Bichromatic Bottleneck Spanning Trees
24th Annual European Symposium on Algorithms, ESA 2016, Aarhus, Denmark, August 22-24, 2016
Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
Soft Subdivision Motion Planning for Complex Planar Robots
Conditional Lower Bounds for Dynamic Geometric Measure Problems
Parametrized Complexity of Expansion Height
On Rectangular Cartograms
Algorithms for Efficient Filtering in Content-Based Multicast
Contention Resolution with Heterogeneous Job Sizes
Average Sensitivity of the Knapsack Problem
Counting Paths and Packings in Halves
Competitive Capacitated Online Recoloring
Popular Matchings in the Capacitated House Allocation Problem
An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem
A Tight Competitive Ratio for Online Submodular Welfare Maximization
Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets
Approximating Connected Maximum Cuts via Local Search
Buffer Management for Packets with Processing Times
Deterministic Communication in Radio Networks with Large Labels
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games
Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms
Lower Envelopes of Surface Patches in 3-Space
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles
Exploring the Tractability of the Capped Hose Model
Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria
Improved Competitive Guarantees for QoS Buffering
Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k
Front Matter, Table of Contents, Preface, Programm Commitee, External Reviewers
Strongly Stable Assignment
Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
On the Direct Sum Conjecture in the Straight Line Model
Submodular Maximization Subject to Matroid Intersection on the Fly
On-Line Machine Covering
Faster FPTASes for Counting and Random Generation of Knapsack Solutions
An Area Lower Bound for a Class of Fat-Trees (Extended Abstract)
A Simpler QPTAS for Scheduling Jobs with Precedence Constraints
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus
Quantum Algorithms for Classical Probability Distributions
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
Dense Peelable Random Uniform Hypergraphs
Finding Frequent Patterns in a String in Sublinear Time
Path-Contractions, Edge Deletions and Connectivity Preservation
A Note On Spectral Clustering
Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
26th Annual European Symposium on Algorithms, ESA 2018, Helsinki, Finland, August 20-22, 2018
An O ( n 3 (loglog n /log n ) 5/4 ) Time Algorithm for All Pairs Shortest Paths
Experimental Comparison of PC-Trees and PQ-Trees
A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs
List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
Randomized Routing on Meshes with Buses
From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs
A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations
Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs
An o(n) Work EREW Parallel Algorithm for Updating MST
The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract
An LP-Designed Algorithm for Constraint Satisfaction
D3-Tree: A Dynamic Deterministic Decentralized Structure
Connectivity Queries Under Vertex Failures: Not Optimal, but Practical
Range Searching Over Tree Cross Products
Simple Deterministic Approximation for Submodular Multiple Knapsack Problem
Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract)
The Pareto Cover Problem
Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability)
Minimum Average Distance Triangulations
Approximate k -Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing
Finding the Sink Takes Some Time
A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
Massively Parallel Algorithms for the Stochastic Block Model
Path Hitting in Acyclic Graphs
Improved Search of Relevant Points for Nearest-Neighbor Classification
Connected Partitions via Connected Dominating Sets
Universal Facility Location
Optimal Parallel Quantum Query Algorithms
Space Efficient Two-Dimensional Orthogonal Colored Range Counting
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling
Fast Lowest Common Ancestor Computations in Dags
Access, Rank, and Select in Grammar-compressed Strings
A Dynamic Data Structure for MSO Properties in Graphs with Bounded Tree-Depth
Shortest Paths in Planar Graphs with Real Lengths in O ( n log 2 n /loglog n ) Time
Duality between Prefetching and Queued Writing with Parallel Disks
Edit Distance with Block Operations
On Parallel versus Sequential Approximation
Sublinear Estimation of Weighted Matchings in Dynamic Data Streams
Longest Cycle Above Erdős-Gallai Bound
Testing Sumsets Is Hard
SNPs Problems, Complexity, and Algorithms
Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound
Optimally Handling Commitment Issues in Online Throughput Maximization
A Space-Optimal Grammar Compression
Improved Algorithms for Distance Selection and Related Problems
Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities
Improved Space Bounds for Subset Sum
A Randomized Algorithm for Two Servers on the Line (Extended Abstract)
Average Case Analysis of Java 7's Dual Pivot Quicksort
Automated Generation of Search Tree Algorithms for Graph Modification Problems
Optimal Stopping Rules for Sequential Hypothesis Testing
FPT Algorithms for Domination in Biclique-Free Graphs
SCIL - Symbolic Constraints in Integer Linear Programming
Online Scheduling Revisited
On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine
On the Tractability of Optimization Problems on H-Graphs
Efficient Self Simulation Algorithms for Reconfigurable Arrays
A Faster Parametric Search for the Integral Quickest Transshipment Problem
Decomposition of Integer Programs and of Generating Sets
LZ-End Parsing in Linear Time
On the Impact of Singleton Strategies in Congestion Games
Graph Decomposition Lemmas and Their Role in Metric Embedding Methods
An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling
Taxes for Linear Atomic Congestion Games
Medial Axis Based Routing Has Constant Load Balancing Factor
Violator Spaces: Structure and Algorithms
Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
Online Companion Caching
Min-Max Correlation Clustering via Neighborhood Similarity
Selfish Bin Packing
Improved Approximation Algorithms for Bipartite Correlation Clustering
Fairness-Free Periodic Scheduling with Vacations
Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays
The Time Complexity of Updating Snapshot Memories
Matching Statistics Speed up BWT Construction
Volume in General Metric Spaces
Priority Queues: Small, Monotone and Trans-dichotomous
A Branch and Price Procedure for the Container Premarshalling Problem
Robust Algorithms for Sorting Railway Cars
Approximation Algorithms for Continuous Clustering and Facility Location Problems
Positive-Instance Driven Dynamic Programming for Treewidth
On-Line Load Banancing in a Hierarchical Server Topology
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT
Quantum Algorithms for Connectivity and Related Problems
To Fill or Not to Fill: The Gas Station Problem
Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings
The Strongly Stable Roommates Problem
Noisy, Greedy and Not so Greedy k-Means++
On Compact RAC Drawings
Minimizing a Convex Cost Closure Set
A Simple Min Cut Algorithm
Improved Parallel Derandomization via Finite Automata with Applications
A Polyhedral Algorithm for Packings and Designs
Large Independent Sets in Triangle-Free Planar Graphs
Sum Multi-coloring of Graphs
Approximating Interval Scheduling Problems with Bounded Profits
Integer Multicommodity Flows with Reduced Demands
Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings
Canonization of a Random Graph by Two Matrix-Vector Multiplications
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract)
Funnelselect: Cache-Oblivious Multiple Selection
Bi-Objective Search with Bi-Directional A
Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation Algorithms
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
Fitting a Step Function to a Point Set
An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram
An Optimal Algorithm for the Maximum-Density Segment Problem
Hardness of Bipartite Expansion
Minimizing Makespan and Preemption Costs on a System of Uniform Machines
Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and Spite
Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search
Bisection of Bounded Treewidth Graphs by Convolutions
Embedding Paths into Trees: VM Placement to Minimize Congestion
Self-Adjusting Binary Search Trees: What Makes Them Tick?
Improved Dominance Filtering for Unions and Minkowski Sums of Pareto Sets
Fault Tolerance in Euclidean Committee Selection
Adversary Immune Leader Election in ad hoc Radio Networks
Geometric Clustering to Minimize the Sum of Cluster Sizes
Solving Edge Clique Cover Exactly via Synergistic Data Reduction
Computing Persistent Homology with Various Coefficient Fields in a Single Pass
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks
Algorithms with Provable Guarantees for Clustering
String 2-Covers with No Length Restrictions
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
Caching Is Hard - Even in the Fault Model
Unbalanced Graph Cuts
Resource Constrained Shortest Paths
A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter
On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG's
Simplifying Massive Contour Maps
Analogs and Duals of the MAST Problem for Sequences and Trees
An Efficient and Effective Approximation Algorithm for the Map Labeling Problem
Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover
On Revenue Maximization in Second-Price Ad Auctions
Approximation Algorithms for Round-UFP and Round-SAP
On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs
Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams
On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract)
Optimal Polynomial-Time Compression for Boolean Max CSP
Tight Bounds for Quantum Phase Estimation and Related Problems
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem
On 2-Coverings and 2-Packings of Laminar Families
QCSP on Reflexive Tournaments
Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments
Scheduling Partially Ordered Jobs Faster Than 2 n
Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing
Maximum Flow in Directed Planar Graphs with Vertex Capacities
On the Threshold of Intractability
Polynomial-Time Algorithm for the Leafage of Chordal Graphs
MorphisHash: Improving Space Efficiency of ShockHash for Minimal Perfect Hashing
An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications
Engineering a Lightweight Suffix Array Construction Algorithm
Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization
Kinetic Algorithms Via Self-adjusting Computation
Data Structures for Node Connectivity Queries
On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric and Graph TSP
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
In-Place Parallel Super Scalar Samplesort (IPSSSSo)
Time-Efficient Quantum Entropy Estimator via Samplizer
An Approximation Algorithm for Maximum Triangle Packing
A Better Heuristic for Orthogonal Graph Drawings
Streaming Pattern Matching with d Wildcards
Enumerating Spanning and Connected Subsets in Graphs and Matroids
Radio Network Clustering from Scratch
An Exact Algorithm for the Steiner Forest Problem
Abstract Morphing Using the Hausdorff Distance and Voronoi Diagrams
Efficient Algorithms with Asymmetric Read and Write Costs
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
Loglog Counting of Large Cardinalities (Extended Abstract)
Approximation Algorithms for Steiner Connectivity Augmentation
A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings
Computing the Greedy Spanner in Linear Space
A Faster Algorithm for Computing Straight Skeletons
Contracting a Planar Graph Efficiently
Fast Minor Testing in Planar Graphs
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
Near-Popular Matchings in the Roommates Problem
How Long Does a Bit Live in a Computer? (abstract)
Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths
Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs
The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract)
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs
Polymatroid Prophet Inequalities
27th Annual European Symposium on Algorithms, ESA 2019, Munich/Garching, Germany, September 9-11, 2019
On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees
Tiling a Polygon with Two Kinds of Rectangles
Quantum Walk Sampling by Growing Seed Sets
Closing the Gap for Single Resource Constraint Scheduling
Insights into (k, ρ)-Shortcutting Algorithms
Top- k Ranked Document Search in General Text Databases
Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings
Analysis of Shellsort and Related Algorithms
Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing
A Comparison of Multicast Pull Models
Improved Approximation Algorithms for Metric Max TSP
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
On the Parameterized Complexity of Layered Graph Drawing
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
Farthest-Polygon Voronoi Diagrams
Binary Jumbled Pattern Matching on Trees and Tree-Like Structures
A Characterization of 2-Player Mechanisms for Scheduling