research
∙
08/29/2023
On the hardness of inclusion-wise minimal separators enumeration
Enumeration problems are often encountered as key subroutines in the exa...
share
research
∙
07/25/2023
A Compact DAG for Storing and Searching Maximal Common Subsequences
Maximal Common Subsequences (MCSs) between two strings X and Y are subse...
research
∙
02/06/2023
Optimal LZ-End Parsing is Hard
LZ-End is a variant of the well-known Lempel-Ziv parsing family such tha...
research
∙
02/19/2022
Sorting Balls and Water: Equivalence and Computational Complexity
Various forms of sorting problems have been studied over the years. Rece...
research
∙
05/23/2021
Modeling Collective Anticipation and Response on Wikipedia
The dynamics of popularity in online media are driven by a combination o...
research
∙
12/31/2019
Proximity Search For Maximal Subgraph Enumeration
This paper considers the subgraphs of an input graph that satisfy a give...
research
∙
06/24/2019
Constant Amortized Time Enumeration of Independent Sets for Graphs with Bounded Clique Number
In this study, we address the independent set enumeration problem. Altho...
research
∙
06/24/2019
Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices
In this paper, we address the independent set enumeration problem. Altho...
research
∙
03/06/2019
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs
In this paper, we propose a characterization of chordal bipartite graphs...
research
∙
02/19/2019
On the dualization in distributive lattices and related problems
In this paper, we study the dualization in distributive lattices, a gene...
research
∙
06/12/2018
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth
The girth of a graph is the length of its shortest cycle. Due to its rel...
research
∙
06/03/2018
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
In this paper, we provide polynomial-time algorithms for different exten...
research
∙
03/10/2018
Efficient Enumeration of Bipartite Subgraphs in Graphs
Subgraph enumeration problems ask to output all subgraphs of an input gr...
research
∙
02/22/2018