Linked e-resources
Details
Table of Contents
A note on handicap incomplete tournaments
Computing the k-Crossing Visibility Region of a Point in a Polygon
An Improved Scheme in the Two Query Adaptive Bitprobe Model
On Erdős-Szekeres-type problems for k-convex point sets
Algorithms and Hardness results on Liar's Dominating Set and k-tuple Dominating Set
Fixed-parameter tractability of (n-k) List Coloring
Finding Periods in Cartesian Tree Matching
Parameterized Complexity of Min-Power Asymmetric Connectivity
Solving Group Interval Scheduling Efficiently
Call Admission on Trees with Advice (Extended Abstract)
Power Edge Set and Zero Forcing Set remain difficult in cubic graphs
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs
Dual Domination
Reaching 3-Connectivity via Edge-edge Additions
Cops and robber on some families of oriented graphs
Disjoint clustering in combinatorial circuits
The hull number in the convexity of induced paths of order 3
Supermagic graphs with many odd degrees
Incremental algorithm for minimum cut and edge connectivity in Hypergraph
A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications
Shortest-Path-Preserving Rounding
Complexity and Algorithms for Semipaired Domination in Graphs
Computing the Rooted Triplet Distance between Phylogenetic Networks
Parameterized Algorithms for Graph Burning Problem
Extension and its price for the connected vertex cover problem
An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs
Complexity of fall coloring for restricted graph classes
Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling under Precedence Constraints
Maximum clique exhaustive search in circulant k-hypergraphs
Burrows-Wheeler transform of words defined by morphisms
Stable Noncrossing Matchings
On the Average Case of MergeInsertion
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings
A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber.
Computing the k-Crossing Visibility Region of a Point in a Polygon
An Improved Scheme in the Two Query Adaptive Bitprobe Model
On Erdős-Szekeres-type problems for k-convex point sets
Algorithms and Hardness results on Liar's Dominating Set and k-tuple Dominating Set
Fixed-parameter tractability of (n-k) List Coloring
Finding Periods in Cartesian Tree Matching
Parameterized Complexity of Min-Power Asymmetric Connectivity
Solving Group Interval Scheduling Efficiently
Call Admission on Trees with Advice (Extended Abstract)
Power Edge Set and Zero Forcing Set remain difficult in cubic graphs
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs
Dual Domination
Reaching 3-Connectivity via Edge-edge Additions
Cops and robber on some families of oriented graphs
Disjoint clustering in combinatorial circuits
The hull number in the convexity of induced paths of order 3
Supermagic graphs with many odd degrees
Incremental algorithm for minimum cut and edge connectivity in Hypergraph
A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications
Shortest-Path-Preserving Rounding
Complexity and Algorithms for Semipaired Domination in Graphs
Computing the Rooted Triplet Distance between Phylogenetic Networks
Parameterized Algorithms for Graph Burning Problem
Extension and its price for the connected vertex cover problem
An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs
Complexity of fall coloring for restricted graph classes
Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling under Precedence Constraints
Maximum clique exhaustive search in circulant k-hypergraphs
Burrows-Wheeler transform of words defined by morphisms
Stable Noncrossing Matchings
On the Average Case of MergeInsertion
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings
A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber.