{"id":38,"date":"2015-03-30T17:12:00","date_gmt":"2015-03-30T08:12:00","guid":{"rendered":"http:\/\/art.ist.hokudai.ac.jp\/?page_id=38"},"modified":"2026-04-01T11:44:02","modified_gmt":"2026-04-01T02:44:02","slug":"%e7%a0%94%e7%a9%b6%e6%88%90%e6%9e%9c","status":"publish","type":"page","link":"https:\/\/art.ist.hokudai.ac.jp\/?page_id=38","title":{"rendered":"\u7814\u7a76\u6210\u679c"},"content":{"rendered":"

<\/p>\n

\u7814\u7a76\u6210\u679c<\/h2>\n

\u7814\u7a76\u5ba4\u306e\u5b66\u751f\u304c\u542b\u307e\u308c\u308b\u7814\u7a76\u6210\u679c\u306e\u307f\u3092\u8f09\u305b\u3066\u3044\u307e\u3059\u3002<\/p>\n

2025\u5e74\u5ea6<\/strong><\/h3>\n

\u3010\u67fb\u8aad\u4ed8\u8ad6\u6587\u8a8c\u3011<\/strong><\/h4>\n

Takashi Horiyama,<\/span>\u00a0<\/span>Kazuhisa Seto<\/span>, and Ryu Suzuki:
\n<\/span>The Complexity of Pre-assignment Problem for Unique Minimum Vertex Cover on Bipartite Graphs
\nTheory of Computing Systems, <\/span>Vol. 69, No. 35, 2025.
\nDOI: https:\/\/doi.org\/10.1007\/s00224-025-10249-4<\/a><\/span><\/p>\n

\u3010\u67fb\u8aad\u4ed8\u56fd\u969b\u4f1a\u8b70\u8ad6\u6587\u3011<\/strong><\/p>\n

Takashi Horiyama,\u00a0<\/span>Yuto Okura<\/span>,\u00a0<\/span>Kazuhisa Seto<\/span>, and\u00a0<\/span>Junichi Teruyama:
\n<\/span>Exact Algorithms and Hardness Result for the Boolean Connectivity Problem of k-Horn Formulas
\n<\/span>In Proceedings of <\/span>t<\/span>he 20th International Symposium on Parameterized and Exact Computation (IPEC 2025), LIPIcs\u00a0<\/span>358<\/span>, pages\u00a0<\/span>25<\/span>:1-<\/span>25<\/span>:1<\/span>5<\/span>,\u00a0<\/span>September 2025 (W<\/span>arsaw<\/span>, Poland)
\nDOI: https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2025.25<\/a><\/span><\/p>\n

Takashi Horiyama,\u00a0<\/span>Fumiya Sakamoto<\/span>,\u00a0<\/span>Kazuhisa Seto<\/span>, and Ryu Suzuki:
\n<\/span>Hardness of Pre-assignment Problem for Unique Minimum Vertex Cover on Planar Graphs with Maximum Degree 3
\nIn Proceedings of <\/span>the 25th International Symposium on Fundamentals of Computation Theory<\/span>\u00a0 (<\/span>FCT<\/span>\u00a02025), LNCS\u00a0<\/span>16106<\/span>, pages\u00a0<\/span>238<\/span>–<\/span>251<\/span>,\u00a0<\/span>September<\/span>\u00a02025 (<\/span>Wroc\u0142aw, Poland<\/span>)
\nDOI: https:\/\/doi.org\/10.1007\/978-3-032-04700-7_18<\/a><\/span><\/p>\n

Shoon Mineyoshi,\u00a0<\/span>Kazuhisa Seto<\/span>, and Takashi Horiyama:
\n<\/span>On the Diameters of Reconfiguration Graphs and ZDD-Based BFS-Algorithm for Optimal Reconfiguration Problems of Optimal Ladder Lotteries
\nIn Proceedings of the 37th Canadian Conference on Computational Geometry\u00a0 (CCCG 2025), pages <\/span>140<\/span>–<\/span>146<\/span>, August 2025 (Toronto, Canada)
\nProceedings: https:\/\/cccg-wads-2025.eecs.yorku.ca\/cccg-all-papers.pdf<\/a><\/span><\/p>\n

\u3010\u5b66\u4f1a\u767a\u8868\u3011\u3000* \u5370\u304c\u767a\u8868\u8005<\/strong><\/h4>\n

\u9752\u5cf6 \u826f\u78e8 *, \u6885\u6797 \u679c\u7433, \u5742\u672c \u90c1\u5f25, \u4f50\u85e4 \u97ff\u6a39, \u810a\u6238 \u548c\u5bff, \u9577\u5c3e \u7be4\u6a39, \u5800\u5c71 \u8cb4\u53f2
\n\u6700\u5927\u6b21\u65703\u306e\u4e8c\u90e8\u30b0\u30e9\u30d5\u306b\u304a\u3051\u308b\u5b8c\u5168\u30de\u30c3\u30c1\u30f3\u30b0\u306e\u89e3\u4e00\u610f\u5316\u306eNP\u5b8c\u5168\u6027
\n\u7b2c207\u56de\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u7814\u7a76\u767a\u8868\u4f1a, 2026\u5e743\u6708\uff08\u5ca1\u5c71\u5927\u5b66, \u5ca1\u5c71\uff09<\/p>\n

Fumiya Sakamoto*<\/span>, Ryu Suzuki, Kazuhisa Seto, Takashi Horiyama:
\nThe Complexity of Computing Pre-assignments for Uniquifying Minimum Vertex Cover on Planar Graphs with Maximum Degree 3
\nThe 25th Korean-Japan Joint Workshop on Algorithms and Computation, August 2025 (Sapporo, Japan).<\/p>\n

\u2ed8\u5cf6 \u826f\u78e8*, \u5742\u672c \u90c1\u5f25, \u810a\u2f3e \u548c\u5bff, \u5800\u2f2d \u8cb4\u53f2:
\n\u90e8\u5206\u5272\u5f53\u306b\u3088\u308b Exact Length Trail \u306e\u552f\u2f00\u5316\u306b\u304a\u3051\u308b\u8a08\u7b97\u8907\u96d1\u3055
\n2025\u5e74\u5ea6 \u590f\u306eLA\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0, 2025\u5e747\u6708 (\u30a2\u30a4\u30fc\u30ca\u30fb\u3044\u308f\u3066\u770c\u6c11\u60c5\u5831\u4ea4\u6d41\u30bb\u30f3\u30bf\u30fc, \u5ca9\u624b).<\/p>\n

2024\u5e74\u5ea6<\/strong><\/h3>\n

\u3010\u67fb\u8aad\u4ed8\u8ad6\u6587\u8a8c\u3011<\/strong><\/h4>\n

Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, and Naoki Katoh:
\nLower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs.
\nIEICE Transactions on Information and Systems, Vol. E107-D, No.6, pages. 732–740, 2024.
\nDOI: https:\/\/doi.org\/10.1587\/transinf.2023EDP7214<\/a><\/p>\n

\u3010\u67fb\u8aad\u4ed8\u56fd\u969b\u4f1a\u8b70\u8ad6\u6587\u3011<\/strong><\/h4>\n

Kazuma Yamane, Yuto Nakashima, Kazuhisa Seto, and Takashi Horiyama:
\nMaximal \u03b1-gapped Repeats in a Fibonacci String.
\nIn Proceedings of the 50th International Conference on Current Trends in Theory and Practice of Computer Science\u00a0 (SOFSEM 2025), LNCS 15539, pages 172-183, January 2025 (Bratislava, Slovakia)
\nDOI: https:\/\/doi.org\/10.1007\/978-3-031-82697-9_13<\/a><\/p>\n

Takuya Mieno, Shun Takahashi, Kazuhisa Seto, and Takashi Horiyama:
\nOnline and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees.
\nIn Proceedings of the 50th International Conference on Current Trends in Theory and Practice of Computer Science\u00a0 (SOFSEM 2025), LNCS 15539, pages 337-350, January 2025 (Bratislava, Slovakia)
\nDOI: https:\/\/doi.org\/10.1007\/978-3-031-82697-9_25<\/a><\/p>\n

Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, and Takashi Horiyama:
\nShortest Cover After Edit.
\nIn Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024), LIPIcs 296, pages 24:1–24:15, June 2024 (Fukuoka, Japan).
\nDOI: https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2024.24<\/a><\/p>\n

\u3010\u5b66\u4f1a\u767a\u8868\u3011\u3000* \u5370\u304c\u767a\u8868\u8005<\/strong><\/h4>\n

\u5742\u672c \u90c1\u5f25*, \u9234\u6728 \u7409, \u810a\u6238 \u548c\u5bff, \u5800\u5c71 \u8cb4\u53f2:
\n\u6700\u5927\u6b21\u6570 3 \u306e\u5e73\u9762\u7684\u30b0\u30e9\u30d5\u306b\u304a\u3051\u308b\u4e8b\u524d\u5272\u5f53\u306b\u3088\u308b\u6700\u5c0f\u9802\u70b9\u88ab\u8986\u306e\u552f\u4e00\u5316\u306e\u8a08\u7b97\u56f0\u96e3\u6027.
\n\u7b2c201\u56de\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u7814\u7a76\u767a\u8868\u4f1a, 2025\u5e741\u6708 \uff08\u304f\u307e\u3082\u3068\u770c\u6c11\u4ea4\u6d41\u9928\u30d1\u30ec\u30a2, \u718a\u672c\uff09<\/p>\n

Yuto Okura*, Junichi Teruyama, Kazuhisa Seto, and Takashi Horiyama:
\nExact Algorithm for the Boolean Connectivity of k-Horn Formulas via Deterministic PPZ.
\n\u7b2c201\u56de\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u7814\u7a76\u767a\u8868\u4f1a, 2025\u5e741\u6708 \uff08\u304f\u307e\u3082\u3068\u770c\u6c11\u4ea4\u6d41\u9928\u30d1\u30ec\u30a2, \u718a\u672c\uff09<\/p>\n

Shoon Mineyoshi*, Kazuhisa Seto, and Takashi Horiyama:
\nOn the Diameters of Reconfiguration Graphs and ZDD-Based BFS-Algorithm for Optimal Reconfiguration Problems of Optimal Ladder Lotteries.
\nThe 6th Workshop on Enumeration Problems and Applications, October 2024 (Nikko, Japan)<\/p>\n

Masashi Gorobe*, Kazuhisa Seto, and Takashi Horiyama:
\nOn the Enumeration of Common Developments of Orthogonal Boxes by Utilizing Cycles on the Surfaces.
\nThe 6th Workshop on Enumeration Problems and Applications, October 2024 (Nikko, Japan)<\/p>\n

Yuto Okura*, Kazuhisa Seto, and Takashi Horiyama:
\nA Moderately Exponential Time Algorithm for the Boolean Connectivity of k-Horn Formulas.
\nThe 24th Korean-Japan Joint Workshop on Algorithms and Computation, August 2024 (Seoul, Korea).<\/p>\n

Kazuma Yamane* Yuto Nakashima, Kazuhisa Seto, and Takashi Horiyama:
\nThe Number of Maximal \u03b1-gapped Repeats in Fibonacci Strings.
\nThe 24th Korean-Japan Joint Workshop on Algorithms and Computation, August 2024 (Seoul, Korea).<\/p>\n

Yuto Okura*, Junichi Teruyama, Kazuhisa Seto, and Takashi Horiyama:
\nModerately Exponential Time Algorithm for the Boolean Connectivity Problem for k-Horn Formulas.
\n2024\u5e74\u5ea6 \u590f\u306eLA\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0, 2024\u5e747\u6708 (\u9ce5\u7fbd\u5546\u5de5\u4f1a\u8b70\u6240, \u4e09\u91cd).<\/p>\n

Ryu Suzuki*, Kazuhisa Seto, and Takashi Horiyama:
\nExact Algorithm for Computing Pre-assignments to Uniquify Minimum Vertex Covers on Bipartite Graphs.
\n2024\u5e74\u5ea6 \u590f\u306eLA\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0, 2024\u5e747\u6708 (\u9ce5\u7fbd\u5546\u5de5\u4f1a\u8b70\u6240, \u4e09\u91cd).<\/p>\n

\u4e94\u90ce\u90e8 \u8aa0\u58eb*, \u810a\u6238 \u548c\u5bff, \u5800\u5c71 \u8cb4\u53f2:
\n\u591a\u9762\u4f53\u4e0a\u306e\u30b5\u30a4\u30af\u30eb\u3092\u5229\u7528\u3057\u305f\u683c\u5b50\u76f4\u65b9\u4f53\u306b\u304a\u3051\u308b\u5171\u901a\u5c55\u958b\u56f3\u306e\u5217\u6319.
\n2024\u5e74\u5ea6 \u590f\u306eLA\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0, 2024\u5e747\u6708 (\u9ce5\u7fbd\u5546\u5de5\u4f1a\u8b70\u6240, \u4e09\u91cd).<\/p>\n

\u5cef\u5409 \u7fd4\u97f3*, \u810a\u6238 \u548c\u5bff, \u5800\u5c71 \u8cb4\u53f2:
\n\u6700\u9069\u3042\u307f\u3060\u304f\u3058\u306e\u6700\u9069\u9077\u79fb\u554f\u984c\u306b\u5bfe\u3059\u308b\u9077\u79fb\u30b0\u30e9\u30d5\u306e\u76f4\u5f84\u3068\u5e45\u512a\u5148\u63a2\u7d22\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0.
\n2024\u5e74\u5ea6 \u590f\u306eLA\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0, 2024\u5e747\u6708 (\u9ce5\u7fbd\u5546\u5de5\u4f1a\u8b70\u6240, \u4e09\u91cd).<\/p>\n

2023\u5e74\u5ea6<\/strong><\/h3>\n

\u3010\u67fb\u8aad\u4ed8\u8ad6\u6587\u8a8c\u3011<\/strong><\/h4>\n

Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, and Takashi Horiyama:
\nFinding Top-k Longest Palindromes in Substrings.
\nTheoretical Computer Science, Vol. 979, No. 114183, 2023.
\nDOI: https:\/\/doi.org\/10.1016\/j.tcs.2023.114183<\/a><\/p>\n

\u3010\u67fb\u8aad\u4ed8\u56fd\u969b\u4f1a\u8b70\u8ad6\u6587\u3011<\/strong><\/p>\n

Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, and Ryu Suzuki:
\nTheoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover.
\nIn Proceedings of the 38th Annual AAAI Conference on Artificial Intelligence\u00a0 (AAAI 2024), Vol. 38(18), pages 20726-20734, February 2024 (Vancouver, Canada).
\nDOI: https:\/\/doi.org\/10.1609\/aaai.v38i18.30060<\/a><\/p>\n

Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, and Naoki Katoh:
\nLower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2, 2)-Tight Graphs.
\nIn Proceedings of the 35th Canadian Conference on Computational Geometry (CCCG 2023), pages 191–196, August 2023 (Montreal, Canada).
\nProceedings: https:\/\/cccg.ca\/proceedings\/2023\/CCCG2023.pdf<\/a><\/p>\n

