The following pages link to Takao Nishizeki (Q226821):
Displaying 50 items.
- (Q194328) (redirect page) (← links)
- A linear-time algorithm for four-partitioning four-connected planar graphs (Q287104) (← links)
- Energy and depth of threshold circuits (Q410715) (← links)
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions (Q627177) (← links)
- Small grid drawings of planar graphs with balanced partition (Q695321) (← links)
- On the relationship between the genus and the cardinality of the maximum matchings of a graph (Q755593) (← links)
- A note on the critical problem for matroids (Q794658) (← links)
- Drawing plane graphs nicely (Q797289) (← links)
- A note on nongraphic matroids (Q801072) (← links)
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950) (← links)
- A linear algorithm for bipartition of biconnected graphs (Q911298) (← links)
- Edge-disjoint paths in a grid bounded by two nested rectangles (Q913521) (← links)
- Partitioning graphs of supply and demand (Q967306) (← links)
- Octagonal drawings of plane graphs with prescribed face areas (Q1000923) (← links)
- Approximability of partitioning graphs with supply and demand (Q1002107) (← links)
- Open rectangle-of-influence drawings of inner triangulated plane graphs (Q1016532) (← links)
- A linear algorithm for embedding planar graphs using PQ-trees (Q1083864) (← links)
- Algorithms for multicommodity flows in planar graphs (Q1119160) (← links)
- Lower bounds on the cardinality of the maximum matchings of planar graphs (Q1135291) (← links)
- A 1-tough nonhamiltonian maximal planar graph (Q1143414) (← links)
- Combinatorial problems on series-parallel graphs (Q1148685) (← links)
- On the maximum matchings of regular multigraphs (Q1155632) (← links)
- Multiple assignment scheme for sharing secret (Q1207695) (← links)
- Algorithms for routing around a rectangle (Q1208452) (← links)
- Planar graphs: Theory and algorithms (Q1210706) (← links)
- Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade (Q1223424) (← links)
- Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings (Q1305535) (← links)
- \(k\)-connectivity and decomposition of graphs into forests (Q1343147) (← links)
- Rectangular grid drawings of plane graphs (Q1392851) (← links)
- Finding a region with the minimum total \(L_1\) distance from prescribed terminals (Q1400886) (← links)
- Characterization of optimal key set protocols (Q1408828) (← links)
- Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
- A linear algorithm for finding \([g,f]\)-colorings of partial \(k\)-trees (Q1578404) (← links)
- Algorithm for the cost edge-coloring of trees (Q1768602) (← links)
- List total colorings of series-parallel graphs (Q1775015) (← links)
- An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs (Q1838978) (← links)
- Multicolorings of series-parallel graphs (Q1889598) (← links)
- Minimum cost partitions of trees with supply and demand (Q1934311) (← links)
- On the fg-coloring of graphs (Q2277478) (← links)
- Parametric power supply networks (Q2354290) (← links)
- Partitioning a weighted tree into subtrees with weights in a given range (Q2428691) (← links)
- Bandwidth consecutive multicolorings of graphs (Q2445874) (← links)
- Algorithms for finding distance-edge-colorings of graphs (Q2457301) (← links)
- Total colorings of degenerate graphs (Q2460621) (← links)
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size (Q2466001) (← links)
- A revised transformation protocol for unconditionally secure secret key exchange (Q2480750) (← links)
- (Q2766817) (← links)
- Generalized edge-colorings of weighted graphs (Q2798333) (← links)
- Algorithms for Bandwidth Consecutive Multicolorings of Graphs (Q2897987) (← links)
- The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs (Q3031944) (← links)
