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
∙
07/28/2022
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems
Given a graph G and two independent sets S, T of G, the independent set ...
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
∙
01/20/2022
Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions
In this paper, we propose a fast method for exactly enumerating a very l...
research
∙
11/04/2021
Reallocation Problems with Minimum Completion Time
Reallocation scheduling is one of the most fundamental problems in vario...
research
∙
06/17/2020
The Essential Role of Empirical Validation in Legislative Redistricting Simulation
As granular data about elections and voters become available, redistrict...
research
∙
11/18/2019
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration
Given graphs G and H, we propose a method to implicitly enumerate topolo...
research
∙
04/20/2019
Decomposing a Graph into Unigraphs
Unigraphs are graphs uniquely determined by their own degree sequence up...
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
∙
04/06/2018