yusuke1997/dblp-id-title huggingface dataset:
Obstructions to Within a Few Vertices or Edges of Acyclic
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
Approximating Multi-objective Knapsack Problems
Small Maximal Independent Sets and Faster Exact Graph Coloring
Resizable Arrays in Optimal Time and Space
On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach
On the Complexity of Scheduling Conditional Real-Time Code
Randomized Algorithms for Metrical Task Systems
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride
Constructing Orthogonal de Bruijn Sequences
Improved Results for a Memory Allocation Problem
Multi-target Ray Searching Problems
Linear Time Algorithms for Computing Reachability Regions from Polygonal Figures
The Traveling Salesman Problem for Cubic Graphs
Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs
Balanced Distributed Search Trees Do Not Exist
Approximation Algorithm for Hotlink Assignments in Web Directories
On the Minimum Consistent Subset Problem
Significant-Presence Range Queries in Categorical Data
On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids
An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs
Path Minima Queries in Dynamic Weighted Trees
When Can Graph Hyperbolicity Be Computed in Linear Time?
Linear Time Algorithms for Generalized Edge Dominating Set Problems
Colored Constrained Spanning Tree on Directed Graphs
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons
On Geometric Dilation and Halving Chords
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint
Groups and Algebraic Complexity (Abstract)
Online Perfect Matching and Mobile Computing
On Explaining Integer Vectors by Few Homogenous Segments
New Results of Fault Tolerant Geometric Spanners
Memory Access in Models of Parallel Computation: From Folklore to Synergy and Beyond
The Greedy Gray Code Algorithm
A Framework for Vehicle Routing Approximation Schemes in Trees
The Parametric Closure Problem
An EPTAS for Scheduling on Unrelated Machines of Few Different Types
On an Optimal Split Tree Problem
Solving Problems on Generalized Convex Graphs via Mim-Width
A Polynomial Kernel for Distance-Hereditary Vertex Deletion
Delaunay Triangulation of Imprecise Points Simplified and Extended
Optimal Time-Convex Hull under the L p Metrics
Design and Analysis of Algorithms for Shared-Memory Multiprocessors (Abstract)
All-Pairs Shortest Paths with Real Weights in O ( n 3 /log n ) Time
Parallel Algorithms for the Subgraph Homeomorphism Problem
Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
Contact Graphs of Circular Arcs
Selecting the kth Largest-Area Convex Polygon
Multicut in Trees Viewed through the Eyes of Vertex Cover
Feedback Vertex Set in Mixed Graphs
Probabilistic Leader Election on Rings of Known Size
Relaxing the Irrevocability Requirement for Online Graph Algorithms
Alternating Paths along Orthogonal Segments
A Time-Randomness Tradeoff for Selection in Parallel
Elastic Labels Around the Perimeter of a Map
Realizability Makes A Difference: A Complexity Gap For Sink-Finding in USOs
On-line Load Balancing for Related Machines
Visibility and Ray Shooting Queries in Polygonal Domains
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
Competitive Search in Symmetric Trees
Dominator Coloring and CD Coloring in Almost Cluster Graphs
Algorithms Meet Art, Puzzles, and Magic
Improved Approximation Bounds for Planar Point Pattern Matching
Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
Planar Packing of Binary Trees
Independent Sets in Semi-random Hypergraphs
Improved Distance Sensitivity Oracles via Tree Partitioning
Succinct Data Structures for Chordal Graph with Bounded Leafage or Vertex Leafage
Augmentation Problems on Hierarchically Defined Graphs (Preliminary Version)
A Deterministic Algorithm for Online Steiner Tree Leasing
Orthogonal Range Searching in Linear and Almost-Linear Space
Treewidth of Circular-Arc Graphs (Abstract)
Orthogonal Cartograms with Few Corners Per Face
Distance-Sensitive Planar Point Location
Cache-Oblivious Iterated Predecessor Queries via Range Coalescing
An Efficient Algorithm for Finding all Maximal Square Blocks in a Matrix
Interval Selection in the Streaming Model
Better Distance Labeling for Unweighted Planar Graphs
Spanner for the 0/1/∞ Weighted Region Problem
Balanced Line Separators of Unit Disk Graphs
On Reconfiguration of Disks in the Plane and Related Problems
An Improved SAT Algorithm in Terms of Formula Length
Most Vital Segment Barriers
Parameterized Reductions and Algorithms for Another Vertex Cover Generalization
A Pseudopolynomial Algorithm for Alexandrov's Theorem
Blame Trees
Designing Multi-Commodity Flow Trees
Line-Segment Intersection Made In-Place
Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time
Finding Longest Approximate Periodic Patterns
Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs
Bin Packing with Item Fragmentation
Fast and Simple Connectivity in Graph Timelines
On the Area Requirements of Euclidean Minimum Spanning Trees
Convex Polygons in Geometric Triangulations
Seller-Focused Algorithms for Online Auctioning
On (Dynamic) Range Minimum Queries in External Memory
Fast Kd-Trees for the Kullback-Leibler Divergence and Other Decomposable Bregman Divergences
Linear Algorithms for Parity Path and Two Path Problems on Circular-Arc Graph
Modular Circulation and Applications to Traffic Management
Local Routing in Spanners Based on WSPDs
Geometric Hitting Set for Line-Constrained Disks
Universal Reconstruction of a String
A Parameterized Approximation Scheme for Generalized Partial Vertex Cover
Regular-Factors In The Complements Of Partial k-Trees
Parameterized Complexity of Generalized Vertex Cover Problems
On the I/O Complexity of the Cocke-Younger-Kasami Algorithm and of a Family of Related Dynamic Programming Algorithms
Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract)
Range Closest-Pair Search in Higher Dimensions
Weighted Orthogonal Linear L ∞ -Approximation and Applications
A Linear Algorithm for the Maximal Planar Subgraph Problem
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements
Succinct Dynamic Data Structures
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
Position-Independent Street Searching
Crossing and Independent Families Among Polygons
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
Optimal Möbius Transformations for Information Visualization and Meshing
I/O-Efficient Shortest Path Queries in Geometric Spanners
Constructing and Routing on Geometric Spanners (Invited Talk)
Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron
An Optimal Algorithm for Computing Visibility in the Plane
Discrepancy Theory and Computational Geometry
On the Stretch Factor of the Theta-4 Graph
On the Spanning Ratio of Theta-Graphs
Robot Map Verification of a Graph World
Minimizing the Aggregate Movements for Interval Coverage
Succinct Representation of Triangulations with a Boundary
Improved Combinatorial Group Testing for Real-World Problem Sizes
On Minimum Generalized Manhattan Connections
Dynamic Convex Hulls Under Window-Sliding Updates
Tree Reconstruction from Partial Orders
Scheduling Jobs that Arrive Over Time (Extended Abstract)
Plane Hop Spanners for Unit Disk Graphs
Dynamic Motion Planning in Low Obstacle Density Environments
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks
On Fat Partitioning, Fat Covering and the Union Size of Polygons (Extended Abstract)
Admission Control to Minimize Rejections
Approximating Transitive Reductions for Directed Networks
A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs
An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space
k-Restricted Rotation with an Application to Search Tree Rebalancing
Optimization over Zonotopes and Training Support Vector Machines
Skip-Splay: Toward Achieving the Unified Bound in the BST Model
Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
On the Reflexivity of Point Sets
A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs
Sharing Memory in Asynchronous Message Passing Systems
B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load
Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings
Point Probe Decision Trees for Geometric Concept Classes
Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees
Greedy Is an Almost Optimal Deque
A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs
Geometric Firefighting in the Half-Plane
Finding Pairwise Intersections Inside a Query Range
A 7/8-Approximation Algorithm for Metric Max TSP
Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-Machining
Go-With-The-Winners Heuristic
Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density
2-Point Site Voronoi Diagrams
Block Crossings in One-Sided Tanglegrams
Bounding the Running Time of Algorithms for Scheduling and Packing Problems
Deciding Clique-Width for Graphs of Bounded Tree-Width
Stabbing Parallel Segments with a Convex Polygon (Extended Abstract)
NC Algorithms for Circular-Arc Graphs
Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences
An Emperical Analysis of Algorithms for Constructing a Minimum Spanning Tree
Geometric Applications Of Posets
Computing the All-Pairs Longest Chain in the Plane
The Minimum Moving Spanning Tree Problem
On the Complexity of Finding 1-Center Spanning Trees
Reconstructing Strings from Substrings (Extended Abstract)
A Linear-Time Scheme for Version Reconstruction (Extended Abstract)
An Algorithm for Finding Predecessors in Integer Sets
Reversing Longest Previous Factor Tables is Hard
Reconfiguring Undirected Paths
Algorithms and Data Structures - 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings
Space Efficient Data Structures for Dynamic Orthogonal Range Counting
Optimal Batch Schedules for Parallel Machines
Algorithms for Radius-Optimally Augmenting Trees in a Metric Space
Kernelization and Complexity Results for Connectivity Augmentation Problems
Trajectory Grouping Structure
Maintaining the Extent of a Moving Point Set
Bundling Three Convex Polygons to Minimize Area or Perimeter
On the Vehicle Routing Problem
Algorithms for Distance Problems in Continuous Graphs
Covering Segments with Unit Squares
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies
Finding Articulation Points of Large Graphs in Linear Time
Witness Rectangle Graphs
Approximation of Constraint Satisfaction via Local Search (Extended Abstract)
Approximation of Multiobjective Optimization Problems
Algorithmic Theory of Qubit Routing
Proximity Structures for Geometric Graphs
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time
Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs
Improved Bounds on the Spanning Ratio of the Theta-5-Graph
Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions
Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems
Algorithmic Arguments in Physics of Computation
Subquadratic Algorithms for 3SUM
Fixed-Parameter Tractability for Non-Crossing Spanning Trees
Computing the Implicit Voronoi Diagram in Triple Precision
Testing the Quality of Manufactured Balls
Computational Geometry with Probabilistically Noisy Primitive Operations
Parallel vs. Parametric Complexity (Abstract)
On the Minimum Eccentricity Shortest Path Problem
Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs
Generalized Approzimate Algorithms for Point Set Congruence
Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings
Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere
A Fast Derandomization Schemes and Its Applications
Computing the Center of Area of a Polygon
The Complexity of Finding Certain Trees in Tournaments
Search Trees with Relaxed Balance and Near-Optimal Height
Computational and Structural Advantages of Circular Boundary Representation
Galleries, Light Matchings and Visibility Graphs
Deferred-Query - An Efficient Approach for Problems on interval and Circular-Arc Graphs (Extended Abstract)
Voronoi Diagrams for Polygon-Offset Distance Functions
Two-Sided Boundary Labeling with Adjacent Sides
Orthogonal Drawing of High Degree Graphs with Small Area and Few Bends
Online Square Packing
Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs
Straight-Line Rectangular Drawings of Clustered Graphs
The Zigzag Path of a Pseudo-Triangulation
Faster Approximation of Distances in Graphs
Probing a Set of Hyperplanes by Lines and Related Problems
Optimal Channel Placement for Multi-Terminal Nets
Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems
Optimal Hypercube Algorithms for Labeled Images (Preliminary Version)
Tight Bounds on the Number of Closest Pairs in Vertical Slabs
A Scheme for Computing Minimum Covers within Simple Regions
A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs
Extending Upward Planar Graph Drawings
On Some Geometric Selection and Optimization Problems via Sorted Matrices
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions
Load Balancing in Quorum Systems (Extended Abstract)
Filling Polyhedral Molds
Online Routing in Directed Yao₄^∞ Graphs
Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets
How to Morph a Tree on a Small Grid
An Index Data Structure For Matrices, with Applications to Fast Two-Dimensional Pattern Matching
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues
Improved Length Bounds for the Shortest Superstring Problem (Extended Abstract)
Performance Guarantees for the TSP with a Parameterized Triangle Inequality
On the Difficulty of Range Searching
Improved Algorithms for the Feedback Vertex Set Problems
Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract)
An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon
Ray-shooting and Isotopy Classes of Lines in 3-Dimensional Space
On the Robustness of Graham's Algorithm for Online Scheduling
Integrated Prefetching and Caching with Read and Write Requests
Faster Algorithms for Cycle Hitting Problems on Disk Graphs
Piecewise-Linear Approximations of Uncertain Functions
String Searching Algorithms Revisited
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane
Optimal Embedding into Star Metrics
Distribution-Sensitive Binomial Queues
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light
Spanners for Geometric Intersection Graphs
A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity
Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location
Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection
3-Coloring C 4 or C 3 -Free Diameter Two Graphs
Multiple Approximate String Matching
Improved Parallel Depth-First Search in Undirected Planar Graphs
Novel Complexity Results for Temporal Separators with Deadlines
Lossless Fault-Tolerant Data Structures with Additive Overhead
Resilient and Low Stretch Routing through Embedding into Tree Metrics
Computing Constrained Minimum-Width Annuli of Point Sets
Straight-Line Drawability of a Planar Graph Plus an Edge
Experiences with the Implementation of Geometric Algorithms (Abstract)
Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract)
On Geodesic Disks Enclosing Many Points
The Homogeneous Broadcast Problem in Narrow and Wide Strips
Fully Persistent Data Structures for Disjoint Set Union Problems
On the Complexity of Orthogonal Compaction
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
Online TSP with Known Locations
Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation
Tresholds for Sports Elimination Numbers Algorithms and Complexity
The MINSUMCUT Problem
On the Complexity of Graph Embeddings (Extended Abstract)
Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
Density Approximation for Moving Groups
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
Reverse Shortest Path Problem for Unit-Disk Graphs
On the Spanning and Routing Ratios of the Directed $\varTheta _6$-Graph
The Accommodating Function - A Generalization of the Competitive Ratio
Offline Algorithms for Dynamic Minimum Spanning Tree Problems
Non-Overlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles)
Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings
Unintuitive Facts About Distances on Planar Graphs (Invited Talk)
Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms
Scheduling on Identical Machines with Setup Time and Unknown Execution Time
New TSP Construction Heuristics and Their Relationships to the 2-Opt
Fast Meldable Priority Queues
Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract)
Parameterized Complexity of Geometric Covering Problems Having Conflicts
Searching in Dynamic Tree-Like Partial Orders
Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter Tractable
Connect the Dot: Computing Feed-Links with Minimum Dilation
Applied Computational Geormetry - Abstract
Characterization of Super-Stable Matchings
Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity
Counting Plane Graphs: Flippability and Its Applications
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
On Hamiltonian Triangulations in Simple Polygons (Extended Abstract)
Streaming Algorithms for 2-Coloring Uniform Hypergraphs
On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees
Approximation Algorithms for Selecting Network Centers (Preliminary Vesion)
On the Complexity of Minimising the Moving Distance for Dispersing Objects
Upward Embeddings and Orientations of Undirected Planar Graphs
Upper and Lower Bounds for Fully Retroactive Graph Problems
The One-Round Voronoi Game Replayed
Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version)
Relative Interval Analysis of Paging Algorithms on Access Graphs
Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers
Online Bin Covering with Advice
Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut
The Complexity of Drawing Graphs on Few Lines and Few Planes
Optimization over k-set Polytopes and Efficient k-set Enumeration
Two for One: Tight Approximation of 2D Bin Packing
Faster Algorithms for Minimum-Link Paths with Restricted Orientations
Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs
On the Enumeration of Signatures of XOR-CNF's
Positive-Instance Driven Dynamic Programming for Graph Searching
Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time
Short and Simple Labels for Small Distances and Other Functions
Constant Time Enumeration by Amortization
Avoidable Vertices and Edges in Graphs
Theory vs. Practice in the Design and Analysis of Algorithms
On the Zone of a Surface in a Hyperplane Arrangement
Inspecting a Set of Strips Optimally
Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem
On the Bounded-Hop Range Assignment Problem
Parametric Search and Locating Supply Centers in Trees
Derandomization of Dimensionality Reduction and SDP Based Algorithms
The Exhaustion of Shared Memory: Stochastic Results
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
Busy Time Scheduling on a Bounded Number of Machines (Extended Abstract)
Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs
Optimal Shuffle Code with Permutation Instructions
On Minimizing Wiggle in Stacked Area Charts
Digital Data Structures and Order Statistics
Register Loading via Linear Programming
Efficient Web Searching Using Temporal Factors
Common-Deadline Lazy Bureaucrat Scheduling Problems
The Complexity of Implicit and Space Efficient Priority Queues
Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems
Global Strategies for Augmenting the Efficiency of TSP Heuristics
Finding Small Holes
Multi-party Pseudo-Telepathy
A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations)
Binary Identification Problems for Weighted Trees
The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout
Fully Dynamic Clustering and Diversity Maximization in Doubling Metrics
Faster Optimal Algorithms for Segment Minimization with Small Maximal Value
Scheduling with Testing on Multiple Identical Parallel Machines
Smoothed Analysis (Motivation and Discrete Models)
Two-Floodlight Illumination of Convex Polygons
On Maximum Weight Objects Decomposable into Based Rectilinear Convex Objects
Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings
Geometric Searching and Link Distance (Extended Abstract)
Finding Level-Ancestors in Dynamic Trees
On the Complexity of an Unregulated Traffic Crossing
How to Draw a Clustered Tree
Time Responsive External Data Structures for Moving Points
Algorithms and Data Structures - 15th International Symposium, WADS 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
Dynamic Dictionary Matching in the Online Model
On Rectilinear Partitions with Minimum Stabbing Number
Towards a Better Understanding of the Pure Packet Routing
Probabilistic Analysis of Algorithms and Data Structures
Immobilizing a Polytope
Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters
Cropping-Resilient Segmented Multiple Watermarking
The Challenges of Delivering Content on the Internet
Fast Relative Approximation of Potential Fields
Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems
Efficient Nearest-Neighbor Query and Clustering of Planar Curves
Splaying Preorders and Postorders
Offset-Polygon Annulus Placement Problems
Planar Subgraphs without Low-Degree Nodes
Computing the Furthest Site Voronoi Diagram for a Set of Discs (Preliminary Report)
Connected Component and Simple Polygon Intersection Searching (Extended Abstract)
Finding the Minimum-Weight k-Path
Balanced Stable Marriage: How Close Is Close Enough?
Testing Whether a Subgraph Is Convex or Isometric
Routing and Call Control Algorithms for Ring Networks
Searching Edges in the Overlap of Two Plane Graphs
Stochastic Closest-Pair Problem and Most-Likely Nearest-Neighbor Search in Tree Spaces
Parameterized Complexity of Categorical Clustering with Size Constraints
Incomplete Directed Perfect Phylogeny in Linear Time