yusuke1997/dblp-id-title huggingface dataset:
Being Arranged in Advance - Quantum Entanglement and Biological Feedback
Causes vs Benefits in the Evolution of Prey Grouping
Building on Simplicity: Multi-stage Evolution of Digital Organisms
Robustness and evolvability of cooperation
Critical Mutation Rate has an Exponential Dependence on Population Size for Eukaryotic-Length Genomes
Is Evolution by Natural Selection the Algorithm of Biological Evolution?
Network Complexity of Foodwebs
Insect-Inspired Robot Coordination: Foraging and Coverage
The Relationship Between Evolvability and Robustness in the Evolution of Boolean Networks
Gilbert Simondon and the enactive conception of life and mind
Microarray of programmable electrochemically active elements
Entropy production in an energy balance Daisyworld model
How to know without having been there? - Investigating communication channels in the nectar collecting system of a honeybee colony
The Efficacy of Group Selection is Increased by Coexistence Dynamics within Groups
Group formation and social evolution - a computational model
Does Empowerment Maximisation Allow for Enactive Artificial Agents?
In silico evolution of chemotaxis
MultiAgent System Architecture in Orphibs II
Identifying Adaptations by Measuring the Trait Derivative of Fitness
Systems Biology Approaches for Developing Artificial Pathogen Detection Networks
Evolution-Inspired Approaches for Engineering Emergent Robustness in an Uncertain Dynamic World
Utility and experimental testability of the Gaia hypothesis
Effects of Temporal Locality of Ecological Processes on Coevolution of Learning and Niche Construction
Body/Brain Co-Evolution in Soft Robots
Evolutionary Potential is Maximized at Intermediate Diversity Levels
Body Representations for Robot Ego-Noise Modelling and Prediction. Towards the Development of a Sense of Agency in Artificial Agents
Complex Taxis-Behaviour in a Novel Bio-Inspired Robot Controller
Artificial Interaction between Two Isolated Micro-Algae Populations for Autonomous Pattern and Rhythm Formation
Modelling Stigmergic Gene Transfer
Developmental Models of Multicellular Organisms: A Computer Graphics Perspective
Reaction-diffusion spots as a model for autopoiesis
Robotic cell surface mechanics
Task Allocation in Foraging Robot Swarms: The Role of Information Sharing
Possible Role of Ice in the Synthesis of Polymeric Compounds
Coevolving parasites improve host evolutionary search on structured fitness landscapes
En Route to Signal Inversion in Chemical Computing
The EvoGrid - A Framework for Distributed Artificial Chemistry Cameo Simulations Supporting Computational Origins of Life Endeavors
An ecology-based evolutionary algorithm to evolve solutions to complex problems
Proceedings of the Thirteenth International Conference on the Simulation and Synthesis of Living Systems, ALIFE 2012, East Lansing, Michigan, USA, July 19-22, 2012
Feedback Control of Evolving Swarms
Abstract of: "On the Relationship between Generative Encodings, Regularity, and Learning Abilities when Evolving Plastic Artificial Networks"
Investigating Emergence by Coarse Graining Elementary Cellular Automata
Cellular Automata, Reaction-Diffusion Systems, and the Origin of Life
Optimal noise in spiking neural networks for the detection of chemicals by simulated agents
Partner Selection - Finding the Right Combination of Players
High-content Words in Patent Records Reflect Key Innovations in the Evolution of Technology
A Face-Encoding Grammar for the Generation of Tetrahedral-Mesh Soft Bodies
'In Vitro' and 'In Silico' Complementary Studies on the Physical Properties of Prebiotic Compartments
Spontaneous Assembly of Cell-Like Structures From Likely Prebiotic Materials - Problems and Prospects
Self-Assembly and Self-Construction
Programmable Architectures That Are Complex and Self-Organized - From Morphogenesis to Engineering
Dynamic Hotlinks
Routing with Delays when Storage is Costly
An Approach for Mixed Upward Planarization
Approximating the Discrete Center Line Segment in Linear Time
Graph Isomorphism for (H 1 , H 2 )-Free Graphs: An Almost Complete Dichotomy
Algorithms and Data Structures, 4th International Workshop, WADS '95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings
On Length-Sensitive Fréchet Similarity
Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time
Finding Optimal Bipartitions of Points and Polygons
Tight Approximation Algorithms for Ordered Covering
Shallow Interdistnace Selection and Interdistance Enumeration
Rank-Balanced Trees
Computing Proximity Drawings of Trees in the 3-Dimemsional Space
FRESH: Fréchet Similarity with Hashing
Fully Dynamic Delauney Triangulation in Logarithmic Expected Time per Operation
Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds
The Parameterized Landscape of Labeled Graph Contractions
A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs
Frequency Capping in Online Advertising
Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs
Dynamic TCP Acknowledgment with Sliding Window
Hardness of Graph-Structured Algebraic and Symbolic Problems
Algorithms for the Line-Constrained Disk Coverage and Related Problems
Approximation Algorithms for a Genetic Diagnostics Problem
Computing the Kernel of a Point Set in a Polygon (Extended Abstract)
How to Cover a Point Set with a V-Shape of Minimum Width
Toward Optimal Motif Enumeration
A Tight Bound for ß-SKeleton of Minimum Weight Triangulations
How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths
Minimal Locked Trees
Online Circle Packing
On Conflict-Free Multi-coloring
Tables Should Be Sorted (On Random Access Machines)
Quick Minimization of Tardy Processing Time on a Single Machine
Fast Algorithms for a Class of Temporal Range Queries
Dynamic Graph Clustering Using Minimum-Cut Trees
Constant Factor Approximations for the Hotlink Assignment Problem
MapReduce Algorithmics
Particle-Based Assembly Using Precise Global Control
Analysis of a Class of Tries with Adaptive Multi-digit Branching
Discrete Morse Theory for Computing Zigzag Persistence
Support Vector Machines in the Hilbert Geometry
Computing the Smallest k-Enclosing Circle and Related Problems
Semi-dynamic Connectivity in the Plane
Extremal Configurations and Levels in Pseudoline Arrangements
Flattening Fixed-Angle Chains Is Strongly NP-Hard
Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract)
Detecting Race Conditions in Parallel Programs that Use One Semaphore
Sweeping a Domain with Line-Of-Sight Between Covisible Agents
Hierarchies of Predominantly Connected Communities
A Dynamic Separator Algorithm
Maximizing Dominance in the Plane and Its Applications
Optimal Facility Location under Various Distance Functions
Maximum Plane Trees in Multipartite Geometric Graphs
Repetivive Hidden-Surface-Removal for Polyhedral Scenes
Link Diameter, Radius and 2-Point Link Distance Queries in Polygonal Domains
Rank-Select Indices Without Tears
Branch and Recharge: Exact Algorithms for Generalized Domination
Maximizing Maximal Angles for Plane Straight-Line Graphs
Flooding Countries and Destroying Dams
Dynamic Set Intersection
Convolution and Knapsack in Higher Dimensions
Cuttings for Disks and Axis-Aligned Rectangles
Fully Persistent Arrays (Extended Array)
Connecting a Set of Circles with Minimum Sum of Radii
Interval Selection with Machine-Dependent Intervals
Inducing the LCP-Array
Shortest Path Problems on a Polyhedral Surface
Optimal Parallel Algorithms for Finding Proximate Points, with Applications (Extended Abstract)
Drawing Colored Graphs on Colored Points
Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs (Extended Abstract)
Visual Ranking of Link Structures
Plane Graphs with Parity Constraints
Diverse Partitions of Colored Points
A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint
Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
Finding Cores of Limited Length
The Complexity of Tree Partitioning
The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure
Socially Stable Matchings in the Hospitals/Residents Problem
Contact Representations of Graphs in 3D
Approximate Shortest Paths Guided by a Small Index
Load Balanced Mapping of Data Structures in Parallel Memory Modules for Fast and Conflict-Free Templates Access
Reconfiguration of List Edge-Colorings in a Graph
Improving Partial Rebuilding by Using Simple Balance Criteria
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
Reachability Problems for Transmission Graphs
A Model for Analyzing Black-Box Optimization
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
Line Simplification with Restricted Orientations
When Can You Fold a Map?
On the Expected Diameter, Width, and Complexity of a Stochastic Convex-Hull
Graph Pricing with Limited Supply
Range Non-overlapping Indexing and Successive List Indexing
Algorithms and Data Structures - 17th International Symposium, WADS 2021, Virtual Event, August 9-11, 2021, Proceedings
The Multi-radius Cover Problem
Simple and Space-Efficient Minimal Perfect Hash Functions
Computing the Fréchet Distance between Folded Polygons
Capacitated Center Problems with Two-Sided Bounds and Outliers
Discs and Other Related Data Structures
Rank-Sensitive Priority Queues
Relaxed Balance through Standard Rotations
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version)
Secure Multi-party Computational Geometry
Online Bin Packing of Squares and Cubes
Fast and Compact Planar Embeddings
Finding Diameter-Reducing Shortcuts in Trees
Revisiting Graph Persistence for Updates and Efficiency
Indexing and Dictionary Matching with One Error
On the Computation of Fast Data Transmissions in Networks with Capacities and Delays
Topology B-Trees and Their Applications
Approximating Small Balanced Vertex Separators in Almost Linear Time
Lower Bounds for Non-adaptive Shortest Path Relaxation
The Grid Placement Problem
Online Bin Packing with Advice of Small Size
Compact Distance Oracles with Large Sensitivity and Low Stretch
ANN for Time Series Under the Fréchet Distance
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance
Dynamic Graph Coloring
Chips on Wafers
Motion Planning in the CL-Environment (Extended Abstract)
Dynamic Representation of Sparse Graphs
Weighted Throughput Maximization with Calibrations
A Fast Algorithm for Melding Splay Trees
Near-Optimal Pricing in Near-Linear Time
Approximating the Maximum Sharing Problem
On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow
The Distribution of Keys in a Binary Heap
Hinged Dissection of Polypolyhedra
Deterministic (2/3 - ε)-Approximation of Matroid Intersection Using Nearly-Linear Independence-Oracle Queries
What Can We Learn about Suffix Trees from Independent Tries?
Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles
An O(n log n) Algorithm for a Load Balancing Problem on Paths
A Linear-Time Algorithm for the 1-Mismatch Problem
Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes
Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space
A 2k-vertex Kernel for Maximum Internal Spanning Tree
Priority Queues Resilient to Memory Faults
Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
Dynamic Planar Point Location with Sub-logarithmic Local Updates
Efficient Second-Order Shape-Constrained Function Fitting
Real Two Dimensional Scaled Matching
The Mutual Visibility Problem for Fat Robots
Structured NC
A Fast Algorithm for Three-Dimensional Layers of Maxima Problem
A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs
Competitive Diffusion on Weighted Graphs
On Simultaneous Planar Graph Embeddings
Generation of Colourings and Distinguishing Colourings of Graphs
Multi-way Space Partitioning Trees
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version)
Combinatorial Pair Testing: Distinguishing Workers from Slackers
Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time
A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata
Approximating Nearest Neighbor Distances
Approximation Algorithms for the Sex-Equal Stable Marriage Problem
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions
Semi-matchings for Bipartite Graphs and Load Balancing
Partitioning Colored Point Sets into Monochromatic Parts
Positive Semidefinite Zero Forcing: Complexity and Lower Bounds
PTAS for Densest k-Subgraph in Interval Graphs
A Comparison of Performance Measures for Online Algorithms
A (5/3 + ε)-Approximation for Strip Packing
Panarity, Revisited (Extended Abstract)
Swapping Colored Tokens on Graphs
From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy
Covering Uncertain Points in a Tree
Guess Free Maximization of Submodular and Linear Sums
Cauchy's Theorem and Edge Lengths of Convex Polyhedra
Improved Bounds for Discrete Voronoi Games
Lower Bounds for Several Standard Bin Packing Algorithms in the Random Order Model
Counting and Reporting Red/Blue Segment Intersections
Faster Randomized Worst-Case Update Time for Dynamic Subgraph Connectivity
Succinct Data Structures for Families of Interval Graphs
Optimal Algorithms for the Weighted p -Center Problems on the Real Line for Small p
The Complexity of Dominating Set Reconfiguration
Computing the Fréchet Distance Between Uncertain Curves in One Dimension
A New Search Time Update Time Tradeoff for the Implicit Dictionary
Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons
The I/O Complexity of Strassen's Matrix Multiplication with Recomputation
On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version)
Online Makespan Minimization with Budgeted Uncertainty
Integer Programming: Optimization and Evaluation Are Equivalent
On Approximating the Longest Path in a Graph (Preliminary Version)
Optimal Algorithms for List Indexing and Subset Rank
A Generalization of Binary Search
Generating 3D Virtual Populations from Pictures of a Few Individuals
Computing Orthogonal Drawings with the Minimum Number of Bends
A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings
Strictly In-Place Algorithms for Permuting and Inverting Permutations
The Neighborhood Polynomial of Chordal Graphs
A QPTAS for Facility Location on Unit Disk Graphs
A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects
Improved Average Complexity for Comparison-Based Sorting
An Approximation Algorithm for Stacking up Bins from a Conveyor onto Pallets
Flow Computations on Imprecise Terrains
Dynamic Text and Static Pattern Matching
Horoball Hulls and Extents in Positive Definite Space
Algorithms and Models for Railway Optimization
Visibility-Based Pursuit-Evasion in a Polygonal Environment
Optimal Algorithms for Two-Guard Walkability of Simple Polygons
Convex Transversals
Approximation Algorithms for the Generalized Point-To-Point Problem
Repairing Schedules by Removing Waiting Times: A Parameterized Complexity Analysis
A Stab at Approximating Minimum Subadditive Join
A Distribution-Sensitive Dictionary with Low Space Overhead
Generalized Disk Graphs
Competitive Algorithms for the Weighted List Update Problem
Parameterized Enumeration of (Locally-) Optimal Aggregations
Intractability of Assembly Sequencing: Unit Disks in the Plane
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
New Directions and New Challenges in Algorithm Design and Complexity, Parameterized
Bandwidth-Constrained Allocation in Grid Computing
An Efficient All-Parses Systolic Algorithm for General Context-Free Parsing
Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets
Edges and Switches, Tunnels and Bridges
Better Space Bounds for Parameterized Range Majority and Minority
Algorithms and Data Structures, Workshop WADS '89, Ottawa, Canada, August 17-19, 1989, Proceedings
Optimizing Constrained Offset and Scaled Polygonal Annuli
A Case Study in Comparison Based Complexity: Finding the Nearest Value(s)
Closest Pair and the Post Office Problem for Stochastic Points
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
Drawing Graphs with Large Vertices and Thick Edges
Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent
Online Interval Scheduling with Predictions
Combinatorial and Computational Results for Line Arrangements in Space
An Optimal Algorithm for Finding the Separation of Simple Polygons
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms
Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length
Representing and Enumerating Edge Connectivity Cuts in RNC
Sorting and Selection with Equality Comparisons
Obedient Plane Drawings for Disk Intersection Graphs
Enumerating Minimal Subset Feedback Vertex Sets
k -Link Shortest Paths in Weighted Subdivisions
Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
Routing Few Robots in a Crowded Network
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon
Pattern Matching in Doubling Spaces
The K-D Heap: An Efficient Multi-dimensional Priority Queue
Faster Enumeration of All Spanning Trees of a Directed Graph
Online Priority Steiner Tree Problems
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS
Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees
On Geometric Path Query Problems
Fault Tolerant External Memory Algorithms
The Analysis of a Probabilistic Approach to Nearest Neighbor Searching
Self-Adjusting k-ary Search Trees
Stackelberg Packing Games
Beyond Triangulation: Covering Polygons with Triangles
The Stackelberg Minimum Spanning Tree Game
Differentially Private Range Query on Shortest Paths
Parameterized Complexity of Directed Feedback Set Problems in Tournaments
Optimization for First Order Delaunay Triangulations
A Centroid Labeling Technique and its Application to Path Selection in Trees (Extended Abstract)
Separating the Power of EREW and CREW PRAMs with Small Communication Width
Solving Problems on Graphs of High Rank-Width
Static and Dynamic Algorithms for k-Point Clustering Problems
19th International Symposium on Algorithms and Data Structures, WADS 2025, York University, Toronto, Canada, August 11-15, 2025
On Computing the Voronoi Diagram for Restricted Planar Figures
Heapsort - Adapted for Presorted Files
Shape Segmentation and Matching with Flow Discretization
Parameterized Complexity of Conflict-Free Graph Coloring
On-line Scheduling with Hard Deadlines (Extended Abstract)
In-Place Calculation of Minimum-Redundancy Codes
Select with Groups of 3 or 4
On Planar Straight-Line Dominance Drawings
Algorithms for Polytope Covering and Approximation
Planar Graph Augmentation Problems (Extended Abstract)
On Generalized Diamond Spanners
Parameterized Counting Algorithms for General Graph Covering Problems
Representing Trees of Higer Degree
Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract)
Applications of a New Space Partitioning Technique
Approximating the Online Set Multicover Problems via Randomized Winnowing
Posimodular Function Optimization
Fair Correlation Clustering with Global and Local Guarantees
A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space
Online Minimum Spanning Trees with Weight Predictions
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles
On the Power of the Semi-Separated Pair Decomposition
Algorithms and Data Structures - 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings
Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time
Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes
When Is Weighted Satisfiability FPT?
Finding All Shortest Path Edge Sequences on a Convex Polyhedron
Farthest-Point Voronoi Diagrams in the Hilbert Metric
Online Seat Reservations via Offine Seating Arrangements
Neighborhood-Preserving Mapping between Trees
Support Optimality and Adaptive Cuckoo Filters
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees
Geometric Spanning Trees Minimizing the Wiener Index
Streaming Algorithms for Conflict-Free Coloring
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
Approximating Shortest Superstrings with Constraints (Extended Abstract)
Efficient Spatial Point Location (Extended Abstract)
Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance
Dynamic Algorithms for the Dyck Languages
Geometric Computations on Indecisive Points
A New Approach for Contact Graph Representations and Its Applications
Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon
Lift-and-Project Methods for Set Cover and Knapsack
Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations
Grandchildren-Weight-Balanced Binary Search Trees
An ETH-Tight Algorithm for Bidirected Steiner Connectivity
Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other Applications
Upper Bounds for Maximally Greedy Binary Search Trees
Pattern Matching for Permutations
Rectilinear Static and Dynamic Discrete 2-center Problems
On Linear Time Minor Tests and Depth First Search
Constructing Pairwise Disjoint Paths with Few Links
Dynamically Maintaining the Visibility Graph
Dynamic Data Structures for Fat Objects and Their Applications
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems
Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
A WSPD, Separator and Small Tree Cover for c-Packed Graphs
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
External-Memory Sorting with Comparison Errors
Universal Point Sets for Planar Three-Trees
\delta -Greedy t-spanner
Smoothed Analysis of Local Search Algorithms
Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings
Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings
Observation Routes and External Watchman Routes
A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs
Tolerating Faults in Meshes and Other Networks (Abstract)
Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices
Sorting with Minimum Data Movement (Preliminary Draft)
The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case
Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric
Voronoi Diagrams for Moving Disks and Applications
Dynamic Streaming Algorithms for Geometric Independent Set
Constrained TSP and Low-Power Computing
Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions
A Linear-time Construction of the Relative Neighborhood Graph within a Histogram
Sorting Circular Permutations by Reversal.
How to Play Hot and Cold on a Line
Competitive Analysis of the LRFU Paging Algorithm
Streaming Embeddings with Slack
Routing on Trees via Matchings
Reconfiguration on Sparse Graphs
The On-line Asymmetric Traveling Salesman Problem
Orthogonal Subdivisions with Low Stabbing Numbers
On the Hausdorff Voronoi Diagram of Point Clusters in the Plane
Kernelization Algorithms for d-Hitting Set Problems
Alpha-Beta Witness Complexes
Resolving Loads with Positive Interior Stresses
Computing Common Tangents Without a Separating Line