The following pages link to Takeaki Uno (Q344785):
Displaying 50 items.
- Mining preserving structures in a graph sequence (Q344786) (← links)
- UNO is hard, even for a single player (Q389942) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization (Q631100) (← links)
- Algorithmic folding complexity (Q659709) (← links)
- A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis (Q697556) (← links)
- Enumeration of the perfect sequences of a chordal graph (Q708216) (← links)
- Base-object location problems for base-monotone regions (Q744059) (← links)
- Exact algorithms for the max-min dispersion problem (Q777304) (← links)
- An efficient algorithm for solving pseudo clique enumeration problem (Q848935) (← links)
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks (Q860399) (← links)
- A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (Q902421) (← links)
- Counting the number of independent sets in chordal graphs (Q935840) (← links)
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions (Q943841) (← links)
- On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (Q996827) (← links)
- Transforming spanning trees: A lower bound (Q1028225) (← links)
- Tight lower bounds for the number of inclusion-minimal \(st\)-cuts (Q1627159) (← links)
- Computational complexity of robot arm simulation problems (Q1670998) (← links)
- Efficient enumeration of subgraphs and induced subgraphs with bounded girth (Q1671003) (← links)
- Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs (Q1708606) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- Efficient enumeration of bipartite subgraphs in graphs (Q1791004) (← links)
- Labeling points with weights (Q1889601) (← links)
- Fast algorithms to enumerate all common intervals of two permutations (Q1969959) (← links)
- Maximal strongly connected cliques in directed graphs: algorithms and bounds (Q1983136) (← links)
- Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
- Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (Q1985603) (← links)
- On the dualization in distributive lattices and related problems (Q2030249) (← links)
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
- Enumeration of maximal common subsequences between two strings (Q2118209) (← links)
- A 4.31-approximation for the geometric unique coverage problem on unit disks (Q2250456) (← links)
- Max-Min 3-Dispersion problems (Q2300048) (← links)
- Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs (Q2301741) (← links)
- An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs (Q2301754) (← links)
- An efficient algorithm for enumerating induced subgraphs with bounded degeneracy (Q2327103) (← links)
- Swapping labeled tokens on graphs (Q2347003) (← links)
- Matroid representation of clique complexes (Q2381814) (← links)
- Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph (Q2412406) (← links)
- Partitioning a weighted tree into subtrees with weights in a given range (Q2428691) (← links)
- Efficient algorithms for dualizing large-scale hypergraphs (Q2449091) (← links)
- A generalization of magic squares with applications to digital halftoning (Q2480747) (← links)
- (Q2742677) (← links)
- Efficient algorithms for a simple network design problem (Q2811297) (← links)
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs (Q2827808) (← links)
- A PARTITION-BASED HEURISTIC ALGORITHM FOR THE RECTILINEAR BLOCK PACKING PROBLEM (Q2829376) (← links)
- BOUNDING THE NUMBER OF REDUCED TREES, COGRAPHS, AND SERIES-PARALLEL GRAPHS BY COMPRESSION (Q2846474) (← links)
- (Q2857357) (← links)
- On Complexity of Flooding Games on Graphs with Interval Representations (Q2864330) (← links)
- On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs (Q2872098) (← links)
