yusuke1997/dblp-id-title huggingface dataset:
A Framework for Constructing Heap-Like Structures In-Place
Dynamic Range Selection in Linear Space
The Parameterized Complexity of Local Search for TSP, More Refined
Voronoi Diagrams with a Transportation Network on the Euclidean Plane
Navigating in a Graph by Aid of Its Spanning Tree
Quantum Algorithms for Intersection and Proximity Problems
Throughput Maximization in Multiprocessor Speed-Scaling
Policies for Periodic Packet Routing
Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings
Distance Measures for Embedded Graphs
Small Convex Quadrangulations of Point Sets
Approximation Algorithms for Generalized Path Scheduling
A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times
Recognizing an Envelope of Lines in Linear Time
Playing Tetris on Meshes and Multi-Dimensional SHEARSORT
Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks
The School Bus Problem on Trees
Satisfiability with Index Dependency
Drawing a Tree as a Minimum Spanning Tree Approximation
A Linear Vertex Kernel for Maximum Internal Spanning Tree
Monitoring Continuous Band-Join Queries over Dynamic Data
A Hard Problem That is Almost Always Easy
2-Stage Fault Tolerant Interval Group Testing
The 1-Versus-2 Queries Problem Revisited
Market Pricing for Matroid Rank Valuations
A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs
Parameterized Complexity of Directed Traveling Salesman Problem
Succinct Data Structures for Representing Equivalence Classes
Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
Edge-Disjoint Paths in Permutation Graphs
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games
Robustness of Minimum Cost Arborescences
On the Clique-Width of Graphs in Hereditary Classes
Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average
Mapping Dynamic Data and Algorithm Structures into Product Networks
A Probabilistic Selection Network with Butterfly Networks
Algorithms for Computing Variants of the Longest Common Subsequence Problem
Spanning Closed Trail and Hamiltonian Cycle in Grid Graphs
Market Clearing with Supply and Demand Curves
Covering a Simple Polygon by Monotone Directions
On Almost Disjunct Matrices for Group Testing
Sliding Tokens on a Cactus
Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces
Bounded Representations of Interval and Proper Interval Graphs
On p-Norm Based Locality Measures of Space-Filling Curves
Algorithms for Finding f-Colorings of Partial k-Trees
Minimum Cost Partitions of Trees with Supply and Demand
Classification of Various Neighborhood Operations for the Nurse Scheduling Problem
Approximating Unweighted Connectivity Problems in Parallel
Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings
Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance
Angle-Restricted Steiner Arborescences for Flow Map Layout
Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights
Hamiltonian Decomposition of Recursive Circulants
Preemptive Semi-online Scheduling on Parallel Machines with Inexact Partial Information
Structure and Computation of Straight Skeletons in 3-Space
Efficient Labeling for Reachability in Directed Acyclic Graphs
On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs
Traffic-Oblivious Multi-Commodity Flow Network Design
Conflict-Free Coloring of Intersection Graphs
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
Computing a Subtrajectory Cluster from c-Packed Trajectories
Coresets for Fuzzy K-Means with Applications
5-th Phylogenetic Root Construction for Strictly Chordal Graphs
Average Update Times for Fully-Dynamic All-Pairs Shortest Paths
Approximating the Traveling Tournament Problem with Maximum Tour Length 2
Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint
Exact Algorithms for Dominating Clique Problems
Posi-modular Systems with Modulotone Requirements under Permutation Constraints
Planar Matchings for Weighted Straight Skeletons
Optimal Fault-Tolerant Broadcasting in Trees (Extended Abstract)
Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets
Efficient Algorithms for k Maximum Sums
Randomized Algorithm for the Sum Selection Problem
Realization of Temporally Connected Graphs Based on Degree Sequences
Unit-Time Predecessor Queries on Massive Data Sets
Entropy-Bounded Representation of Point Grids
Model Counting for Formulas of Bounded Clique-Width
Dynamic Structures for Top- k Queries on Uncertain Data
Future Directions in Computer Science Research
Limiting Negations in Bounded-Depth Circuits: An Extension of Markov's Theorem
Sparse Induced Subgraphs in P₇-Free Graphs of Bounded Clique Number
Compact Routing in Unit Disk Graphs
On the Approximability of the Maximum Interval Constrained Coloring Problem
Nearly-Tight Lower Bounds for Set Cover and Network Design with Deadlines/Delay
Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues
Simple Realizability of Abstract Topological Graphs
Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs
Algorithms for Finding Optimal Disjoint Paths Around a Rectangle
Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs
Optimal Approximate Agreement with Omission Faults
An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
An Approximation Algorithm for Alphabet Indexing Problem
A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs
The Layered Net Surface Problems in Discrete Geometry and Medical Image Segmentation
Parameterized Reunion with Achromatic Number
When Maximum Stable Set Can Be Solved in FPT Time
A New Algorithm for Finding Trees with Many Leaves
Algorithms for the Hypergraph and the Minor Crossing Number Problems
Reforming an Unfair Allocation by Exchanging Goods
Simultaneous Feedback Edge Set: A Parameterized Perspective
Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve
A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge
The Complexity of Geodesic Spanners Using Steiner Points
Approximating the Minmax Subtree Cover Problem in a Cactus
How Many People Can Hide in a Terrain?
An FPT Algorithm for Splitting a Necklace Among Two Thieves
Weak Visibility Queries of Line Segments in Simple Polygons
Efficient List Ranking on the Reconfigurable Mesh, with Applications
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction
Seidel Minor, Permutation Graphs and Combinatorial Properties
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits
New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction
Cutting a Country for Smallest Square Fit
Space-Efficient Plane-Sweep Algorithms
L_1 Geodesic Farthest Neighbors in a Simple Polygon and Related Problems
Approximation Algorithms for Layered Multicast Scheduling
Unifying Two Graph Decompositions with Modular Decomposition
Bipartite Matching with Linear Edge Weights
Boosting Spectral Partitioning by Sampling and Iteration
Locally Checkable Problems Parameterized by Clique-Width
Approximating the Crossing Number of Toroidal Graphs
Lower Bounds on Correction Networks
Discriminating Codes in Geometric Setups
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics
Faster Algorithms for Half-Integral T-Path Packing
Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems
Matrix Completion: Approximating the Minimum Diameter
Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
Bounded-Degree Independent Sets in Planar Graphs
A New Problem in String Searching
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation
Streaming Pattern Matching (Invited Talk)
Polynomial Deterministic Rendezvous in Arbitrary Graphs
SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data
Coloring and Recognizing Mixed Interval Graphs
Geometric Optimization Problems Over Sliding Windows
A Competitive Algorithm for Random-Order Stochastic Virtual Circuit Routing
Single Family Algebra Operation on BDDs and ZDDs Leads to Exponential Blow-Up
Sweeping Graphs with Large Clique Number
Quasi-Random Combinatorial Structures (Abstract)
36th International Symposium on Algorithms and Computation, ISAAC 2025, Tainan, Taiwan, December 7-10, 2025
Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees
Exact Solutions for CLOSEST STRING and Related Problems
A Geometric Approach to Boolean Matrix Multiplication
The Minimum Vulnerability Problem
Minimum Link Fencing
Approximation Algorithms for Some Parameterized Counting Problems
Extremal Problems for Geometric Hypergraphs
New Results on Simple Stochastic Games
Structure in Average Case Complexity
The VC-Dimension of Limited Visibility Terrains
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
Counting Partitions of Graphs
A Dynamic Dictionary for Priced Information with Application
Convex Grid Drawings of Plane Graphs with Rectangular Contours
Maximizing a Voronoi Region: The Convex Case
Generating Small Convergent Systems Can Be Extremely Hard
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes
Skeletons and Minimum Energy Scheduling
Dynamic Boolean Formula Evaluation
An Optimal Labeling for Node Connectivity
An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles
Separability with Outliers
Approximation to the Minimum Cost Edge Installation Problem
Partial Function Extension with Applications to Learning and Property Testing
Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes
Convex Grid Drwaings of Four-Connected Plane Graphs
Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings
Fast Convolutions for Near-Convex Sequences
On the Connected Minimum Sum of Radii Problem
Depth-Three Circuits for Inner Product and Majority Functions
Bisecting Two Subsets in 3-Connected Graphs
Unbalanced Graph Partitioning
Orders of Gauss Periods in Finite Fields
Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks
Some Constrained Notions of Planarity
Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings
An Efficient Parallel Algorithm for Geometrically Characterising Drawings of a Class of 3-D Objects
A Fast Algorithm for Enumerating Bipartite Perfect Matchings
Succinct Greedy Geometric Routing in the Euclidean Plane
Online Algorithms for Warehouse Management
Computing the Discrete Fréchet Distance with Imprecise Input
Baire Category and Nowhere Differentiability for Feasible Real Functions
Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center
Feedback Vertex Set on Geometric Intersection Graphs
Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information
A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree
On the Line-Separable Unit-Disk Coverage and Related Problems
A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
Generalized Reduction to Compute Toric Ideals
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points
Range LCP
Some Remarks on the L-Conjecture
Augmenting Edge and Vertex Connectivities Simultaneously
On the Runtime and Robustness of Randomized Broadcasting
On the Convergence Time of a Natural Dynamics for Linear Programming
Complexity of Approximating the Vertex Centroid of a Polyhedron
Practical Logic (Abstract)
Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs
Sparse Geometric Graphs with Small Dilation
Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers
Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures
An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks
Semidefinite Programming and Approximation Algorithms: A Survey
Monotone Drawings of Planar Graphs
Using Nash Implementation to Achieve Better Frugality Ratios
Role of Structured Matrices in Fine-Grained Algorithm Design (Invited Talk)
Top-k Document Retrieval in Compact Space and Near-Optimal Time
How Much Independent Should Individual Contacts Be to Form a Small-World?
Solving Minimum Weight Exact Satisfiability in Time O (2 0.2441 n )
Approximating Tree Edit Distance Through String Edit Distance
Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs
The Isolation Game: A Game of Distances
New Ways to Construct Binary Search Trees
Efficient Minus and Signed Domination in Graphs
Good Programming in Transactional Memory
Approximate Distance Oracles for Graphs with Dense Clusters
Property-Preserving Data Reconstruction
Induced Immersions
Covering Clients with Types and Budgets
How Does Object Fatness Impact the Complexity of Packing in d Dimensions?
Threshold Computation and Cryptographic Security
34th International Symposium on Algorithms and Computation, ISAAC 2023, Kyoto, Japan, December 3-6, 2023
On Maximal Cliques with Connectivity Constraints in Directed Graphs
Assigning Weights to Minimize the Covering Radius in the Plane
Single Machine Scheduling with Job-Dependent Machine Deterioration
Counting Complexity Classes over the Reals I: The Additive Case
Geometric Matching Algorithms for Two Realistic Terrains
Randomized Leader Election Protocols in Radio Networks with No Collision Detection
How to Base Security on the Perfect/Statistical Binding Property of Quantum Bit Commitment?
An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem
How to Generate Realistic Sample Problems for Network Optimization
Queaps
Fine-Grained Meta-Theorems for Vertex Integrity
Succinct Representation of Labeled Graphs
Random Tries
Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion
Approximating the Packedness of Polygonal Curves
Polynomial-Time Isomorphism Test of Groups that are Tame Extensions - (Extended Abstract)
On the Complexity of Reconfiguration Problems
Minimum Plane Bichromatic Spanning Trees
On the Computational Complexity of Vertex Integrity and Component Order Connectivity
Planar Maximum Matching: Towards a Parallel Algorithm
Compressed and Searchable Indexes for Highly Similar Strings (Invited Talk)
On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms
An Improved Data Structure for Left-Right Maximal Generic Words Problem
Singularities Make Spatial Join Scheduling Hard
Non-Clairvoyant Makespan Minimization Scheduling with Predictions
Randomized Algorithms for Motif Detection
Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
Degree-Constrained Orientations of Embedded Graphs
All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time
An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts
Detecting Commuting Patterns by Clustering Subtrajectories
Correlation Clustering Generalized
Complexity of Partial Covers of Graphs
Efficient Parallel Algorithms for Constructing a k -Tree Center and a k -Tree Core of a Tree Network
Knapsack with Vertex Cover, Set Cover, and Hitting Set
Realizability of Free Spaces of Curves
Optimal File Distribution in Peer-to-Peer Networks
Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules
Unfolding Orthogonal Polyhedra with Linear Refinement
Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs
The Complexity of Rationalizing Matchings
Approximation of a Geometric Set Covering Problem
Computing the Maximum Overlap of Two Convex Polygons Under Translations
Clustering in Polygonal Domains
Minimal Obstructions for Partial Representations of Interval Graphs
An On-line Competitive Algorithm for Coloring P_8 -free Bipartite Graphs
A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem
On the Stretch Factor of Convex Delaunay Graphs
On the Complexity of Testing for Catastrophic Faults
On Directed Covering and Domination Problems
Optimizing Quantum Circuit Parameters via SDP
No Quadrangulation is Extremely Odd
On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems
Essentially Every Unimodular Matrix Defines and Expander
Free-Form Surface Partition in 3-D
Asymptotic Modularity of Some Graph Classes
Reconstruction of Weakly Simple Polygons from their Edges
A New Subgraph of Minimum Weight Triangulations
Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings
Evaluation of General Set Expressions
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata
Algorithms for Building Consensus MUL-trees
Enumerating Floorplans with n Rooms
Exact Sublinear Binomial Sampling
Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures
Weighted Independent Perfect Domination on Cocomparability Graphs
Minkowski Sum Selection and Finding
Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
Negation-Limited Inverters of Linear Size
Dynamic Range Reporting in External Memory
Computing the Longest Common Subsequence of Two Run-Length Encoded Strings
Simultaneous Matchings
Mimicking Networks for Constrained Multicuts in Hypergraphs
Approximate Matchings in Massive Graphs via Local Structure (Invited Talk)
Point Location in Incremental Planar Subdivisions
Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings
Relativizing Complexity Classes With Random Oracles
Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings
Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol
On Shortest Disjoint Paths in Planar Graphs
An Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management
A Practical Algorithm for the Computation of Market Equilibrium with Logarithmic Utility Functions
Prefix Sorting DFAs: A Recursive Algorithm
Faster Rumor Spreading with Multiple Calls
On Algorithmic Self-Assembly of Squares by Co-Transcriptional Folding
A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence
Shortest Safari Routes in Simple Polygon
Inferring Strings from Full Abelian Periods
Computing the Visibility Polygon Using Few Variables
Covering a Point Set by Two Disjoint Rectangles
Approximation Algorithms for Computing the Earth Mover's Distance Under Transformations
Recursion Theoretic Operators for Function Complexity Classes
Approximation Schemes for k-Subset Sum Ratio and k-Way Number Partitioning Ratio
On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter
Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams
A Theoretical Framework of Hybrid Approaches to MAX SAT
Frequency Allocation Problems for Linear Cellular Networks
On Defect Sets in Bipartite Graphs (Extended Abstract)
Interval Stabbing Problems in Small Integer Ranges
Fixed-Parameter Tractability of Token Jumping on Planar Graphs
Optimal Online Bipartite Matching in Degree-2 Graphs
Computing the ( t , k )-Diagnosability of Component-Composition Graphs and Its Application
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations
Agnostically Learning Boolean Functions with Finite Polynomial Representation
Dominating Induced Matchings for P 7-free Graphs in Linear Time
A Unified Framework for Approximating Multiway Partition Problems
The Generating Algorithm for Quasi-Full Steiner Trees
Myhill-Nerode Methods for Hypergraphs
Model-Based Classification of Trajectories
Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem
Dynamic Data Structures for k-Nearest Neighbor Queries
Strong Robustness of Randomized Rumor Spreading Protocols
Finding Popular Places
Improved Approximation Algorithms for Routing Shop Scheduling
Survivable Networks with Bounded Delay: The Edge Failure Case
Approximation Algorithm for Vertex Cover with Multiple Covering Constraints
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor
Worst-Case and Smoothed Analysis of k -Means Clustering with Bregman Divergences
A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2
Application of M-Convex Submodular Flow Problem to Mathematical Economics
Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings
Computing Shapley Values for Mean Width in 3-D
On Coloring Graphs without Induced Forests
Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths
The Solvable Cases of a Scheduling Algorithm
Universal Guard Problems
Computing the Pattern Waiting Time: A Revisit of the Intuitive Approach
The b-Matching Problem in Distance-Hereditary Graphs and Beyond
Vertex Cover Reconfiguration and Beyond
Trading off Worst and Expected Cost in Decision Tree Problems
Finding the Shortest Watchman Route in a Simple Polygon
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
Faster Algorithms for Growing Prioritized Disks and Rectangles
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs
Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
Relations Between Two Common Types of Rectangular Tilings
Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle
(In)approximability of Maximum Minimal FVS
Fast Approximate Dictionary Matching
Minimum Entropy Coloring
Cyclability in Graph Classes
Hardness and Fixed Parameter Tractability for Pinwheel Scheduling Problems
A Faster Algorithm for Finding Disjoint Paths in Grids
Logspace Verifiers, NC, and NP
Challenges and Opportunities of Graph-Based Algorithms for Similarity Search (Invited Talk)
Reconfiguration of Labeled Matchings in Triangular Grid Graphs
Asynchronous Rumor Spreading on Random Graphs
Algorithmic Problems Arising from Genome Informatics (Abstract)
Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover
Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements
A Linear-Time Algorithm for Computing Characteristic Strings
Graph Searches and Their End Vertices
Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane
Complexity of Local Search for Euclidean Clustering Problems
Width-Optimal Visibility Representations of Plane Graphs
Dynamic Programming on Distance-Hereditary Graphs
New and Improved Algorithms for Unordered Tree Inclusion
Multi-Color Routing in the Undirected Hypercube
A New Approach for Speeding Up Enumeration Algorithms
Shortest Path Algorithms: Engineering Aspects
Approximation Algorithms in Batch Processing
Graph Layout Problems Parameterized by Vertex Cover
On Determining Deep Holes of Generalized Reed-Solomon Codes
Group Evacuation on a Line by Agents with Different Communication Abilities