Multivariate Complexity Analysis of Geometric RED BLUE SET COVER
We investigate the parameterized complexity of Generalized Red Blue Set Cover (...
Secluded Connectivity Problems
Consider a setting where possibly sensitive information sent over a path in a network...
When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots
A team of k mobile robots is deployed on a weighted graph whose edge weights represent...
Quantum Algorithm for Triangle Finding in Sparse Graphs
This paper presents a quantum algorithm for triangle finding over sparse graphs that...
String Powers in Trees
In this paper we consider substrings of an unrooted edge‐labeled tree, which...
On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems
In this paper, we study the approximability of the minimum rainbow subgraph (MRS)...
A VNS-LP algorithm for the robust dynamic maximal covering location problem
This study introduces a robust variant of the well‐known dynamic maximal...
Self-Bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications
A self‐bilinear map is a bilinear map where the domain and target groups are...
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer...
The Book Thickness of 1-Planar Graphs is Constant
In a book embedding, the vertices of a graph are placed on the ‘spine’ of...
Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs
Depth First Search (DFS) tree is a fundamental data structure for graphs used in...
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
We consider the problem of constructing optimal decision trees: given a collection of...
How to solve a design centering problem
This work considers the problem of design centering. Geometrically, this can be...
Dual parameterization and parameterized approximability of subset graph problems
Paschos Vangelis Th
We discuss approximability in FPT‐time for the class of subset optimization...
Quadratic stabilization of bilinear systems: Linear dynamical output feedback
We consider stabilization of bilinear control systems by means of linear output...
Diagnosis of multiprocessor systems under failure of more than half processors
The possibility of diagnosis of the multiprocessor systems under multiple, up to n...
Optimal placement of rectangles on a plane with fixed objects
Consider a region on a plane with a set of points with positive weights and rectangles...
Building a K-Pop knowledge graph using an entertainment ontology
Recently, the Korean popular (K‐Pop) music industry has grown into a popular...
Multi-depot rural postman problems
This paper studies multi‐depot rural postman problems on an undirected graph....
Locating a minisum annulus: a new partial coverage distance model
The problem is to find the best location in the plane of a minisum annulus with fixed...
Games with a permission structure - A survey on generalizations and applications
In the field of cooperative games with restricted cooperation, various restrictions on...
On Kernelization and Approximation for the Vector Connectivity Problem
In the Vector Connectivity problem we are given an undirected graph G = ( V , E ) , a...
Fixed-Parameter Tractable Distances to Sparse Graph Classes
We show that for various classes C of sparse graphs, and several measures of distance...
Linear Kernels for Outbranching Problems in Sparse Digraphs
In the k ‐ Leaf Out‐Branching and k ‐ Internal...
Papers per page: