Exploring the Limits of Computation in the Scenario of Constrained Work Space

• Project Area: A multifaceted approach toward understanding the limitations of computation
• Project/Area Number: 24106004
• Research Category: Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
• Allocation Type: Single-year Grants
• Review Section: Science and Engineering
• Research Institution: Japan Advanced Institute of Science and Technology
• Principal Investigator: Asano Tetsuo 北陸先端科学技術大学院大学, 学長 (90113133)
• Co-Investigator(Kenkyū-buntansha): 上原 隆平 北陸先端科学技術大学院大学, 情報科学研究科, 教授 (00256471) ; 垂井 淳 電気通信大学, 情報理工学(系)研究科, 准教授 (00260539) ; 小野 廣隆 九州大学, 経済学研究科(研究院), 准教授 (00346826) ; 清見 礼 横浜市立大学, 総合科学部, 准教授 (30447685) ; 大舘 陽太 北陸先端科学技術大学院大学, 情報科学研究科, 助教 (80610196)
• Research Collaborator: Guenter Rote Freie Universität Berlin, Institut für Informatik, Professor ; Wolfgang Mulzer Freie Universität Berlin, Institut für Informatik, Professor ; Ovidiu Daescu University of Texas at Dallas, Department of Computer Science, Professor
• Project Period (FY): 2012-06-28 – 2017-03-31
• Project Status: Completed (Fiscal Year 2016)
• Budget Amount: ¥28,730,000 (Direct Cost: ¥22,100,000、Indirect Cost: ¥6,630,000); Fiscal Year 2016: ¥5,590,000 (Direct Cost: ¥4,300,000、Indirect Cost: ¥1,290,000); Fiscal Year 2015: ¥5,590,000 (Direct Cost: ¥4,300,000、Indirect Cost: ¥1,290,000); Fiscal Year 2014: ¥5,590,000 (Direct Cost: ¥4,300,000、Indirect Cost: ¥1,290,000); Fiscal Year 2013: ¥5,590,000 (Direct Cost: ¥4,300,000、Indirect Cost: ¥1,290,000); Fiscal Year 2012: ¥6,370,000 (Direct Cost: ¥4,900,000、Indirect Cost: ¥1,470,000)
• Keywords: アルゴリズム / 計算量 / 計算幾何学 / グラフアルゴリズム / 作業領域 / 最短経路問題 / 格子グラフ / 問題の下界 / 省メモリ / 下界

Outline of Final Research Achievements

In this research we have developed powerful techniques for analysis toward establishment of nontrivial lower and upper bounds on the constrained work space. The most fundamental problem is to seek for each entry in a given array of real numbers one of nearest greater values. Using linear size of work space we can design a linear time algorithm for solving the problem. Our problem is whether we can solve the problem in an efficient way using less work space. In this research we showed that we have an efficient algorithm using only constant amount of work space. We also had results on time and space tradeoffs on the problem. We obtained other many results in basic problems in computational geometry and graph theory.

Research Products

• [Journal Article] Common Developments of Three Incongruent Boxes of Area 30 (2017)
  • Author(s): D. Xu, T. Horiyama, T. Shirakawa, R. Uehara
  • Journal Title: Computational Geometry: Theory and Applications Volume: 印刷中 Pages: 1-17
  • DOI: 10.1016/j.comgeo.2017.03.001
  • NAID: 120005850316
  • Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] Induced minor free graphs: Isomorphism and clique-width (2017)
  • Author(s): R. Belmonte, Y.chi, P. Schweitzer
  • Journal Title: Algorithmica Volume: 印刷中 Issue: 1 Pages: 29-47
  • DOI: 10.1007/s00453-016-0234-8
  • Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] Extending partial representations of interval graphs (2017)
  • Author(s): P. Klavik, J. Kratochvil, Y.chi, T. Saitoh, T. Vyskocil
  • Journal Title: Algorithmica Volume: 印刷中 Issue: 3 Pages: 945-967
  • DOI: 10.1007/s00453-016-0186-z
  • Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] The robustest clusters in the input; output networks: global CO2 emission clusters (2017)
  • Author(s): Omar Rifki, H. Ono, S. Kagawa
  • Journal Title: J. of Economic Structures Volume: 6 Issue: 1 Pages: 1-29
  • DOI: 10.1186/s40008-017-0062-2
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] A New Algorithmic Framework for Basic Problems on Binary Images (2016)
  • Author(s): T. Asano, L. Buzer, and S. Bereg
  • Journal Title: Applied Mathematics Volume: 印刷中 Pages: 376-392
  • DOI: 10.1016/j.dam.2016.02.025
  • Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] Ferrers Dimension of Grid Intersection Graphs (2016)
  • Author(s): Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, and Ryuhei Uehara
  • Journal Title: Discrete Applied Mathematics Volume: to appear Pages: 130-135
  • DOI: 10.1016/j.dam.2015.05.035
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] On the treewidth of toroidal grids (2016)
  • Author(s): Yoshio Okamoto, Masashi Kiyomi, and Yota Otachi
  • Journal Title: Discrete Applied Mathematics Volume: 198 Pages: 303-306
  • DOI: 10.1016/j.dam.2015.06.027
  • Peer Reviewed
• [Journal Article] Finding a chain graph in a bipartite permutation graph (2016)
  • Author(s): Masashi Kiyomi, Yota Otachi
  • Journal Title: Information Processing Letters Volume: 印刷中 Issue: 9 Pages: 569-573
  • DOI: 10.1016/j.ipl.2016.04.006
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation (2016)
  • Author(s): Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono
  • Journal Title: Theory of Computing Systems Volume: 58 Issue: 1 Pages: 60-93
  • DOI: 10.1007/s00224-014-9565-5
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] The Convex Configurations of ``Sei Shonagon Chie no Ita,'' Tangram, and Other Silhouette Puzzles with Seven Pieces (2016)
  • Author(s): Eli Fox-Epstein, Kazuho Katsumata, and Ryuhei Uehara
  • Journal Title: IEICE Trans. on Inf. and Sys. Volume: 印刷中
  • NAID: 130005154230
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Common Unfolding of Regular Tetrahedron and JZ Solid (2016)
  • Author(s): Y. Araki, T. Horiyama, R. Uehara
  • Journal Title: Journal of Graph Algorithms and Applications Volume: 20 Issue: 1 Pages: 101-114
  • DOI: 10.7155/jgaa.00386
  • Peer Reviewed / Open Access