\u3010\u5b66\u4f1a\u767a\u8868\u3011\u3000* \u5370\u304c\u767a\u8868\u8005<\/strong><\/h4>\n

Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, and Ryu Suzuki*:
\nHardness of Uniquifying Minimum Vertex Covers and Minimum Dominating Sets under Pre-assignments.
\n2024\u5e74\u96fb\u5b50\u60c5\u5831\u901a\u4fe1\u5b66\u4f1a\u7dcf\u5408\u5927\u4f1a, 2024\u5e743\u6708 (\u5e83\u5cf6\u5927\u5b66, \u5e83\u5cf6).<\/p>\n

\u4e09\u8c37 \u548c\u6689*, \u4e09\u91cd\u91ce \u7422\u4e5f, \u810a\u6238 \u548c\u5bff, \u5800\u5c71 \u8cb4\u53f2:
\n1 \u30d6\u30ed\u30c3\u30af\u7de8\u96c6\u6642\u306e\u6700\u9577\u30dc\u30fc\u30c0\u30fc\u30af\u30a8\u30ea\u3068\u6700\u5c0f\u30ab\u30d0\u30fc\u30af\u30a8\u30ea.
\n2023\u5e74\u5ea6 \u51ac\u306eLA\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0, 2024\u5e742\u6708 (\u4eac\u90fd\u5927\u5b66, \u4eac\u90fd).<\/p>\n

\u5c71\u6839 \u548c\u771f*, \u4e2d\u5cf6 \u7950\u4eba, \u810a\u6238 \u548c\u5bff, \u5800\u5c71 \u8cb4\u53f2:
\n\u30d5\u30a3\u30dc\u30ca\u30c3\u30c1\u6587\u5b57\u5217\u4e2d\u306e\u6975\u5927\u03b1\u30ae\u30e3\u30c3\u30d7\u4ed8\u304d\u53cd\u5fa9\u306e\u500b\u6570\u306e\u4e0a\u754c.
\n2023\u5e74\u5ea6 \u51ac\u306eLA\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0, 2024\u5e742\u6708 (\u4eac\u90fd\u5927\u5b66, \u4eac\u90fd).<\/p>\n

\u9234\u6728 \u7409* ,\u00a0 \u810a\u6238 \u548c\u5bff, \u5800\u5c71 \u8cb4\u53f2:
\nHardness of Computing a Pre-assignment to Uniquify Minimum Dominating Sets on Bipartite Graphs.
\n\u7b2c195\u56de\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u7814\u7a76\u767a\u8868\u4f1a, 2023\u5e7411\u6708, (\u90a3\u8987IT\u5275\u9020\u9928, \u90a3\u8987).<\/p>\n

\u6cb3\u4e0a \u60a0\u8f1d*,\u00a0 \u810a\u6238 \u548c\u5bff, \u5800\u5c71 \u8cb4\u53f2, \u5c0f\u6797 \u7950\u8cb4, \u6771\u5ddd \u96c4\u54c9, \u52a0\u85e4 \u76f4\u6a39:
\n\u5e73\u9762\u4e0a\u306e\u6700\u5c0f\u91cd\u307f\u7121\u4ea4\u5dee Laman \u30b0\u30e9\u30d5\u3068\u95a2\u9023\u3059\u308b\u5e7e\u4f55\u7684\u30b0\u30e9\u30d5\u306b\u3064\u3044\u3066.
\n2023\u5e74\u5ea6 \u590f\u306eLA\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0, 2023\u5e747\u6708 (\u30b5\u30f3\u30fb\u30ea\u30d5\u30ec\u51fd\u9928, \u5317\u6d77\u9053)<\/p>\n

