yusuke1997/dblp-id-title huggingface dataset:
Two Arc Disjoint Paths in Eulerian Diagraphs
Max-Throughput for (Conservative) k-of-n Testing
Space Hardness of Solving Structured Linear Systems
Computing Optimal Shortcuts for Networks
Finitely Representables Spatial Objects and Efficient Computation
Piecewise-Linear Farthest-Site Voronoi Diagrams
Linear Transformations Between Dominating Sets in the TAR-Model
Enhancing Generalized Compressed Suffix Trees, with Applications
Less Space: Indexing for Queries with Wildcards
Compressibility Measures and Succinct Data Structures for Piecewise Linear Approximations
On the Fault Testing for Reversible Circuits
On a Generalization of Nemhauser and Trotter's Local Optimization Theorem
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
Connected Coordinated Motion Planning with Bounded Stretch
Computation of Cycle Bases in Surface Embedded Graphs
An 8/3 Lower Bound for Online Dynamic Bin Packing
Hamiltonian Abstract Voronoi Diagrams in Linear Time
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width
Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming
Efficient Interactive Proofs for Linear Algebra
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation
Relativizations of the P =?NP and other Problems: Some Developments in Structural Complexity Theory
Geometric Spanner of Segments
Generating Random Hyperbolic Graphs in Subquadratic Time
On Probabilistic ACC Circuits with an Exact-Threshold Output Gate
Size, Depth and Energy of Threshold Circuits Computing Parity Function
Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs
RAM-Efficient External Memory Sorting
k -Pairs Non-Crossing Shortest Paths in a Simple Polygon
Funnel Heap - A Cache Oblivious Priority Queue
Core Stability in Additively Separable Hedonic Games of Low Treewidth
Undecidability Results for Monoids with Linear-Time Decidable Word Problems
Area Bounds of Rectilinear Polygons Realized by Angle Sequences
An Efficient Sum Query Algorithm for Distance-based Locally Dominating Functions
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices
On Locating Disjoint Segments with Maximum Sum of Densities
The Complexity of Perfect Matching Problems on Dense Hypergraphs
Localized and Compact Data-Structure for Comparability Graphs
Tessellation of Quadratic Elements
On Approximate Range Mode and Range Selection
Multiprocess Time Queue
Space-Time Trade-Offs for the Shortest Unique Substring Problem
König Deletion Sets and Vertex Covers above the Matching Size
A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication
Number Theory Helps Line Detection in Digital Images
Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD
Approximating the Minimum Logarithmic Arrangement Problem
Shortest-Path Queries in Geometric Networks
Hierarchical Categories in Colored Searching
Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs
Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees,
On the Minimum Volume of a Perturbed Unit Cube
Explicit Array-Based Compact Data Structures for Triangulations
Online Packet Scheduling with Bounded Delay and Lookahead
Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings
Machine Covering in the Random-Order Model
Casting an Object with a Core
The Monomial Ideal Membership Problem and Polynomial Identity Testing
On the Hyperbolicity of Small-World and Tree-Like Random Graphs
Data-Compression for Parametrized Counting Problems on Sparse Graphs
On Symmetric Differences of NP-hard Sets with Weakly-P-Selective Sets
Approximation Algorithms in the Successive Hitting Set Model
A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph
A 1.75-Approximation Algorithm for Unsigned Translocation Distance
Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs
Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)
Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs
Algorithms and Computation, 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997, Proceedings
Generating All Invertible Matrices by Row Operations
Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors
Minimizing and Computing the Inverse Geodesic Length on Trees
Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees
Stabbing Pairwise Intersecting Disks by Five Points
Hardness and Approximation of Traffic Grooming
How to Select the Top k Elements from Evolving Data?
Optimal Randomized Algorithm for the Density Selection Problem
Suffix Vector: A Space-Efficient Suffix Tree Representation
On Counting Oracles for Path Problems
Improved Approximation for Single-Sink Buy-at-Bulk
The Steiner Minimal Tree Problem in the lambda-Geormetry Plane
Decomposing a Graph into Shortest Paths with Bounded Eccentricity
Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs
On the Complexity of Train Assignment Problems
All-Around Near-Optimal Solutions for the Online Bin Packing Problem
Top Tree Compression of Tries
Recursively Divisible Problems
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
The Cent-dian Path Problem on Tree Networks
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
Combinatorial Network Abstraction by Trees and Distances
Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings
Symmetric Layout of Disconnected Graphs
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
Contraction-Based Steiner Tree Approximations in Practice
Efficient Algorithms for Assigning Chain-Like Tasks on a Chain-Like Network Computer
Efficiently Realizing Interval Sequences
A Capacitated Vehicle Routing Problem on a Tree
28th International Symposium on Algorithms and Computation, ISAAC 2017, Phuket, Thailand, December 9-12, 2017
Adaptive Point Location in Planar Convex Subdivisions
Path and Ancestor Queries over Trees with Multidimensional Weight Vectors
Deterministic Algorithm for the t-Threshold Set Problem
Intuitive Algorithms and t-Vertex Cover
Improved Approximate String Matching Using Compressed Suffix Data Structures
Star-Based Separators for Intersection Graphs of c-Colored Pseudo-Segments
Dilation-Optimal Edge Deletion in Polygonal Cycles
Dynamic Interval Scheduling for Multiple Machines
The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem
Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs
Time Space Tradeoffs (Getting Closer to the Barrier?)
Tree Path Majority Data Structures
On the Geometric Dilation of Finite Point Sets
Peg-Solitaire, String Rewriting Systems and Finite Automata
Complexity of the Multi-Service Center Problem
Succinct Representations of Graphs (Invited Talk)
Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes
A Short Implicant of a CNF Formula with Many Satisfying Assignments
Optimal Construction of the City Voronoi Diagram
An Improved Interval Routing Scheme for Almost All Networks Based on Dominating Cliques
Quasi-optimal Arithmetic for Quaternion Polynomials
Carrying Umbrellas: An Online Relocation Problem on Graphs
Searching a Solid Pseudo 3-Sided Orthoconvex Grid
Minimizing a Monotone Concave Function with Laminar Covering Constraints
Optimal Linear Broadcast Routing with Capacity Limitations
Consecutive Interval Query and Dynamic Programming on Intervals
Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations
Approximating Multicast Congestion
Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity
Graph Spanners and Connectivity
An Improved Algorithm for Static 3D Dominance Reporting in the Pointer Machine
Improved Algorithms for the k Maximum-Sums Problems
Space-Efficient Informational Redundancy
Basis Sequence Reconfiguration in the Union of Matroids
Static Dictionaries Supporting Rank
Minimum Wavelength in an All-Optical Ring Network
Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest
Constructing Shortest Watchman Routes by Divide-and-Conquer
Connected Vertex Cover on AT-Free Graphs
A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
In-Place Algorithm for Image Rotation
On (1, epsilon)-Restricted Max-Min Fair Allocation Problem
The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract)
Approximation Algorithms for Some Clustering and Classification Problems
Fast Deterministic Hot-Potato Routing on Processor Arrays
Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds
A Simple Balanced Search Tree with O(1) Worst-Case Update Time
Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion
An Optimization Problem Related to VoD Broadcasting
Analyzing Disturbed Diffusion on Networks
Blocking Dominating Sets for H-Free Graphs via Edge Contractions
A Self-stabilizing and Local Delaunay Graph Construction
Efficient Prüfer-Like Coding and Counting Labelled Hypertrees
Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem
The Generalized Popular Condensation Problem
Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy
Segment Visibility Counting Queries in Polygons
Multi-Finger Binary Search Trees
Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions
Computational and Statistical Indistinguishabilities
Tree Decontamination with Temporary Immunity
FPT Approximations for Fair k-Min-Sum-Radii
Scheduling Algorithms for a Chain-like Task System
Finding Dense Subgraphs
Generalized Self-Approaching Curves
Untangling Circular Drawings: Algorithms and Complexity
Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy
An Approximation Algorithm for MAX 3-SAT
Optimal Point Movement for Covering Circular Regions
Robust Nonparametric Data Approximation of Point Sets via Data Reduction
Upper Bounds for MaxSat: Further Improved
Weighted Domination on Cocomparability Graphs
Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares
Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs
A 2-Approximation Algorithm for Path Coloring on Trees of Rings
The Probability of a Rendezvous is Minimal in Complete Graphs
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
Sliding Window Property Testing for Regular Languages
Representation of Graphs by OBDDs
Depth of Field and Cautious-Greedy Routing in Social Networks
Sparse Hop Spanners for Unit Disk Graphs
An Approximation Scheme for Some Steiner Tree Problems in the Plane
Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs
A Linear-Time Algorithm for Integral Multiterminal Flows in Trees
On-Line Windows Scheduling of Temporary Items
Labeling Points with Weights
Inducing Polygons of Line Arrangements
Reverse Center Location Problem
On the Advice Complexity of Buffer Management
Improved Guarantees for the a Priori TSP
Characterizing History Independent Data Structures
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs
Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography
Simple Order-Isomorphic Matching Index with Expected Compact Space
The k-Edge-Connectivity Augmentation Problem of Weighted Graphs
Graph Coloring Below Guarantees via Co-Triangle Packing
Unbounded-Error Quantum Query Complexity
A Min-Max Relation on Packing Feedback Vertex Sets
On-Line Load Balancing of Temporary Tasks Revisited
Packing Returning Secretaries
A Resource Assignment Problem on Graphs
Reconfiguration of List L(2, 1)-Labelings in a Graph
From Holant to #CSP and Back: Dichotomy for Holant c Problems
Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces
File Transfer Tree Problems
Minimum Partition of Polygons Under Width and Cut Constraints
Additive Approximation Algorithms for Modularity Maximization
Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs
The Phase Matrix
Edge-Coloring and f-Coloring for Various Classes of Graphs
On the Complexity of Network Synchronization
Flexible Word Design and Graph Labeling
Space Efficient Algorithms for Ordered Tree Comparison
Average-Case Complexity of the Min-Sum Matrix Product Problem
Heuristic Time Hierarchies via Hierarchies for Sampling Distributions
Dominance Product and High-Dimensional Closest Pair under L_infty
Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width
Two Notes on Low-Density Subset Sum Algorithms
Minimizing the Maximum Moving Cost of Interval Coverage
Capacitated Domination Problem
Fréchet Distance Problems in Weighted Regions
Constructing Labeling Schemes Through Universal Matrices
Popular Edges with Critical Nodes
Approximate Distance Oracles Revisited
Fast Evaluation of Union-Intersection Expressions
Optimal Triangulation with Steiner Points
On the Hardness and Easiness of Random 4-SAT Formulas
Dynamic Path Counting and Reporting in Linear Space
Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks
Unifying Themes for Network Selection
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
On Determining the Congruity of Point Sets in Higher Dimensions
Computing Upward Topological Book Embeddings of Upward Planar Digraphs
The Multi-Service Center Problem
Efficient Job Scheduling Algorithms with Multi-type Contentions
The Subset Assignment Problem for Data Placement in Caches
Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries
Indexing Isodirectional Pointer Sequences
Two New Families of List Update Algorithms
Temporal Separators with Deadlines
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity
Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs
Computing the Quartet Distance between Evolutionary Trees in Time O(n log 2 n)
Extensions of Self-Improving Sorters
Delaunay Meshing of Surfaces
Illumination with Orthogonal Floodlights
Routing Problems on the Mesh of Buses
On Labeled Traveling Salesman Problems
Embedding Graphs into Embedded Graphs
Opinion Forming in Erdös-Rényi Random Graph and Expanders
GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive Constraints
Separating Complexity Classes Related to Bounded Alternating omega-Branching Programs
Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems
Approximating Longest Spanning Tree with Neighborhoods
An Efficient Approximation Scheme for the Subset-Sum Problem
On Tractable Cases of Target Set Selection
Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract)
Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise
Quantum Query Complexity of Boolean Functions with Small On-Sets
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
A Geometric Approach to Graph Isomorphism
Smart Contract Execution - the (+-)-Biased Ballot Problem
Subquadratic Weighted Matroid Intersection Under Rank Oracles
A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules
Approximation and Special Cases of Common Subtrees and Editing Distance
The Online Broadcast Range-Assignment Problem
On Maximizing Sums of Non-Monotone Submodular and Linear Functions
A Study of the LMT-Skeleton
Sorting with Recurrent Comparison Errors
Dense Subgraph Problems with Output-Density Conditions
Shortcuts for the Circle
The Price of Nash Equilibria in Multicast Transmissions Games
Kernels for Deletion to Classes of Acyclic Digraphs
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size
Phylogenetic k -Root and Steiner k -Root
Toehold DNA Languages are Regular
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem
Approximation and Hardness Results for the Maximum Edge q -coloring Problem
On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks
Exact Matching: Correct Parity and FPT Parameterized by Independence Number
Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact Space
Stabilization Time in Minority Processes
Convexifying Monotone Polygons
Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome
One-Face Shortest Disjoint Paths with a Deviation Terminal
Computing Knapsack Solutions with Cardinality Robustness
Minimum Edge Ranking Spanning Trees of Threshold Graphs
Deterministic w Automata vis-a-vis Deterministic Buchi Automata
An Improved Algorithm for the Traveler's Problem
Greedy Construction of 2-Approximation Minimum Manhattan Network
A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem
Applications of a Numbering Scheme for Polygonal Obstacles in the Plane
Selected Neighbor Degree Forest Realization
Three-Round Adaptive Diagnosis in Binary n-Cubes
From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges
Range Queries on Uncertain Data
Fast Fréchet Queries
Fast Adaptive Diagnosis with a Minimum Number of Tests
Online Multi-path Routing in a Maze
The VC-Dimension of Visibility on the Boundary of a Simple Polygon
Algorithms for Tolerated Tverberg Partitions
Linear-time In-place Selection in Less than 3n Comparisons
Linear Time Algorithms for k-cutwidth Problem
Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics
Computing with Priced Information: When the Value Makes the Price
Input-Thrifty Extrema Testing
Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O ( n 1 + ε ) Time
Optimality and Integer Programming Formulations of Triangulations in General Dimension
Evacuation from a Disk for Robots with Asymmetric Communication
Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings
Dynamic Tree Routing under the "Matching with Consumption" Model
Heaps with Bits
Algorithm Engineering for Route Planning - An Update -
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
Max-Coloring Paths: Tight Bounds and Extensions
Step-Assembly with a Constant Number of Tile Types
Lower Bounds for Induced Cycle Detection in Distributed Computing
Heap Construction: Optimal in Both Worst and Average Cases?
On Higher Order Voronoi Diagrams of Line Segments
A Spectral Method for MAX2SAT in the Planted Solution Model
Revisiting T. Uno and M. Yagiura's Algorithm
Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition
NC Algorithms for Partitioning Sparse Graphs into Induced Forests with an Application
A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks
Small Space Encoding and Recognition of k-Palindromic Prefixes
Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability
On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time
Shortest Paths and Voronoi Diagrams with Transportation Networks Under General Distances
More on a Problem of Zarankiewicz
Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings
On the Complexity of the Eigenvalue Deletion Problem
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond
Augmenting Graphs to Minimize the Radius
Minimum-Width Double-Strip and Parallelogram Annulus
Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching
Computing k-center over Streaming Data for Small k
A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths
Asynchronous Random Polling Dynamic Load Balancing
Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm
A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling
Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections
Disjunctions of Horn Theories and Their Cores
Geometric Minimum Diameter Minimum Cost Spanning Tree Problem
A Simple Test for the Consecutive Ones Property
Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels
Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?
Speeding Up Shortest Path Algorithms
Analysis of the Convergency of Topology Preserving Neural Networks on Learning
StUSPACE(log n) <= DSPACE(log²n / log log n)
Does Subset Sum Admit Short Proofs?
Manipulation in Games
Distributed Scheduling of Parallel Hybrid Computations
External Data Structures for Shortest Path Queries on Planar Digraphs
Graph Orientation and Flows over Time
On the Multiple Gene Duplication Problem
Multiple Polyline to Polygon Matching
Testing the Quality of Manufactured Disks and Cylinders
Parameterized Complexity: The Main Ideas and Some Research Frontiers
Finding Temporal Paths Under Waiting Time Constraints
The Maximum k-Dependent and f-Dependent Set Problem
Dimension-Exchange Token Distribution on the Mesh and the Torus
On Steiner Minimal Trees in Grid Graphs and Its Application to VLSI Routing
Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items
Simulating Undirected st -Connectivity Algorithms on Uniform JAGs and NNJAGs
Resource Bounded Randomness and Weakly Complete Problems
Computing Paths of Large Rank in Planar Frameworks Deterministically
Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFA
On the Complexity of Lattice Puzzles
Oriented Paths in Mixed Graphs
A Refined Definition for Groups of Moving Entities and its Computation
Contracting to a Longest Path in H-Free Graphs
Ham-Sandwich Cuts for Abstract Order Types
Weighted Irredundance of Interval Graphs
Deductive Inference for the Interiors and Exteriors of Horn Theories
Lower Bounds on Retroactive Data Structures
Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number
Recent Developments on the Approximability of Combinatorial Problems
Casting with Skewed Ejection Direction
Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons
Competitive Searching for a Line on a Line Arrangement
A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
On the Size of Probabilistic Formulae
Optimal Paths for Mutually Visible Agents
Approximating Points by a Piecewise Linear Function: I
Circle-Segment Intersection Queries in Connected Geometric Graphs
A Tight Bound on the Number of Mobile Servers to Guarantee the Mutual Transferability Among Dominating Configurations
Double-Ended Binomial Queues
On Geometric Priority Set Cover Problems
On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs
A Tighter Analysis of Work Stealing
Sorting and/by Merging Finger Trees
An Optimal Algorithm for On-Line Palletizing at Delivery Industry
Strong Conflict-Free Coloring for Intervals
An Adaptive Distributed Fault-Tolerant Routing Algorithm for the Star Graph
Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach
Independent Sets of Maximum Weight in Apple-Free Graphs
Honest Iteration Schemes of Randomizing Algorithms
On the Intersection of Tolerance and Cocomparability Graphs
Kernelization Complexity of Solution Discovery Problems