A survey of the algorithmic aspects of modular decomposition
Modular decomposition is a technique that applies to (but is not restricted to) graphs. The
notion of a module naturally appears in the proofs of many graph theoretical theorems …
notion of a module naturally appears in the proofs of many graph theoretical theorems …
Parameterized algorithms for modular-width
It is known that a number of natural graph problems which are FPT parameterized by
treewidth become W-hard when parameterized by clique-width. It is therefore desirable to …
treewidth become W-hard when parameterized by clique-width. It is therefore desirable to …
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
Recently, hardness results for problems in P were achieved using reasonable complexity-
theoretic assumptions such as the Strong Exponential Time Hypothesis. According to these …
theoretic assumptions such as the Strong Exponential Time Hypothesis. According to these …
On the enumeration of minimal dominating sets and related notions
A dominating set D in a graph is a subset of its vertex set such that each vertex is either in D
or has a neighbor in D. In this paper, we are interested in the enumeration of (inclusionwise) …
or has a neighbor in D. In this paper, we are interested in the enumeration of (inclusionwise) …
A near-optimal planarization algorithm
The problem of testing whether a graph is planar has been studied for over half a century,
and is known to be solvable in (n) time using a myriad of different approaches and …
and is known to be solvable in (n) time using a myriad of different approaches and …
Improving vertex cover as a graph parameter
R Ganian - Discrete Mathematics & Theoretical Computer …, 2015 - dmtcs.episciences.org
Parameterized algorithms are often used to efficiently solve NP-hard problems on graphs. In
this context, vertex cover is used as a powerful parameter for dealing with graph problems …
this context, vertex cover is used as a powerful parameter for dealing with graph problems …
Evolutionary perspective and expression analysis of intronless genes highlight the conservation of their regulatory role
K Aviña-Padilla, JA Ramírez-Rafael… - Frontiers in …, 2021 - frontiersin.org
The structure of eukaryotic genes is generally a combination of exons interrupted by
intragenic non-coding DNA regions (introns) removed by RNA splicing to generate the …
intragenic non-coding DNA regions (introns) removed by RNA splicing to generate the …
A simple linear time LexBFS cograph recognition algorithm
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful
tool for the development of linear time, easily implementable recognition algorithms for …
tool for the development of linear time, easily implementable recognition algorithms for …
Grundy distinguishes treewidth from pathwidth
Structural graph parameters, such as treewidth, pathwidth, and clique-width, are a central
topic of study in parameterized complexity. A main aim of research in this area is to …
topic of study in parameterized complexity. A main aim of research in this area is to …
[HTML][HTML] Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
An enumeration kernel as defined by Creignou et al.(2017)[11] for a parameterized
enumeration problem consists of an algorithm that transforms each instance into one whose …
enumeration problem consists of an algorithm that transforms each instance into one whose …