Ryu Suzuki* , Yasuaki Kobayashi, Kazuhisa Seto, Takashi Horiyama:
\nNP-completeness of Computing Pre-assignments to Uniquify Vertex Cover for Bipartite Graphs.
\n2023\u5e74\u5ea6 \u590f\u306eLA\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0, 2023\u5e747\u6708 (\u30b5\u30f3\u30fb\u30ea\u30d5\u30ec\u51fd\u9928, \u5317\u6d77\u9053).<\/p>\n

\u5c71\u6839 \u548c\u771f*, \u4e2d\u5cf6 \u7950\u4eba, \u810a\u6238 \u548c\u5bff, \u5800\u5c71 \u8cb4\u53f2:
\n\u30d5\u30a3\u30dc\u30ca\u30c3\u30c1\u6587\u5b57\u5217\u4e2d\u306e\u6975\u5927\u30ae\u30e3\u30c3\u30d7\u4ed8\u304d\u53cd\u5fa9\u306e\u500b\u6570.
\n2023\u5e74\u5ea6 \u590f\u306eLA\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0, 2023\u5e747\u6708 (\u30b5\u30f3\u30fb\u30ea\u30d5\u30ec\u51fd\u9928, \u5317\u6d77\u9053).<\/p>\n

Ryu Suzuki*, Yasuaki Kobayashi, Kazuhisa Seto, and Takashi Horiyama:
\nNP-completeness of Computing Pre-assignments to Uniquify Vertex Cover for Bipartite Graphs.
\nIn Proceedings of the 23rd Korean-Japan Joint Workshop on Algorithms and Computation (WAAC 2023), June 2023 (Aichi, Japan).<\/p>\n

