yusuke1997/dblp-id-title huggingface dataset:
Tight Bounds for Some Classical Problems Parameterized by Cutwidth
Equal-Subset-Sum Faster Than the Meet-in-the-Middle
Sorting and Permuting without Bank Conflicts on GPUs
Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs
Online Bipartite Matching with Decomposable Weights
Approximating Min-Diameter: Standard and Bichromatic
Local Search Algorithms for Maximum Carpool Matching
Coresets for the Nearest-Neighbor Rule
Faster Worst Case Deterministic Dynamic Connectivity
Hardness of Token Swapping on Trees
Approximation Algorithms for Clustering with Dynamic Points
Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
External-Memory Breadth-First Search with Sublinear I/O
An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee
Bipartite Graph Matchings in the Semi-streaming Model
An O (log 2 k )-Competitive Algorithm for Metric Bipartite Matching
Robust Kinetic Convex Hulls in 3D
SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints
Removing the log Factor from (min, +)-Products on Bounded Range Integer Matrices
Randomized Contractions for Multiobjective Minimum Cuts
Lyndon Words Accelerate Suffix Sorting
Selfish Vector Packing
Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large
Resource Allocation for Covering Time Varying Demands
A Probabilistic Zero-Test for Expressions Involving Root of Rational Numbers
Online Spanners in Metric Spaces
1-Planar Graphs have Constant Book Thickness
Succinct Posets
Using Fractional Primal-Dual to Schedule Split Intervals with Demands
Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else
On Degree Constrained Shortest Paths
A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing
Average Whenever You Meet: Opportunistic Protocols for Community Detection
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis
Optimal Integer Alphabetic Trees in Linear Time
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems
A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem
An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
Determining Similarity of Conformational Polymorphs
Clustering-Based Bidding Languages for Sponsored Search
Better and Simpler Approximation Algorithms for the Stable Marriage Problem
Fixing Variables in Semidefinite Relaxations
λ > 4
Lightweight Approximate Selection
Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima
New Algorithms for Pigeonhole Equal Subset Sum
Shortest Paths in the Plane with Obstacle Violations
Bidirectional Text Compression in External Memory
TSP in a Simple Polygon
Improved Deterministic Parallel Padded Sorting
Steiner Tree Parameterized by Multiway Cut and Even Less
Buying a Constant Competitive Ratio for Paging
Determining 4-Edge-Connected Components in Linear Time
IP Address Lookup Made Fast and Simple
Fast Algorithms for for Linear Algebra Modulo N
Fully Dynamic k-Means Coreset in Near-Optimal Update Time
The Support of Bin Packing Is Exponential
Dominating Sets and Local Treewidth
Noisy k-Means++ Revisited
FPTAS for Counting Weighted Edge Covers
Improved Algorithms for Quantum MaxCut via Partially Entangled Matchings
On the Complexity of the (Approximate) Nearest Colored Node Problem
Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime
Faster Block Tree Construction
Switching Colouring of G(n, d/n) for Sampling up to Gibbs Uniqueness Threshold
Jitter Regulation for Multiple Streams
Optimal Antimatroid Sorting
A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing
Galactic Token Sliding
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
Near-Linear Time Approximation Algorithms for Curve Simplification
Finding a Cluster in Incomplete Data
Large Low-Diameter Graphs are Good Expanders
The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables
Exact Algorithm for the Maximum Induced Planar Subgraph Problem
PRAM Computations Resilient to Memory Faults
Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints
Compact Oracles for Approximate Distances Around Obstacles in the Plane
Edit Distances and Factorisations of Even Permutations
Trace Reconstruction: Generalized and Parameterized
Preprocess, Set, Query!
Greedy in Approximation Algorithms
Bandwidth Maximization in Multicasting
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth
Faster Geometric Algorithms via Dynamic Determinant Computation
Oriented Spanners
Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach
Consistent Digital Curved Rays and Pseudoline Arrangements
33rd Annual European Symposium on Algorithms, ESA 2025, Warsaw, Poland, September 15-17, 2025
I/O-efficient Hierarchical Diameter Approximation
The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
Wanna Buy an Algorithm? Cheap! or: Algorithms for Text Searching Which Could Have Commercial Value (Abstract)
Kernelization for Spreading Points
Lower Bounds for Sorted Geometric Queries in the I/O Model
Tight Bounds for Online Coloring of Basic Graph Classes
Parallel Algorithms for Partitioning Sorted Sets and Related Problems
Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique
Engineering Planar Separator Algorithms
An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters
The Price of Resiliency: A Case Study on Sorting with Memory Faults
Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
Kernel Bounds for Disjoint Cycles and Disjoint Paths
Capacitated Sum-Of-Radii Clustering: An FPT Approximation
Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds
A Unified Framework for Hopsets
On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games
An Improved Algorithm for CIOQ Switches
Improved Algorithms for Resource Allocation under Varying Capacity
Construction of Minimum-Weight Spanners
Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links
Mincut Sensitivity Data Structures for the Insertion of an Edge
Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy
Incremental Edge Orientation in Forests
Approximation Hardness of Dominating Set Problems
5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size
Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings
A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth
Bounds on Greedy Algorithms for MAX SAT
New Binary Search Tree Bounds via Geometric Inversions
Polynomial-Time Constant-Approximation for Fair Sum-Of-Radii Clustering
Improved Explicit Data Structures in the Bitprobe Model
Distance-Preserving Subgraphs of Interval Graphs
Flexible Path Planning Using Corridor Maps
A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
Distribution-Aware Compressed Full-Text Indexes
Implementing Shared Memory on Mult-Dimensional Meshes and on the Fat-Tree (Extended Abstract)
Computing Smallest Convex Intersecting Polygons
The Number of Repetitions in 2D-Strings
Better Indexing for Rectangular Pattern Matching
Simpler and Better Algorithms for Minimum-Norm Load Balancing
How to Sort by Walking on a Tree
Bidirectional String Anchors: A New String Sampling Mechanism
Randomized Approximation Algorithms for Query Optimization Problems on Two Processors
Online Disjoint Set Cover Without Prior Knowledge
Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings
Constructing the R* Consensus Tree of Two Trees in Subcubic Time
Complexity Estimates Depending on Condition and Round-Off Error
Quantum Sub-Gaussian Mean Estimator
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
Inner-Product Based Wavelet Synopses for Range-Sum Queries
Data Migration on Parallel Disks
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Reconstructing Random Graphs from Distance Queries
Polynomial-Time Algorithms for Energy Games with Special Weight Structures
Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties
Dynamically Switching Vertices in Planar Graphs (Extended Abstract)
Online Coalition Formation Under Random Arrival or Coalition Dissolution
On Optimally Partitioning a Text to Improve Its Compression
Approximation Schemes for Min-Sum k-Clustering
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design
Deciding Relaxed Two-Colorability - A Hardness Jump
Optimizing over the Growing Spectrahedron
An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems
The Minimization of Random Hypergraphs
A Calculus of Random Generation
Contractions of Planar Graphs in Polynomial Time
An Algorithm for Dualization in Products of Lattices and Its Applications
Highway Hierarchies Hasten Exact Shortest Path Queries
Worst-Case Efficient Dynamic Geometric Independent Set
Permuting and Batched Geometric Lower Bounds in the I/O Model
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms
Making Multicurves Cross Minimally on Surfaces
Minimum Neighboring Degree Realization in Graphs and Trees
Compact and Fast Sensitivity Oracles for Single-Source Distances
Local Graph Exploration and Fast Property Testing
Optimal Upward Planarity Testing of Single-Source Digraphs
Incremental (1-ε)-Approximate Dynamic Matching in O(poly(1/ε)) Update Time
A Tree Structure For Dynamic Facility Location
Benchmark Graphs for Practical Graph Isomorphism
Nested Set Union
Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects
Engineering Minimal k-Perfect Hash Functions
Finding All Global Minimum Cuts in Practice
Dynamic Connectivity for Axis-Parallel Rectangles
31st Annual European Symposium on Algorithms, ESA 2023, Amsterdam, The Netherlands, September 4-6, 2023
Compact Oblivious Routing
Sublinear Space Algorithms for the Longest Common Substring Problem
Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing
Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
Latency Constrained Aggregation in Sensor Networks
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
Geometric Pattern Matching in d-Dimensional Space
A Practical Quicksort Algorithm for Graphics Processors
Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms
Deterministic Rendezvous in Graphs
A Subexponential Parameterized Algorithm for Proper Interval Completion
The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes
Combine and Conquer: a General Technique for Dynamic Algorithms (Extended Abstract)
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs
Experiments on Graph Clustering Algorithms
Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections
Dynamic Storage Allocation with Known Durations
Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs
Membership in Constant Time and Minimum Space
A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options
Cut-Query Algorithms with Few Rounds
Fast Computation of Zigzag Persistence
Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families
Near-Optimal Distance Emulator for Planar Graphs
Path Minima in Incremental Unrooted Trees
Maintaining a Minimum Spanning Tree Under Transient Node Failures
Optimal Tree Contraction on the Hypercube and Related Networks
A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph
Generalizing CGAL Periodic Delaunay Triangulations
Improved BDD Algorithms for the Simulation of Quantum Circuits
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL
Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity
Accelerating Multi-modal Route Planning by Access-Nodes
Online Scheduling for Sorting Buffers
Euclidean Greedy Drawings of Trees
On Computing the Diameter of a Point Set in High Dimensional Euclidean Space
Partial Alphabetic Trees
An Improved Algorithm for Finding the Shortest Synchronizing Words
Origami, Linkages, and Polyhedra: Folding with Algorithms
Efficient Construction of a Bounded Degree Spanner with Low Weight
On the Variance of Subset Sum Estimation
Approximation Algorithms for Quickest Spanning Tree Problems
Document Retrieval on Repetitive Collections
Desnakification of Mesh Sorting Algorithms
Graph Isomorphism for Unit Square Graphs
Efficient Top-Down Updates in AVL Trees
An Optimal Algorithm for Preemptive On-line Scheduling
Small Stretch Spanners on Dynamic Graphs
Multicut Problems in Almost-Planar Graphs: the Dependency of Complexity on the Demand Pattern
Engineering Edge Orientation Algorithms
Faster Exact Solutions for Some NP-Hard Problems
Area-Efficient Static and Incremental Graph Drawings
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
Quantum Approximate k-Minimum Finding
A Constant Approximation Algorithm for Scheduling Packets on Line Networks
Fast Approximation in Subspaces by Doubling Metric Decomposition
Sequencing by Hybridization in Few Rounds
Algorithms for Computing Signs of 2×2 Determinants: Dynamics and Average-Case Analysis
Computing Regions Decomposable into m Stars
The Complexity of Games on Highly Regular Graphs
Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
Flows on Few Paths: Algorithms and Lower Bounds
Subcubic Algorithm for (Unweighted) Unrooted Tree Edit Distance
On the Tree Augmentation Problem
Cover-Decomposition and Polychromatic Numbers
Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings
Consensus Patterns (Probably) Has no EPTAS
Randomized Competitive Analysis for Two-Server Problems
Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
Delineating Boundaries for Imprecise Regions
Min-Sum Scheduling Under Precedence Constraints
Tradeoffs and Average-Case Equilibria in Selfish Routing
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
Cache-Oblivious Red-Blue Line Segment Intersection
Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions
Scheduling Multiclass Queueing Networks on Parallel Servers: Approximate and Heavy-Traffic Optimality of Klimov's Priority Rule
K-D Trees Are Better when Cut on the Longest Side
Parallel Algorithms for Mean-Payoff Games: An Experimental Evaluation
Computing Shapes from Point Cloud Data
More on Change-Making and Related Problems
Bottleneck Non-crossing Matching in the Plane
Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings
Hedonic Games and Treewidth Revisited
Improved Approximations for Translational Packing of Convex Polygons
Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings
Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs
Simultaneous Representation of Interval Graphs in the Sunflower Case
Vertex Deletion for 3D Delaunay Triangulations
Incidences with Curves in ℝ d
Efficient Approximation Algorithms for the Achromatic Number
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
On the Computational Complexity of Linear Discrepancy
Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection
Minimum Vertex Cover in Rectangle Graphs
Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract)
Relax-and-Cut for Capacitated Network Design
Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal
A New Approach to Resultant Computations and Other Algorithms with Exact Division
Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs
Simpler Universally Optimal Dijkstra
A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges
On Learning Linear Functions from Subset and Its Applications in Quantum Computing
Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy
Dispersion on Trees
On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
Optimal Color Range Reporting in One Dimension
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
Restricted t-Matchings via Half-Edges
New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem
The Capacitated K-Center Problem (Extended Abstract)
More Robust Hashing: Cuckoo Hashing with a Stash
Maximum Multicommodity Flows over Time without Intermediate Storage
Finding Mobile Data: Efficiency vs. Location Inaccuracy
Fast Deterministic Simulation of Computations on Faulty Parallel Machines
Feedback Vertex Sets in Tournaments
Approximation Algorithms for Restoration Capacity Planning
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
Parallel Imaging Problem
Decompositions and Boundary Coverings of Non-convex Fat Polyhedra
Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode
Buffer Overflows of Merging Streams
Triangles and Girth in Disk Graphs and Transmission Graphs
Encodings for Range Selection and Top-k Queries
Exact and Approximate Distances in Graphs - A Survey
A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time
Nearly Optimal Private Convolution
A Polynomial Kernel for Diamond-Free Editing
On the Hardness and Inapproximability of Recognizing Wheeler Graphs
A Linear-Time Parameterized Algorithm for Node Unique Label Cover
An Algorithmic Weakening of the Erdős-Hajnal Conjecture
Solutions to Real-World Instances of PSPACE-Complete Stacking
Efficiency of Learned Indexes on Genome Spectra
An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
The Maximum Binary Tree Problem
A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity
The Stochastic Score Classification Problem
Hyperbolic Dovetailing
Limitations of Deterministic Auction Design for Correlated Bidders
A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem
Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem
Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing
Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence
Approximability of Average Completion Time Scheduling on Unrelated Machines
Extending Reduction Techniques for the Steiner Tree Problem
Maximizing Job Completions Online
PReaCH: A Fast Lightweight Reachability Index Using Pruning and Contraction Hierarchies
Maximum Matchings in Planar Graphs via Gaussian Elimination
How to Allocate Goods in an Online Market?
Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space - with Fast Point-Location
Alphabet-Independent Compressed Text Indexing
The Online Replacement Path Problem
Simulating Population Protocols in Sub-Constant Time per Interaction
A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images
Medium-Space Algorithms for Inverse BWT
Randomization of Search Trees by Subtree Size
An Efficient Algorithm for Power Dominating Set
Multiline Addressing by Network Flow
Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model
A 7/3-Approximation for Feedback Vertex Sets in Tournaments
Computing Homotopic Shortest Paths Efficiently
Localized Geometric Moves to Compute Hyperbolic Structures on Triangulated 3-Manifolds
Faster Deterministic Modular Subset Sum
Design and Implementation of Efficient Data Types for Static Graphs
A Lower Bound for Cake Cutting
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane
Balanced Neighbor Selection for BitTorrent-Like Networks
Packet Routing and Information Gathering in Lines, Rings and Trees
Courcelle's Theorem for Lipschitz Continuity
A Simple Shortest Path Algorithm with Linear Average Time
A Dual-Fitting $\frac{3}{2}$ -Approximation Algorithm for Some Minimum-Cost Graph Problems
Reporting Red-Blue Intersections between Two Sets of Connected Line Segments
Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables
High-Level Filtering for Arrangements of Conic Arcs
Jitter Regulation in an Internet Router with Delay Consideration
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited
(Multivariate) k-SUM as Barrier to Succinct Computation
Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
FPTAS for Minimizing Earth Mover's Distance under Rigid Transformations
Dynamic Clustering to Minimize the Sum of Radii
New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs
Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard
Work-Time Optimal Parallel Prefix Matching (Extended Abstract)
Fully-Dynamic Coresets
Chordless Cycle Packing Is Fixed-Parameter Tractable
Compression by Contracting Straight-Line Programs
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond
Building a Nest by an Automaton
Some Computational Challenges in Today's Bio-medicine
List Colouring Trees in Logarithmic Space
Kinetic Collision Detection for Convex Fat Objects
Tolerant Algorithms
Can Nearest Neighbor Searching Be Simple and Always Fast?
Preemptive Coordination Mechanisms for Unrelated Machines
Good Quality Virtual Realization of Unit Ball Graphs
Web Information Retrieval - an Algorithmic Perspective
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem
Approximate Coloring of Uniform Hypergraphs (Extended Abstract)
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms
Order Statistics in the Farey Sequences in Sublinear Time
Dynamic Trees with Almost-Optimal Access Cost
Online and Offline Distance Constrained Labeling of Disk Graphs
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions
Altruism in Atomic Congestion Games
I/O-Efficient Undirected Shortest Paths
Simpler and Faster Vertex-Connectivity Augmentation Algorithms
Distributed Signaling Games
Equivalence of Search Capability Among Mobile Guards with Various Visibilities
A Primal Approach to the Stable Set Problem
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract)
Faster Algorithm for Unique (k, 2)-CSP
Packing and Covering with Non-Piercing Regions
Density-Sensitive Algorithms for (Δ + 1)-Edge Coloring