Showing 1–16 of 16 results
/ Date/ Name
Apr 11, 2018Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision DiagramsNov 18, 2019Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph EnumerationApr 20, 2019Decomposing a Graph into UnigraphsDec 14, 2022Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect GraphsJan 14, 2026Computational Complexity of SwishApr 6, 2018Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision DiagramsApr 1, 2016Effect of Bitcoin fee on transaction-confirmation processDec 9, 2016The Time Complexity of Permutation Routing via Matching, Token Swapping and a VariantJul 28, 2022ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration ProblemsJan 20, 2022Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost SolutionsFeb 9, 2015An improved lower bound for one-dimensional online unit clusteringFeb 19, 2022Sorting Balls and Water: Equivalence and Computational ComplexityNov 4, 2021Reallocation Problems with Minimum Completion TimeJul 25, 2012Tight Analysis of Priority Queuing Policy for Egress TrafficSep 19, 2013Better Bounds for Online $k$-Frame Throughput Maximization in Network SwitchesJun 17, 2020The Essential Role of Empirical Validation in Legislative Redistricting Simulation