標(biāo)題: Titlebook: Discrete and Computational Geometry and Graphs; 18th Japan Conferenc Jin Akiyama,Hiro Ito,Yushi Uno Conference proceedings 2016 Springer In [打印本頁] 作者: 使醉 時(shí)間: 2025-3-21 18:35
書目名稱Discrete and Computational Geometry and Graphs影響因子(影響力)
書目名稱Discrete and Computational Geometry and Graphs影響因子(影響力)學(xué)科排名
書目名稱Discrete and Computational Geometry and Graphs網(wǎng)絡(luò)公開度
書目名稱Discrete and Computational Geometry and Graphs網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Discrete and Computational Geometry and Graphs被引頻次
書目名稱Discrete and Computational Geometry and Graphs被引頻次學(xué)科排名
書目名稱Discrete and Computational Geometry and Graphs年度引用
書目名稱Discrete and Computational Geometry and Graphs年度引用學(xué)科排名
書目名稱Discrete and Computational Geometry and Graphs讀者反饋
書目名稱Discrete and Computational Geometry and Graphs讀者反饋學(xué)科排名
作者: hieroglyphic 時(shí)間: 2025-3-21 23:29 作者: echnic 時(shí)間: 2025-3-22 03:27 作者: ADORE 時(shí)間: 2025-3-22 06:31 作者: Vulvodynia 時(shí)間: 2025-3-22 12:19 作者: Flounder 時(shí)間: 2025-3-22 14:29 作者: Flounder 時(shí)間: 2025-3-22 20:48 作者: 含糊其辭 時(shí)間: 2025-3-22 22:56
Minimum Rectilinear Polygons for Given Angle Sequences,right turns. The number of left turns always equals the number of right turns plus?4. It is known that any such sequence can be realized by a rectilinear polygon. In this paper, we consider the problem of finding realizations that minimize the perimeter or the area of the polygon or the area of the 作者: 兵團(tuán) 時(shí)間: 2025-3-23 02:36 作者: 行為 時(shí)間: 2025-3-23 09:25 作者: 畏縮 時(shí)間: 2025-3-23 11:38
,-Labeling of a Cycle with One Chord,s defined as .The maximum value of a .-labeling of . is defined as .while the minimum value of a .-labeling of . is .In this paper, we determine the maximum and minimum values of a .-labeling of a graph derived from cycle with adding one chord.作者: 吹牛者 時(shí)間: 2025-3-23 15:13 作者: 勤勞 時(shí)間: 2025-3-23 18:39
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces, their interior-disjoint union is line symmetric? On the negative side, we show that the problem is strongly NP-complete even if the pieces are all polyominos. On the positive side, we show that the problem can be solved in polynomial time if the number of pieces is a fixed constant.作者: 看法等 時(shí)間: 2025-3-23 23:38
Simultaneous Approximation of Polynomials,-. if there exist . such that for every polynomial . there exists an index . with . We settle a problem of Makai and Pach (1983) by showing that . is .-controlling if and only if . is divergent. The proof is based on a statement about covering the Euclidean space with translates of slabs, which is r作者: genuine 時(shí)間: 2025-3-24 06:02
Distance Geometry on the Sphere,tance between two realized vertices incident to a same edge is equal to the given edge weight. In this paper we look at the setting where the target space is the surface of the sphere .. We show that the Distance Geometry Problem is almost the same in this setting, as long as the distances are Eucli作者: 開花期女 時(shí)間: 2025-3-24 06:35
The Sigma Chromatic Number of the Circulant Graphs ,, ,, and ,,the vertices adjacent to .. If . for every two adjacent ., then . is called a . of .. The minimum number of colors required in a sigma coloring of . is called its . and is denoted by .. In this paper, we determine the sigma chromatic numbers of three families of circulant graphs: ., ., and ..作者: 時(shí)間等 時(shí)間: 2025-3-24 13:31
https://doi.org/10.1007/978-3-030-90099-1n squared Horton sets of size .. Improving on previous upper and lower bounds we show that this number is ., which constitutes the currently best upper bound on minimizing the number of general 4-holes for any set of . points in the plane..To obtain the improved bounds, we prove a result of independ作者: 蟄伏 時(shí)間: 2025-3-24 16:58
Bone. The Foundation of a Smileed into four pieces, then hinged like a chain, and then is transformed into a square by rotating the hinged pieces. Furthermore, the entire boundary of each figure goes into the inside of the other figure and becomes the dissection lines of the other figure. Many intriguing results on reversibilitie作者: 后退 時(shí)間: 2025-3-24 19:05
https://doi.org/10.1007/978-3-030-40268-6e plane, which are sorted according to their .-coordinates, we show how to test in . time if . piercing points placed on two lines, parallel to the .-axis, can pierce all the disks of different radii centered at the . given points. This leads to an . time algorithm for the weighted .-center problem.作者: 合法 時(shí)間: 2025-3-24 23:25 作者: Muffle 時(shí)間: 2025-3-25 06:28
Describing and Expressing Surprisehow that the game is NP-complete for . colors but polytime solvable for .. Similarly the game is NP-complete if every color is used by at most . buttons but polytime solvable for .. We also consider restrictions on the board size, cut directions, and cut sizes. Finally, we introduce several natural 作者: Adulate 時(shí)間: 2025-3-25 08:23 作者: ORBIT 時(shí)間: 2025-3-25 14:59
Describing and Expressing Surpriseonvex, but the question remains open for nonconvex polyhedra. In this paper, we give a continuous flat folding motion when the polyhedron . is an orthogonal polyhedron, i.e., when every face is orthogonal to a coordinate axis (., ., or?.). More generally, we demonstrate a continuous flat folding mot作者: Invertebrate 時(shí)間: 2025-3-25 17:35
https://doi.org/10.1007/978-3-319-09315-4right turns. The number of left turns always equals the number of right turns plus?4. It is known that any such sequence can be realized by a rectilinear polygon. In this paper, we consider the problem of finding realizations that minimize the perimeter or the area of the polygon or the area of the 作者: Endemic 時(shí)間: 2025-3-25 22:56
https://doi.org/10.1007/978-3-319-09315-4 Given a closed figure in the plane, find a new closed figure that is similar to the original and can tile the plane. In this study, we give a new formulation of the problem with the weighted Procrustes distance and an algorithm to solve the problem optimally. We conduct computational experiments wi作者: exostosis 時(shí)間: 2025-3-26 00:46
The Divergence of the Casimir Stress A variant of janken can be represented by a tournament (a complete asymmetric digraph), where a vertex corresponds to a sign and an arc (.,?.) indicates that sign . defeats sign .. However, not all tournaments define useful janken variants, i.e., some janken variants may include a useless sign, whi作者: 鉗子 時(shí)間: 2025-3-26 06:19 作者: 紋章 時(shí)間: 2025-3-26 08:31 作者: 節(jié)約 時(shí)間: 2025-3-26 14:00 作者: 毛細(xì)血管 時(shí)間: 2025-3-26 19:39
Argentina’s Pioneer Surrealists-. if there exist . such that for every polynomial . there exists an index . with . We settle a problem of Makai and Pach (1983) by showing that . is .-controlling if and only if . is divergent. The proof is based on a statement about covering the Euclidean space with translates of slabs, which is r作者: COLON 時(shí)間: 2025-3-26 22:23
Argentina’s Pioneer Surrealiststance between two realized vertices incident to a same edge is equal to the given edge weight. In this paper we look at the setting where the target space is the surface of the sphere .. We show that the Distance Geometry Problem is almost the same in this setting, as long as the distances are Eucli作者: forestry 時(shí)間: 2025-3-27 03:59
https://doi.org/10.1007/978-94-010-1526-4the vertices adjacent to .. If . for every two adjacent ., then . is called a . of .. The minimum number of colors required in a sigma coloring of . is called its . and is denoted by .. In this paper, we determine the sigma chromatic numbers of three families of circulant graphs: ., ., and ..作者: Ganglion 時(shí)間: 2025-3-27 08:12 作者: 柱廊 時(shí)間: 2025-3-27 13:05 作者: 不要嚴(yán)酷 時(shí)間: 2025-3-27 17:33 作者: panorama 時(shí)間: 2025-3-27 20:41 作者: hypnogram 時(shí)間: 2025-3-27 23:28 作者: Derogate 時(shí)間: 2025-3-28 04:33
The Sigma Chromatic Number of the Circulant Graphs ,, ,, and ,,the vertices adjacent to .. If . for every two adjacent ., then . is called a . of .. The minimum number of colors required in a sigma coloring of . is called its . and is denoted by .. In this paper, we determine the sigma chromatic numbers of three families of circulant graphs: ., ., and ..作者: 充氣球 時(shí)間: 2025-3-28 09:50 作者: 故意 時(shí)間: 2025-3-28 12:13 作者: 泄露 時(shí)間: 2025-3-28 18:22 作者: CANE 時(shí)間: 2025-3-28 21:25 作者: faucet 時(shí)間: 2025-3-28 23:45
Bust-a-Move/Puzzle Bobble Is NP-complete,We prove that the classic 1994 Taito video game, known as Puzzle Bobble or Bust-a-Move, is NP-complete. Our proof applies to the perfect-information version where the bubble sequence is known in advance, and it uses just three bubble colors.作者: 壯觀的游行 時(shí)間: 2025-3-29 03:32
Continuous Folding of Regular Dodecahedra,Itoh and Nara [.] discussed with Kobayashi the continuous flattening of all Platonic polyhedra; however, a problem was encountered in the case of the dodecahedron. To complete the study, we explicitly show, in this paper, a continuous folding of a regular dodecahedron following the ideas in [.].作者: 整體 時(shí)間: 2025-3-29 07:18 作者: linear 時(shí)間: 2025-3-29 12:35
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281181.jpg作者: syncope 時(shí)間: 2025-3-29 18:06 作者: 遺忘 時(shí)間: 2025-3-29 19:55
978-3-319-48531-7Springer International Publishing AG 2016作者: 容易懂得 時(shí)間: 2025-3-30 00:22
Discrete and Computational Geometry and Graphs978-3-319-48532-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: CT-angiography 時(shí)間: 2025-3-30 05:34 作者: 抑制 時(shí)間: 2025-3-30 09:55
The Argentine Surrealist Journalss defined as .The maximum value of a .-labeling of . is defined as .while the minimum value of a .-labeling of . is .In this paper, we determine the maximum and minimum values of a .-labeling of a graph derived from cycle with adding one chord.作者: humectant 時(shí)間: 2025-3-30 13:01
The Two Faces of Early Surrealism in Mexicoremains NP-complete even for box pleating, where creases form a subset of a square grid with diagonals. In addition, we provide new terminology to implicitly represent the global layer order of a flat folding, and present a new planar reduction framework for grid-aligned gadgets.作者: 引導(dǎo) 時(shí)間: 2025-3-30 16:45
The Argentine Surrealist Journals their interior-disjoint union is line symmetric? On the negative side, we show that the problem is strongly NP-complete even if the pieces are all polyominos. On the positive side, we show that the problem can be solved in polynomial time if the number of pieces is a fixed constant.作者: 變形 時(shí)間: 2025-3-30 22:28
Argentina’s Pioneer Surrealists-. if there exist . such that for every polynomial . there exists an index . with . We settle a problem of Makai and Pach (1983) by showing that . is .-controlling if and only if . is divergent. The proof is based on a statement about covering the Euclidean space with translates of slabs, which is related to Tarski’s plank problem.作者: altruism 時(shí)間: 2025-3-31 01:23
https://doi.org/10.1007/978-94-010-1526-4the vertices adjacent to .. If . for every two adjacent ., then . is called a . of .. The minimum number of colors required in a sigma coloring of . is called its . and is denoted by .. In this paper, we determine the sigma chromatic numbers of three families of circulant graphs: ., ., and ..作者: Silent-Ischemia 時(shí)間: 2025-3-31 05:27 作者: Eviction 時(shí)間: 2025-3-31 10:16
Reversible Nets of Polyhedra,eral connected figures. It is shown that two nets obtained by cutting the surface of an arbitrary convex polyhedron along non-intersecting dissection trees are reversible. Moreover, a condition for two nets of an isotetrahedron to be both reversible and tessellative is given.作者: 疲憊的老馬 時(shí)間: 2025-3-31 16:17 作者: Arteriography 時(shí)間: 2025-3-31 17:55 作者: 無節(jié)奏 時(shí)間: 2025-3-31 22:30 作者: Grievance 時(shí)間: 2025-4-1 03:19
Describing and Expressing Surpriseogonal polyhedron, i.e., when every face is orthogonal to a coordinate axis (., ., or?.). More generally, we demonstrate a continuous flat folding motion for any polyhedron whose faces are orthogonal to the . axis or the . plane.作者: Brain-Imaging 時(shí)間: 2025-4-1 09:21
https://doi.org/10.1007/978-3-319-09315-4mulation of the problem with the weighted Procrustes distance and an algorithm to solve the problem optimally. We conduct computational experiments with animal shape tiles to confirm the effectiveness of the proposed method.作者: Creditee 時(shí)間: 2025-4-1 10:20
Argentina’s Pioneer Surrealistspace is the surface of the sphere .. We show that the Distance Geometry Problem is almost the same in this setting, as long as the distances are Euclidean. We then generalize a theorem of G?del about the case where the distances are spherical geodesics, and discuss a method for realizing cliques geodesically on a .-dimensional sphere.作者: Commonwealth 時(shí)間: 2025-4-1 17:49
