Showing 1–11 of 11 results
/ Date/ Name
Nov 18, 2019Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph EnumerationApr 20, 2019Decomposing a Graph into UnigraphsMay 29, 2019On the Clique-Width of UnigraphsJan 24, 2020Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and OptimizationMay 12, 2025Reconfiguring Multiple Connected Components with Size Multiset ConstraintsApr 6, 2018Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision DiagramsApr 2, 2025Computing Time-varying Network Reliability using Binary Decision DiagramsJul 7, 2021Reconfiguring (non-spanning) arborescencesMar 25, 2022Independent set reconfiguration on directed graphsJul 28, 2022ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration ProblemsOct 5, 2020A Note on Exponential-Time Algorithms for Linearwidth