• [Journal Article] Folding a Paper Strip to Minimize Thickness (2016)
  • Author(s): Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, and Yushi Uno
  • Journal Title: Journal of Discrete Algorithms Volume: 36 Pages: 18-26
  • DOI: 10.1016/j.jda.2015.09.003
  • NAID: 120006380546
  • Peer Reviewed / Open Access / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares (2016)
  • Author(s): Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno,
  • Journal Title: Computational Geometry: Theory and Applications Volume: 51 Pages: 25-39
  • DOI: 10.1016/j.comgeo.2015.10.004
  • NAID: 120005954496
  • Peer Reviewed
• [Journal Article] Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs (2016)
  • Author(s): Matsuo Konagaya, Yota Otachi, and Ryuhei Uehara
  • Journal Title: Discrete Applied Mathematics Volume: 199 Pages: 37-45
  • DOI: 10.1016/j.dam.2015.01.040
  • NAID: 120006380549
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Thin strip graphs (2015)
  • Author(s): T. Hayashi, A. Kawamura, Y. Otachi, H. Shinohara, and K. Yamazaki
  • Journal Title: Discrete Applied Mathematics, to appear Volume: - Pages: 203-210
  • DOI: 10.1016/j.dam.2015.01.018
  • Peer Reviewed / Open Access
• [Journal Article] Approximability of Minimum Certificate Dispersal with Tree Structures (2015)
  • Author(s): Ta. Izumi, To. Izumi, H. Ono, K. Wada
  • Journal Title: Theoretical Computer Science Volume: 591 Pages: 5-14
  • DOI: 10.1016/j.tcs.2015.01.007
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Journal Article] Pattern Formation by Oblivious Asynchronous Mobile Robots (2015)
  • Author(s): Nao Fujinaga, Yukiko Yamauchi, Hirotaka Ono, Shuji Kijima, and Masafumi Yamashita
  • Journal Title: SIAM Journal on Computing Volume: 44 Issue: 3 Pages: 740-785
  • DOI: 10.1137/140958682
  • Peer Reviewed
• [Journal Article] Graph Orientations Optimizing the Number of Light or Heavy Vertices (2015)
  • Author(s): Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono
  • Journal Title: Journal of Graph Algorithms and Applications Volume: 19 Issue: 1 Pages: 441-465
  • DOI: 10.7155/jgaa.00371
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Journal Article] How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately (2015)
  • Author(s): Kazuya Haraguchi, Hirotaka Ono
  • Journal Title: Journal of Information Processing Volume: 23 Issue: 3 Pages: 276-283
  • DOI: 10.2197/ipsjjip.23.276
  • NAID: 130005070055
  • ISSN: 1882-6652
  • Peer Reviewed / Open Access
• [Journal Article] The searchlight problem for road networks (2015)
  • Author(s): Dariusz Dereniowski, Hirotaka Ono, Ichiro Suzuki, Lukasz Wrona, Masafumi Yamashita, Pawel Zylinski
  • Journal Title: Theoretical Computer Science Volume: 591 Pages: 28-59
  • DOI: 10.1016/j.tcs.2015.04.026
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Linear-Time Algorithm for Sliding Tokens on Trees (2015)
  • Author(s): Erik D Demaine, Martin L Demaine, Eli Fox-Epstein, Duc A Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, and Takeshi Yamada
  • Journal Title: Theoretical Computer Science Volume: 600 Pages: 132-142
  • DOI: 10.1016/j.tcs.2015.07.037
  • NAID: 120006355793
  • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] Extending partial representations of subclasses of chordal graphs (2015)
  • Author(s): Pavel Klavik, Jan Kratochvil, Yota Otachi, and Toshiki Saitoh
  • Journal Title: Theoretical Computer Science Volume: 576 Pages: 85-101
  • DOI: 10.1016/j.tcs.2015.02.007
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Completely independent spanning trees in (partial) k-trees (2015)
  • Author(s): Masayoshi Matsushita, Yota Otachi, and Toru Araki
  • Journal Title: Discussiones Mathematicae Graph Theory Volume: 35 Issue: 3 Pages: 427-437
  • DOI: 10.7151/dmgt.1806
  • Peer Reviewed
• [Journal Article] Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds (2015)
  • Author(s): Kazuyuki Amano, Kyaw May Oo, Yota Otachi, Ryuhei Uehara
  • Journal Title: IEICE Transactions on Information and Systems Volume: E98.D Issue: 3 Pages: 486-489
  • DOI: 10.1587/transinf.2014FCP0007
  • NAID: 130004841873
  • ISSN: 0916-8532, 1745-1361
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Swapping Labeled Tokens on Graphs (2015)
  • Author(s): Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
  • Journal Title: Theoretical Computer Science Volume: tbd
  • Peer Reviewed
• [Journal Article] Computational Complexity of Piano-Hinged Dissections (2014)
  • Author(s): Zachary Abel, Erik D. Demaine, Martin L. Demaine, Takashi Horimaya, Ryuhei Uehara
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E97.A Issue: 6 Pages: 1206-1212
  • DOI: 10.1587/transfun.E97.A.1206
  • NAID: 130004770850
  • ISSN: 0916-8508, 1745-1337
  • Peer Reviewed
• [Journal Article] Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane (2014)
  • Author(s): Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo Silveira, Ryuhei Uehara, Pavl Valtr, Birgit Vogtenhuber, Emo Welzl
  • Journal Title: Discrete Mathematics and Theoretical Computer Science Volume: 16
  • NAID: 120006675374
  • Peer Reviewed
• [Journal Article] UNO is hard, even for a single player (2014)
  • Author(s): E. D. Demaine, M. L. Demaine, N. J. A. Harvey, R. Uehara, T. Uno, Y. Uno
  • Journal Title: Theoretical Computer Science Volume: Vol.521 Pages: 51-61
  • DOI: 10.1016/j.tcs.2013.11.023
  • NAID: 120003184351
  • Peer Reviewed
• [Journal Article] Computational Complexity and an Integer Programming Model of Shakashaka (2014)
  • Author(s): Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E97.A Issue: 6 Pages: 1213-1219
  • DOI: 10.1587/transfun.E97.A.1213
  • NAID: 130004770851
  • ISSN: 0916-8508, 1745-1337
  • Peer Reviewed
