research
∙
12/14/2022
Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs
Intersection graphs are well-studied in the area of graph algorithms. So...
share
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
∙
07/08/2020
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes
For a graph class 𝒞, the 𝒞-Edge-Deletion problem asks for a given graph ...
research
∙
04/11/2018
Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams
We propose a general method performed over multivalued decision diagrams...
research
∙
03/19/2018
