We consider questions that arise from the intersection between the areas of approximation
algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms. The …

We consider questions that arise from the intersection between the areas of polynomial-time
approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable …

We study the problem of deleting the smallest set S of vertices (resp. edges) from a given
graph G such that the induced subgraph (resp. subgraph) G\S belongs to some class ℋ. We …

We present a (1+ k k+ 2)-approximation algorithm for the Maximum k-dependent Set
problem on bipartite graphs for any k≥ 1. For a graph with n vertices and m edges, the …

A language L is random-self-reducible if deciding membership in L can be reduced (in
polynomial time) to deciding membership in L for uniformly random instances. It is known …

An improved algorithm for finding maximum outerplanar subgraphs - ScienceDirect Skip to
main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View …

We introduce the novel Nearest Pattern Constrained String (NPCS) problem of finding a
minimum set Q of character mutation, insertion, and deletion edit operations sufficient to …

The spreading of dangerous malware in inter-dependent networks of electronics devices
has raised deep concern, because from the ICT networks infections may propagate to other …

A critical resource in a distributed real-time system is its shared communication medium.
Unrestrained concurrent access to the network can lead to collisions that reduce the …

Cohesive subgraph search is a fundamental problem in bipartite graph analysis. Given
integers k and ℓ, a (k, ℓ)-biplex is a cohesive structure which requires each vertex to …