The following pages link to Toshihide Ibaraki (Q171928):
Displayed 50 items.
- Error-free and best-fit extensions of partially defined Boolean functions (Q1383161) (← links)
- Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs (Q1383804) (← links)
- Variations on extending partially defined Boolean functions with missing bits. (Q1400581) (← links)
- Local search algorithms for the rectangle packing problem with general spatial costs (Q1403304) (← links)
- Finding essential attributes from binary data (Q1404409) (← links)
- Interior and exterior functions of positive Boolean functions. (Q1408452) (← links)
- Convex embeddings and bisections of 3-connected graphs (Q1410408) (← links)
- Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. (Q1417580) (← links)
- Totally balanced combinatorial optimization games (Q1575068) (← links)
- Optimal scheduling in parallel and serial manufacturing systems via the maximum principle (Q1580435) (← links)
- A faster algorithm for computing minimum 5-way and 6-way cuts in graphs (Q1583693) (← links)
- A fast algorithm for computing minimum 3-way and 4-way cuts (Q1587938) (← links)
- Ordered binary decision diagrams as knowledge-bases (Q1605409) (← links)
- Logical analysis of binary data with missing bits (Q1606295) (← links)
- Computing intersections of Horn theories for reasoning with models (Q1606297) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921) (← links)
- Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
- Implementing an efficient minimum capacity cut algorithm (Q1804650) (← links)
- Inferring minimal functional dependencies in Horn and q-Horn theories (Q1810895) (← links)
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program (Q1821694) (← links)
- A polynomial time algorithm for a chance-constrained single machine scheduling problem (Q1837104) (← links)
- Bin packing and multiprocessor scheduling problems with side constraint on job types (Q1838290) (← links)
- Polyhedral structure of submodular and posi-modular systems (Q1841887) (← links)
- Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation (Q1850970) (← links)
- Recognition and dualization of disguised bidual Horn functions. (Q1853017) (← links)
- Logical analysis of data with decomposable structures. (Q1853578) (← links)
- A primal-dual approximation algorithm for the survivable network design problem in hypergraphs (Q1861578) (← links)
- One-dimensional cutting stock problem to minimize the number of different patterns (Q1869576) (← links)
- Reasoning with ordered binary decision diagrams (Q1878409) (← links)
- A decomposability index in logical analysis of data (Q1878410) (← links)
- On generalized greedy splitting algorithms for multiway partition problems (Q1887049) (← links)
- Decompositions of positive self-dual Boolean functions (Q1893164) (← links)
- Decomposability of partially defined Boolean functions (Q1900137) (← links)
- A parallel relaxation method for quadratic programming problems with interval constraints (Q1900763) (← links)
- A multisplitting method for symmetric linear complementarity problems (Q1917824) (← links)
- Interior and exterior functions of Boolean functions (Q1923581) (← links)
- Bidual Horn functions and extensions (Q1961447) (← links)
- Minimum self-dual decompositions of positive dual-minor Boolean functions (Q1961458) (← links)
- Inner-core and outer-core functions of partially defined Boolean functions (Q1961465) (← links)
- A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs (Q1969943) (← links)
- Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph (Q1977862) (← links)
- An approximation of the minimum vertex cover in a graph (Q2258357) (← links)
- A fast algorithm for cactus representations of minimum cuts (Q2258383) (← links)
- Classes of discrete optimization problems and their decision problems (Q2265336) (← links)
- A globally convergent Newton method for solving strongly monotone variational inequalities (Q2367916) (← links)
- The complexity of assigning genotypes to people in a pedigree consistently (Q2370452) (← links)
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (Q2386217) (← links)
- Improved local search algorithms for the rectangle packing problem with general spatial costs (Q2484340) (← links)
- A 3-flip neighborhood local search for the set covering problem (Q2490164) (← links)