yusuke1997/dblp-id-title huggingface dataset:
Asymptotic Lattice Path Enumeration Using Diagonals
A Faster Algorithm for Truth Discovery via Range Cover
Assigning Channels Via the Meet-in-the-Middle Approach
Lower Bounds for Maximal and Convex Layers Problems
Computing a Pessimistic Stackelberg Equilibrium with Multiple Followers: The Mixed-Pure Case
Improved Computation of Plane Steiner Minimal Trees
Reactive Local Search for the Maximum Clique Problem
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions
In Memoriam: Ingo Wegener
Graph Searching on Some Subclasses of Chordal Graphs
Algorithms for Data Migration
Planar Bus Graphs
A Constrained Edit Distance Between Unordered Labeled Trees
Derandomizing the HSSW Algorithm for 3-SAT
Average-Case Analysis of the Modified Harmonic Algorithm
Algorithms for Parallel Memory I: Two-Level Memories
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure
Tilt Assembly: Algorithms for Micro-factories That Build Objects with Uniform External Forces
Fractional Cascading: I. A Data Structuring Technique
A Full Sensing Window Random-Access Algorithm for Messages with Strict Delay Constraints
Improved Algorithms for Even Factors and Square-Free Simple b-Matchings
Understanding the Generalized Median Stable Matchings
Convex Hulls Under Uncertainty
Approximating the Canadian Traveller Problem with Online Randomization
An Algorithm for Geometric Minimum Spanning Trees Requiring Nearly Linear Expected Time
A Tight Lower Bound for Planar Steiner Orientation
Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools
Self-Adjusting Evolutionary Algorithms for Multimodal Optimization
Guest Editorial: Theory of Evolutionary Computation
Pure Nash Equilibria in Graphical Games and Treewidth
Schnyder Decompositions for Regular Plane Graphs and Application to Drawing
Parallel Algorithms for Some Functions of two Convex Polygons
Right-Triangulated Irregular Networks
A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs
Near-Linear Approximation Algorithms for Geometric Hitting Sets
Safety in s-t Paths, Trails and Walks
Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles
Dynamical Sources in Information Theory: A General Analysis of Trie Structures
Solving Problems with Unknown Solution Length at Almost No Extra Cost
Sum Coloring of Bipartite Graphs with Bounded Degree
Optimal Algorithms for Dissemination of Information in Some Interconnection Networks
Generating Cut Conjunctions in Graphs and Related Problems
The Complete Solution of the Competitive Rank Selection Problem
Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
Randomized Partition Trees for Nearest Neighbor Search
Constructing Labeling Schemes through Universal Matrices
Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas
A Series of Approximation Algorithms for the Acyclic Directed Steiner Tree Problem
On the Advantage of Overlapping Clusters for Minimizing Conductance
Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact Similarity Search in High Dimensions
Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial
Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations
Problems in Geometric Probing
Making Doubling Metrics Geodesic
Online Metric Tracking and Smoothing
Sieve Algorithms for Perfect Power Testing
A One-Step Crust and Skeleton Extraction Algorithm
Black-Box Search by Unbiased Variation
The Complexity of Parallel Multisearch on Coarse-Grained Machines
ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges
Asymptotics of Divide-and-Conquer Recurrences: Batcher's Sorting Algorithm and a Minimum Euclidean Matching Heuristic
LZ77 Computation Based on the Run-Length Encoded BWT
Metric Decompositions of Path-Separable Graphs
Online Randomized Multiprocessor Scheduling
Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons
Maintenance of a Piercing Set for Intervals with Applications
Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes
Correction to: Longest Common Substring with Approximately k Mismatches
2D Lyndon Words and Applications
Security of Practical Time-Reversed EPR Quantum Key Distribution
A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing
Full Characterization of a Class of Graphs Tailored for Software Watermarking
A Subquadratic Algorithm for Approximate Limited Expression Matching
Seven Fingers Allow Force-Torque Closure Grasps on Any Convex Polyhedron
Performance Analysis of the (1+1) Evolutionary Algorithm for the Multiprocessor Scheduling Problem
Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs
A Class of Random Recursive Tree Algorithms with Deletion
Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows
Stochastic Analysis of Shell Sort
Approximate Minimum Selection with Unreliable Comparisons
Fast Maximal Cliques Enumeration in Sparse Graphs
MMAS Versus Population-Based EA on a Family of Dynamic Fitness Functions
A Linear-Time Algorithm for Constructing a Circular Visibility Diagram
Special Issue Dedicated to 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022
Routing Flow Through a Strongly Connected Graph
An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems
Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items
Connectivity with Uncertainty Regions Given as Line Segments
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
Drawing Planar Graphs Using the Canonical Ordering
Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition
Optimal Self-Assembly of Finite Shapes at Temperature 1 in 3D
Incompressibility of H-Free Edge Modification Problems
Computing Minimal Unique Substrings for a Sliding Window
Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees
An Optimal Visibility Graph Algorithm for Triangulated Simple Polygons
Edge-Skeletons in Arrangements with Applications
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between
Construction of C-Space Roadmaps from Local Sensory Data. What Should the Sensors Look For?
Multi-budgeted Directed Cuts
Guest Editorial: Selected Papers from European Symposium on Algorithms
Quadratic Vertex Kernel for Rainbow Matching
Essentially Tight Kernels for (Weakly) Closed Graphs
Linear Time Algorithms for Generalizations of the Longest Common Substring Problem
Routing on Meshes with Buses
Minimum Weight Convex Steiner Partitions
The Sandwich Problem for Decompositions and Almost Monotone Properties
Approximating Shortest Paths on Weighted Polyhedral Surfaces
Improved Algorithms for Dynamic Shortest Paths
The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard
Shortest Paths for Line Segments
Knowledge State Algorithms
Algorithms for Maximum Independent Set in Convex Bipartite Graphs
Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences
Analytic Variations on the Airy Distribution
Minimum-Link Paths Among Obstacles in the Plan
A Distributed Ant Algorithm for Efficiently Patrolling a Network
Practical and Efficient Circle Graph Recognition
A New Scheme for the Deterministic Simulation of PRAMs in VLSI
Analysing the Robustness of Evolutionary Algorithms to Noise: Refined Runtime Bounds and an Example Where Noise is Beneficial
Analysis of the "Hiring Above the Median" Selection Strategy for the Hiring Problem
Mapping Filtering Streaming Applications
Multiple Filtration and Approximate Pattern Matching
Reporting Red - Blue Intersections between Two Sets of Connected Line Segments
A Refined Branching Algorithm for the Maximum Satisfiability Problem
Planning for Modular and Hybrid Fixture
Random 2-SAT with Prescribed Literal Degrees
Maximizing Throughput in Multi-Queue Switches
An Efficient Algorithm for Maxdominance, with Applications
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs
On Coloring Unit Disk Graphs
Improved Approximations for Tour and Tree Covers
On the Sum Coloring Problem on Interval Graphs
Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two
The Impact of a Sparse Migration Topology on the Runtime of Island Models in Dynamic Optimization
Efficient Bulk Operations on Dynamic R-Trees
Algorithms for k-Internal Out-Branching and k-Tree in Bounded Degree Graphs
Optimal Parallel Algorithms for Point-Set and Polygon Problems
The Higher-Order Voronoi Diagram of Line Segments
Key-Independent Optimality
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs
Efficient Algorithms for Computing a Complete Visibility Region in Three-Dimensional Space
Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization
An Improved (and Practical) Parameterized Algorithm for the Individual Haplotyping Problem MFR with Mate-Pairs
Emergency Connectivity in Ad-hoc Networks with Selfish Nodes
A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems
Accuracy vs. Lifetime: Linear Sketches for Aggregate Queries in Sensor Networks
Randomized Fixed-Parameter Algorithms for the Closest String Problem
Network Design under General Wireless Interference
Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints
On Heuristics for Minimum Length Rectilinear Partitions
Randomized Online Computation with High Probability Guarantees
Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains
Computing the Quartet Distance between Evolutionary Trees in Time O(n log n)
OVSF-CDMA Code Assignment in Wireless Ad Hoc Networks
The Representation of Numbers in Quantum Mechanics
Revenue and Reserve Prices in a Probabilistic Single Item Auction
Maximum Matching on Trees in the Online Preemptive and the Incremental Graph Models
Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient
New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees
Computational Geometry Algorithms for the Systolic Screen
Compositions into Powers of b: Asymptotic Enumeration and Parameters
Recognizing Hole-Free 4-Map Graphs in Cubic Time
Path Refinement in Weighted Regions
A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology
Non-Preemptive Tree Packing
External Memory Planar Point Location with Logarithmic Updates
Asymptotics of Largest Components in Combinatorial Structures
Rapid Homology Search with Neighbor Seeds
Edge-b-Coloring Trees
Finding the Consensus Shape for a Protein Family
Near-Optimal Search Time in δ-Optimal Space, and Vice Versa
Mapping Simple Polygons: How Robots Benefit from Looking Back
Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs
A Linear Algorithm for the Random Sampling from Regular Languages
Evolutionary Trees and Ordinal Assertions
On-Line Resource Management with Application to Routing and Scheduling
The Average Size of Giant Components between the Double-Jump
The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms
Rank Reduction of Oriented Graphs by Vertex and Edge Deletions
Improved Solution to Data Gathering with Mobile Mule
Algorithms for the Homogeneous Set Sandwich Problem
Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling
The Structure and Complexity of Sports Elimination Numbers
Proximity Problems for Points on a Rectilinear Plane with Rectangular Obstacles
Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming
Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges
Algorithms for the Compilation of Regular Expressions into PLAs
Tile Complexity of Approximate Squares
Improved Approximation Algorithms for Data Migration
On the Number of Eulerian Orientations of a Graph
Succinct Permutation Graphs
The Need for Seed (in the Abstract Tile Assembly Model)
Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem
Security of Quantum Key Distribution against All Collective Attacks
A General Model for Authenticated Data Structures
Vertex Cover Meets Scheduling
Programming Simultaneous Actions Using Common Knowledge
An Improved Parallel Algorithm for Integer GCD
Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities
Editor's Foreword Special Issue on Parallel Algorithms for Geometric Problems on Digitzed Pictures
The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon
Approximation Algorithms for the Interval Constrained Coloring Problem
Combinatorial Reallocation Mechanisms
Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n
Data Migration on Parallel Disks: Algorithms and Evaluation
Approximation Algorithms for Minimum K -Cut
Two-Dimensional Prefix String Matching and Covering on Square Matrices
The k-Splittable Flow Problem
Thresholds for Extreme Orientability
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths
A Linear Algorithm to Find a Rectangular Dual of a Planar Triangulated Graph
Combinatorial Auctions Without Money
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb {R}^2$
Bandwidth Packing
Optimal Algorithms for the Single and Multiple Vertex Updating Problems of a Minimum Spanning Tree
Asymptotic Analysis of q-Recursive Sequences
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups
Scheduling on Unrelated Machines under Tree-Like Precedence Constraints
On the Algebraic Formulation of Certain Geometry Statements and Mechanical Geometry Theorem Proving
Certification of Numerical Computation of the Sign of the Determinant of a Matrix
Remotely Prepared Entanglement: a Quantum Web Page
On Finding Optimal and Near-Optimal Lineal Spanning Trees
Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems
Computing Klee's Measure of Grounded Boxes
Cache-Oblivious R-Trees
Efficient Construction of a Bounded-Degree Spanner with Low Weight
Kinetic Facility Location
Output-Sensitive Reporting of Disjoint Paths
A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons
Average-Case Analysis of Algorithms - Preface
FFD Bin Packing for Item Sizes with Uniform Distributions on [0, 1/2]
Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests
The Parallel Complexity of Graph Canonization Under Abelian Group Action
Online Unweighted Knapsack Problem with Removal Cost
Random Parallel Algorithms for Finding Exact Branchings, Perfect Matchings, and Cycles
All-Pairs Shortest Paths and the Essential Subgraph
Evolutionary Algorithms and Matroid Optimization Problems
Complexity and Modeling Aspects of Mesh Refinement into Quadrilater
A Weight-Scaling Algorithm for f-Factors of Multigraphs
A Slightly Improved Sub-Cubic Algorithm for the All PairsShortest Paths Problem with Real Edge Lengths
Linear Probing and Graphs
Stagnation Detection in Highly Multimodal Fitness Landscapes
Seriation in the Presence of Errors: A Factor 16 Approximation Algorithm for l ∞ -Fitting Robinson Structures to Distances
Parameterized Complexity of Length-bounded Cuts and Multicuts
Efficiently Testing Sparse GF (2) Polynomials
An O ( n log n ) Average Time Algorithm for Computing the Shortest Network under a Given Topology
Fast Algorithms for Minimum Matrix Norm with Application in Computer Graphics
A q-Analogue of the Path Length of Binary Search Trees
Active-Learning a Convex Body in Low Dimensions
Parallel Construction of Binary Trees with Near Optimal Weighted Path Lengt
Editor's Note: Special Issue on GECCO 2023
Approximation Algorithms for Bounded Degree Phylogenetic Roots
Improved Subquadratic 3SUM
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP
An Optimal Algorithm for the Minimum Disc Cover Problem
PASS Approximation: A Framework for Analyzing and Designing Heuristics
Approximate Boyer-Moore String Matching for Small Alphabets
Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics
Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms
Escaping a Grid by Edge-Disjoint Paths
A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio
Analytic Combinatorics of Lattice Paths with Forbidden Patterns, the Vectorial Kernel Method, and Generating Functions for Pushdown Automata
Algorithms for Marketing-Mix Optimization
A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph
Algorithms for the On-Line Travelling Salesman
Ancient and New Algorithms for Load Balancing in the l p Norm
Crossing Numbers of Graphs with Rotation Systems
On-Line Dial-a-Ride Problems Under a Restricted Information Model
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks
Incremental Construction of Minimal Tree Automata
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs
The Set-Set LCS Problem
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
Optimal Parallel Detection of Squares in Strings
Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation
A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles
Algorithms for Counting Minimum-Perimeter Lattice Animals
Optimal Tree Constraction and Term Matching on the Hypercube and Related Networks
Embedding Linkages on an Integer Lattice
Paired-Domination Problem on Distance-Hereditary Graphs
Transactional Contention Management as a Non-Clairvoyant Scheduling Problem
Online Packet-Routing in Grids with Bounded Buffers
An Improved Deterministic #SAT Algorithm for Small de Morgan Formulas
On Polynomial Kernelization of H-free Edge Deletion
Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees
Continuous Alternation: The Complexity of Pursuit in Continuous Domains
The Expected Size of the Rule k Dominating Set
Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size
Online Stochastic Matching: New Algorithms and Bounds
A Simplified Õ ( nm ) Time Edge-Splitting Algorithm in Undirected Graphs
Editorial, COCOON 2007 Special Issue
An Algorithm for Minimum Cost Arc-Connectivity Orientations
AND-Compression of NP-Complete Problems: Streamlined Proof and Minor Observations
Graph Spanners in the Streaming Model: An Experimental Study
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set
Runtime Analysis of Competitive Co-evolutionary Algorithms for Maximin Optimisation of a Bilinear Function
Improved Approximation Algorithms for the Facility Location Problems with Linear/Submodular Penalties
The Complexity of the Empire Colouring Problem
Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs
Intersecting Longest Cycles in Archimedean Tilings
Parallel Geometric Algorithms on a Mesh-Connected Computer
FIST: Fast Industrial-Strength Triangulation of Polygons
Retiming Synchronous Circuitry
Solving String Problems on Graphs Using the Labeled Direct Product
Many-to-Many Communication in Radio Networks
On-Line Construction of Suffix Trees
Approximating Node Connectivity Problems via Set Covers
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
Succinct Indices for Path Minimum, with Applications
A Polynomial Newton Method for Linear Programming
Efficient Two-Stage Group Testing Algorithms for Genetic Screening
Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph
Average-Case Analysis of the Merging Algorithm of Hwang and Lin
Online and Offline Algorithms for the Time-Dependent TSP with Time Zones
On Incentive Compatible Competitive Selection Protocols
A Fast Algorithm for Computing Sparse Visibility Graphs
Analysis of Quickselect Under Yaroslavskiy's Dual-Pivoting Algorithm
A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
Counting Distinct Strings
Approximability of Clique Transversal in Perfect Graphs
Maximum Dispersion and Geometric Maximum Weight Cliques
Editor's Note: Special Issue Dedicated to the 14th Latin American Theoretical Informatics Symposium
On Minimum Witnesses for Boolean Matrix Multiplication
Memory-Efficient Matrix Multiplication in the BSP Model
Representations by Contact and Intersection of Segments
Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability
Analysis of Finite Length Annealing Schedules
Making Bidirected Graphs Strongly Connected
Point Placement Algorithms for Delaunay Triangulation of Polygonal Domains
On Selecting the k Largest with Median Tests
Deterministic Leader Election Takes Θ(D+log n) Bit Rounds
Improved Parallel Approximation of a Class of Integer Programming Problems
String Search in Coarse-Grained Parallel Computers
A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length
Optimal Book Embeddings of the FFT, Benes, and Barrel Shifter Networks
Direct Sum Fails for Zero-Error Average Communication
A Strongly Competitive Randomized Paging Algorithm
Drawing Partial 2-Trees with Few Slopes
Sublinear Algorithms in T-Interval Dynamic Networks
Lempel-Ziv-78 Compressed String Dictionaries
Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms
Large Deviations for the Weighted Height of an Extended Class of Trees
An Iterative Displacement Method for Conflict Resolution in Map Generalization
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem
Contribution Games in Networks
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
A Universal Randomized Packet Scheduling Algorithm
Finding the Closed Partition of a Planar Graph
A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length
Generation of Polynomial-Time Algorithms for Some Optimization Problems on Tree-Decomposable Graphs
Compressing Two-Dimensional Routing Tables
Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection
Strict Self-Assembly of Fractals Using Multiple Hands
Learning Poisson Binomial Distributions
Parallel Implementation of a Class of Adaptive Signal Processing Applications
Packing Random Intervals On-Line
Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders
Equivalence of Binary and Ternary Algebraic Decision Trees
Parallel Computational Geometry
Building Fences Straight and High: An Optimal Algorithm for Finding the Maximum Length You Can Cut k Times from Given Sticks
Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization
Erratum to: Editorial
Finding All Periods and Initial Palindromes of a String in Parallel
Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays
Stochastic Budget Optimization in Internet Advertising
Finding Dominating Induced Matchings in P 8 -Free Graphs in Polynomial Time
An Edit Distance between Quotiented Trees
A Linear Time Algorithm for L(2, 1)-Labeling of Trees
A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors
Solving Target Set Selection with Bounded Thresholds Faster than 2 n
An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs
Upper Domination: Towards a Dichotomy Through Boundary Properties
Data Structures for Computing Unique Palindromes in Static and Non-Static Strings
Nearly Constant Tile Complexity for any Shape in Two-Handed Tile Assembly
Topological Implications of Selfish Neighbor Selection in Unstructured Peer-to-Peer Networks