Publications of 2014 Publications of 2015 Publications of 2016 Publications of 2018

A: Sublinear-time Algorithm Group (Team A)

D: Sublinear Data Structure Group (Team D)

M: Sublinear-time Modeling Group (Team M)

## Award

D Kengo Nakamura, Best Student Paper, The 28th International Symposium on Algorithms and Computation (ISAAC2017), 12/12/17.

D Shinichi Yamagiwa, Selected for finalist, IoT Project Contest.

## Conferences

### Invited talks

A Adnan Sljoka, “Probing allosteric communication with long-range rigidity propagation across protein networks”, 100th Canadian Chemistry Conference, Toronto, Canada, 30/05/17.

A Naoki Katoh, “Characterizing minimal rigidity of square-grid frameworks with holes”, The 20th Anniversary of the Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2017), Tokyo, Japan, 31/08/17.

A Naoki Katoh, “Recent developments of combinatorial rigidity theory”, International Conference on Mathematical Modeling and Applications Based on Self-Organization (ICMMA 2017), Tokyo, Japan, 11/12/17.

A Naoki Katoh, “Optimal sink location problems on dynamic flow networks”, The 12th International Conference and Workshops on Algorithms and Computation (WALCOM 2018), Dhaka, Bangladesh, 04/03/18.

D Shin-ichi Nakano, “Enumerating Floorplans”, 21st Conference of the International Federation of Operational Research Societies (IFORS 2017), Quebec City, Canada, 17/07/17.

D Katsutoshi Yada, “Marketing and the Uses of Big Data”, Asia Pacific for Computing and Information Technology (APSCIT2017), Hokkaido, Japan, 30/07/17.

D Hiroshi Sakamoto, “Stream Data Compression and Its Applications”, The 14th International Conference on Modeling Decisions for Artificial Intelligence(MDAI2017), Fukuoka, Japan, 18/10/17.

### Oral presentations

A K. Takazawa, “Excluded t-factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-matchings”, The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2017), Budapest, Hungary, 24/05/17.

A Y. Okamoto, “Tight Approximability of the Server Allocation Problem for Real-Time Applications”, 10th Combinatorial Algorithms Day, ETH Zuric, 12/06/17.

A K. Buchin, J. Chun, M. Lofller, A. Markovic, W. Meulemans, Y. Okamoto and T. Shiitada, “Folding Free-Space Diagrams: Computing the Frechet Distance between 1-Dimensional Curves”, 26th International Computational Geometry Multimedia Exposition, Brisbane, Australia, 04/07/17.

A E. Demaine, H. Ito, S. Langerman, J. Lynch, M. Rudoy and K. Xiao, “Cookie Clicker”, The 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2017), Tokyo, Japan, 29/08/17.

A H. Ito and Y. Takeda, “Packing polyominoes into a rectangle is constant-time testable”, The 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2017), Tokyo, Japan, 30/08/17.

A K. Chiba, H. Ito and A. Nagao, “K_3 edge cover in a wide sense”, The 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2017), Tokyo, Japan, 01/09/17.

A E. Miyano, Efficient algorithm design for combinatorial optimization problems, Robotics and Computer Science, New York, USA, 01/09/17.

A M. Sasajima, Y. Honda, Y. Uno, H. Ito and N. Katoh, “Towards Development of Practically Efficient Property Testing – Experimental Study on Practical Effectiveness of a Graph Partitioning Algorithm”, International Workshop on Innovative Algorithms for Big Data, Tokyo, Japan, 30/11/17.

A A. Sljoka, “Allosteric transmission across GPCR networks”, GPCR Structure and Function: Taking GPCR Drug Development and Discovery to the Next Level (B8) 2018, Santa Fe, New Mexico, USA, 16/02/18.

A Atsushi Takizawa, Monte Carlo simulation estimates the number of residents who will be forced to make secondary evacuations because houses will be damaged by the inundation caused by the tsunami, The 5th Regional Collaboration Conference, 3/7/18.

D I. Furuya and T. Kida, “A Compact Expression of Church Numerals and Its Application to Higher-Order Compression”, The 20th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC2017), Seoul, Korea, 25/08/17.

D T. Akagi, T. Araki, H. Ishikawa and S. Nakano, “The partial sum dispersion problem on the line”, The 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2017), Tokyo, Japan, 01/09/17.

D K. Marumo, “Time-sharing Multithreading on Stream-based Lossless Data Compression”, The Fifth International Symposium on Computing and Networking, Aomori, Japan, 20/09/17.

M M. Fukui, K. Suetsugu and A. Suzuki, “Complexity of “Goishi Hiroi””, The 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2017), Tokyo, Japan, 01/09/17.

### Poster presentations

M Y. Seki, S. Tanaka, S. Kataoka and K. Tanaka, “Effect of State transition of multi level systems to Performance of Quantum Annealing”, Adiabatic Quantum Computing Conference 2017 (AQC2017), Tokyo, Japan, 27/06/17.

M S. Arai, M. Ohzeki, S. Kataoka and K. Tanaka, “Detection of phase transition in transverse-field Ising model by neural network”, Adiabatic Quantum Computing Conference 2017 (AQC2017), Tokyo, Japan, 27/06/17.

M C. Takahashi, M. Ohzeki, S. Okada, M. Terabe, S. Taguchi and K. Tanaka, “Statistical-mechanics analysis of compressed sensing for Hamiltonian estimation of the Ising spin glass”, International Meeting on “High-Dimensional Data-Driven Science” (HD^3-2017), Kyoto, Japan, 12/09/17.

M J. Mikami, Y. Seki, M. Ohzeki and K. Tanaka, “Low-rank matrix completion by simulated annealing”, International Meeting on “High-Dimensional Data-Driven Science” (HD^3-2017), Kyoto, Japan, 12/09/17.

M C. Takahashi, M. Ohzeki, S. Okada, M. Terabe, S. Taguchi and K. Tanaka, “Statistical-mechanical analysis of Hamiltonian estimation of Ising spin glass based on the framework of statistical query learning”, Quantum Machine Learning & Biomimetic Quantum Technologies, Leioa, Spain, 20/03/18.

M S. Arai, M. Ohzeki and K. Tanaka, “Detection of quantum phase transition in D-Wave 2000Q by deep neural network”, Quantum Machine Learning & Biomimetic Quantum Technologies, Leioa, Spain, 20/03/18.

## Journal papers

A J.R. Jeliazkov, A. Sljoka, D. Kuroda, N. Tsuchimura, N. Katoh, K. Tsumoto and J.J. Gray, “Repertoire Analysis of Antibody CDR-H3 Loops Suggests Affinity Maturation Does Not Typically Result in Rigidification”, Frontiers in Immunology, Vol.9, Article 413, pp.1-16, 2018 (DOI: 10.3389/fimmu.2018.00413)

A A. Kawachi, Y. Okamoto, K. Tanaka and K. Yasunaga, “General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction”, The Computer Journal, Vol.60, Issue 5, pp.711-728, 2017 (DOI: 10.1093/comjnl/bxw094)

A P. Klavík, J. Kratochvíl, Y. Otachi, I. Rutter, T. Saitoh, M. Saumell and T. Vyskocil, “Extending partial representations of proper and unit interval graphs”, Algorithmica, Vol.77, Issue 4, pp.1071–1104, 2017 (DOI: 10.1007/s00453-016-0133-z)

A Y. Higashikawa, K. Imai, Y. Matsumoto, N. Sukegawa and Y. Yokosuka, “Minimum Point-Overlap Labeling”, Proceedings of The 10th International Conference on Algorithms and Complexity (CIAC 2017), LNCS 10236, pp.334-344, 2017 (DOI: 10.1007/978-3-319-57586-5_28)

A S. Shimizu, K. Yamaguchi, T. Saitoh and S. Masuda, “Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound”, Discrete Applied Mathematics, Vol.223, pp.120–134, 2017 (DOI: 10.1016/j.dam.2017.01.026)

A T. Ito, N. Kakimura, N. Kamiyama, Y. Kobayashi and Y. Okamoto, “Efficient Stabilization of Cooperative Matching Games”, Theoretical Computer Science, Vol.677, pp.69-82, 2017 (DOI: 10.1016/j.tcs.2017.03.020)

A J.F. Baffier, M.K. Chiu, Y. Diez, M. Korman, V. Mitsou, A. van Renssen, M. Roeloffzen and Y. Uno, “Hanabi is NP-complete, even for cheaters who look at their cards”, Theoretical Computer Science, Vol.675, pp.43-55, 2017.

A S.W. Cheng, Y. Higashikawa, N. Katoh and A. Sljoka, “Characterizing the minimal rigidity of a square-grid framework with holes”, Proceedings of The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2017), pp.93-102, 2017.

A X. Han, N. Ma, K. Makino and H. Chen, “Online Knapsack Problem Under Concave Functions”, 11th International Frontiers of Algorithmics Workshop (FAW 2017), LNCS 10336, pp.103-114, 2017 (DOI: 10.1007/978-3-319-59605-1_10)

A Y. Higashikawa, S.W. Cheng, T. Kameda, N. Katoh and S. Saburi, “Minimax Regret 1-Median Problem in Dynamic Path Networks”, Theory of Computing Systems, Published online, 2017 (DOI: 10.1007/s00224-017-9783-8)

A K. Buchin, J. Chun, M. Lofller, A. Markovic, W. Meulemans, Y. Okamoto and T. Shiitada, “Folding Free-Space Diagrams: Computing the Frechet Distance between 1-Dimensional Curves”, Proceedings of 33rd International Symposium on Computational Geometry (SoCG 2017), LIPIcs 77, pp.64:1-64:5, 2017 (DOI: 10.4230/LIPIcs.SoCG.2017.64)

A A. Nagao, K. Seto and J. Teruyama, “A Moderately Exponential Time Algorithm for k-IBDDSatisﬁability”, Algorithmica, Online First, 2017 (DOI: 10.1007/s00453-017-0332-2)

A K. Takazawa, “Excluded t-factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-matchings”, Proceedings of the 19th Conference on Integer Programming and Combinatorial Optimization (IPCO 2017), LNCS 10328, pp.430-441, 2017 (DOI: 10.1007/978-3-319-59250-3 35)

A T. Ito, N. Kakimura, N. Kamiyama, Y. Kobayashi and Y. Okamoto, “Reconfiguration of Maximum-Weight b-Matchings in a Graph”, Proceedings of 23rd Annual International Computing and Combinatorics Conference (COCOON 2017), LNCS 10392, pp.287-296, 2017 (DOI: 10.1007/978-3-319-62389-4_24)

A P. Klavík, J. Kratochvíl, Y. Otachi, T. Saitoh and T. Vyskocil, “Extending Partial Representations of Interval Graphs”, Algorithmica, Vol.78, Issue 3, pp.945–967, 2017 (DOI: 10.1007/s00453-016-0186-z)

A H. Mizuta, T. Ito and X. Zhou, “Reconfiguration of Steiner Trees in an Unweighted Graph”, IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, E100-A(7), pp.1532-1540, 2017 (DOI: 10.1587/transfun.E100.A.1532)

A B. Bhattacharya, M.J. Golin, Y. Higashikawa, T. Kameda and N. Katoh, “Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks”, Proceedings of The 15th Algorithms and Data Structures Symposium (WADS 2017), LNCS 10389, pp.133-144, 2017 (DOI: 10.1007/978-3-319-62127-2_12)

A P. Carmi, M.K. Chiu, M.J. Katz, M. Korman, Y. Okamoto, A. van Renssen, M. Roeloffzen, T. Shiitada and S. Smorodinsky, “Balanced Line Separators of Unit Disk Graphs”, Proceedings of The 15th Algorithms and Data Structures Symposium (WADS 2017), LNCS 10389, pp.241-252, 2017 (DOI: 10.1007/978-3-319-62127-2_21)

A M.M. Halldórsson, T. Ishii, K. Makino and K. Takazawa, “Posimodular function optimization”, Proceedings of the 15th International Symposium on Algorithms and Data Structures (WADS 2017), LNCS 10389, pp.437-448, 2017 (DOI: 10.1007/978-3-319-62127-2_37)

A E. Hahn, A. Sljoka and A. Muller, “Applications of Constraint Graphs and Assur groups in applications of constraint graphs and Assur groups in Mechanism Analysis and Synthesis”, Proceedings of the ASME 2017 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference (IDETC2017), 2017 (DOI: 10.1115/DETC2017-67925)

A Z. Abel, B. Ballinger, E. Demaine, M. Demaine, J. Erickson, A. Hesterberg, H. Ito, I. Kostitsyna, J. Lynch and R. Uehara, “Unfolding and dissection of multiple cubes, tetrahedra, and doubly covered squares”, Journal of Information Processing, Vol.25, pp.610-615, 2017 (DOI: 10.2197/ipsjjip.25.610)

A H. Ito and S. Bereg, “Transforming graphs with the same graphic sequence”, Journal of Information Processing, Vol.25, pp.627-633, 2017 (DOI: 10.2197/ipsjjip.25.627)

A E. Tomita, S. Matsuzaki, A. Nagao, H. Ito and M. Wakatsuki, “A much faster algorithm for finding a maximum clique with computational experiments”, Journal of Information Processing, Vol.25, pp.667-677, 2017 (DOI: 10.2197/ipsjjip.25.667)

A A. Suzuki, M. Kiyomi, Y. Otachi, K. Uchizawa and T. Uno, “Hitori numbers”, Journal of Information Processing, Vol.25, pp.695-707, 2017 (DOI: 10.2197/ipsjjip.25.695)

A T. Horiyama, T. Iizuka, M. Kiyomi, Y. Okamoto, R. Uehara, T.Uno, Y. Uno and Y. Yamauchi, “Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set”, Journal of Information Processing, Vol.25, pp.708-715, 2017 (DOI: 10.2197/ipsjjip.25.708)

A T. Hatanaka, T. Ito and X. Zhou, “Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters”, The 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), LIPIcs 83, pp.51:1-51:13, 2017 (DOI: 10.4230/LIPIcs.MFCS.2017.51)

A H. Sumita, N. Kakimura and K. Makino, “Parameterized Complexity of Sparse Linear Complementarity Problems”, Algorithmica, Vol.79, Issue 1, pp.42-65, 2017 (DOI: 10.1007/s00453-016-0229-5)

A T. Ito, N. Kakimura, N. Kamiyama, Y. Kobayashi, Y. Okamoto and T. Shiitada, “Tight Approximability of the Server Allocation Problem for Real-Time Applications”, Proceedings of the 3rd International Workshop on Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2017), LNCS 10739, pp.41-55, 2018 (DOI: 10.1007/978-3-319-74875-7_4)

A E. Boros, O. Cepek and K. Makino, “Strong Duality in Horn Minimization”, 21st International Symposium on Fundamentals of Computation Theory (FCT 2017), LNCS 10472, pp.123-135, 2017 (DOI: 10.1007/978-3-662-55751-8_11)

A B. Deng, S. Zhu, A.M. Macklin, J. Xu, C. Lento, A. Sljoka and D. Wilson, “Suppressing allostery in epitope mapping experiments using millisecond hydrogen / deuterium exchange mass spectrometry”, MAbs, Vol.9, Isuue 8, pp.1327-1336, 2017 (DOI: 10.1080/19420862.2017.1379641)

A K. Takazawa, “Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs”, Discrete Optimization, Vol.26, pp.26-40, 2017 (DOI: 10.1016/j.disopt.2017.05.003)

A Y. Kobayashi and K. Takazawa, “Randomized strategies for cardinality robustness in the knapsack problem”, Theoretical Computer Science, Vol.699, pp.53-62, 2017 (DOI: 10.1016/j.tcs.2016.12.019)

A E. Boros, K. Elbassioni, V. Gurvich and K. Makino, “A convex programming-based algorithm for mean payoff stochastic games with perfect information”, Optimization, Letters 11(8), pp.1499-1512, 2017 (DOI: 10.1007/s11590-017-1140-y)

A H. Hayakawa, T. Ishii, H. Ono and Y. Uno, “Settlement fund circulation problem”, Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), LIPIcs 92, pp.46:1-46:13, 2017 (DOI: 10.4230/LIPIcs.ISAAC.2017.46)

A T. Ito, N. Kakimura and Y. Kobayashi, “Complexity of the Multi-Service Center Problem”, Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), LIPIcs 92, pp.48:1-48:12, 2017 (DOI: 10.4230/LIPIcs.ISAAC.2017.48)

A Y. Kawase, K. Kimura, K. Makino and H. Sumita, “Optimal Matroid Partitioning Problems”, Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), LIPIcs 92, pp.51:1-51:13, 2017 (DOI: 10.4230/LIPIcs.ISAAC.2017.51)

A A. Nagao, K. Seto and J. Teruyama, “Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs”, Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), LIPIcs 92, pp.58:1-58:10, 2017 (DOI: 10.4230/LIPIcs.ISAAC.2017.58)

A T. Hatanaka, T. Ito and X. Zhou, “The Coloring Reconfiguration Problem on Specific Graph Classes”, Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017), LNCS 10627, pp.152-162, 2017 (DOI: 10.1007/978-3-319-71150-8_15)

