Naonori Kakimura and Yuta Mishima, Reconfiguration of Labeled Matchings in Triangular Grid Graphs,
The 35th International Symposium on Algorithms and Computation (ISAAC 2024), Sydney, Australia, December 8–11 2024.
Naonori Kakimura and Ildiko Schlotter, Parameterized Complexity of Submodular Minimization under Uncertainty,
The 19th Scandinavian Symposium on Algorithm Theory (SWAT 2024), Helsinki, Finland, June 12-14, 2024.
Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi, New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem,
The 38th AAAI Conference on Artificial Intelligence (AAAI 2024), Vancouver, Canada, February 20-27, 2024.
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi, Bandit Task Assignment with Unknown Processing Time,
The 37th Conference on Neural Information Processing Systems (NeurIPS 2023), New Orleans, USA, December 10-16, 2023.
Naonori Kakimura, Tomohiro Nakayoshi, Deterministic Primal-Dual Algorithms for Online k-way Matching with Delays,
The 29th International Computing and Combinatorics Conference (COCOON 2023), Honolulu, Hawaii, USA, December 15-17, 2023.
Naonori Kakimura, Donghao Zhu, Matchings in Bipartite Graphs with Stochastic Arrivals and Departures,
The 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, Hungary, March 20-24, 2023. Invited Talk
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki, On Reachable Assignments under Dichotomous Preferences,
The 24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022), Hybrid, Valencia, Spain,
November 16-18, 2022.
Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi, Online Task Assignment Problems with Reusable Resources,
The 36th AAAI Conference on Artificial Intelligence (AAAI 2022), Vancouver, Canada, February 22-March 1, 2022.
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto and Kenta Ozeki, Reforming an Envy-Free Matching,
The 36th AAAI Conference on Artificial Intelligence (AAAI 2022), Vancouver, Canada, February 22-March 1, 2022.
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki, Monotone Edge Flips to an Orientation of Maximum Edge-connectivity \`a la Nash-Williams,
The ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), Alexandria, Virginia, U.S., January 9-12, 2022.
Naonori Kakimura and Donghao Zhu, Dynamic Bipartite Matching Market with Arrivals and Departures,
The 17th Conference on Web and Internet Economics (WINE 2021), Potsdam, Germany, December 14-17, 2021.
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki, Reconfiguration of Envy-Free Item Allocations,
Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2021, Online, July 12, 2021.
Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi, A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits,
The 24th International Conference on Artificial Intelligence and Statistics (AISTATS-21), Online, April 13-15, 2021.
Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi, Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions,
The 35th AAAI Conference on Artificial Intelligence (AAAI 2021), Online, February 2-9, 2021.
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi, Delay and Cooperation in Nonstochastic Linear Bandits,
The 34th Conference on Neural Information Processing Systems (NeurIPS 2020), Online, December 6-12, 2020.
Kristóf Bérczi, Naonori Kakimura and Yusuke Kobayashi, Market Pricing for Matroid Rank Valuations,
The 31st International Symposium on Algorithms and Computation (ISAAC 2020), online, December 14-18, 2020.
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-Ichi Kawarabayashi, Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback,
The 33rd Conference on Neural Information Processing Systems (NeurIPS 2019), Vancouver, Canada, December 8-14, 2019.
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-Ichi Kawarabayashi, Improved Regret Bounds for Bandit Combinatorial Optimization,
The 33rd Conference on Neural Information Processing Systems(NeurIPS 2019), Vancouver, Canada, December 8-14, 2019.
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Shortest Reconfiguration of Perfect Matchings via Alternating Cycles,
The 27th Annual European Symposium on Algorithms (ESA 2019), Munich/Garching, Germany, September 9-11, 2019.
Charlie Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura and Alexandra Kolla, Spectral Aspects of Symmetric Matrix Signings,
The 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Aachen, Germany, August 26-30, 2019.
Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, and Jakub Pachocki, Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries,
The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD 2019), Würzburg, Germany, September 16-20, 2019.
Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura and Ken-ichi Kawarabayashi, Non-Zero-Sum Stackelberg Budget Allocation Game for Computational Advertising,
The 16th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2019), Yanuca Island, Cuvu, Fiji, August 26-30, 2019.
Chien-Chung Huang and Naonori Kakimura, Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint,
The Algorithms and Data Structures Symposium (WADS), University of Alberta, Edmonton, Canada, August 5-7, 2019.
Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi, Regret Bounds for Online Portfolio Selection with a Cardinality Constraint,
The 32nd Conference on Neural Information Processing Systems (NeurIPS 2018), Montreal, Canada, December 3-6, 2018.
Atsushi Miyauchi and Naonori Kakimura, Finding a dense subgraph with sparse cut,
The 27th ACM International Conference on Information and Knowledge Management (CIKM 2018), Lingotto, Turin, Italy, October 22-26, 2018.
Naoto Ohsaka, Tomohiro Sonobe, Naonori Kakimura, Takuro Fukunaga, Sumio Fujita, Ken-ichi Kawarabayashi, Boosting PageRank Scores by Optimizing Internal Link Structure,
The 29th International Conference on Database and Expert Systems Applications (DEXA2018), Regensburg, Germany, September 3 - 6, 2018.
Naonori Kakimura, Naoyuki Kamiyama and Kenjiro Takazawa, The b-Branching Problem in Digraphs,
The 43rd International Symposium on Mathematical Foundations of Computer Science(MFCS2018), Liverpool, UK, August 27-31, 2018.
Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi, Causal Bandits with Propagating Inference,
The International Conference on Machine Learning(ICML2018), Stockholm, Sweden, July 10-15, 2018.
Takehiro Ito, Naonori Kakimura and Yusuke Kobayashi, Complexity of the Multi-Service Center Problem,
The Japanese Conference on Combinatorics and its Applications(JCCA 2018), Sendai, Japan, May 20-24, 2018.
Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi, Online Regression with Partial Information: Generalization and Linear Projection,
The 21st International Conference on Artificial Intelligence and Statistics(AISTATS2018), Playa Blanca, Lanzarote, Canary Islands, Spain, April 9-11, 2018.
Takehiro Ito, Naonori Kakimura and Yusuke Kobayashi, Complexity of the Multi-Service Center Problem,
The 28th International Symposium on Algorithms and Computation(ISAAC2017), Phuket, Thailand, December 10-12, 2017.
Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi, Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation,
The 31st Annual Conference on Neural Information Processing Systems(NIPS2017), Long Beach, U.S., December 4-9, 2017.
Prompong Pakawanwong, Vorapong Suppakitpaisarn, Liwen Xu, Naonori Kakimura, Reducing Recovery Error in Compressive Sensing with Limited Number of Base Stations,
IEEE Global Communications Conference(GLOBECOM), Singapore, Singapore, December 4-8, 2017.
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, and Taichi Shiitada, Tight Approximability of the Server Allocation Problem for Real-Time Applications,
The 3rd International Workshop on Algorithmic Aspects of Cloud Computing(ALGOCLOUD2017), Vienna, Austria, September 5, 2017.
Chien-Chung Huang, Naonori Kakimura, and Yuichi Yoshida, Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint,
The 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems(APPROX2017), Berkeley U.S., August 16-18, 2017.
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto, Reconfiguration of Maximum-Weight b-Matchings in a Graph,
The 23rd Annual International Computing and Combinatorics Conference(COCOON2017), Hong Kong, China, August 3-5, 2017.
Hanna Sumita, Yuuma Yonebayashi, Naonori Kakimura, Ken-ichi Kawarabayashi, An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization,
The 26th International Joint Conference on Artificial Intelligence(IJCAI2017), Melbourne, Australia, August 21-25, 2017.
Chien-Chung Huang, Naonori Kakimura, and Yuichi Yoshida, Streaming Submodular Maximization under a Knapsack Constraint,
The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, Hungary, May 22-25, 2017.
Naoto Ohsaka, Yutaro Yamaguchi, Naonori Kakimura, and Ken-ichi Kawarabayashi, Maximizing Time-decaying Influence in Social Networks,
The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery (ECML-PKDD), Riva del Garda, Italy, September 19-23, 2016.
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto, Efficient Stabilization of Cooperative Matching Games,
International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2016), Singapore, May 9-13, 2016.
Chien-Chung Huang, Naonori Kakimura, and Naoyuki Kamiyama, Exact and Approximation Algorithms for Weighted Matroid Intersection,
The 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Arlington, Virginia, U.S., January 10-12, 2016.
Hanna Sumita, Naonori Kakimura, and Kazuhisa Makino, Parameterized Complexity of Sparse Linear Complementarity Problems,
The 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Patras, Greece, September 16-18, 2015.
Hanna Sumita, Naonori Kakimura, and Kazuhisa Makino, Total Dual Integrality of the Linear Complementarity Problem,
The 22nd International Symposium on Mathematical Programming (ISMP), Pittsburgh, U.S., July 12-17, 2015.
Chien-Chung Huang, Naonori Kakimura and Naoyuki Kamiyama, Exact and approximation algorithms for weighted matroid intersection,
The 22nd International Symposium on Mathematical Programming (ISMP), Pittsburgh, U.S., July 12-17, 2015.
Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, and Naonori Kakimura, Threshold Influence Model for Allocating Advertising Budgets,
The 32nd International Conference on Machine Learning (ICML 2015), Lille, France, July 6-11, 2015.
Chien-Chung Huang, Naonori Kakimura and Naoyuki Kamiyama, Weighted Matroid Intersection Algorithms via Weight Decomposition,
The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Fukuoka, Japan, June 2-5 2015.
Hanna Sumita, Naonori Kakimura and Kazuhisa Makino, Total Dual Integrality of the Linear Complementarity Problem,
The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Fukuoka, Japan, June 2-5 2015.
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto, Minimum-Cost b-Edge Dominating Sets on Trees,
The 25th Annual International Symposium on Algorithms and Computation (ISAAC 2014), Jeonju, Korea, December 15-17, 2014.
Norie Fu, Vorapong Suppakitpaisarn, Kei Kimura, and Naonori Kakimura, Maximum Lifetime Coverage Problems with Battery Recovery Effects,
IEEE Global Communications Conference(GLOBECOM 2014), Austin, TX, USA, Dec 8-12, 2014.
Tasuku Soma, Naonori Kakimura, Kazuhiro Inaba, Ken-ichi Kawarabayashi, Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm,
The 31st International Conference on Machine Learning, Beijing, China, June 21-26, 2014.
Naonori Kakimura, Yusuke Kobayashi and K. Kawarabayashi, Packing Edge-Disjoint Odd S-Cycles in 4-Edge-Connected Graphs,
SIAM Conference on Discrete Mathematics, Minneapolis, Minnesota, U.S., June 16-19, 2014.
Naonori Kakimura and Ken-ichi Kawarabayashi Packing Edge-Disjoint K_5-Immersions in 4-Edge-Connected Graphs,
The Asian Mathematical Conference 2013(AMC 2013), Busan, Korea, July 2013.(Session invited talk)
Hanna Sumita, Naonori Kakimura, and Kazuhisa Makino, Sparse Linear Complementarity Problems,
The 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Veszprem, Hungary, June 2013.
Naonori Kakimura and Ken-ichi Kawarabayashi Packing edge-disjoint K_5-immersions in 4-edge-connected graphs,
The 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Veszprem, Hungary, June 2013.
Hanna Sumita, Naonori Kakimura, and Kazuhisa Makino, Sparse Linear Complementarity Problems,
The 8th International Conference on Algorithms and Complexity (CIAC), Barcelona, Spain, May 22-24, 2013.
Naonori Kakimura, Kazuhisa Makino, and Kento Seimi, Computing Knapsack Solutions with Cardinality Robustness,
The 21st International Symposium on Mathematical Programming (ISMP), Berlin, Germany, August 2012.
Naonori Kakimura and Mizuyo Takamatsu, Matching Problems with Delta-Matroid Constraints
The 21st International Symposium on Mathematical Programming (ISMP), Berlin, Germany, August 2012.
Naonori Kakimura and Mizuyo Takamatsu, Matching Problems with Delta-Matroid Constraints
The 18th CATS symposium (Computing: the Australasian Theory Symposium), Melbourne, Australia, February 2012.
Naonori Kakimura, Ken-ichi Kawarabayashi, and Yusuke Kobayashi, Erd\H{o}s-P\'osa Property and Its Algorithmic Applications --- Parity Constraints, Subset Feedback Set, and Subset Packing
The 23rd Annual ACM-SIAM Symposium on Discrete Algorithms(SODA 2012), Kyoto, Japan, January 2012.
Naonori Kakimura, Kazuhisa Makino, and Kento Seimi, Computing Knapsack Solutions with Cardinality Robustness,
The 22nd International Symposium on Algorithms and Computation(ISAAC 2011), Yokohama, Japan, December 2011.
Naonori Kakimura and Kazuhisa Makino, Robust Independence Systems,
The 38th International Colloquium on Automata, Languages and Programming(ICALP 2011), Zurich, Switzerland, July 2011.
Naonori Kakimura and Kazuhisa Makino, Robust Independence Systems,
The 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Kyoto, Japan, May-June 2011.
Naonori Kakimura and Ken-ichi Kawarabayashi, Packing Cycles of Length 0 Modulo p through Prescribed Vertices,
The 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Kyoto, Japan, May-June 2011.
Naonori Kakimura and Kazuhisa Makino, Robust Independence Systems,
The SIAM Conference on Optimization, Darmstadt, Germany, May 2011.
Naonori Kakimura, Matching Structure of Symmetric Bipartite Graphs and a Generalization of Polya's Problem.
The 20th International Symposium on Mathematical Programming (ISMP), Chicago, U.S., August 2009.
Naonori Kakimura, Matching Structure of Symmetric Bipartite Graphs and a Generalization of Polya's Problem.
The 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, Hungary, May 2009.
Naonori Kakimura, Sign-Solvable Linear Complementarity Problems.
The 12th Conference on Integer Programming and Combinatorial Optimization (IPCO), Ithaca, U.S., June 2007.
Satoru Iwata and Naonori Kakimura, Solving Linear Programs from Sign Patterns,
The 19th International Symposium on Mathematical Programming (ISMP), Rio de Janeiro, Brazil, July-August 2006.
Naonori Kakimura and Yasuhisa Oda, A Mathematical Programming Approach to the Ground Station Network,
The 1st International Workshop on Ground Station Network, Tokyo, Japan, July 2006.
Naonori Kakimura and Satoru Iwata, Sign-Solvable Linear Programs,
The 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, Hungary, June 2005.
Naonori Kakimura and Satoru Iwata, Computing the Inertia from Sign Patterns,
The 11th Conference on Integer Programming and Combinatorial Optimization (IPCO), Berlin, Germany, June 2005.
垣村尚徳,Chien-Chung Huang:
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint,
情報処理学会第174回アルゴリズム研究会,信州大学,2019年9月17日.