• [Journal Article] Algorithmic aspects of distance constrained labeling: a survey (2014)
  • Author(s): Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
  • Journal Title: International Journal of Networking and Computing Volume: 4 Pages: 251-259
  • NAID: 130004709087
  • Peer Reviewed
• [Journal Article] Reconfigure on list L(2, 1)-labelings in a graph (2014)
  • Author(s): Takehiro Ito, Kazuto Kawamura, Hitotaka Ono and Xiao Zhou
  • Journal Title: Theoretical Computer Science (TCS) Volume: 544 Pages: 84-97
  • DOI: 10.1016/j.tcs.2014.04.011
  • NAID: 110009670153
  • Peer Reviewed
• [Journal Article] A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks (2014)
  • Author(s): Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
  • Journal Title: Theoretical Computer Science Volume: 544 Pages: 14-31
  • DOI: 10.1016/j.tcs.2014.04.014
  • NAID: 120005893622
  • Peer Reviewed
• [Journal Article] Efficient algorithms for network localization using cores of underlying graphs (2014)
  • Author(s): Meng Li, Yota Otachi, Takeshi Tokuyama
  • Journal Title: Theoretical Computer Science Volume: 553 Pages: 18-26
  • DOI: 10.1016/j.tcs.2014.02.020
  • Peer Reviewed
• [Journal Article] The graph isomorphism problem on geometric graphs (2014)
  • Author(s): Ryuhei Uehara
  • Journal Title: Discrete Mathematics and Theoretical Computer Science Volume: 16
  • NAID: 120005528185
  • Peer Reviewed
• [Journal Article] Base-object location problems for base-monotone regions (2013)
  • Author(s): J Chun, T. Horiyama, T. Ito, Natsuda Kaothanthong, H. Ono, Y. Otachi, T. Tokuyama, RUehara, and T. Uno
  • Journal Title: Theoretical Computer Science Volume: 555 Pages: 71-84
  • DOI: 10.1016/j.tcs.2013.11.030
  • Peer Reviewed / Open Access
• [Journal Article] Approximating the path-distance-width for AT-free graphs and graphs in related classes (2013)
  • Author(s): Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, and Koichi Yamazaki
  • Journal Title: Discrete Applied Mathematics Volume: -- Pages: 69-77
  • DOI: 10.1016/j.dam.2012.11.015
  • Peer Reviewed
• [Journal Article] A Small-Space Algorithm for Removing Small Connected Components from a Binary Image (2013)
  • Author(s): Tetsuo Asano and Revant Kumar
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E96.A Issue: 6 Pages: 1044-1050
  • DOI: 10.1587/transfun.E96.A.1044
  • NAID: 10031193788
  • ISSN: 0916-8508, 1745-1337
  • Peer Reviewed
• [Journal Article] Reporting All Segment Intersections Using an Arbitrary Sized Work Space (2013)
  • Author(s): Matsuo Konagaya and Tetsuo Asano
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E96.A Issue: 6 Pages: 1066-1071
  • DOI: 10.1587/transfun.E96.A.1066
  • NAID: 10031193791
  • ISSN: 0916-8508, 1745-1337
  • Peer Reviewed
• [Journal Article] Efficient algorithms for a simple network design problem (2013)
  • Author(s): Shin-ichi Nakano, Ryuhei Uehara, and Takeaki Uno
  • Journal Title: Networks Volume: 62 Issue: 2 Pages: 96-104
  • DOI: 10.1002/net.21500
  • Peer Reviewed
• [Journal Article] Tractabilities and Intractabilities on Geometric Intersection Graphs (2013)
  • Author(s): Ryuhei Uehara
  • Journal Title: Algorithms Volume: 6(1) Issue: 1 Pages: 60-83
  • DOI: 10.3390/a6010060
  • NAID: 120005300535
  • Peer Reviewed
• [Journal Article] Common Developments of Three Incongruent Orthogonal Boxes (2013)
  • Author(s): Toshihiro Shirakawa and Ryuhei Uehara
  • Journal Title: International Journal of Computational Geometry and Applications Volume: 23(1) Issue: 01 Pages: 65-71
  • DOI: 10.1142/s0218195913500040
  • NAID: 120005323060
  • Peer Reviewed
• [Journal Article] Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression (2013)
  • Author(s): Takeaki Uno, Ryuhei Uehara, and Shin-ichi Nakano
  • Journal Title: Discrete Mathematics, Algorithms and Applications Volume: 5(2) Issue: 02 Pages: 1360001-1360014
  • DOI: 10.1142/s179383091360001x
  • NAID: 120005367953
  • Peer Reviewed
• [Journal Article] Variations on Instant Insanity (2013)
  • Author(s): Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, and Ryuhei Uehara
  • Journal Title: Lecture Notes in Computer Science Volume: 8066 Pages: 33-47
  • DOI: 10.1007/978-3-642-40273-9_4
  • NAID: 110009768498
  • ISBN: 9783642402722, 9783642402739
  • Peer Reviewed
• [Journal Article] Computational complexity and an integer programming model of Shakashaka (2013)
  • Author(s): Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara and Yushi Uno
  • Journal Title: Canadian Conference on Computational Geometry Volume: 25 Pages: 31-36
  • NAID: 130004770851
  • Peer Reviewed
• [Journal Article] Zipper Unfoldability of Domes and Prismoids (2013)
  • Author(s): Erik D. Demaine, Martin Demaine and Ryuhei Uehara
  • Journal Title: Canadian Conference on Computational Geometry Volume: 25 Pages: 43-48
  • NAID: 120006675377
  • Peer Reviewed
• [Journal Article] Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane (2013)
  • Author(s): Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo Silveira, Ryuhei Uehara, Birgit Vogtenhuber and Emo Welzl
  • Journal Title: Canadian Conference on Computational Geometry Volume: 25 Pages: 169-174
  • NAID: 120006675374
  • Peer Reviewed
• [Journal Article] Optimal approximability of bookmark assignments (2013)
  • Author(s): Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono
  • Journal Title: Discrete Applied Mathematics Volume: 161(16-17) Issue: 16-17 Pages: 2361-2366
  • DOI: 10.1016/j.dam.2013.05.018
  • Peer Reviewed
• [Journal Article] Coalescing Random Walks and Voting on Connected Graphs (2013)
  • Author(s): Colin Cooper, Robert Elsaesser, Hirotaka Ono, Tomasz Radzik
  • Journal Title: SIAM J. Discrete Math. Volume: 27(4) Issue: 4 Pages: 1748-1758
  • DOI: 10.1137/120900368
  • Peer Reviewed
• [Journal Article] Recent Advances on Distance Constrained Labeling Problems (2013)
  • Author(s): Hirotaka Ono
  • Journal Title: Proceedings of First International Symposium on Computing and Networking (CANDAR) Volume: - Pages: 26-29
  • Peer Reviewed
• [Journal Article] On the Treewidth of Toroidal Graphs (2013)
  • Author(s): Masashi Kiyomi, Yoshio Okamoto, Yota Otachi
  • Journal Title: Japan Conference on Discrete and Computational Geometry and Graphs Volume: 16 Pages: 76-77
  • Peer Reviewed
• [Journal Article] Memory-constrained algorithms for simple polygons (2013)
  • Author(s): Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Gunter Rote, Andre Schulz
  • Journal Title: Comput. Geom. Volume: 46(8) Issue: 8 Pages: 959-969
  • DOI: 10.1016/j.comgeo.2013.04.005
  • Peer Reviewed
• [Journal Article] Priority Queues and Sorting for Read-Only Data (2013)
  • Author(s): Tetsuo Asano, Amr Elmasry, Jyrki Katajainen
  • Journal Title: Proceedings of TAMC Volume: LNCS 7876 Pages: 32-41
  • DOI: 10.1007/978-3-642-38236-9_4
  • ISBN: 9783642382352, 9783642382369
  • Peer Reviewed
• [Journal Article] Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems (2013)
  • Author(s): Tetsuo Asano, David G. Kirkpatrick
  • Journal Title: Proceedings of WADS Volume: LNCS 8037 Pages: 61-72
  • DOI: 10.1007/978-3-642-40104-6_6
  • ISBN: 9783642401039, 9783642401046
  • Peer Reviewed
• [Journal Article] The path-distance-width of hypercubes (2013)
  • Author(s): Yota Otachi
  • Journal Title: Discussiones Mathematicae Graph Theory Volume: 33 Issue: 2 Pages: 467-470
  • DOI: 10.7151/dmgt.1682
  • Peer Reviewed
• [Journal Article] Isomorphism on subgraph-closed graph classes: a complexity dichotomy and intermediate graph classes (2013)
  • Author(s): Yota Otachi and Pascal Schweitzer
  • Journal Title: Lecture Notes in Computer Science Volume: 8283 Pages: 111-118
  • DOI: 10.1007/978-3-642-45030-3_11
  • ISBN: 9783642450297, 9783642450303
  • Peer Reviewed
• [Journal Article] Bounded representations of interval and proper interval graphs (2013)
  • Author(s): Martin Balko, Pavel Klavik, and Yota Otachi
  • Journal Title: Lecture Notes in Computer Science Volume: 8283 Pages: 535-546
  • DOI: 10.1007/978-3-642-45030-3_50
  • ISBN: 9783642450297, 9783642450303
  • Peer Reviewed
• [Journal Article] On shortest barriers (2013)
  • Author(s): Akitoshi Kawamura, Sonoko Moriyama, and Yota Otachi
  • Journal Title: Japan Conference on Discrete and Computational Geometry and Graphs Volume: 16 Pages: 102-102
  • Peer Reviewed
• [Journal Article] Feasibility of Polynomial-time Randomized Gathering for Oblivious Mobile Robots (2013)
  • Author(s): Taisuke Izumi, Tomoko Izumi, Sayaka Kamei, Fukuhito Oosita
  • Journal Title: IEEE Transactions on Parallel and Distributed Systems Volume: Vol. 24, No. 4 Issue: 4 Pages: 716-723
  • DOI: 10.1109/tpds.2012.212
  • Peer Reviewed
• [Journal Article] Scalable Estimation of Network Average Degree (2013)
  • Author(s): Taisuke Izumi and Hironobu Kanzaki
  • Journal Title: Lecture Notes in Computer Science Volume: 8255 Pages: 367-369
  • DOI: 10.1007/978-3-319-03089-0_32
  • ISBN: 9783319030883, 9783319030890
  • Peer Reviewed
• [Journal Article] Coverage with k-Transmitters in the Presence of Obstacles (2013)
  • Author(s): B. Ballinger, N. Benbernou, P. Bose, M. Damian, E. D. Demaine, V. Dujmović, R. Flatland, F. Hurtado, J. Iacono, A. Lubiw, P. Morin, V. Sacristán, D. Souvaine, and R. Uehara
  • Journal Title: Journal of Combinatorial Optimization Volume: Vol.25(2) Issue: 2 Pages: 208-233
  • DOI: 10.1007/s10878-012-9475-x
  • NAID: 120005850318
  • Peer Reviewed
• [Journal Article] Route-Enabling Graph Orientation Problems (2013)
  • Author(s): Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
  • Journal Title: Algorithmica Volume: 65(2) Issue: 2 Pages: 317-338
  • DOI: 10.1007/s00453-011-9589-z
  • NAID: 120005850325
  • Peer Reviewed
• [Journal Article] A Small-Space Algorithm for Removing Small Connected Components from a Binary Image (2013)
  • Author(s): Tetsuo Asano and Revant Kumar
  • Journal Title: IEICE Trans. EA, Special Section on Discrete Mathematics and Its Applications Volume: -
  • NAID: 10031193788
  • Peer Reviewed
• [Journal Article] Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs (2013)
  • Author(s): Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara
  • Journal Title: IEICE Transactions on Information and Systems Volume: E96.D Issue: 3 Pages: 426-432
  • DOI: 10.1587/transinf.E96.D.426
  • NAID: 10031167427
  • ISSN: 0916-8532, 1745-1361
  • Peer Reviewed
• [Journal Article] Algorithm for Reporting All Segment Intersections Using Work Space of Arbitrary Size (2013)
  • Author(s): Matsuo Konagaya and Tetsuo Asano
  • Journal Title: IEICE Trans. EA, Special Section on Discrete Mathematics and Its Applications Volume: -
  • NAID: 110009564280
  • Peer Reviewed
• [Journal Article] The complexity of the stamp folding problem (2013)
  • Author(s): Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito, and Yoshio Okamoto
  • Journal Title: Theoretical Computer Science Volume: -- Pages: 13-19
  • DOI: 10.1016/j.tcs.2012.08.006
  • Peer Reviewed
• [Journal Article] Computational Complexity of Piano-Hinged Dissections (2013)
  • Author(s): Zachary Abel, Erik D. Demaine, Martin L. Demaine, Takashi Horiyama and Ryuhei Uehara
  • Journal Title: Proc. The European Workshop on Computational Geometry (EuroCG 2013) Volume: -
  • NAID: 130004770850
  • Peer Reviewed
• [Journal Article] Base Location Problems for Base-Monotone Regions (2013)
  • Author(s): Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
  • Journal Title: 7^<th> International Workshop on Algorithms and Computation Volume: 7748 Pages: 53-64
  • DOI: 10.1007/978-3-642-36065-7_7
  • ISBN: 9783642360640, 9783642360657
  • Peer Reviewed
• [Journal Article] A linear time algorithm for L(2, 1)-labeling of trees (2012)
  • Author(s): Hasunuma T., Ishii T., Ono H., Uno Y.
  • Journal Title: Algorithmica Volume: (印刷中) Issue: 3 Pages: 654-681
  • DOI: 10.1007/s00453-012-9657-z
  • NAID: 110007995596
  • Peer Reviewed
• [Journal Article] In-place Algorithm for Erasing a Connected Component in a Binary Image (2012)
  • Author(s): Tetsuo Asano
  • Journal Title: Theory of Computing Systems Volume: 50(1) Issue: 1 Pages: 111-123
  • DOI: 10.1007/s00224-011-9335-6
  • Peer Reviewed
• [Journal Article] NP-completeness of generalized Kaboozle (2012)
  • Author(s): Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
  • Journal Title: Journal of Information Processing Volume: 20 Issue: 3 Pages: 713-718
  • DOI: 10.2197/ipsjjip.20.713
  • NAID: 130002116381
  • ISSN: 1882-6652
  • Peer Reviewed
• [Journal Article] Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks (2012)
  • Author(s): Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente
  • Journal Title: Information Sciences Volume: 197 Pages: 77-90
  • DOI: 10.1016/j.ins.2012.01.038
  • NAID: 120003184350
  • Peer Reviewed
• [Journal Article] Ghost Chimneys (2012)
  • Author(s): D. Charlton, E. D. Demaine, M. L. Demaine, V. Dujmović, P. Morin, and R. Uehara
  • Journal Title: International Journal of Computational Geometry and Applications Volume: Vol.22, No.3 Issue: 03 Pages: 207-214
  • DOI: 10.1142/s0218195912500057
  • NAID: 120005147907
  • Peer Reviewed
• [Journal Article] Bipartite Permutation Graphs are Reconstructible (2012)
  • Author(s): Masashi Kiyomi, Toshiki Saitoh, and Ryuhei Uehara
  • Journal Title: Discrete Mathematics, Algorithms and Applications Volume: 4(3) Issue: 03 Pages: 1-14
  • DOI: 10.1142/s1793830912500395
  • NAID: 120005316240
  • Peer Reviewed
• [Journal Article] On space complexity of self-stabilizing leader election in mediated population protocol (2012)
  • Author(s): Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
  • Journal Title: Distributed Computing Volume: 25 Issue: 6 Pages: 451-460
  • DOI: 10.1007/s00446-012-0173-9
  • NAID: 110007995639
  • Peer Reviewed
• [Journal Article] On bipartite powers of bigraphs (2012)
  • Author(s): Yoshio Okamoto, Yota Otachi, and Ryuhei Uehara
  • Journal Title: Discrete Mathematics and Theoretical Computer Science Volume: 14(2) Pages: 11-20
  • NAID: 120005147908
  • Peer Reviewed
• [Journal Article] On Covering of Any Point Configuration by Disjoint Unit Disks (2012)
  • Author(s): Yosuke Okayama, Masashi Kiyomi, and Ryuhei Uehara
  • Journal Title: Geombinatorics Volume: XXI(1) Pages: 14-23
  • NAID: 120006675019
  • Peer Reviewed
• [Journal Article] Covering points with disjoint unit disks (2012)
  • Author(s): Greg Aloupis, Robert Hearn, Hirokazu Iwasawa and Ryuhei Uehara
  • Journal Title: Proc. The 24th Canadian Conference on Computational Geometry (CCCG 2012) Volume: - Pages: 41-46
  • Peer Reviewed
• [Journal Article] A New Framework for Connected Components Labeling of Binary Images (2012)
  • Author(s): Tetsuo Asano and Sergey Bereg
  • Journal Title: Proc. the 15th International Workshop on Combinatorial Image Analysis Volume: - Pages: 90-102
  • NAID: 110009768653
  • Peer Reviewed
• [Journal Article] Small Work Space Algorithms for Some Basic Problems on Binary Images (2012)
  • Author(s): Tetsuo Asano, Sergey Bereg, and Lilian Buzer
  • Journal Title: Proc. the 15th International Workshop on Combinatorial Image Analysis Volume: - Pages: 103-114
  • Peer Reviewed
• [Journal Article] Memory-Constrained Algorithms for Simple Polygons (2012)
  • Author(s): Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Gunter Rote, and Andre Schulz
  • Journal Title: Proc. European Workshop on Computational Geometry Volume: -
  • Peer Reviewed
• [Journal Article] On Complexity of Flooding Games on Graphs with Interval Representations (2012)
  • Author(s): Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno and Yushi Uno
  • Journal Title: Proc. Thailand-Japan Joint Conference on Computational Geometry and Graphs (TJJCCGG 2012) Volume: -
  • Peer Reviewed
• [Journal Article] Algorithms for Computing Optimal Image Segmentation using Quadtree Decomposition (2012)
  • Author(s): Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, and Takeaki Uno
  • Journal Title: Proc. Thailand-Japan Joint Conference on Computational Geometry and Graphs (TJJCCGG 2012) Volume: -
  • Peer Reviewed
• [Journal Article] Packing Trominoes is NP-Complete, #P-hard and ASP-Complete (2012)
  • Author(s): Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki and Ryuhei Uehara
  • Journal Title: Proc. The 24th Canadian Conference on Computational Geometry (CCCG 2012) Volume: - Pages: 219-224
  • Peer Reviewed
