yusuke1997/dblp-id-title huggingface dataset:
Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts
A New Approach to Exact Crossing Minimization
Width Helps and Hinders Splitting Flows
Minimizing Movement: Fixed-Parameter Tractability
Buffered Partially-Persistent External-Memory Search Trees
Detecting Regular Visit Patterns
Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
Improved Time and Space Bounds for Dynamic Range Mode
Property Testing of Curve Similarity
A Local Search Algorithm for Large Maximum Weight Independent Set Problems
Approximation of Minimum Cost Homomorphisms
On the Hardness of Learning Sparse Parities
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs
Compressed Cache-Oblivious String B-tree
Improved Bounds for Online Balanced Graph Re-Partitioning
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
Computing the Edit-Distance between Unrooted Ordered Trees
Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around
Sorting 13 Elements Requires 34 Comparisons
A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface
Efficient Wavelength Routing on Directed Fiber Trees
Reconstructing Biological and Digital Phylogenetic Trees in Parallel
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash
A Simple Algorithm for Trimmed Multipoint Evaluation
Streaming and Massively Parallel Algorithms for Edge Coloring
Greedy Hot-Potato Routing on the Mesh
Multisampling: A New Approach to Uniform Sampling and Approximate Counting
The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations
Fine-Grained Complexity of Regular Expression Pattern Matching and Membership
On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
Counting Linear Extensions: Parameterizations by Treewidth
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy
Mobile Route Planning
Testing Equivalence of Morphisms on Context-Free Languages
Lines through Segments in 3D Space
Towards Tight Lower Bounds for Scheduling Problems
Repetition Detection in a Dynamic String
Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
Improved Randomized Results for That Interval Selection Problem
A Simple Boosting Framework for Transshipment
Revenue Maximization for Selling Multiple Correlated Items
On Resilient Graph Spanners
32nd Annual European Symposium on Algorithms, ESA 2024, Royal Holloway, London, United Kingdom, September 2-4, 2024
Improved Competitive Performance Bounds for CIOQ Switches
The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination
Chromatic k-Nearest Neighbor Queries
Some Open Questions Related to Cuckoo Hashing
Fast 3-Coloring Triangle-Free Planar Graphs
Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract)
Approximation Algorithm for Norm Multiway Cut
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
Induced Disjoint Paths in Claw-Free Graphs
Stabbing Convex Polygons with a Segment or a Polygon
Faster Approximate Covering of Subcurves Under the Fréchet Distance
Motif Statistics
On the External Validity of Average-Case Analyses of Graph Algorithms
Succinct Indices for Path Minimum, with Applications to Path Reporting
The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves
30th Annual European Symposium on Algorithms, ESA 2022, Berlin/Potsdam, Germany, September 5-9, 2022
The Directed Disjoint Shortest Paths Problem
Online View Maintenance Under a Response-Time Constraint
Approximating Satisfiable Satisfiability Problems (Extended Abstract)
Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional
An Integer Programming Algorithm for Routing Optimization in IP Networks
Time-Dependent Route Planning with Generalized Objective Functions
29th Annual European Symposium on Algorithms, ESA 2021, Lisbon, Portugal (Virtual Conference), September 6-8, 2021
Approximation Algorithms for Conflict-Free Vehicle Routing
f -Sensitivity Distance Oracles and Routing Schemes
An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract)
A Fast and Simple Algorithm for the Resource Constrained Shortest Path Problem
Approximating the 2-Interval Pattern Problem
Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice
The Minimum Range Assignment Problem on Linear Radio Networks
Losing Weight by Gaining Edges
External-Memory Network Analysis Algorithms for Naturally Sparse Graphs
Making Chord Robust to Byzantine Attacks
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound
External-Memory Priority Queues with Optimal Insertions
Competitive Analysis of Flash-Memory Algorithms
Extension of Additive Valuations to General Valuations on the Existence of EFX
Region-Restricted Clustering for Geographic Data Mining
Computing k-Modal Embeddings of Planar Digraphs
Algorithms to Separate {0, 1/2}-Chvátal-Gomory Cuts
A Simple Algorithm for Graph Reconstruction
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments
Amortized Bounds for Dynamic Orthogonal Range Reporting
Fast Multipoint Evaluation of Bivariate Polynomials
Online Multistage Subset Maximization Problems
Vector Assignment Problems: A General Framework
Improved Guarantees for Tree Cut Sparsifiers
Generalized Assignment via Submodular Optimization with Reserved Capacity
Turbocharging Heuristics for Weak Coloring Numbers
Finding Frequent Elements in Non-bursty Streams
The Batched Predecessor Problem in External Memory
Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
A $\frac{3}{2}$ Approximation for a Constrained Forest Problem
Settling the Relationship Between Wilber's Bounds for Dynamic Optimality
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract)
Faster External Memory LCP Array Construction
Parameterized Dynamic Data Structure for Split Completion
Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem
Polynomial-Time Approximation of Independent Set Parameterized by Treewidth
Compact Representation of Semilinear and Terrain-Like Graphs
Trace Reconstruction Revisited
Inclusion/Exclusion Meets Measure and Conquer
On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows: Extended Abstract
FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees
Fast Generation of Random Permutations via Networks Simulation
Cheating by Men in the Gale-Shapley Stable Matching Algorithm
Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)
Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries
An Experimental Study of Dynamic Dominators
Parameterized Complexity of Induced H-Matching on Claw-Free Graphs
Improved Implementation of Point Location in General Two-Dimensional Subdivisions
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time
A Unified FPT Framework for Crossing Number Problems
Approximation of Partial Capacitated Vertex Cover
Sparse Fault-Tolerant BFS Trees
A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
Efficient Approximation Schemes for Geometric Problems?
Finding Large Set Covers Faster via the Representation Method
Computing the Fréchet Distance with a Retractable Leash
Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design
Subexponential Time Algorithms for Finding Small Tree and Path Decompositions
Taming Graphs with No Large Creatures and Skinny Ladders
On the Cost of Interchange Rearrangement in Strings
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs
Finding Stable Matchings That Are Robust to Errors in the Input
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
Tight Lower Bounds for the Complexity of Multicoloring
On the Geodesic Centers of Polygonal Domains
Exploration of Graphs with Excluded Minors
Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks
Improved Practical Matrix Sketching with Guarantees
Weighted Geometric Set Multi-cover via Quasi-uniform Sampling
Finding an Approximate Mode of a Kernel Density Estimate
Fréchet Queries in Geometric Trees
A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem
Deterministic Minimum Steiner Cut in Maximum Flow Time
Incremental Maximization for a Broad Class of Objectives
Less Hashing, Same Performance: Building a Better Bloom Filter
Reconfiguration of Polygonal Subdivisions via Recombination
Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths
What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs?
Fast and Memory-Efficient BWT Construction of Repetitive Texts Using Lyndon Grammars
Space-Efficient Randomized Algorithms for K-SUM
Tolerant Testers for Subgraph-Freeness
The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential
List H-Coloring a Graph by Removing Few Vertices
An Approximation Algorithm for the Minimum Latency Set Cover Problem
Computing 3D Periodic Triangulations
Theory and Practice of Chunked Sequences
d -Dimensional Knapsack in the Streaming Model
Sampling-Based Bottleneck Pathfinding with Applications to Fréchet Matching
Network Bargaining with General Capacities
A New Regular Grammar Pattern Matching Algorithm
Estimating Rarity and Similarity over Data Stream Windows
Splitting a Delaunay Triangulation in Linear Time
Deep Multilevel Graph Partitioning
Improved Approximate Rips Filtrations with Shifted Integer Lattices
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes
Disjoint Unit Spheres admit at Most Two Line Transversals
Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices
Moving-Target TSP and Related Problems
A Multivariate Approach for Weighted FPT Algorithms
Compressed Data Structures for Dynamic Sequences
Algorithms for Solving Rubik's Cubes
PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding
An Improved Approximation Algorithm for Knapsack Median Using Sparsification
UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution
Approximation Algorithms for Connected Dominating Sets
Communication Complexity of Quasirandom Rumor Spreading
A Framework for In-place Graph Algorithms
Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty
On the Lattice Distortion Problem
Exploring the Approximability Landscape of 3SUM
Iterative Rounding for Multi-Objective Optimization Problems
Packing Cars into Narrow Roads: PTASs for Limited Supply Highway
A Parameterized Algorithm for Upward Planarity Testing
Traversing the Machining Graph
An Approximation Algorithm for Hypergraph Max k -Cut with Given Sizes of Parts
Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication
Counting Simplices in Hypergraph Streams
Approximation Algorithms for Hop Constrained and Buy-At-Bulk Network Design via Hop Constrained Oblivious Routing
Contraction Bidimensionality: The Accurate Picture
Shape Fitting on Point Sets with Probability Distributions
Efficient Algorithms for Least Square Piecewise Polynomial Regression
Hitting Sets Online and Vertex Ranking
Feature Cross Search via Submodular Optimization
Giving Some Slack: Shortcuts and Transitive Closure Compressions
Estimating Dominance Norms of Multiple Data Streams
Group Activity Selection with Few Agent Types
Fast Dynamic Arrays
Approximating Minimum Manhattan Networks in Higher Dimensions
Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy
Differentially Private Algorithms for Graphs Under Continual Observation
Output Sensitive Algorithms for Approximate Incidences and Their Applications
On Fully Dynamic Strongly Connected Components
Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract)
The Quantum Query Complexity of Read-Many Formulas
Random Cayley Graphs with O(log[G]) Generators Are Expanders
A Fast Algorithm for Approximating the Detour of a Polygonal Chain
On Nonblocking Properties on the Benes Network
Sparse Outerstring Graphs Have Logarithmic Treewidth
A Polynomial Kernel for Line Graph Deletion
Out-of-Order Event Processing in Kinetic Data Structures
Many Visits TSP Revisited
The Oil Searching Problem
Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio
Approximating LZ77 via Small-Space Multiple-Pattern Matching
Geometric Crossing-Minimization - A Scalable Randomized Approach
Self-Assembly of Any Shape with Constant Tile Types using High Temperature
Load Balancing for Response Time
Temporal Clustering
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
Lempel-Ziv Index for q-Grams
Improved Analysis of Complete-Linkage Clustering
New Algorithms and Lower Bounds for Streaming Tournaments
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
Online Submodular Maximization Problem with Vector Packing Constraint
Approximate Unions of Lines and Minkowski Sums
Range Searching and Point Location among Fat Objects
Resource Allocation in Bounded Degree Trees
A 5-Approximation for Capacitated Facility Location
Butterflies and Peer-to-Peer Networks
On the Fine-Grained Complexity of Rainbow Coloring
More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints
Exclusive Graph Searching
Balls into Bins Made Faster
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments
An Optimal Parallel Algorithm for Digital Curve Segmentation Using Hough Polygons and Monotone Function Search
Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks
Adaptively-Secure Distributed Public-Key Systems
Computing Equilibrium Prices: Does Theory Meet Practice?
Simple (Invited Talk)
Resilient Dictionaries for Randomly Unreliable Memory
On Finding Longest Palindromic Subsequences Using Longest Common Subsequences
Fast RSK Correspondence by Doubling Search
Shortest Cut Graph of a Surface with Prescribed Vertex Set
EXACUS: Efficient and Exact Algorithms for Curves and Surfaces
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
Techniques for Generalized Colorful k-Center Problems
The Union of Probabilistic Boxes: Maintaining the Volume
The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations
Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
How Hard is it to Find (Honest) Witnesses?
Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy
AdCell: Ad Allocation in Cellular Networks
The Price of Matching with Metric Preferences
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
Telescoping Filter: A Practical Adaptive Filter
Computing the 4-Edge-Connected Components of a Graph: An Experimental Study
Online Flexible Busy Time Scheduling on Heterogeneous Machines
Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications
Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates
Maximizing a Submodular Function with Viability Constraints
Approximation and Hardness of Token Swapping
A Robust PTAS for Machine Covering and Packing
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
Balancing Applied to Maximum Network Flow Problems
Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling
TSP with Neighborhoods of Varying Size
Long Circuits and Large Euler Subgraphs
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
Pricing Tree Access Networks with Connected Backbones
On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
Multicommodity Flow Approximation Used for Exact Graph Partitioning
Logit Dynamics with Concurrent Updates for Local Interaction Games
Engineering Highway Hierarchies
On the Approximability of Digraph Ordering
Min Sum Clustering with Penalties
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
Instance-Optimal Imprecise Convex Hull
Contraction and Treewidth Lower Bounds
Online Algorithms with Randomly Infused Advice
Time-Dependent SHARC-Routing
Optimality and Competitiveness of Exploring Polygons by Mobile Robots
Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs
Skewed Binary Search Trees
An Algorithm for the SAT Problem for Formulae of Linear Length
Revenue Guarantees in Sponsored Search Auctions
Fast Algorithms for Even/Odd Minimum Cuts and Generalizations
On Interference Among Moving Sensors and Related Problems
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
Reporting Flock Patterns
Fast Quasi-Threshold Editing
A Polynomial Kernel for Trivially Perfect Editing
Covering Things with Things
Clustering in Hypergraphs to Minimize Average Edge Service Time
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs
Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs
Longest Common Extensions with Wildcards: Trade-Off and Applications
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats
Amortized Analysis of Asynchronous Price Dynamics
On Constructing Suffix Arrays in External Memory
Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space
On Piercing Sets of Axis-Parallel Rectangles and Rings
How Profitable Are Strategic Behaviors in a Market?
Hitting Meets Packing: How Hard Can It Be?
Semi-Streaming Algorithms for Hypergraph Matching
Top-k Document Retrieval in External Memory
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
On Exact Algorithms for Treewidth
Recoverable Robustness by Column Generation
On Inducing Polygons and Related Problems
Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing
On Adaptive Integer Sorting
Subexponential Parameterized Algorithms for Graphs of Polynomial Growth
Compressed Indexes for Approximate String Matching
Bicriteria Data Compression: Efficient and Usable
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
Reconstructing the Topology of a CAD Model: A Discrete Approach
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help
On the Decision Tree Complexity of String Matching
Simulated Annealing and Its Problems to Color Graphs
Sampling Geometric Inhomogeneous Random Graphs in Linear Time
Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem
A Row Generation Algorithm for Finding Optimal Burning Sequences of Large Graphs
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs
Swap and Mismatch Edit Distance
Improved Bounds for Metric Capacitated Covering Problems
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract)
New Tools and Simpler Algorithms for Branchwidth
A Model for Minimizing Active Processor Time
On Variants of the Matroid Secretary Problem
k -Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees
Practical Low-Dimensional Halfspace Range Space Sampling
Equivalence between Priority Queues and Sorting in External Memory
Efficient Communication Protocols for Deciding Edit Distance
Improved Prophet Inequalities for Combinatorial Welfare Maximization with (Approximately) Subadditive Agents
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks
New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks
Improved Space-Time Tradeoffs for kSUM
Planar Support for Non-piercing Regions and Applications
Treewidth Lower Bounds with Brambles
An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams
Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints
Improved Algorithms for Partial Curve Matching
Combinatorial Auctions with Verification Are Tractable
Balanced Crown Decomposition for Connectivity Constraints
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
Unambiguity of Extended Regular Expressions in SGML Document Grammars
On Geometric Prototype and Applications
Closing the Gap for Pseudo-Polynomial Strip Packing
Efficient Algorithms for Integer Programs with Two Variables per Constraint
Shortest Path Separators in Unit Disk Graphs
Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings
Computing Cycle Covers without Short Cycles
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
Minimum Spanning Trees in d Dimensions
On-Line Construction of Two-Dimensional Suffix Trees
Online Bin Coloring
A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times
Fast and Robust Smallest Enclosing Balls
Non-Exploratory Self-Stabilization for Constant-Space Symmetry-Breaking
On the Complexity of Bounded Context Switching
Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows
String Attractors: Verification and Optimization
Nash Equilibria in Voronoi Games on Graphs
On Local Search for Weighted k-Set Packing
Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms
Constructing Plane Spanners of Bounded Degree and Low Weight
Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning
Data Structures for Storing Small Sets in the Bitprobe Model
The Space-Stretch-Time Tradeoff in Distance Oracles
Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs
The Algorithmic Power of the Greene-Kleitman Theorem
Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands
Cache-Oblivious Comparison-Based Algorithms on Multisets
Convex Tours on Bounded Curvature
Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information
The Computational Complexity of Genetic Diversity
The Geodesic Diameter of Polygonal Domains
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
First-Order Model-Checking in Random Graphs and Complex Networks
Covert Computation in Staged Self-Assembly: Verification Is PSPACE-Complete
Generalized Graph Packing Problems Parameterized by Treewidth
Minimal Interval Completions
Mechanism Design for Fun and Profit
Theory and Implementation of Online Multiselection Algorithms
Connectivity in the Presence of an Opponent
Set Cover with Delay - Clairvoyance Is Not Required
A Euclidean Embedding for Computing Persistent Homology with Gaussian Kernels
On the Recognition of Permuted Bottleneck Monge Matrices
Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings