yusuke1997/dblp-id-title huggingface dataset:
Guest Editorial: Special Issue on Theoretical Informatics
Statistical Active Learning Algorithms for Noise Tolerance and Differential Privacy
Approximation Algorithms for the Directed k -Tour and k -Stroll Problems
Embedding Small Digraphs and Permutations in Binary Trees and Split Trees
Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation
Efficient Parallel Recognition of Some Circular Arc Graphs, II
On Boyer-Moore Automata
TSP Heuristics: Domination Analysis and Complexity
The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms
Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity
A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle
Algorithms for Dense Graphs and Networks on the Random Access Computer
Optimal Reconstruction of Graphs under the Additive Model
A Unified Framework for Designing EPTAS for Load Balancing on Parallel Machines
New Results on Path Approximation
Bounding the Inefficiency of Compromise in Opinion Formation
Online Square Packing with Gravity
Selected Papers of the 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021
Improved Sorting Networks with O(log N) Depth
Finding a Region with the Minimum Total L 1 Distance from Prescribed Terminals
Reductions Do Not Preserve Fast Convergence Rates in Average Time
Fair Allocation of Indivisible Items with Conflict Graphs
A Monotonic Projective Algorithm for Fractional Linear Programming
Efficient On-Line Nonparametric Kernel Density Estimation
Random Geometric Graph Diameter in the Unit Ball
Structural and Algorithmic Properties of 2-Community Structures
Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
Analytic Variations on Quadtrees
Strategyproof Facility Location for Concave Cost Functions
Online Multiset Submodular Cover
Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs
Algorithmic Aspects of Acyclic Edge Colorings
Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm
Small Strictly Convex Quadrilateral Meshes of Point Sets
On the Hitting Times of Quantum Versus Random Walks
A Permanent Algorithm with exp[Omega (n 1/3 /2 ln n )] Expected Speedup for 0-1 Matrices
Exact Algorithms for Linear Programming over Algebraic Extensions
Fast Algorithms for Approximating Distances
Semi-Group Range Sum Revisited: Query-Space Lower Bound Tightened
On Locally Decodable Codes, Self-Correctable Codes, and t -Private PIR
Collective Tree Spanners in Graphs with Bounded Parameters
Data Structures and Algorithms for the String Statistics Problem
Motorcycle Graphs and Straight Skeletons
A Generalization of a Lower Bound Technique due to Fredman and Saks
Cliques in Hyperbolic Random Graphs
On the Fundamental Limits of Topology Control in Ad Hoc Networks
Analysis of Randomized Protocols for Conflict-Free Distributed Access
A Flexible Way of Counting Large Numbers Approximately in Small Registers
Algorithms for Communication Scheduling in Data Gathering Network with Data Compression
Engineering Parallel String Sorting
Fixed-Target Runtime Analysis
A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs
On the Stability of Dynamic Diffusion Load Balancing
Testing the Supermodular-Cut Condition
An Algorithm for Segment-Dragging and Its Implementation
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks
Capabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-Assembly
Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center
Left and Right Pathlengths in Random Binary Trees
Shared Versus Private Randomness in Distributed Interactive Proofs
Fast Algorithms for the Density Finding Problem
Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases
Generating Rooted Triangulations Without Repetitions
Fast Mutation in Crossover-Based Algorithms
Probabilistic Analysis of a Grouping Algorithm
A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion
Evaluation of Circuits Over Nilpotent and Polycyclic Groups
Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles)
On Perturbation Resilience of Non-uniform k-Center
Comparison of Matrix Norm Sparsification
A Tight Runtime Analysis for the (μ + λ ) EA
Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications
Constructing the first (and coolest) fixed-content universal cycle
A Modification of Karmarkar's Linear Programming Algorithm
Forests, Frames, and Games: Algorithms for Matroid Sums and Applications
Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs
Locality-Preserving Hash Functions for General Purpose Parallel Computation
Reconstructing Surfaces and Functions on Surfaces from Unorganized Three-Dimensional Data
Computing Optimal Steiner Trees in Polynomial Space
How To Find Steiner Minimal Trees in Euclidean d-Space
A Note on Bounding k-Terminal Reliability
Improved Algorithms for Distributed Entropy Monitoring
Conflict-Free Chromatic Art Gallery Coverage
The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games
Solving MAX- r -SAT Above a Tight Lower Bound
On the Hardness of Approximating Spanners
A Better Performance Guarantee for Approximate Graph Coloring
Guest Editorial: Special Issue on Parameterized and Exact Computation
The Complexity of the Single Individual SNP Haplotyping Problem
Competitive Randomized Algorithms for Nonuniform Problems
Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra into Convex Pieces
Lower Bounds for Dynamic Data Structures on Algebraic RAMs
Improved Approximation Results for the Minimum Energy Broadcasting Problem
Campaign Management Under Approval-Driven Voting Rules
A Tight (3/2+ε )-Approximation for Skewed Strip Packing
Recognition Complexity of Subgraphs of bf k-Connected Planar Cubic Graphs
An FPT 2-Approximation for Tree-Cut Decomposition
Random Matrices and Codes for the Erasure Channel
Minimizing Energy Consumption for Real-Time Tasks on Heterogeneous Platforms Under Deadline and Reliability Constraints
Why Did the Shape of Your Network Change? (On Detecting Network Anomalies via Non-local Curvatures)
Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
Energy Constrained Depth First Search
Multiple Translational Containment. Part I: An Approximate Algorithm
Sorting Real Numbers in $O\big (n\sqrt{\log n}\big )$ Time and Linear Space
Space-Efficient Substring Occurrence Estimation
Linear-Time Algorithms for Partial k -Tree Complements
A Better Constant-Factor Approximation for Selected-Internal Steiner Minimum Tree
Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation
On the Information Ratio of Non-perfect Secret Sharing Schemes
Partitioning Circuits for Improved Testability
Bit Transposition for Very Large Scientific and Statistical Databases
Probabilistic Algorithms for Efficient Grasping and Fixturing
Generalised k-Steiner Tree Problems in Normed Planes
Canonical Representations for Circular-Arc Graphs Using Flip Sets
The Distance-Constrained Matroid Median Problem
Computing Unrestricted Synopses Under Maximum Error Bound
A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees
k -Nearest-Neighbor Clustering and Percolation Theory
List 3-Coloring Graphs with No Induced P 6+rP 3
Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items
Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization
Flexible Resource Allocation to Interval Jobs
Fast Stable In-Place Sorting with O (n) Data Moves
Editors Foreword to the Special Issue on Principles of Mobile Communications and Computing
Sharp Quantum versus Classical Query Complexity Separations
Lopsided Trees, I: Analyses
An O(n 1.5 ) Deterministic Gossiping Algorithm for Radio Networks
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution
Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints
An Algorithm for Enumerating All Spanning Trees of a Directed Graph
The Longest Common Subsequence Problem Revisited
New Results on Web Caching with Request Reordering
A Note on Parallel Selection on Coarse-Grained Multicomputers
Estimating the Makespan of the Two-Valued Restricted Assignment Problem
Gaussian Laws for the Main Parameters of the Euclid Algorithms
Finding Pathway Structures in Protein Interaction Networks
A Sublinear Algorithm for Approximate Keyword Searching
The Price of Optimum: Complexity and Approximation for a Matching Game
Parallel Approximation Algorithms by Positive Linear Programming
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles
Distributed Match-Making
The Steiner Ratio Conjecture of Gilbert-Pollak May Still Be Open
Optimization with Demand Oracles
Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem
Multilayer Grid Embeddings for VLSI
A Fast Bit-Parallel Algorithm for Computing the Subset Partial Order
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint
On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness
Minimize the Maximum Duty in Multi-interface Networks
Hexagonal Models for Channel Routing
Towards a Runtime Comparison of Natural and Artificial Evolution
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems
Global Wire Routing in Two-Dimensional Arrays
Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon
Optimal Read-Once Parallel Disk Scheduling
The Role of Arithmetic in Fast Parallel Matrix Inversion
Convergence to Equilibrium of Logit Dynamics for Strategic Games
Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins
Diameter and Treewidth in Minor-Closed Graph Families, Revisited
Black-Box Trace&Revoke Codes
An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem
Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem
Efficient Online String Matching Based on Characters Distance Text Sampling
Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three
Structural Results on Matching Estimation with Applications to Streaming
Characterizing and Recognizing the Visibility Graph of a Funnel-Shaped Polygon
A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties
Circular Separability of Polygons
Connected Component and Simple Polygon Intersection Searching
Evaluating Signs of Determinants Using Single-Precision Arithmetic
Introduction for S.I. AofA14
I/O-Efficient Algorithms for Graphs of Bounded Treewidth
Testing the Quality of Manufactured Disks and Balls
An Improved Upper Bound on the Queue Number of Planar Graphs
Computer Algebra Methods for Studying and Computing Molecular Conformations
Search Directions for Interior Linear-Programming Methods
Average-Case Analysis of Dynamic Graph Algorithms
Complexity Aspects of Guessing Prefix Codes
Improved Bounds for Electing a Leader in a Synchronous Ring
Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source
An O(n 4 ) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
Approximating Maximum Agreement Forest on Multiple Binary Trees
Algorithms for Computing the QR Decomposition of a Set of Matrices with Common Columns
Foreword: Special Issue on IPEC 2014
Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs
Fast Concurrent Access to Parallel Disks
Using Topological Sweep to Extract the Boundaries of Regions in Maps Represented by Region Quadtrees
A Tutorial for Designing Flexible Geometric Algorithms
Approximation Algorithms for Partitioning a Rectangle with Interior Points
Recovering the Original Simplicity: Succinct and Exact Quantum Algorithm for the Welded Tree Problem
Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation
Graph Decomposition for Memoryless Periodic Exploration
Crossing Number and Weighted Crossing Number of Near-Planar Graphs
Resequencing a Set of Strings Based on a Target String
Randomized Approximation for the Set Multicover Problem in Hypergraphs
The Parameterized Complexity of Unique Coverage and Its Variants
The Complexity of Two Colouring Games
A Note on Submodular Function Minimization with Covering Type Linear Constraints
Parallel Construction of a Suffix Tree with Applications
Competitive On-Line Switching Policies
On 3-Coloring of (2P 4, C 5 )-Free Graphs
Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input
The Interplay of Population Size and Mutation Probability in the (1+λ) EA on OneMax
Inapproximability Results for Guarding Polygons and Terrains
On the Efficiency of Maximum-Flow Algorithms on Networks with Small Integer Capacities
Optimal Tradeoffs for Addition on Systolic Arrays
Consistent Sets of Secondary Structures in Proteins
Largest and Smallest Convex Hulls for Imprecise Points
Inference Algorithms for Pattern-Based CRFs on Sequence Data
On the Height of Digital Trees and Related Problems
Reducing Graph Parameters by Contractions and Deletions
Subgraph Complementation
An Algorithm for Identifying Similar Amino Acid Clusters among Different Alpha-Helical Coiled-Coil Proteins Using Their Secondary Structure
Faster Algorithms for Stable Allocation Problems
Stretch and Diameter in Random Geometric Graphs
Approximate Pattern Matching with the L 1 , L 2 and L ∞ Metrics
Robot Motion Planning: A Game-Theoretic Foundation
One-Pass Additive-Error Subset Selection for ℓ p Subspace Approximation and (k, p)-Clustering
Approximation Algorithms for Access Network Design
Well Supported Approximate Equilibria in Bimatrix Games
Approximate k -Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing
On the Separation and Equivalence of Paging Strategies and Other Online Algorithms
Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees
A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
Preface to the Special Issue on Theory of Genetic and Evolutionary Computation
Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns
The Geometric Dilation of Finite Point Sets
Efficient Algorithms for Minimum-Cost Flow Problems with Piecewise-Linear Convex Costs
Randomization for Robot Tasks: Using Dynamic Programming in the Space of Knowledge States
A Theory of Rectangular Dual Graphs
The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees
Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs
On Bounded Leg Shortest Paths Problems
The Power of Priority Algorithms for Facility Location and Set Cover
LRU Is Better than FIFO
Editor's Note: Special Issue with GECCO 2021
Finding Largest Subtrees and Smallest Supertrees
Designing Checkers for Programs that Run in Parallel
Topological Numbering of Features on a Mesh
Regular Augmentation of Planar Graphs
Distribution-Free Connectivity Testing for Sparse Graphs
Performance Analysis of Some Simple Heuristics for Computing Longest Common Subsequences
Parity Conditions in Homotopic Knock-Knee Routing
A 1-Local Asymptotic 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs
Computing median and antimedian sets in median graphs
Parameterized Counting of Partially Injective Homomorphisms
An Asymptotic Analysis of Labeled and Unlabeled k-Trees
Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax
The k-Server Dual and Loose Competitiveness for Paging
Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms
An Adversarial Model for Scheduling with Testing
Multivariate Complexity Analysis of Geometric Red Blue Set Cover
Using Patterns to Form Homogeneous Teams
Approximability of the Firefighter Problem - Computing Cuts over Time
Approximate Generalized Matching: f-Matchings and f-Edge Covers
A Parallel Algorithm for Approximating the Minimum Cycle Cover
Comparison of Distance Measures for Planar Curves
Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation
Algorithms for a Class of Isotonic Regression Problems
Algorithms for Corner Stitched Data-Structures
A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory
Efficient Parallel Algorithms for Graph Problems
Temporary Tasks Assignment Resolved
A New Algorithm for the K DMDGP Subclass of Distance Geometry Problems with Exact Distances
Evolutionary Algorithms for Quantum Computers
Incentive Compatible Mulit-Unit Combinatorial Auctions: A Primal Dual Approach
Detecting Fixed Patterns in Chordal Graphs in Polynomial Time
Finding Effective "Force Targets" for Two-Dimensional Multifinger Frictional Grips
Maximum k-Covering of Weighted Transitive Graphs with Applications
Improved Approximation Algorithms for Projection Games
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness
A Reflective Symmetry Descriptor for 3D Models
Relative Convex Hulls in Semi-Dynamic Arrangements
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates
Stable Matching with Network Externalities
Approximating Dynamic Weighted Vertex Cover with Soft Capacities
Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem
Algorithms for Coloring Quadtrees
On The Closures of Monotone Algebraic Classes and Variants of the Determinant
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation
A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs
d -Dimensional Range Search on Multicomputers
Approximating Satisfiable Satisfiability Problems
A Time-Optimal Parallel Algorithm for Three-Dimensional Convex Hulls
The Farthest Color Voronoi Diagram in the Plane
Succinct 2D Dictionary Matching
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
Asymptotic Analysis of Regular Sequences
Minimum Cycle Bases for Network Graphs
Corrigendum: Static Frequency Assignment in Cellular Networks
The Hospitals/Residents Problem with Lower Quotas
Algorithms for P 4 -Comparability Graph Recognition and Acyclic P 4 -Transitive Orientation
Erratum to: Greedy Matching: Guarantees and Limitations
Automated Displacement for Large Numbers of Discrete Map Objects
On Steiner Minimal Trees with L_p Distance
A Geometric View of Parametric Linear Programming
Computing Minimum Cuts by Randomized Search Heuristics
List Covering of Regular Multigraphs with Semi-edges
A Simultaneous Search Problem
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems
A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization
A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons
An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics
Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
The Longest Path Problem has a Polynomial Solution on Interval Graphs
String Layouts for a Redundant Array of Inexpensive Disks
Editors' Note: ISAAC 2009 Special Section
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy
Single-Layer Cylindrical Compaction
Special Issue Dedicated to the 14th International Symposium on Parameterized and Exact Computation
Protein Communication System: Evolution and Genomic Structure
Optimal Program-Size Complexity for Self-Assembled Squares at Temperature 1 in 3D
k Best Cuts for Circular-Arc Graphs
A Paradigm for Robust Geometric Algorithms
The Quantum Black-Box Complexity of Majority
A Unified Approach to Conic Visibility
Explicit Linear Kernels for Packing Problems
A General Method for Estimating Correlated Aggregates Over a Data Stream
Approximate String Matching with Suffix Automata
On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems
The Optimal Control Approach to Generalized Multiprocessor Scheduling
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost
35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes
Asynchronous Distributed Termination-Parallel and Symmetric Solutions with Echo Algorithms
Two-stage Robust Network Design with Exponential Scenarios
Guest Editorial: Selected Papers from ISAAC 2011
An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem
Minimum-Cost b-Edge Dominating Sets on Trees
Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration
Trade-Offs in Dynamic Coloring for Bipartite and General Graphs
Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints
Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings
Quantum Algorithms for Weighing Matrices and Quadratic Residues
Memory Requirements for Table Computations in Partial k-Tree Algorithms
A General Bin Packing Game: Interest Taken into Account
Degree Constrained Node-Connectivity Problems
On the Largest Empty Axis-Parallel Box Amidst n Points
3SUM, 3XOR, Triangles
Preface Special Issue on Robotics
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems
A Randomized Sieving Algorithm for Approximate Integer Programming
Space-Efficient Estimation of Statistics Over Sub-Sampled Streams
Tiling a Polygon with Parallelograms
A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem
A Semi Brute-Force Search Approach for (Balanced) Clustering
The Relative Complexity of Approximate Counting Problems
On the Approximate Compressibility of Connected Vertex Cover
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms
Computing The Maximum Exponent in a Stream
Conflict-Free Coloring Bounds on Open Neighborhoods
A Network Game with Attackers and a Defender
Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix
A Linear-Time Algorithm for Finding an Ambitus
Matchings with Lower Quotas: Algorithms and Complexity
On Exact Quantum Query Complexity
A Cautious Scheduler for Multistep Transactions
Parallel Triangulation of a Polygon in Two Cails to the Trapezoidal Map
On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results
Wavelength Conversion in All-Optical Networks with Shortest-Path Routing
The Ordered Covering Problem
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
The Heaviest Induced Ancestors Problem: Better Data Structures and Applications
Rigid Components in Molecular Graphs
Computing the Intersection-Depth of Polyhedra
New Tools and Connections for Exponential-Time Approximation
Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays
Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective
Polynomial Cases for the Vertex Coloring Problem
The Steiner Ratio Gilbert-Pollak Conjecture Is Still Open - Clarification Statement
Note on the Structure of Kruskal's Algorithm
Continuous Lunches Are Free Plus the Design of Optimal Optimization Algorithms
Recognizing d-Interval Graphs and d-Track Interval Graphs
Isomorphic Tree Spanner Problems
Guest Editorial: Special Issue on Combinatorial Optimization and Applications
Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm