yusuke1997/dblp-id-title huggingface dataset:
A Faster Algorithm for Cuckoo Insertion and Bipartite Matching in Large Graphs
Generalization of EDF and LLF: Identifying All Optimal Online Algorithms for Minimizing Maximum Lateness
Correction to: Sorting Real Numbers in $O(n\sqrt{\log n})$ Time and Linear Space
Comparison-Based Buffer Management in QoS Switches
Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures
An Online Algorithm for the Dynamic Maximal Dense Tree Problem
A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings
The Uniform Memory Hierarchy Model of Computation
Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments
Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis
Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization
Sublinear Approximate String Matching and Biological Applications
Aligning Two Convex Figures to Minimize Area or Perimeter
Large Parallel Machines Can Be Extremely Slow for Small Problems
One-by-One Cleaning for Practical Parallel List Ranking
A New Algorithm for a Field Splitting Problem in Intensity-Modulated Radiation Therapy
Further Thoughts on the Syntenic Distance between Genomes
Assortment Planning with Nested Preferences: Dynamic Programming with Distributions as States?
Clocked Adversaries for Hashing
Necklaces, Convolutions, and X+Y
Stable Sets in {ISK4, wheel}-Free Graphs
Robustness of Populations in Stochastic Environments
On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
Two New Criteria for Finding Steiner Hulls in Steiner Tree Problems
Deterministic Parallel Algorithms for Bilinear Objective Functions
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm
The Derivation of On-Line Algorithms, with an Application To Finding Palindromes
Parallel Sorting on Cayley Graphs
Parameterized Multi-Scenario Single-Machine Scheduling Problems
Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs
Preface to the Special Issue on Parameterized and Exact Computation
Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic
Succinct Summing over Sliding Windows
The k-in-a-Path Problem for Claw-free Graphs
Online Constrained Forest and Prize-Collecting Network Design
Heuristics for Rapidly Four-Coloring Large Planar Graphs
An O(ND) Difference Algorithm and Its Variations
On the Cost of Fixed Partial Match Queries in K-d Trees
Coupled Path Planning, Region Optimization, and Applications in Intensity-modulated Radiation Therapy
A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm
The Implementation of Linear Programming Algorithms Bases on Homotopies
The Subfield and Extended Codes of a Subclass of Optimal Three-Weight Cyclic Codes
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
Dynamic Maintenance of Planar Digraphs, with Applications
Metastability of Logit Dynamics for Coordination Games
Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020
Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm
Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables
Succinct Dynamic Cardinal Trees
Parallel Searching in Generalized Monge Arrays
Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms
A. Metropolis-Type Optimization Algorithm on the Infinite Tree
Efficient Observer-Dependent Simplification in Polygonal Domains
Dynamic Expression Trees
Computational Complexity of Optimum Multiuser Detection
Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs
Two New Perspectives on Multi-Stage Group Testing
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications
Fast 3-coloring Triangle-Free Planar Graphs
Optimizing Responses to Broadcast Messages in Radio Networks
Minimizing alpha-Information for Generalization and Interpretation
An Approximation Algorithm and Dynamic Programming for Reduction in Heterogeneous Environments
NBmalloc: Allocating Memory in a Lock-Free Manner
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints
Independent Feedback Vertex Set for P 5 -Free Graphs
Efficient Orthogonal Drawings of High Degree Graphs
Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints
Secrecy, Computational Loads and Rates in Practical Quantum Cryptography
Size Versus Truthfulness in the House Allocation Problem
A 1.5-Approximation Algorithm for Two-Sided Scaffold Filling
Grade of Service Steiner Minimum Trees in the Euclidean Plane
Using Quadratic Programming to Solve High Multiplicity Scheduling Problems on Parallel Machines
An Algorithm for Constructing Gröbner Bases from Characteristic Sets and Its Application to Geometry
Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor
Complexity of Token Swapping and Its Variants
Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets
When Can Graph Hyperbolicity be Computed in Linear Time?
Optimal Static and Self-Adjusting Parameter Choices for the (1+(λ, λ)) Genetic Algorithm
Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem
An External-Memory Algorithm for String Graph Construction
An Optimal Approximation Algorithm for the Rectilinear m-Center Problem
Subgraphs of 4-Regular Planar Graphs
An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion
Recent Advances in Computation and Combinatorial Optimization
Dual-Based Approximation Algorithms for Cut-Based Network Connectivity Problems
On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures
Guest Editorial: Selected Papers of European Symposium of Algorithms
A Lower Bound on the Period Length of a Distributed Scheduler
Faster Approximate String Matching
Introduction: New Approaches to Linear Programming
L_1 Shortest Paths Among Polygonal Obstacles in the Plane
Identifying Shapes Using Self-assembly
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
On-Line Construction of Two-Dimensional Suffix Trees in O(n 2 log n) Time
Dynamic Detection of Subgraphs in Computer Networks
Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?
Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms
Decomposition and Intersection of Simple Splinegons
Computing Optimal Diameter-Bounded Polygon Partitions
Guest Editor's Foreword: Algorithms, Combinatorics, & Geometry
High-Dimensional Approximate r-Nets
Convergence of the Number of Period sets in Strings
Linear-Time Border-Tracing Algorithms for Quadtrees
Asymptotic Component Densities in Programmable Gate Arrays Realizing All Circuits of a Given Size
Combine and Conquer
Few Cuts Meet Many Point Sets
On the Probablistic Worst-Case Time of "Find"
Communication Complexity in a 3-Computer Model
On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem
On Two Techniques of Combining Branching and Treewidth
An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants
An [( O )\tilde]( m 2 n )\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs
Modifying a Graph Using Vertex Elimination
Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games
Graham's Problem on Shortest Networks for Points on a Circle
I/O-Efficient Well-Separated Pair Decomposition and Applications
The Dense k -Subgraph Problem
Spanning Trees in Multipartite Geometric Graphs
On Two Class-Constrained Versions of the Multiple Knapsack Problem
Maximum Independent Set when Excluding an Induced Minor: K 1 + tK 2 and $tC_3 \uplus C_4$
Special Issue on Computational Robotics: The Geometric Theory of Manipulation, Planning, and Control
Fast Algorithms to Enumerate All Common Intervals of Two Permutations
The Euclidean Bottleneck Full Steiner Tree Problem
A New Measure for the Study of On-Line Algorithms
Design and Performance of a Heterogeneous Grid Partitioner
Optimal Encodings for Range Majority Queries
Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm
A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior
New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction
An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication
Dynamic Path Queries in Linear Space
Reconstructing Phylogenetic Trees from Multipartite Quartet Systems
Computing H-Joins with Application to 2-Modular Decomposition
Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks
Testing Proximity to Subspaces: Approximate ℓ ∞ Minimization in Constant Time
Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario
Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time
On computing vertex connectivity of 1-planar graphs
On Sorting Triangles in a Delaunay Tessellation
Special Issue on Algorithms and Computation (ISAAC 2021)
Upper and Lower Bounds for Selection in the Mesh
Worst-Case Optimal Tree Layout in External Memory
General Lower Bounds and Improved Algorithms for Infinite-Domain CSPs
Editorial: COCOON 2012 Special Issue
Linear Recognition and Embedding of Fibonacci Cubes
Faster Parameterized Algorithms for Minimum Fill-in
Maximum Queue Size and Hashing with Lazy Deletion
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters
On Implementing the Push-Relabel Method for the Maximum Flow Problem
Sorting and Searching in Faulty Memories
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques
Definability Equals Recognizability of Partial 3-Trees and k-Connected Partial k-Trees
Algorithms for Multicommodity Flows in Planar Graphs
Tile-Packing Tomography Is NP-hard
Selfish Load Balancing and Atomic Congestion Games
Performing BMMC Permutations Efficiently on Distributed-Memory Multiprocessors with MPI
A $3+\varOmega (1)$ Lower Bound for Page Migration
Visualization of Three-Dimensional Delaunay Meshes
Online Clique Clustering
Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics
Non-Greedy Online Steiner Trees on Outerplanar Graphs
Hierarchical Sampling from Sketches: Estimating Functions over Data Streams
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
Populations Can Be Essential in Tracking Dynamic Optima
Oblivious Algorithms for the Maximum Directed Cut Problem
Fully Dynamic Geometric Spanners
Permutation Betting Markets: Singleton Betting with Extra Information
The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time
Small Vertex Cover makes Petri Net Coverability and Boundedness Easier
Models of Greedy Algorithms for Graph Problems
Searching Among Intervals and Compact Routing Tables
Erratum to: Foreword: Special Issue on IPEC 2014
Multicolorings of Series-Parallel Graphs
On Pattern Frequency Occurrences in a Markovian Sequence
A Study of Integrated Document and Connection Caching in the WWW
Better Alternatives to OSPF Routing
Stronger Lempel-Ziv Based Compressed Text Indexing
On the Convergence of Multicast Games in Directed Networks
Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme
Sublinear Merging and Natural Mergesort
Detecting Race Conditions in Parallel Programs that Use Semaphores
Distributed Deadlock Resolution in Store-and-Forward Networks
On Finding Min-Min Disjoint Paths
Almost Stable Matchings by Truncating the Gale-Shapley Algorithm
Approximation Algorithms for a Capacitated Network Design Problem
Editor's Note: Special Issue on Genetic and Evolutionary Computation
Robust Distance-Based Clustering with Applications to Spatial Data Mining
Hitting All Maximal Independent Sets of a Bipartite Graph
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
Parameterized Complexity of Small Weight Automorphisms and Isomorphisms
Optimal Algorithms for Adjacent Side Routing
Resilient Dynamic Programming
Minimean Optimal Key Arrangements in Hash Tables
Editor's Foreword: Special Issue on Parallel and Distributed Computing, Part II
Subcubic Cost Algorithms for the All Pairs Shortest Path Problem
Correction to: Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks
Provably Good Pattern Generators for a Random Pattern Test
Geographic Quorum System Approximations
Feasibility of Design in Stereolithography
Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable
An Exact Exponential Time Algorithm for Power Dominating Set
Greedy Δ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
An Improved Technique for Output-Sensitive Hidden Surface Removal
The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network
Tight Bounds for Sliding Bloom Filters
Structure and Recognition of Graphs with No 6-wheel Subdivision
Combinatorial Algorithms for the Unsplittable Flow Problem
Independent Sets and Hitting Sets of Bicolored Rectangular Families
Erratum to 'Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes'
Guest Editor's Introduction: Special Issue on Large-Scale Memories
Precision, Local Search and Unimodal Functions
Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs
Deleting Vertices to Graphs of Bounded Genus
Self-adjusting Population Sizes for Non-elitist Evolutionary Algorithms: Why Success Rates Matter
Drawings of Graphs on Surfaces with Few Crossings
Coloring Bridge-Free Antiprismatic Graphs
Communication-Efficient Parallel Algorithms for Distributed Random-Access Machines
Theoretical Foundation for CMA-ES from Information Geometry Perspective
On the Complexity of Strongly Connected Components in Directed Hypergraphs
Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n
New Approximation Results for the Maximum Scatter TSP
Universal Asymptotics for Random Tries and PATRICIA Trees
Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems
An Algorithmic Characterization of Polynomial Functions over Z p n
A Fixed-Parameter Approach to 2-Layer Planarization
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
A Branch-Checking Algorithm for All-Pairs Shortest Paths
From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction
Guest Editorial for Information Complexity and Applications
Constraint-Based Processing of Multiway Spatial Joins
Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring
Clamshell Casting
Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees
New Algorithms for Steiner Tree Reoptimization
Self-Adjusting Mutation Rates with Provably Optimal Success Rules
Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts
A Universal Online Caching Algorithm Based on Pattern Matching
Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour Classes
New Primal and Dual Matching Heuristics
Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series
New Linear-Time Algorithms for Edge-Coloring Planar Graphs
Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems
Partial Sorting Problem on Evolving Data
On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs
Finding and Counting Given Length Cycles
Correction to: Outer 1-Planar Graphs
An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function
The Monotone Circuit Complexity of Quadratic Boolean Functions
Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions
A Central Limit Theorem for Almost Local Additive Tree Functionals
A Local Limit Theorem in the Theory of Overpartitions
Exact Largest and Smallest Size of Components
Erratum: A Correction to "Parallel Approximation Algorithms by Positive Linear Programming"
The Complexity of Counting Eulerian Tours in 4-regular Graphs
Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability
Linear Size Binary Space Partitions for Uncluttered Scenes
Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs
A Long-Step Barrier Method for Convex Quadratic Programming
Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree
A Linear Time Randomizing Algorithm for Searching Ranked Functions
Inserting an Edge into a Planar Graph
Polynomial Kernelizations for MIN F+Π1 and MAX NP
Online Unit Profit Knapsack with Predictions
Orienting Polygonal Parts Without Sensors
Sorting by Swaps with Noisy Comparisons
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown
Proportionate Progress: A Notion of Fairness in Resource Allocation
Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals
On the Grundy and b -Chromatic Numbers of a Graph
Constrained Pseudorandom Functions for Turing Machines Revisited: How to Achieve Verifiability and Key Delegation
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm in Watson-Crick and Nussinov-Jacobson Energy Models
Compressed String Dictionary Search with Edit Distance One
Running Time Analysis of the ( $$1+1$$ 1 + 1 )-EA for OneMax and LeadingOnes Under Bit-Wise Noise
Efficient Collision Detection among Moving Spheres with Unknown Trajectories
The Longest Path Problem Is Polynomial on Cocomparability Graphs
Interval Partitions and Polynomial Factorization
Algorithms for Sensorless Manipulation Using a Vibrating Surface
Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities
Editor's Foreword: Special Issue on the Sixth Annual Symposium on Computational Geometry
Testing and Spot-Checking of Data Streams
Upward Drawings of Triconnected Digraphs
Computational Aspects of Ordered Integer Partitions with Bounds
Robustness of the Rotor-Router Mechanism
Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait?
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
Polynomial Treedepth Bounds in Linear Colorings
Constrained Multilinear Detection and Generalized Graph Motifs
Stochastic Variance Reduction for DR-Submodular Maximization
Ortho-polygon Visibility Representations of Embedded Graphs
Some Problems in Computational Geometry
Polynomial Time Algorithm for Min-Ranks of Graphs with Simple Tree Structures
Designing Networks with Compact Routing Tables
Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram
Fixed-Parameter Tractable Distances to Sparse Graph Classes
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees
Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems
Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover
Shape Algorithmics
A Faster Divide-and-Conquer Algorithm for Constructing Delaunay Triangulations
The Near Exact Bin Covering Problem
Counting Minimum Weight Arborescences
A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs
Dominating Induced Matchings for P 7-Free Graphs in Linear Time
Many Distances in Planar Graphs
Minimum Congestion Redundant Assignments to Tolerate Random Faults
Editorial, SWAT 2008 Special Issue
Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs
Building an Optimal Point-Location Structure in O( sort (n)) I/Os
Isotonic Regression via Partitioning
Improved Bounds for On-Line Load Balancing
On the Feasibility of Time Estimation under Isolation Conditions in Wireless Sensor Networks
Sweep Methods for Parallel Computational Geometry
Permutation-constrained Common String Partitions with Applications
A Preliminary Study of a Diagonal Channel-Routing Model
An Algorithm to Compute the Nucleolus of Shortest Path Games
Bounded Degree Interval Sandwich Problems
Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis
Efficient Parallel Recognition of Some Circular Arc Graphs, I
Extracting Maximal Information About Sets of Minimum Cuts
A Correction Algorithm for Token-Passing Sequences in Mobile Communication Networks
Analysis of the Strategy "Hiring Above the $$m$$ m -th Best Candidate"
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds
A Fast, Accurate, and Simple Method for Pricing European-Asian and Saving-Asian Options
Smallest Bipartite Bridge-Connectivity Augmentation
An Analysis of Budgeted Parallel Search on Conditional Galton-Watson Trees
Grasping and In-Hand Manipulation: Geometry and Algorithms
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems
Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint
Erratum to: Signature Theory in Holographic Algorithms
The Compact Genetic Algorithm Struggles on Cliff Functions
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
A Uniform Paradigm to Succinctly Encode Various Families of Trees
A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs
Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra
The Complex Parameter Landscape of the Compact Genetic Algorithm
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs
Contraction Bidimensionality of Geometric Intersection Graphs
Optimal Indexes for Sparse Bit Vectors
Minimizing Channel Density with Movable Terminals
Minimum Dominating Sets of Intervals on Lines
Dynamic Half-Space Range Reporting and Its Applications
The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms
Multikey Quickselect
Runtime Analysis for Permutation-based Evolutionary Algorithms
Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs
A Note on Multiflows and Treewidth
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth
Designing Secure Communication Protocols from Trust Specification
Algorithms for Parallel Memory II: Hierarchical Multilevel Memories
Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework
Classes of Cost Functions for String Edit Distance
Online Node- and Edge-Deletion Problems with Advice
Minimum k Arborescences with Bandwidth Constraints
Special Issue: European Symposium on Algorithms, Design and Analysis
Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints
Theory of Evolutionary Computation
A Linear-Time Algorithm for Linear L_1 Approximation of Points
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets
Deterministic Dynamic Matching in O(1) Update Time
Embedding of Cycles in Twisted Cubes with Edge-Pancyclic