• [Journal Article] A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (2012)
  • Author(s): Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno
  • Journal Title: Lecture Notes in Computer Science Volume: 7357 Pages: 24-35
  • DOI: 10.1007/978-3-642-31155-0_3
  • NAID: 120005954496
  • ISBN: 9783642311543, 9783642311550
  • Peer Reviewed / Open Access
• [Journal Article] A 4.31-approximation for the geometric unique coverage problem on unit disks (2012)
  • Author(s): Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno
  • Journal Title: Lecture Notes in Computer Science Volume: 7676 Pages: 372-381
  • DOI: 10.1007/978-3-642-35261-4_40
  • NAID: 120005893622
  • ISBN: 9783642352607, 9783642352614
  • Peer Reviewed
• [Journal Article] Efficient enumeration of the directed binary perfect phylogenies from incomplete data (2012)
  • Author(s): Masashi Kiyomi, Yoshio Okamoto, and Toshiki Saitoh
  • Journal Title: Lecture Notes in Computer Science Volume: 7276 Pages: 248-259
  • DOI: 10.1007/978-3-642-30850-5_22
  • NAID: 110009588447
  • ISBN: 9783642308499, 9783642308505
  • Peer Reviewed
• [Journal Article] Common Developments of Three Different Orthogonal Boxes (2012)
  • Author(s): Toshihiro Shirakawa and Ryuhei Uehara
  • Journal Title: Proc. The 24th Canadian Conference on Computational Geometry (CCCG 2012) Volume: - Pages: 19-23
  • Peer Reviewed
• [Presentation] On the Maximum Weight Minimal Separator (2017)
  • Author(s): T. Hanaka, Hans L. Bodlaender, T. van der Zanden, H. Ono
  • Organizer: The 14th Conference on Theory and Applications of Models of Computation
  • Place of Presentation: Bern, Switzerland
  • Year and Date: 2017-04-20
  • Int'l Joint Research
• [Presentation] Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns (2017)
  • Author(s): K. Ouchi and R. Uehara
  • Organizer: The 11th International Conference and Workshops on Algorithms and Computation
  • Place of Presentation: Hsinchu, Taiwan
  • Year and Date: 2017-03-29
  • Int'l Joint Research
• [Presentation] Sliding tokens on block graphs (2017)
  • Author(s): D. Hoang, E. Fox-Epstein and R. Uehara
  • Organizer: The 11th International Conference and Workshops on Algorithms and Computation
  • Place of Presentation: Hsinchu, Taiwan
  • Year and Date: 2017-03-29
  • Int'l Joint Research
• [Presentation] Sequentially Swapping Colored Tokens on Graphs (2017)
  • Author(s): K. Yamanaka, E. D. Demaine, T. Horiyama, A. Kawamura, S. Nakano, Y. Okamoto, T. Saitoh, A. Suzuki, R. Uehara and T. Uno
  • Organizer: The 11th International Conference and Workshops on Algorithms and Computation
  • Place of Presentation: Hsinchu, Taiwan
  • Year and Date: 2017-03-29
  • Int'l Joint Research
• [Presentation] Safe sets in graphs: Graph classes and structural parameters (2016)
  • Author(s): R. Agueda, N. Cohen, S. Fujita, S. Legay, Y. Manoussakis, Y. Matsui, L. Montero, R. Naserasr, Y. Otachi, T. Sakuma, Z. Tuza, R. Xu
  • Organizer: The 10th Annual International Conference on Combinatorial Optimization and Applications
  • Place of Presentation: Hong Kong, China
  • Year and Date: 2016-12-16
  • Int'l Joint Research
• [Presentation] Shortest Reconfiguration of Sliding Tokens on a Caterpillar (2016)
  • Author(s): Takeshi Yamada and Ryuhei Uehara
  • Organizer: International Workshop on Algorithms and Computation (WALCOM 2016)
  • Place of Presentation: Kathmandu, Nepal
  • Year and Date: 2016-03-29
  • Int'l Joint Research
• [Presentation] Sliding Token on Bipartite Permutation Graphs (2015)
  • Author(s): Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, and Ryuhei Uehara
  • Organizer: International Symposium on Algorithms and Computation (ISAAC 2015)
  • Place of Presentation: Nagoya Marriott Associa Hotel, Nagoya, Japan
  • Year and Date: 2015-12-09
  • Int'l Joint Research
• [Presentation] The Complexity of Dominating Set Reconfiguration (2015)
  • Author(s): Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki and Youcef Tebbal
  • Organizer: International Symposium on Algorithms and Data Structures (WADS 2015)
  • Place of Presentation: Victoria, BC, Canada
  • Year and Date: 2015-08-05
  • Int'l Joint Research
• [Presentation] Swapping Colored Tokens on Graphs (2015)
  • Author(s): Katsuhisa Yamanaka, Takashi Horiyama, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara and Yushi Uno
  • Organizer: International Symposium on Algorithms and Data Structures (WADS 2015)
  • Place of Presentation: Victoria, BC, Canada
  • Year and Date: 2015-08-05
  • Int'l Joint Research
• [Presentation] Competitive Diffusion on Weighted Graphs (2015)
  • Author(s): Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka and Xiao Zhou
  • Organizer: International Symposium on Algorithms and Data Structures (WADS 2015)
  • Place of Presentation: Victoria, BC, Canada
  • Year and Date: 2015-08-05
  • Int'l Joint Research
• [Presentation] Computational Complexity of Puzzles and Games (2015)
  • Author(s): Ryuhei Uehara
  • Organizer: International Colloquium on Automata, Languages, and Programming (ICALP 2015)
  • Place of Presentation: Grand Prince Hotel Kyoto, Kyoto, Japan
  • Year and Date: 2015-07-06
  • Int'l Joint Research / Invited
• [Presentation] Induced minor free graphs: Isomorphism and clique-width (2015)
  • Author(s): Remy Belmonte, Yota Otachi, and Pascal Schweitzer
  • Organizer: International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015)
  • Place of Presentation: Munich, Germany
  • Year and Date: 2015-06-17
  • Int'l Joint Research
• [Presentation] Subgraph Domatic Problem and Writing Capacity of Devices with Restricted State Transitions (2015)
  • Author(s): Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono
  • Organizer: IEEE International Symposium on Information Theory (ISIT 2015)
  • Place of Presentation: Hong Konga, China
  • Year and Date: 2015-06-14
  • Int'l Joint Research
• [Presentation] Common Developments of Three Incongruent Boxes of Area 30 (2015)
  • Author(s): Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa and Ryuhei Uehara
  • Organizer: Annual Conference on Theory and Applications of Models of Computation (TAMC 2015)
  • Place of Presentation: Singapore
  • Year and Date: 2015-05-18
  • Int'l Joint Research
• [Presentation] Reconfiguration of cliques in a graph (2015)
  • Author(s): Takehiro Ito, Hirotaka Ono, Yota Otachi
  • Organizer: Annual Conference on Theory and Applications of Models of Computation (TAMC 2015)
  • Place of Presentation: Singapore
  • Year and Date: 2015-05-18
  • Int'l Joint Research
• [Presentation] Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid (2015)
  • Author(s): Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara
  • Organizer: WALCOM 2015
  • Place of Presentation: Dhaka, Bangladesh
  • Year and Date: 2015-02-26 – 2015-02-28
• [Presentation] Folding a Paper Strip to Minimize Thickness (2015)
  • Author(s): Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
  • Organizer: WALCOM 2015
  • Place of Presentation: Dhaka, Bangladesh
  • Year and Date: 2015-02-26 – 2015-02-28
• [Presentation] A Fixed-Parameter Algorithm for Max Edge Domination (2015)
  • Author(s): Tesshu Hanaka, Hirotaka Ono
  • Organizer: SOFSEM 2015 (Student Research Forum Papers / Posters)
  • Place of Presentation: Pec pod Snezkou, Czech Republic
  • Year and Date: 2015-01-24 – 2015-01-29
• [Presentation] Depth-First Search Using O(n) Bits (2014)
  • Author(s): Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Yota Otachi, Hirotaka Ono, Pascal Schweitzer, Jun Tarui and Ryuhei Uehara
  • Organizer: ISAAC2014
  • Place of Presentation: Jeonju, Korea
  • Year and Date: 2014-12-15 – 2014-12-17
• [Presentation] Polynomial-Time Algorithm for Sliding Tokens on Trees (2014)
  • Author(s): Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
  • Organizer: ISAAC 2014
  • Place of Presentation: Jeonju, Korea
  • Year and Date: 2014-12-15 – 2014-12-17
• [Presentation] Fixed-Parameter Tractability of Token Jumping on Planar Graphs (2014)
  • Author(s): Takehiro Ito, Marcin Kaminski, Hirotaka Ono
  • Organizer: ISAAC 2014
  • Place of Presentation: Jeonju, Korea
  • Year and Date: 2014-12-15 – 2014-12-17
• [Presentation] Flat Foldings of Plane Graphs with Prescribed Angles and Edge (2014)
  • Author(s): Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara
  • Organizer: GD 2014
  • Place of Presentation: Wurzburg, Germany
  • Year and Date: 2014-09-24 – 2014-09-26
• [Presentation] O(\sqrt{n})-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability (2014)
  • Author(s): Tetsuo Asano, David G. Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe
  • Organizer: MFCS 2014
  • Place of Presentation: Budpest, Hungary
  • Year and Date: 2014-08-25 – 2014-08-29
• [Presentation] Bumpy Pyramid Folding (2014)
  • Author(s): Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara
  • Organizer: CCCG 2014
  • Place of Presentation: Halifax, Nova Scotia, Canada
  • Year and Date: 2014-08-11 – 2014-08-13
• [Presentation] The Convex Configurations of ``Sei Shonagon Chie no Ita'' and Other Dissection Puzzles (2014)
  • Author(s): Eli Fox-Epstein, Ryuhei Uehara
  • Organizer: CCCG 2014
  • Place of Presentation: Halifax, Nova Scotia, Canada
  • Year and Date: 2014-08-11 – 2014-08-13
• [Presentation] Extending partial representations of proper and unit interval graphs (2014)
  • Author(s): Pavel Klavik, Jan Kratochvil, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomas Vyskocil
  • Organizer: SWAT 2014
  • Place of Presentation: Copenhagen, Denmark
  • Year and Date: 2014-07-02 – 2014-07-04
• [Presentation] Reduction techniques for graph isomorphism in the context of width parameters (2014)
  • Author(s): Yota Otachi, Pascal Schweitzer
  • Organizer: SWAT 2014
  • Place of Presentation: Copenhagen, Denmark
  • Year and Date: 2014-07-02 – 2014-07-04
• [Presentation] Approximability of Latin Square Completion-Type Puzzles (2014)
  • Author(s): Kazuya Haraguchi, Hirotaka Ono
  • Organizer: FUN 2014
  • Place of Presentation: Sicily, Italy
  • Year and Date: 2014-07-01 – 2014-07-03
• [Presentation] Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set (2014)
  • Author(s): Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
  • Organizer: FUN 2014
  • Place of Presentation: Sicily, Italy
  • Year and Date: 2014-07-01 – 2014-07-03
• [Presentation] Swapping Labeled Tokens on Graphs (2014)
  • Author(s): Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
  • Organizer: FUN 2014
  • Place of Presentation: Sicily, Italy
  • Year and Date: 2014-07-01 – 2014-07-03
• [Presentation] Intersection Dimension of Bipartite Graphs (2014)
  • Author(s): Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
  • Organizer: TAMC 2014
  • Place of Presentation: Chennai, India
  • Year and Date: 2014-04-11 – 2014-04-13
• [Presentation] On the Parameterized Complexity for Token Jumping on Graphs (2014)
  • Author(s): Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
  • Organizer: TAMC 2014
  • Place of Presentation: Chennai, India
  • Year and Date: 2014-04-11 – 2014-04-13
• [Presentation] Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs (2014)
  • Author(s): Matsuo Konagaya, Yota Otachi, Ryuhei Uehara
  • Organizer: TAMC 2014
  • Place of Presentation: Chennai, India
  • Year and Date: 2014-04-11 – 2014-04-13
• [Presentation] Isomorphism on subgraph-closed graph classes: a complexity dichotomy and intermediate graph classes (2014)
  • Author(s): 大舘 陽太，Pascal Schweitzer
  • Organizer: 2013年度 冬のLAシンポジウム
  • Place of Presentation: 京都大学
