Linked e-resources
Details
Table of Contents
Distance from Triviality 2.0: Hybrid Parameterizations
Graphs as Algorithms: Characterizing Motion-Planning Gadgets through Simulation and Complexity
On the Existence of EFX Allocations
Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model
Perfect Matchings with Crossings
Graph parameters, implicit representations and factorial properties
Approximating Subset Sum Ratio via Subset Sum Computations
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings
Lower bounds on the performance of online algorithms for relaxed packing problems
An Adjacency Labeling Scheme Based On A Decomposition Of Trees Into Caterpillars
Computing Longest (Common) Lyndon Subsequence
Structure-aware combinatorial group testing: a new method for pandemic screening
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution
1-Extendability of independent sets
Tukey Depth Histograms
An Efficient Algorithm for the Proximity Connected Two Center Problem
A New Temporal Interpretation of Cluster Editing
List covering of regular multigraphs
The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs
Perfect matching cuts partitioning a graph into complementary subgraphs
On the Intractability Landscape of Digraph Intersection Representations
The Red-Blue Separation problem on graphs
Harmless Sets in Sparse Classes
The Parameterized Complexity of s-Club with Triangle and Seed Constraints
Space-Efficient B Trees via Load-Balancing
An Additive Approximation Scheme for the Nash Social Welfare Maximization with Identical Additive Valuations
Controlling Weighted Voting Games by Deleting or Adding Players with or without Changing the Quota
Practical Space-Efficient Index for Structural Pattern Matching
A Shift Gray Code for Fixed-Content Lukasiewicz Words
Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms
Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings
On relative clique number of triangle-free planar colored mixed graphs.
Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Linear Time Construction of Indexable Elastic Founder Graphs
On Critical Node Problems with Vulnerable Vertices
Winner Determination Algorithms for Graph Games with Matching Structures.
Graphs as Algorithms: Characterizing Motion-Planning Gadgets through Simulation and Complexity
On the Existence of EFX Allocations
Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model
Perfect Matchings with Crossings
Graph parameters, implicit representations and factorial properties
Approximating Subset Sum Ratio via Subset Sum Computations
Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings
Lower bounds on the performance of online algorithms for relaxed packing problems
An Adjacency Labeling Scheme Based On A Decomposition Of Trees Into Caterpillars
Computing Longest (Common) Lyndon Subsequence
Structure-aware combinatorial group testing: a new method for pandemic screening
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution
1-Extendability of independent sets
Tukey Depth Histograms
An Efficient Algorithm for the Proximity Connected Two Center Problem
A New Temporal Interpretation of Cluster Editing
List covering of regular multigraphs
The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs
Perfect matching cuts partitioning a graph into complementary subgraphs
On the Intractability Landscape of Digraph Intersection Representations
The Red-Blue Separation problem on graphs
Harmless Sets in Sparse Classes
The Parameterized Complexity of s-Club with Triangle and Seed Constraints
Space-Efficient B Trees via Load-Balancing
An Additive Approximation Scheme for the Nash Social Welfare Maximization with Identical Additive Valuations
Controlling Weighted Voting Games by Deleting or Adding Players with or without Changing the Quota
Practical Space-Efficient Index for Structural Pattern Matching
A Shift Gray Code for Fixed-Content Lukasiewicz Words
Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms
Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number
Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings
On relative clique number of triangle-free planar colored mixed graphs.
Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Linear Time Construction of Indexable Elastic Founder Graphs
On Critical Node Problems with Vulnerable Vertices
Winner Determination Algorithms for Graph Games with Matching Structures.