A Y. Hanawa, Y. Higashikawa, N. Kamiyama, N. Katoh and A. Takizawa, “The Mixed Evacuation Problem”, Journal of Combinatorial Optimization, Published online, 2017 (DOI: 10.1007/s10878-017-0237-7)

A K. Takazawa, “Decomposition theorems for square-free 2-matchings in bipartite graphs”, Discrete Applied Mathematics, Vol.233, pp.215-223, 2017 (DOI: 10.1016/j.dam.2017.07.035)

A A. Hashimoto, A. Nagao and S. Okuda, “Topological graph description of multicellular dynamics based on vertex model”, Journal of Theoretical Biology, Vol.437, pp.187-201, 2018 (DOI: 10.1016/j.jtbi.2017.10.023)

A K. Kimura and K. Makino, “Linear Satisfiability Preserving Assignments”, Journal of Artificial Intelligence Research, Vol.61, pp.291-321, 2018 (DOI: 10.1613/jair.5658)

A H. Eto, H. Kawahara, E. Miyano and N. Nonoue, “Complexity of the minimum single dominating cycle problem for graph classes”, IEICE Transactions on Information and Systems, E101-D(3), pp.574-581, 2018 (DOI: 10.1587/transinf.2017FCP0007)

A E. Boros, K. Elbassioni, V. Gurvich and K. Makino, “A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games”, Dynamic Games and Applications, 8(1), pp.22-41, 2018 (DOI: 10.1007/s13235-016-0199-x)

A K. Yamazaki, T. Saitoh, M. Kiyomi and R. Uehara, “Enumeration of Nonisomorphic Graphs in Graph Classes”, Proceedings of the 11th Annual Workshop on Algorithms and Computation (WALCOM 2018), LNCS 10755, pp.8-19, 2018 (DOI: 10.1007/978-3-319-75172-6_2)

A E. Miyano, T. Saitoh, R. Uehara, T. Yagita and T. Zanden, “Complexity of the Maximum k-Path Vertex Cover Problem”, Proceedings of the 11th Annual Workshop on Algorithms and Computation (WALCOM 2018), LNCS 10755, pp.240-251, 2018 (DOI: 10.1007/978-3-319-75172-6_21)

A K. Murota and K. Takazawa, “Relationship of two formulations for shortest bibranchings”, submitted.

A K. Takazawa, “The b-bibranching problem: TDI system, packing, and discrete convexity”, submitted.

D T. Onodera and T. Shibuya, “Succinct Oblivious RAM”, Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), LIPIcs 96, pp.52:1–52:16, 2018 (DOI: 10.4230/LIPIcs.STACS.2018.52)

D R. Onuki, R. Yamaguchi, T. Shibuya, M. Kanehisa and S. Goto, “Revealing Phenotype-Associated Functional Differences by Genome-Wide Scan of Ancient Haplotype Blocks”, PLOS ONE, 12(4), e0176530, 2017 (DOI: 10.1371/journal.pone.0176530)

D K. Ishiyama and K. Sadakane, “A Succinct Data Structure for Multidimensional Orthogonal Range Searching”, Proceedings of IEEE Data Compression Conference (DCC), pp.270-279, 2017 (DOI: 10.1109/DCC.2017.47)

D P. Dinklage, J. Fischer, D. Köppl, M. Löbel and K. Sadakane, “Compression with the tudocomp Framework”, Proceedings of 16th International Symposium on Experimental Algorithms (SEA 2017), LIPIcs 75, pp.13:1-13:22, 2017 (DOI: 10.4230/LIPIcs.SEA.2017.13)

D W.T. So and K. Yada, “A Framework of Recommendation System Based on In-store Behavior”, MISNC ’17 Proceedings of the 4th Multidisciplinary International Social Networks Conference, ACM, pp.1-4, 2017 (DOI: 10.1145/3092090.3092130)

D T. Ohno, Y. Takabatake, T. I and H. Sakamoto, “A Faster Implementation of Online Run-Length Burrows-Wheeler Transform”, 28th International Workshop on Combinatorial Algorithms (IWOCA 2017), LNCS 10765, pp.420-431, 2017.

D Y. Kaneko, S. Miyazaki and K. Yada, “The Influence of Customer Movement between Sales Areas on Sales Amount: A Dynamic Bayesian Model of the In-store Customer Movement and Sales Relationship”, Procedia Computer Science, Vol.112, pp.1845-1854, 2017 (DOI: 10.1016/j.procs.2017.08.225)