• [Presentation] Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs (2014)
  • Author(s): Matsuo Konagaya, Yota Otachi, and Ryuhei Uehara
  • Organizer: 情報処理学会アルゴリズム研究会
  • Place of Presentation: 中央大学
• [Presentation] キャタピラグラフの独立点集合遷移問題に対する多項式時間アルゴリズム (2014)
  • Author(s): 山田 武，上原 隆平
  • Organizer: 情報処理学会アルゴリズム研究会
  • Place of Presentation: 中央大学
• [Presentation] Zipper Unfolding of Simple Convex Polyhedra (2014)
  • Author(s): Erik D. Demaine, Martin L. Demaine, and Ryuhei Uehara
  • Organizer: 情報処理学会アルゴリズム研究会
  • Place of Presentation: 函館市民会館
• [Presentation] On Complexity of Distributed Diameter Approximation (2014)
  • Author(s): Taisuke Izumi and Roger Wattenhofer
  • Organizer: 電子情報通信学会コンピュテーション研究会
  • Place of Presentation: 明治大学
• [Presentation] Enumerating All Maximal Cliques in Unit Disk Graphs (2014)
  • Author(s): Daisuke Suzuki and Taisuke Izumi
  • Organizer: 40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM2014)
  • Place of Presentation: Hotel Atrium, Slovakia
• [Presentation] 最大辺支配問題に対する貪欲法の近似率解析 (2013)
  • Author(s): 土中哲秀，小野廣隆
  • Organizer: 火の国情報シンポジウム
  • Place of Presentation: 熊本大学
  • Year and Date: 2013-03-14
• [Presentation] On low congestion spanning trees (2013)
  • Author(s): 大舘 陽太
  • Organizer: KSMAP研究会
  • Place of Presentation: 京都大学
• [Presentation] 遮光線の長さについて (2013)
  • Author(s): 大舘 陽太，河村 彰星，森山 園子
  • Organizer: 2013年度 夏のLAシンポジウム
  • Place of Presentation: 休暇村志賀島
• [Presentation] Algorithms for independent set reconfiguration problem on graphs (2013)
  • Author(s): Erik D. Demaine, Martin L. Demaine, Takehiro Ito, Hirotaka Ono, and Ryuhei Uehara
  • Organizer: 電子情報通信学会コンピュテーション研究会
  • Place of Presentation: 沖縄産業支援センター
• [Presentation] Bumpy Pyramid Folding Problem (2013)
  • Author(s): Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, and Ryuhei Uehara
  • Organizer: 情報処理学会アルゴリズム研究会
  • Place of Presentation: 岩手県花巻市
• [Presentation] Computational Complexity of Piano-Hinged Dissections (2013)
  • Author(s): Zachary Abel, Erik D. Demaine, Martin L. Demaine, Takashi Horiyama, and Ryuhei Uehara
  • Organizer: 情報処理学会アルゴリズム研究会
  • Place of Presentation: 小樽商科大学
• [Presentation] On Computational Complexity and an Integer Programming model of Shakashaka (2013)
  • Author(s): Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, and Yushi Uno
  • Organizer: 電子情報通信学会コンピュテーション研究会
  • Place of Presentation: 神戸大学
• [Presentation] The Graph Isomorphism Problem on Geometric graphs (2013)
  • Author(s): Ryuhei Uehara
  • Organizer: The 2nd Pacific Rim Mathematical Association (PRIMA)
  • Place of Presentation: 上海交通大学，中国
• [Presentation] The graph isomorphism problem on graphs with geometric represenations (2013)
  • Author(s): Ryuhei Uehara
  • Organizer: 4th Biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM)
  • Place of Presentation: Memorial University of Newfoundland, Canada
• [Presentation] On generation of graphs with geometric representations (2013)
  • Author(s): Ryuhei Uehara
  • Organizer: 4th Biennial Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM)
  • Place of Presentation: Memorial University of Newfoundland, Canada
• [Presentation] On Enumerating All Maximal Cliques in Unit Disk Graphs (2013)
  • Author(s): Daisuke Suzuki and Taisuke Izumi
  • Organizer: 電子情報通信学会コンピュテーション研究会
  • Place of Presentation: 沖縄産業支援センター
• [Presentation] On Parallel Complexity of MapReduce Computation (2013)
  • Author(s): Koichi Wada and Taisuke Izumi
  • Organizer: 電子情報通信学会コンピュテーション研究会
  • Place of Presentation: 小樽商科大学
• [Presentation] 計算の複雑さと証明の複雑さ (2012)
  • Author(s): 垂井淳
  • Organizer: 京大数理研研究集会「証明論と複雑性」, 京大数理研講究録
  • Place of Presentation: 京都大学数理解析研究所
  • Year and Date: 2012-09-12
  • Invited
• [Book] Reverse Search; Enumeration Algorithms (2016)
  • Author(s): M. Kiyomi
  • Total Pages: 371
  • Publisher: Springer
• [Book] ORIGAMI6 (2016)
  • Author(s): Koryo Miura, Toshikazu Kawasaki, Tomohiro Tachi, Ryuhei Uehara, Robert J. Lang, and Patsy Wang-Inverson (Editors)
  • Total Pages: 744
  • Publisher: American Mathematical Society
• [Book] ガードナーの数学娯楽 (2015)
  • Author(s): マーティン・ガードナー著，岩沢宏和・上原隆平訳
  • Total Pages: 340
  • Publisher: 日本評論社
• [Book] ガードナーの数学パズル・ゲーム (2015)
  • Author(s): マーティン・ガードナー著，岩沢宏和・上原隆平訳
  • Total Pages: 288
  • Publisher: 日本評論社
• [Book] はじめてのアルゴリズム (2013)
  • Author(s): 上原隆平
  • Total Pages: 183
  • Publisher: 近代科学社
• [Book] 折り紙の情報科学への応用（3.1章），『折紙の数理とその応用』 (2012)
  • Author(s): 上原隆平（日本応用数理学会監修，野島武敏，萩原一郎編）
  • Total Pages: 255
  • Publisher: 共立出版
• [Book] 近代科学社 (2012)
  • Author(s): 上原 隆平(訳), ジョセフ・オルーク(著)
  • Total Pages: 235
  • Publisher: 折り紙のすうり