The following pages link to Naoki Katoh (Q202561):
Displaying 50 items.
- A new probabilistic analysis of Karger's randomized algorithm for minimum cut problems (Q293142) (← links)
- An inductive construction of minimally rigid body-hinge simple graphs (Q300212) (← links)
- Extended formulations for sparsity matroids (Q304267) (← links)
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system (Q391976) (← links)
- Topology optimization of trusses with stress and local constraints on nodal stability and member intersection (Q438487) (← links)
- A linear-time algorithm for testing outer-1-planarity (Q494794) (← links)
- A proof of the molecular conjecture (Q540449) (← links)
- Covering directed graphs by in-trees (Q626455) (← links)
- A rooted-forest partition with uniform vertex demand (Q695323) (← links)
- Optimal spanners for axis-aligned rectangles (Q706725) (← links)
- Minimax regret 1-median problem in dynamic path networks (Q726099) (← links)
- The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths (Q741538) (← links)
- An approximation algorithm for the pickup and delivery vehicle routing problem on trees (Q860395) (← links)
- Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs (Q894472) (← links)
- Optimally bracing grid frameworks with holes (Q896115) (← links)
- Multiple sink location problems in dynamic path networks (Q897956) (← links)
- On the edge crossing properties of Euclidean minimum weight Laman graphs (Q902420) (← links)
- Enumerating constrained non-crossing minimally rigid frameworks (Q946684) (← links)
- Voronoi diagrams with respect to criteria on vision information (Q946853) (← links)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
- An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths (Q967437) (← links)
- Arc-disjoint in-trees in directed graphs (Q987553) (← links)
- (Q1051431) (redirect page) (← links)
- On-line computation of transitive closures of graphs (Q1051432) (← links)
- An efficient algorithm for the parametric resource allocation problem (Q1058467) (← links)
- A cautious scheduler for multistep transactions (Q1101210) (← links)
- An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion (Q1183333) (← links)
- A fully polynomial time approximation scheme for minimum cost-reliability ratio problems (Q1183334) (← links)
- Optimal strategies for some team games (Q1186315) (← links)
- A multiversion cautious scheduler with dynamic serialization constraints for database concurrency control (Q1208453) (← links)
- Efficient algorithms for finding the most vital edge of a minimum spanning tree (Q1313724) (← links)
- On minimum and maximum spanning trees of linearly moving points (Q1346135) (← links)
- \(k\)-levels of concave surfaces (Q1611064) (← links)
- The mixed evacuation problem (Q1631682) (← links)
- A population-based algorithm for solving linear assignment problems with two objectives (Q1652173) (← links)
- Minsum \(k\)-sink problem on dynamic flow path networks (Q1670987) (← links)
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications (Q1774529) (← links)
- Triangulations intersect nicely (Q1816461) (← 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)
- LMT-skeleton heuristics for several new classes of optimal triangulations (Q1841243) (← links)
- Approximating uniform triangular meshes in polygons. (Q1853569) (← links)
- Group symmetry in interior-point methods for semidefinite program (Q1863859) (← links)
- The structure and number of global roundings of a graph (Q1884844) (← links)
- Variants for the Hough transform for line detection (Q1917055) (← links)
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms (Q1917270) (← links)
- Independent arborescences in directed graphs (Q1937557) (← links)
- Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints (Q1968617) (← links)
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights (Q2232232) (← links)
- Online graph exploration algorithms for cycles and trees by multiple searchers (Q2251142) (← links)