2022\u5e74\u5ea6<\/strong><\/h3>\n

\u3010\u67fb\u8aad\u4ed8\u56fd\u969b\u4f1a\u8b70\u8ad6\u6587\u3011<\/strong><\/p>\n

Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, and Takashi Horiyama:
\nInternal Longest Palindrome Queries in Optimal Time.
\nIn Proceedings of the 17th International Workshop on Algorithms and Computation (WALCOM 2023), LNCS 13973, pages 127-138, March 2023 (Hsinchu, Taiwan).
\nDOI: https:\/\/doi.org\/10.1007\/978-3-031-27051-2_12<\/a><\/p>\n

\u3010\u5b66\u4f1a\u767a\u8868\u3011\u3000* \u5370\u304c\u767a\u8868\u8005<\/strong><\/h4>\n

\u5ca9\u5d0e \u5584\u6cf0*, \u5800\u5c71 \u8cb4\u53f2, \u677e\u4e95 \u6cf0\u5b50, \u91ce\u5d0e \u96c4\u592a, \u810a\u6238 \u548c\u5bff, \u5c71\u4e2d \u514b\u4e45:
\nZDD \u3092\u7528\u3044\u305f\u6700\u9069\u5186\u7b52\u3042\u307f\u3060\u304f\u3058\u306e\u5217\u6319.
\n\u7b2c192\u56de\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u7814\u7a76\u767a\u8868\u4f1a, 2023\u5e743\u6708, (\u6771\u5317\u5927\u5b66, \u5bae\u57ce).<\/p>\n