D Y. Takabatake, T. I and H. Sakamoto, “A Space-Optimal Grammar Compression”, Proceedings of the 25th Annual European Symposium on Algorithms (ESA 2017), LIPIcs 87, pp.67:1-67:15, 2017 (DOI: 10.4230/LIPIcs.ESA.2017.67)

D K. Ishiyama and K. Sadakane, “Practical Space-Efficient Data Structures for High-Dimensional Orthogonal Range Searching”, Proceedings of the 10th International Conference on Similarity Search and Applications (SISAP 2017), LNCS 10609, pp.234-246, 2017 (DOI: 10.1007/978-3-319-68474-1_16)

D K. Ishiyama, K. Kobayashi and K. Sadakane, “Succinct Quadtrees for Road Data”, Proceedings of the 10th International Conference on Similarity Search and Applications (SISAP 2017), LNCS 10609, pp.262-272, 2017 (DOI: 10.1007/978-3-319-68474-1_18)

D K. Marumo and S. Yamagiwa, “Time-sharing Multithreading on Stream-based Lossless Data Compression”, Proceedings of the Fifth International Symposium on Computing and Networking, IEEE, 2017.

D K. Ishibashi, T. Iwasaki, S. Otomasa and K. Yada, “Model Selection for Financial Statement Analysis Comparison of models developed by using data mining technique”, 2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC) IEEE pp.81-86, 2017 (DOI: 10.1109/SMC.2017.8122582)

D K. Nakamura, “Fully Dynamic Connectivity Oracles under General Vertex Updates”, Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), LIPIcs 92, pp.59:1-59:12, 2017 (DOI: 10.4230/LIPIcs.ISAAC.2017.59)

D K. Yamanaka, Md.S. Rahman and S. Nakano, “Floorplans with Columns”, Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017), LNCS 10627, pp.33-40, 2017 (DOI: 10.1007/978-3-319-71150-8_3)

D S. Fukunaga, Y. Takabatake, T. I and H. Sakamoto, “Approximate Frequent Pattern Discovery in Compressed Space”, IEICE Transactions on Information and Systems, E101-D(3), pp.593-601, 2018 (DOI: 10.1587/transinf.2017FCP0010)

D S. Nakano, “A Simple Algorithm for r-gatherings on the Line”, Proceedings of the 11th Annual Workshop on Algorithms and Computation (WALCOM 2018), LNCS 10755, pp.1-7, 2018 (DOI: 10.1007/978-3-319-75172-6_1)

D M.J. Kashyop, T. Nagayama and K. Sadakane, “Faster Network Algorithms Based on Graph Decomposition”, Proceedings of the 11th Annual Workshop on Algorithms and Computation (WALCOM 2018), LNCS 10755, pp.80-92, 2018 (DOI: 10.1007/978-3-319-75172-6_8)

D I. Furuya and T. Kida, “Compaction of Church Numerals for Higher-Order Compression”, Proc. of Data Compression Conference (DCC2018), IEEE Press, pp. 410, Cliff Lodge, Snowbird, UT, in press.

M M. Yasuda, J. Watanabe, S. Kataoka and K. Tanaka, “Linear-Time Algorithm in Bayesian Image Denoising based on Gaussian Markov Random Field”, IEICE Transactions on Information and Systems, Vol.E101-D, No.6, pp.1629-1639, 2018.

M Y. Waizumi, M. Omachi and K. Tanaka, “On Demand Color Calibration for Pedestrian Tracking in Non-overlapping Fields of View”, IEEE Internet of Things Journal, Vol.4, No.2, pp.320-329, 2017 (DOI: 10.1109/JIOT.2016.2557814)

M A.E. Mouawad, N. Nishimura, V. Raman, N. Simjour and A. Suzuki, “On the parameterized complexity of reconfiguration problems”, Algorithmica, Vol.78, Issue 1, pp.274-297, 2017 (DOI: 10.1007/s00453-016-0159-2)

M M. Yasuda and S. Kataoka, “Solving Non-parametric Inverse Problem in Continuous Markov Random Field using Loopy Belief Propagation”, Journal of the Physical Society of Japan, Vol.86, No.8, Article ID:084806, 2017 (DOI: 10.7566/JPSJ.86.084806)

