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 ...
share
research
∙
03/25/2022
Independent set reconfiguration on directed graphs
Directed Token Sliding asks, given a directed graph and two sets of pair...
research
∙
07/07/2021
Reconfiguring Directed Trees in a Digraph
In this paper, we investigate the computational complexity of subgraph r...
research
∙
10/05/2020
A Note on Exponential-Time Algorithms for Linearwidth
In this note, we give an algorithm that computes the linearwidth of inpu...
research
∙
01/24/2020
Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization
Given n points in the plane, we propose algorithms to compile connected ...
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
∙
05/29/2019
On the Clique-Width of Unigraphs
Clique-width is a well-studied graph parameter. For graphs of bounded cl...
research
∙
04/20/2019
Decomposing a Graph into Unigraphs
Unigraphs are graphs uniquely determined by their own degree sequence up...
research
∙
04/06/2018