\u9ad8\u6a4b \u5b54\u5e73*, \u810a\u6238 \u548c\u5bff, \u5800\u5c71 \u8cb4\u53f2, \u4e09\u91cd\u91ce \u7422\u4e5f:
\n\u81ea\u5df1\u540c\u578b\u5199\u50cf\u306e\u65ad\u7247\u3092\u7528\u3044\u305f\u4ee3\u8868\u5143\u306e\u53cd\u5fa9\u62bd\u51fa\u306b\u3088\u308b\u540c\u578b\u6027\u306e\u9664\u53bb.
\n\u96fb\u5b50\u60c5\u5831\u901a\u4fe1\u5b66\u4f1a \u30b3\u30f3\u30d4\u30e5\u30c6\u30fc\u30b7\u30e7\u30f3\u7814\u7a76\u4f1a, 2022\u5e7412\u6708, (\u611b\u5a9b\u5927\u5b66, \u611b\u5a9b).<\/p>\n

Yudai Enomoto*, Yuki Kawakami, Kazuhisa Seto, Takashi Horiyama, and Jun Mitani:
\nCounting and ZDD-based Enumeration of Locally Flat-Foldable Box-Pleated Crease Patterns on the 45-Degree Grid System.
\nFifth Workshop on Enumeration Problems and Applications, November 2022, (Clermont-Ferrand, France).<\/p>\n

\u6cb3\u4e0a \u60a0\u8f1d*, \u9ad8\u6a4b \u99ff, \u810a\u6238 \u548c\u5bff, \u5800\u5c71 \u8cb4\u53f2, \u5c0f\u6797 \u7950\u8cb4, \u6771\u5ddd \u96c4\u54c9, \u52a0\u85e4 \u76f4\u6a39:
\n\u6700\u5c0f\u91cd\u307f Laman \u30b0\u30e9\u30d5\u306e\u7dcf\u4ea4\u70b9\u6570\u3068\u539a\u307f\u306e\u4e0b\u754c\u306e\u6539\u826f.
\n\u7b2c35\u56de\u56de\u8def\u3068\u30b7\u30b9\u30c6\u30e0\u30ef\u30fc\u30af\u30b7\u30e7\u30c3\u30d7, 2022\u5e748\u6708, (\u5317\u4e5d\u5dde\u56fd\u969b\u4f1a\u8b70\u5834, \u798f\u5ca1).
\n\u5968\u52b1\u8cde\u53d7\u8cde<\/strong><\/p>\n

\u6cb3\u4e0a \u60a0\u8f1d*, \u9ad8\u6a4b \u99ff, \u810a\u6238 \u548c\u5bff, \u5800\u5c71 \u8cb4\u53f2, \u5c0f\u6797 \u7950\u8cb4, \u6771\u5ddd \u96c4\u54c9, \u52a0\u85e4 \u76f4\u6a39:
\n\u6700\u5c0f\u91cd\u307f Laman \u30b0\u30e9\u30d5\u306e\u7dcf\u4ea4\u70b9\u6570\u3068\u539a\u307f\u306e\u4e0b\u754c\u306e\u6539\u826f.
\n2022\u5e74\u5ea6 \u590f\u306eLA\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0, 2022\u5e747\u6708, (\u306b\u304e\u308f\u3044\u4ea4\u6d41\u9928 AU, \u79cb\u7530).<\/p>\n

\u4e09\u8c37 \u548c\u6689*, \u810a\u6238 \u548c\u5bff, \u5800\u5c71 \u8cb4\u53f2, \u4e09\u91cd\u91ce \u7422\u4e5f:
\n\u533a\u9593\u6700\u9577\u56de\u6587\u30af\u30a8\u30ea\u306b\u5bfe\u3059\u308b\u6642\u9593\u6700\u9069\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0.
\n2022\u5e74\u5ea6 \u590f\u306eLA\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0, 2022\u5e747\u6708, (\u306b\u304e\u308f\u3044\u4ea4\u6d41\u9928 AU, \u79cb\u7530).<\/p>\n