M A. Shioura, “Algorithms for L-convex Function Minimization: Connection Between Discrete Convex Analysis and Other Research Fields”, Journal of Operations Research Society of Japan, Vol.60, No.3, pp.216-243, 2017 (DOI: 10.15807/jorsj.60.216

M A Shioura, N.V. Shakhlevich and V.A. Strusevich, “Preemptive Models of Scheduling with Controllable Processing Times and of Scheduling with Imprecise Computation: a Review of Solution Approaches”, European Journal of Operational Research, Vol.266, No.3, pp. 795-818, 2018 (DOI: 10.1016/j.ejor.2017.08.034)

M S. Fukuda, A. Shioura and T. Tokuyama, “Buyback Problem with Discrete Concave Valuation Functions”, Discrete Optimization, Vol.26, pp.78-96, 2017 (DOI: 10.1016/j.disopt.2017.07.002)

M A. Shioura, N.V. Shakhlevich and V.A. Strusevich, “Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints”, INFORMS Journal on Computing, Vol.29, No.4, pp.724-736, 2017 (DOI: 10.1287/ijoc.2017.0758)

M T. Horiyama, T. Ito, K. Nakatsuka, A. Suzuki and R. Uehara, “Complexity of tiling a polygon with trominoes or bars”, Discrete & Computational Geometry (DCG), Vol.58, Issue 3, pp.686-704, 2017 (DOI: 10.1007/s00454-017-9884-9)

M S. Cho, T. Negishi, M. Yasuda and M. Yokoyama, “Estimation System of Blood Pressure Variation with Photo-Plethysmograph Signals using Neural Network”, Proceedings of the 30th International Conference on Computer Applications in Industry and Engineering (CAINE 2017), pp.155-160, 2017.

M M. Tsuchiya, A. Tanaka, M. Yasuda, T. Harada and M. Yokoyama, “Evaluation of Sleep Quality Based on Environmental and Vital Sensor Signals using Big Data Analysis and Deep Learning”, Proceedings of the 2017 International Symposium on Nonlinear Theory and its Applications (NOLTA 2017), pp.38-41, 2017.

M M. Yasuda, H. Sakata, S. Cho, T. Harada, A. Tanaka and M. Yokoyama, “A fast test method for noise robustness of deep neural networks”, Proceedings of the 2017 International Symposium on Nonlinear Theory and its Applications (NOLTA 2017), pp.46-49, 2017.

M T. Harada, M. Yokoyama, S. Cho, A. Tanaka and M. Yasuda, “Multiple Sensor Data Acquisition System using Commonly Available Sensor Devices for Sleep and Car Conditions”, Proceedings of the 2017 International Symposium on Nonlinear Theory and its Applications (NOLTA 2017), pp.50-53, 2017.

M A. Tanaka, S. Cho, M. Yasuda, T. Harada and M. Yokoyama, “Analysis of Social Networks and its Evaluation using Big Data Analyzing Technique”, Proceedings of the 2017 International Symposium on Nonlinear Theory and its Applications (NOLTA 2017), pp.54-57, 2017.

M H. Osawa, A. Suzuki, T. Ito and X. Zhou, “Complexity of Coloring Reconfiguration under Recolorability Constraints”, Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), LIPIcs 92, pp.62:1-62:12, 2017 (DOI: 10.4230/LIPIcs.ISAAC.2017.62)

M H. Osawa, A. Suzuki, T. Ito and X. Zhou, “The complexity of (list) edge-coloring reconfiguration problem”, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E101-A(1), pp.848-857, 2018 (DOI: 10.1587/transfun.E97.A.848)

M M. Ohzeki, Y. Kudo and K. Tanaka, “An Extension of Estimation of Critical Points in Ground State for Random Spin Systems”, Journal of the Physical Society of Japan, Vol.87, No.1, Article ID.015001, pp.1-2, 2018 (DOI: 10.7566/JPSJ.87.015001)

M S. Arai, M. Ohzeki and K. Tanaka, “Deep Neural Network Detects Quantum Phase Transition”, Journal of the Physical Society of Japan, Vol.87, No.3, Article ID.033001, pp.1-4, 2018 (DOI: 10.7566/JPSJ.87.033001)

M F. Hurtado, M. Korman, M. van Kreveld, M. Löffler, V. Sacristán, A. Shioura, R.I. Silveira, B. Speckmann and T. Tokuyama, “Colored Spanning Graphs for Set Visualization”, Computational Geometry, Vol.68, pp.262-276, 2018 (DOI: 10.1016/j.comgeo.2017.06.006)