yusuke1997/dblp-id-title huggingface dataset:
30th International Symposium on Algorithms and Computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8-11, 2019
Two Fixed-Parameter Algorithms for the Cocoloring Problem
Analysis of an Iterated Local Search Algorithm for Vertex Coloring
Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words
Self-Adjusting Augmented Search Trees
Inapproximability of Maximal Strip Recovery
Orthogonal Queries in Segments and Triangles
Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings
Approximation Algorithms for the Multi-Vehicle Scheduling Problem
Broadcasting in Heterogeneous Tree Networks with Uncertainty
Augmenting Forests to Meet Odd Diameter Requirements
Co-Clustering Under the Maximum Norm
A Multiway Merging Network
Complexity of the Min-Max (Regret) Versions of Cut Problems
Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible
Streaming Verification of Graph Properties
Origami Robots and Star Trek Replicators
Geometric TSP on Sets
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}
Stable Matching Problems
L infinity Voronoi Diagrams and Applications to VLSI Layout and Manufacturing
Energy-Efficient Wireless Network Design
K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
Implementing Algorithms and Data Structures: An Educational and Research Perspective
On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem
Regularization of Low Error PCPs and an Application to MCSP
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
Result-Sensitive Binary Search with Noisy Information
Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems
On Malign Input Distributions for Algorithms
Algorithmic Problems in Discrete Choice (Invited Talk)
Approximations for Throughput Maximization
Depth-First Search Using O(n) Bits
An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering
Efficiently Computing All Delaunay Triangles Occurring over All Contiguous Subsequences
Streaming Verification in Data Analysis
Speed-Scaling with No Preemptions
How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy
Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties
Interval Graph Representation with Given Interval and Intersection Lengths
Fast and Efficient Operations on Parallel Priority Queues
Complexity Study on Two Clustering Problems
Station Layouts in the Presence of Location Constraints
Efficiently Correcting Matrix Products
Algorithmic Folding Complexity
A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
Choice Is Hard
An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
Geometric Pattern Matching Reduces to k-SUM
Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms
A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem
Matching Cuts in Graphs of High Girth and H-Free Graphs
Grid Recognition: Classical and Parameterized Computational Perspectives
A 2or3-Approximation of the Matroid Matching Problem
finding Smallest Supertrees
Characterizing and Recognizing Visibility Graphs of Funnel-Shaped Polygons
A Convex Hull Algorithm on Coarse-Grained Multiprocessors
Precoloring Extension with Demands on Paths
A Randomized Algorithm to Finite Automata Public Key Cryptosystem
GCD of Random Linear Forms
Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems
On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?
On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
Bounds and Algorithms for a Practical Task Allocation Model (Extended Abstract)
On the Minimum Local-Vertex-Connectivity Augmentation in Graphs
Generalized Maximum Independent Sets for Trees in Subquadratic Time
A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem
Approximate Pattern Matching with Samples
Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP
Online Routing in Triangulations
An Improved O(1.234 m )-Time Deterministic Algorithm for SAT
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts
Randomized Wait-Free Naming
Provably Secure Steganography and the Complexity of Sampling
Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities
An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem
Rapid Mixing of Several Markov Chains for a Hard-Core Model
Determinantal Complexities and Field Extensions
Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings
Exploration of Periodically Varying Graphs
Cops and Robbers on Intersection Graphs
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
Hilbert's Thirteenth Problem and Circuit Complexity
On the Approximability of the Steiner Tree Problem in Phylogeny
External Memory Orthogonal Range Reporting with Fast Updates
Adaptive and Oblivious Algorithms for D-Cube Permutation Routing
Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings
On the Clique Problem in Intersection Graphs of Ellipses
Topologically Consistent Algorithms Realted to Convex Polyhedra
Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)
Two-Dimensional Dynamic Dictionary Matching
Drawing Phylogenetic Trees
Quality Tetrahedral Mesh Generation for Macromolecules
On Adaptive Fault Diagnosis for Multiprocessor Systems
Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift
Green Scheduling, Flows and Matchings
Priority Range Trees
A Simple, Fast, and Compact Static Dictionary
Almost Optimal Solutions for Bin Coloring Problems
Faster Existential FO Model Checking on Posets
Realizing Degree Sequences in Parallel
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions
Online Knapsack Problems with Limited Cuts
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems
Approximating the Traffic Grooming Problem
Algorithms for Enumerating Circuits in Matroids
Complexity of Distributions and Average-Case Hardness
A Framework for Network Reliability Problems on Graphs of Bounded Treewidth
Terrain Visibility with Multiple Viewpoints
Temporal Queries for Dynamic Temporal Forests
Wavelength Conversion in Shortest-Path All-Optical Networks
A Certifying Algorithm for 3-Colorability of P 5 -Free Graphs
Scheduling of Independent Dedicated Multiprocessor Tasks
Semi-normal Schedulings: Improvement on Goemans' Algorithm
Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups
Rotation Distance, Triangulations of Planar Surfaces and Hyperbolic Geometry
Optimal Line Bipartitions of Point Sets
Incidences Between Curves and Points on the Grid
Approximate Query Processing over Static Sets and Sliding Windows
Succinct Indexes for Circular Patterns
Single and Multiple Consecutive Permutation Motif Search
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
Faster Centralized Communication in Radio Networks
Quadtree Decomposition, Steiner Triangulation, and Ray Shooting
The Directed Hausdorff Distance between Imprecise Point Sets
On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems
On the Number of Edges of Fan-Crossing Free Graphs
The Impact of Geometry on Monochrome Regions in the Flip Schelling Process
The 2-Center Problem in a Simple Polygon
A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization
Diamond Triangulations Contain Spanners of Bounded Degree
Sliding Bloom Filters
An Introduction to Perpetual Gossiping
Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs
On the Optimality of Tape Merge of Two Lists with Similar Size
Pattern Masking for Dictionary Matching
Higher Order Communication Processes with Value-Passing, Assignment and Return of Results
Structural Alignment of Two RNA Sequences with Lagrangian Relaxation
Placing your Coins on a Shelf
The Distance 4-Sector of Two Points Is Unique
Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain
Parallel Algorithms for Single-Layer Channel Routing
Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces
Crossing Number for Graphs with Bounded~Pathwidth
Dispersing Points on Intervals
A Parameterized Study of Secluded Structures in Directed Graphs
Non-cooperative Facility Location and Covering Games
Range Updates and Range Sum Queries on Multidimensional Points with Monoid Weights
A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams
Computing Fair and Bottleneck Matchings in Geormetric Graphs
Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs
On Routing in VLSI Design and Communication Networks
Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings
Distributed Algorithms for Finding Small Cycle Covers in Arbitrary Networks
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving
An Efficient Method for Indexing All Topological Orders of a Directed Graph
Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph
An Improved Approximation Algorithm for the Traveling Tournament Problem
Generating Realistic Roofs over a Rectilinear Polygon
Are Fibonacci Heaps Optimal?
A Fast and Efficient Homophonic Coding Algorithm
Bounding the Payment of Approximate Truthful Mechanisms
Reporting and Counting Intersections of Lines within a Polygon
Exact Algorithms for Set Multicover and Multiset Multicover Problems
Pathfinding in Self-Deleting Graphs
Approximation Guarantees for Shortest Superstrings: Simpler and Better
Simultaneous Augmentation of Two Graphs to an l -Edge-Connected Graph and a Biconnected Graph
Fast and Simple Fully-Dynamic Cut Tree Construction
Diagnosis in the Presence of Intermittent Faults
Adaptive Spatial Partitioning for Multidimensional Data Streams
On a Non-cooperative Model for Wavelength Assignment in Multifiber Optical Networks
General Pseudo-random Generators from Weaker Models of Computation
Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
A Fast and Space - Economical Algorithm for Length - Limited Coding
Simple Combinatorial Gray Codes Constructed by Reversing Sublists
On the Complexity of Stable Fractional Hypergraph Matching
Constant Query Time (1+\epsilon ) -Approximate Distance Oracle for Planar Graphs
SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks
Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth
Optimal Composition Ordering Problems for Piecewise Linear Functions
Reaching a Goal with Directional Uncertainty
Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II
On Partitioning a Graph into Two Connected Subgraphs
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
Efficiently Reconfiguring a Connected Swarm of Labeled Robots
Minimization and Parameterized Variants of Vertex Partition Problems on Graphs
On Polynomial Time Constructions of Minimum Height Decision Tree
Efficient Algorithms for Generation of Combinatorial Covering Suites
Distance Queries over Dynamic Interval Graphs
Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization - (Extended Abstract)
Finding Long Paths, Cycles and Circuits
Average Case Analysis for Tree Labelling Schemes
New Results on Optimizing Rooted Triplets Consistency
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement
On Symmetry of Information and Polynomial Time Invertibility
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials
pi /2-Angle Yao Graphs Are Spanners
Competitive Call Control in Mobile Networks
Repetition- and Linearity-Aware Rank/Select Dictionaries
Optimal Key Tree Structure for Deleting Two or More Leaves
Local Cliques in ER-Perturbed Random Geometric Graphs
Γ-Graphic Delta-Matroids and Their Applications
Selecting Sums in Arrays
Pattern Matching for 321-Avoiding Permutations
Comparing First-Fit and Next-Fit for Online Edge Coloring
Approximate Range Searching in External Memory
Analysing Deletions in Competitive Self-Adjusting Linear List
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane
Hierarchy of Surface Models and Irreducible Triangulation
Three Sorting Algorithms Using Priority Queues
Enclosing Depth and Other Depth Measures
Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters
Generalized Function Matching
Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks
Maximum Weight Digital Regions Decomposable into Digital Star-Shaped Regions
Finding the Medial Axis of a Simple Polygon in Linear Time
Competitive Analysis of the Round Robin Algorithm
Finding Independent Spanning Trees in Partial k-Trees
Levelwise Mesh Sparsification for Shortest Path Queries
Improved Algorithms for Scheduling Unsplittable Flows on Paths
Gourds: A Sliding-Block Puzzle with Turning
Biased Skip Lists
Scheduling Interval Ordered Tasks with Non-Uniform Deadlines
A Unified Framework of FPT Approximation Algorithms for Clustering Problems
Periodic Merging Networks
Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
Network Load Games
Approximate Maximum Halfspace Discrepancy
Algorithms and Complexity for Tetrahedralization Detections
Algorithms for Range-Aggregate Query Problems Involving Geometric Aggregation Operations
New Approximate Distance Oracles and Their Applications
Simon's Congruence Pattern Matching
Arithmetic Expression Construction
Energy Efficient Deadline Scheduling in Two Processor Systems
On the Best Possible Competitive Ratio for Multislope Ski Rental
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits
On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts
Online paging for flash memory devices
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st -Digraphs
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Online Maximum Directed Cut
Reachability of Independent Sets and Vertex Covers Under Extended Reconfiguration Rules
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap
Maximizing Social Welfare Among EF1 Allocations at the Presence of Two Types of Agents
Airline Crew-Scheduling Problem with Many Irregular Flights
Algorithms for Landmark Hub Labeling
Complexity of Linear Operators
Cutting Out Polygons with Lines and Rays
Labeling Subway Lines
Searching a Simple Polygon by a k -Searcher
Polynomial Equivalence of Extended Chemical Reaction Models
Approximate Čech Complex in Low and High Dimensions
Approximation Algorithms for Facial Cycles in Planar Embeddings
Between Shapes, Using the Hausdorff Distance
External Memory Algorithms for Outerplanar Graphs
Impatient Online Matching
External-Memory Dictionaries with Worst-Case Update Cost
Average-Case Communication-Optimal Parallel Parenthesis Matching
New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs
Fence Patrolling by Mobile Agents with Distinct Speeds
The Densest Subgraph Problem with a Convex/Concave Size Function
Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width
A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags
Polynomial-Time Algorithm for Sliding Tokens on Trees
Building Clusters with Lower-Bounded Sizes
Approximation of Polygonal Curves with Minimum Number of Line Segments
On the Succinct Representation of Unlabeled Permutations
On the Approximation of Largest Common Subtrees and Largest Common Point Sets
Negation-Limited Complexity of Parity and Inverters
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate
Characterization of Rooms Searchable by Two Guards
New Inapproximability Bounds for TSP
Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles
Optimal Point Set Projections onto Regular Grids
3D Rectangulations and Geometric Matrix Multiplication
Fully Dynamic Betweenness Centrality
The Query Complexity of Program Checking by Constant-Depth Circuits
Optimal Routing of Permutations on Rings
Topology Oriented vs. Exact Arithmetic - Experience in Implementing the Three-Dimensional Convex Hull Algorithm
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Precision vs Confidence Tradeoffs for ℓ2-Based Frequency Estimation in Data Streams
Triangle Estimation Using Tripartite Independent Set Queries
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
A New Competitive Analysis of Randomized Caching
Finger Search in the Implicit Model
Key Independent Optimality
Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings
Space-Efficient Data-Analysis Queries on Grids
Algorithms and Complexity on Indexing Elastic Founder Graphs
A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs
Computing Vertex-Disjoint Paths in Large Graphs Using MAOs
Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite Graphs
Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions
Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm
Online Packet Admission and Oblivious Routing in Sensor Networks
Some Formal Analysis of Roccio's Similarity-Based Relvance Feedback Algorithm
Trajectory-Based Dynamic Map Labeling
A General Method for Improving Insertion-Based Adaptive Sorting
Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching
Revenue Maximization in a Bayesian Double Auction Market
Illuminating the x-Axis by α-Floodlights
On Min-Max Graph Balancing with Strict Negative Correlation Constraints
Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search
Linear Layouts in Submodular Systems
Recency Queries with Succinct Representation
Inner Rectangular Drawings of Plane Graphs
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs
Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem
Matchgate Signatures Under Variable Permutations
Pursuit Evasion on Polyhedral Surfaces
Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane
Derandomizing Arthur-Merlin Games under Uniform Assumptions
SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs
Sampling Unlabeled Biconnected Planar Graphs
Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
Sensor Network Gossiping or How to Break the Broadcast Lower Bound
Random Regular Graphs with Edge Faults: Expansion through Cores
Homophonic Coding with Logarithmic Memory Size
Alhorithms for a Class of Min-Cut and Max-Cut Problem
Dynamic Parameterized Problems on Unit Disk Graphs
Path Queries in Weighted Trees
A Combinatorial Algorithm for Horn Programs
The Complexity of Finding a Large Subgraph under Anonymity Constraints
Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii
Shortest Beer Path Queries Based on Graph Decomposition
I/O and Space-Efficient Path Traversal in Planar Graphs
On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree
Accurate MapReduce Algorithms for k-Median and k-Means in General Metric Spaces
Multiparty Selection
Memory Paging for Connectivity and Path Problems in Graphs
Constructing Degree-3 Spanners with Other Sparseness Properties
Finding Planar Geometric Automorphisms in Planar Graphs
Distributed and Robust Support Vector Machine
On the Range Maximum-Sum Segment Query Problem
Topological Peeling and Implementation
Parameterized Clique on Scale-Free Networks
Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem
Algorithms for Coloring Reconfiguration Under Recolorability Constraints
Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems
Cutting Out Polygons with a Circular Saw
Computing Best Swaps in Optimal Tree Spanners
Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings
Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs
Improved Collaborative Filtering
Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets
Colored Non-crossing Euclidean Steiner Forest
Going Beyond Traditional Characterizations in the Age of Big Data and Network Sciences (Invited Talk)
k-Universality of Regular Languages
Constructing Compressed Suffix Arrays with Large Alphabets
Geometric Streaming Algorithms with a Sorting Primitive
On the Complexity of Computing Prime Tables
The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings
An Efficient Parallel Strategy for Recognizing Series-Parallel Graphs
Algorithms for Rectilinear Optimal Multicast Tree Problem
Reconstructing Polygons from Scanner Data
Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers
The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
The Intractability of Computing the Hamming Distance
Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay
Compressing Spatio-temporal Trajectories
A New Algorithm for the Characteristic String Problem under Loose Similarity Criteria
Exact Algorithms for the Bottleneck Steiner Tree Problem
Approximate Shortest Distances Among Smooth Obstacles in 3D
Computing Orthogonal Drawings in a Variable Embedding Setting
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
On the Continuous CNN Problem
Augmenting the Edge-Connectivity of a Spider Tree
Uniformization of Discrete Data
The Discrepancy Method
Components and Projections of Curves over Finite Fields
Generalized Swap-with-Parent Schemes for Self-Organizing Sequential Linear Lists
New Results on the Most Significant Bit of Integer Multiplication
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance
On the Extended TSP Problem
A 21/16-Approximation for the Minimum 3-Path Partition Problem
Animal Testing
An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching
Approximating the Generalized Minimum Manhattan Network Problem
On Approximating the TSP with Intersecting Neighborhoods
On Efficient Weighted Rectangle Packing with Large Resources
Dynamic Conflict-Free Colorings in the Plane
A Dichotomy Result for Cyclic-Order Traversing Games
Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings
Weighted Treewidth Algorithmic Techniques and Results
How to Decompose a Graph into a Tree-Like Structure (Invited Talk)
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
Improved Approximation for Two-Dimensional Vector Multiple Knapsack