\u9ad8\u6a4b \u99ff*, \u810a\u6238 \u548c\u5bff, \u5800\u5c71 \u8cb4\u53f2, \u4e09\u91cd\u91ce \u7422\u4e5f:
\n\u6587\u5b57\u5217\u4e2d\u306e\u7570\u306a\u308b\u9589\u6587\u5b57\u5217\u306e\u6570\u3048\u4e0a\u3052\u3068\u6700\u5927\u500b\u6570\u306b\u3064\u3044\u3066.
\n2022\u5e74\u5ea6 \u590f\u306eLA\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0, 2022\u5e747\u6708, (\u306b\u304e\u308f\u3044\u4ea4\u6d41\u9928 AU, \u79cb\u7530).<\/p>\n

\u698e\u672c \u512a\u5927*, \u6cb3\u4e0a \u60a0\u8f1d, \u810a\u6238 \u548c\u5bff, \u5800\u5c71 \u8cb4\u53f2, \u4e09\u8c37 \u7d14:
\n45 \u5ea6\u7cfb\u683c\u5b50\u30d1\u30bf\u30fc\u30f3\u306b\u304a\u3051\u308b\u5c40\u6240\u5e73\u5766\u6298\u308a\u53ef\u80fd\u306a\u5c55\u958b\u56f3\u306e\u6570\u3048\u4e0a\u3052\u3068 ZDD \u306b\u3088\u308b\u5217\u6319.
\n2021\u5e74\u5ea6 \u51ac\u306eLA\u30b7\u30f3\u30dd\u30b8\u30a6\u30e0, 2022\u5e742\u6708, (\u4eac\u90fd\u5927\u5b66, \u4eac\u90fd).<\/p>\n

2021\u5e74\u5ea6<\/strong><\/h3>\n

\u3010\u5b66\u4f1a\u767a\u8868\u3011\u3000* \u5370\u304c\u767a\u8868\u8005<\/strong><\/h4>\n

\u698e\u672c \u512a\u5927*, \u810a\u6238 \u548c\u5bff, \u5800\u5c71 \u8cb4\u53f2, \u4e09\u8c37 \u7d14:
\nZDD \u306b\u3088\u308b 45 \u5ea6\u7cfb\u683c\u5b50\u30d1\u30bf\u30fc\u30f3\u306b\u304a\u3051\u308b\u5c40\u6240\u5e73\u5766\u6298\u308a\u53ef\u80fd\u306a\u5c55\u958b\u56f3\u306e\u5217\u6319.
\n\u7b2c30\u56de\u6298\u308a\u7d19\u306e\u79d1\u5b66\u30fb\u6570\u5b66\u30fb\u6559\u80b2\u7814\u7a76\u96c6\u4f1a, 2021\u5e746\u6708 (\u30aa\u30f3\u30e9\u30a4\u30f3).<\/p>","protected":false},"excerpt":{"rendered":"

\u7814\u7a76\u6210\u679c \u7814\u7a76\u5ba4\u306e\u5b66\u751f\u304c\u542b\u307e\u308c\u308b\u7814\u7a76\u6210\u679c\u306e\u307f\u3092\u8f09\u305b\u3066\u3044\u307e\u3059\u3002 2025\u5e74\u5ea6 \u3010\u67fb… <\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"_links":{"self":[{"href":"https:\/\/art.ist.hokudai.ac.jp\/index.php?rest_route=\/wp\/v2\/pages\/38"}],"collection":[{"href":"https:\/\/art.ist.hokudai.ac.jp\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/art.ist.hokudai.ac.jp\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/art.ist.hokudai.ac.jp\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/art.ist.hokudai.ac.jp\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=38"}],"version-history":[{"count":28,"href":"https:\/\/art.ist.hokudai.ac.jp\/index.php?rest_route=\/wp\/v2\/pages\/38\/revisions"}],"predecessor-version":[{"id":1669,"href":"https:\/\/art.ist.hokudai.ac.jp\/index.php?rest_route=\/wp\/v2\/pages\/38\/revisions\/1669"}],"wp:attachment":[{"href":"https:\/\/art.ist.hokudai.ac.jp\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=38"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}