The following pages link to Shin-ichi Nakano (Q238445):
Displaying 50 items.
- (Q168531) (redirect page) (← links)
- A linear-time algorithm for four-partitioning four-connected planar graphs (Q287104) (← links)
- On the class number divisibility of pairs of quadratic fields obtained from points on elliptic curves (Q296569) (← links)
- (Q407552) (redirect page) (← links)
- A compact encoding of plane triangulations with efficient query supports (Q407553) (← links)
- Efficient enumeration of ordered trees with \(k\) leaves (Q441889) (← links)
- A note on the construction of metacyclic extensions (Q696226) (← links)
- On ideal class groups of algebraic number fields (Q760463) (← links)
- Exact algorithms for the max-min dispersion problem (Q777304) (← links)
- On the construction of certain number fields (Q787194) (← links)
- On the 2-rank of the ideal class groups of pure number fields (Q788042) (← links)
- A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (Q902421) (← links)
- Efficient enumeration of all ladder lotteries and its application (Q964388) (← links)
- A family of quintic cyclic fields with even class number parameterized by rational points on an elliptic curve (Q1035585) (← links)
- Class numbers of pure cubic fields (Q1051688) (← links)
- On the construction of pure number fields of odd degrees with large 2-class groups (Q1075368) (← links)
- Construction of pure cubic fields with large 2-class groups (Q1105638) (← links)
- Minimum-width grid drawings of plane graphs (Q1265328) (← links)
- Rectangular grid drawings of plane graphs (Q1392851) (← links)
- Efficient generation of triconnected plane triangulations. (Q1428112) (← links)
- A simple algorithm for r-gatherings on the line (Q1641084) (← links)
- Floorplans with columns (Q1699755) (← links)
- More routes for evacuation (Q1790955) (← links)
- The 2-class groups of cubic fields and 2-descents on elliptic curves (Q1802555) (← links)
- Efficient generation of plane trees. (Q1853129) (← links)
- An application of the arithmetic of elliptic curves to the class number problem for quadratic fields (Q1984015) (← links)
- Floorplans with walls (Q2110694) (← links)
- A 4.31-approximation for the geometric unique coverage problem on unit disks (Q2250456) (← links)
- On the fg-coloring of graphs (Q2277478) (← links)
- Max-Min 3-Dispersion problems (Q2300048) (← links)
- \(r\)-gatherings on a star (Q2327520) (← links)
- The coverage problem by aligned disks (Q2695288) (← links)
- (Q2766691) (← links)
- (Q2766817) (← links)
- Efficient algorithms for a simple network design problem (Q2811297) (← links)
- Assigning Proximity Facilities for Gatherings (Q2817866) (← links)
- BOUNDING THE NUMBER OF REDUCED TREES, COGRAPHS, AND SERIES-PARALLEL GRAPHS BY COMPRESSION (Q2846474) (← links)
- Generating All Triangulations of Plane Graphs (Q2865036) (← links)
- Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression (Q2889896) (← links)
- A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares (Q2904540) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q2980931) (← links)
- A Compact Encoding of Unordered Binary Trees (Q3010392) (← links)
- How to Obtain the Complete List of Caterpillars (Q3082940) (← links)
- On ideal groups of algebraic number fields. (Q3347971) (← links)
- On r-Gatherings on the Line (Q3452549) (← links)
- Enumeration, Counting, and Random Generation of Ladder Lotteries (Q3452576) (← links)
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) (Q3605493) (← links)
- Generating All Triangulations of Plane Graphs (Extended Abstract) (Q3605494) (← links)
- Listing All Plane Graphs (Q3627962) (← links)
- Ideal class groups of cubic cyclic fields (Q3735805) (← links)
