Publications

Journal Articles

  1. Yasushi Kawase and Atsushi Miyauchi: The Densest Subgraph Problem with a Convex/Concave Size Function, Algorithmica, December 2017, https://link.springer.com/article/10.1007/s00453-017-0400-7.
  2. Yasushi Kawase, Kazuhisa Makino, and Kento Seimi: Optimal Composition Ordering Problems for Piecewise Linear Functions, Algorithmica, November 2017, http://link.springer.com/article/10.1007/s00453-017-0397-y.
  3. Yasushi Kawase, Xin Han, and Kazuhisa Makino: Proportional Cost Buyback Problem with Weight Bounds, Theoretical Computer Science, June 2016, http://www.sciencedirect.com/science/article/pii/S0304397516302419.
  4. Atsushi Miyauchi and Yasushi Kawase: Z-Score-Based Modularity for Community Detection in Networks, PLOS ONE 11(1), January 2016, http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0147805.
  5. Naoyuki Kamiyama and Yasushi Kawase: On Packing Arborescences in Temporal Networks, Information Processing Letters, Vol. 115, Pages 321–325, February 2015, http://www.sciencedirect.com/science/article/pii/S0020019014002208.
  6. Xin Han, Yasushi Kawase, and Kazuhisa Makino: Randomized Algorithms for Online Knapsack Problems, Theoretical Computer Science, Vol. 562, Pages 395–405, January 2015, http://www.sciencedirect.com/science/article/pii/S0304397514007798.
  7. Xin Han, Yasushi Kawase, and Kazuhisa Makino: Online Unweighted Knapsack Problem with Removal Cost, Algorithmica, Vol. 70, Pages 76–91, September 2014, http://link.springer.com/article/10.1007%2Fs00453-013-9822-z.
  8. Xin Han, Yasushi Kawase, Kazuhisa Makino, and He Guo: Online Removable Knapsack Problem under Convex Function, Theoretical Computer Science, Volumes 540–541, Pages 62–69, June 2014, http://www.sciencedirect.com/science/article/pii/S0304397513006932.
  9. Yasushi Kawase and Kazuhisa Makino: Nash Equilibria with Minimum Potential in Undirected Broadcast Games, Theoretical Computer Science, Vol. 482, Pages 33–47, April 2013, http://dx.doi.org/10.1016/j.tcs.2013.02.031.

Refereed Conference Proceedings

  1. Yasushi Kawase, Yutaro Yamaguchi, and Yu Yokoi: Computing a Subgame Perfect Equilibrium of a Sequential Matching Game, Proceedings of the 19th ACM Conference on Economics and Computation (EC2018), Pages 131–148, June 2018, https://dl.acm.org/citation.cfm?id=3219200.
  2. Yasushi Kawase, Hanna Sumita, and Takuro Fukunaga: Submodular Maximization with Uncertain Knapsack Capacity, Proceedings of the 13th Latin American Theoretical Informatics (LATIN2018), Pages 653–668, April 2018, https://link.springer.com/content/pdf/10.1007%2F978-3-319-77404-6_48.pdf.
  3. Yasushi Kawase and Atsushi Iwasaki: Approximately Stable Matchings with Budget Constraints, Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI2018), Pages 1113–1120, February 2018, https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/17032.
  4. Yasushi Kawase, Kei Kimura, Kazuhisa Makino, and Hanna Sumita: Optimal Matroid Partitioning Problems, Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC2017), Pages 51:1–51:13, December 2017, http://drops.dagstuhl.de/opus/volltexte/2017/8271/pdf/LIPIcs-ISAAC-2017-51.pdf.
  5. Constantinos Daskalakis and Yasushi Kawase: Optimal Stopping Rules for Sequential Hypothesis Testing, Proceedings of the 25th Annual European Symposium on Algorithms (ESA2017), Pages 32:1–32:14, September 2017, http://drops.dagstuhl.de/opus/volltexte/2017/7823/pdf/LIPIcs-ESA-2017-32.pdf.
  6. Hanna Sumita, Yasushi Kawase, Sumio Fujita, and Takuro Fukunaga: Online Optimization of Video-Ad Allocation, Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI2017), Pages 423–429, August 2017, https://doi.org/10.24963/ijcai.2017/60
  7. Yasushi Kawase and Atsushi Iwasaki: Near-Feasible Stable Matchings with Budget Constraints, Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI2017), Pages 242–248, August 2017, https://doi.org/10.24963/ijcai.2017/35
  8. Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, and Ken-Ichi Kawarabayashi: Optimal Pricing for Submodular Valuations with Bounded Curvature, Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI2017), Pages 622–628, February 2017, http://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14562/13821.
  9. Yasushi Kawase and Atsushi Miyauchi: The Densest Subgraph Problem with a Convex/Concave Size Function, Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC2016, LIPICS64), Pages 44:1–44:12, December 2016, http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=6814.
  10. Yasushi Kawase, Tomomi Matsui, and Atsushi Miyauchi: Additive Approximation Algorithms for Modularity Maximization, Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC2016, LIPICS64), Pages 43:1–43:13, December 2016, http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=6813.
  11. Yasushi Kawase, Kazuhisa Makino, and Kento Seimi: Optimal Composition Ordering Problems for Piecewise Linear Functions, Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC2016, LIPICS64), Pages 42:1–42:13, December 2016, http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=6812.
  12. Yasushi Kawase and Kazuhisa Makino: Surrogate optimization for p-norms, Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC2016, LIPICS64), Pages 41:1–41:13, December 2016, http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=6811.
  13. Yasushi Kawase, Xin Han, and Kazuhisa Makino: Proportional Cost Buyback Problem with Weight Bounds, Proceedings of the 9th Annual International Conference on Computational Optimization and Applications (COCOA2015, LNCS9486), Pages 794–808, December 2015, http://link.springer.com/chapter/10.1007%2F978-3-319-26626-8_59.
  14. Yasushi Kawase: The Secretary Problem with a Choice Function, Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC2015, LNCS9472), Pages 129–139, December 2015. http://link.springer.com/chapter/10.1007%2F978-3-662-48971-0_12
  15. Atsushi Miyauchi and Yasushi Kawase: What Is a Network Community? A Novel Quality Function and Detection Algorithms, Proceedings of the 24th ACM International Conference on Information and Knowledge Management (CIKM 2015), Pages 1471–1480, October 2015, http://dl.acm.org/citation.cfm?id=2806555. program.
  16. Yasushi Kawase, Yusuke Kobayashi, and Yutaro Yamaguchi: Finding a Path in Group-Labeled Graphs with Two Labels Forbidden, Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015, LNCS9134), Pages 797–809, July 2015, http://link.springer.com/chapter/10.1007/978-3-662-47672-7_65.
  17. Yasushi Kawase, Takanori Maehara, and Ken-ichi Kawarabayashi: Scalable Sensor Localization via Ball-Decomposition Algorithm, Proceedings of the 14th IFIP International Conferences on Networking, 9 pages, May 2015, http://dl.ifip.org/db/conf/networking/networking2015/1570063515.pdf.
  18. Yasushi Kawase, Xin Han, and Kazuhisa Makino: Unit Cost Buyback Problem, Proceedings of the 24th International Symposium on Algorithms and Computing (ISAAC2013, LNCS8283), Pages 435–445,December 2013, http://link.springer.com/chapter/10.1007%2F978-3-642-45030-3_41.
  19. Xin Han, Yasushi Kawase, and Kazuhisa Makino: Randomized Algorithms for Removable Online Knapsack Problems, Proceedings of the 7th International Frontiers of Algorithmics Workshop and the 9th International Conference on Algorithmic Aspects of Information and Management (FAW-AAIM2013, LNCS7924), Pages 60–71, June 2013, http://link.springer.com/chapter/10.1007%2F978-3-642-38756-2_9.
  20. Xin Han, Yasushi Kawase, and Kazuhisa Makino: Online Knapsack Problem with Removal Cost, Proceedings of the 18th Annual International Computing and Combinatorics Conference (COCOON2012, LNCS7434), Pages 61–73, August 2012, http://link.springer.com/chapter/10.1007%2F978-3-642-32241-9_6.
  21. Yasushi Kawase and Kazuhisa Makino: Nash Equilibria with Minimum Potential in Undirected Broadcast Games, Proceedings of the 6th International Workshop on Algorithms and Computation (WALCOM2012, LNCS7157), Pages 217–228, February 2012, http://link.springer.com/chapter/10.1007/978-3-642-28076-4_22.

Preprints

  1. Yasushi Kawase and Keisuke Bando: Subgame Perfect Equilibria Under the Deferred Acceptance Algorithm, SSRN: 3235068, August 2018.
  2. Yasushi Kawase, Yutaro Yamaguchi, and Yu Yokoi: Subgame Perfect Equilibria of Sequential Matching Games, arXiv: 1804.10353v2, August 2018. A preliminary version is Computing a Subgame Perfect Equilibrium of a Sequential Matching Game, arXiv: 1804.10353v1, April 2018.
  3. Yasushi Kawase, Yusuke Kobayashi, and Yutaro Yamaguchi: Finding a Path in Group-Labeled Graphs with Two Labels Forbidden arXiv:1807.00109, June 2018. A preliminary version is Finding a Path in Group-Labeled Graphs with Two Labels Forbidden, Mathematical Engineering Technical Reports, METR 2014-41, 34pp., December 2014. PDF
  4. Yasushi Kawase and Hanna Sumita: Randomized Strategies for Robust Combinatorial Optimization, arXiv: 1805.07809, May 2018.
  5. Yasushi Kawase, Hanna Sumita, and Takuro Fukunaga: Submodular Maximization with Uncertain Knapsack Capacity, arXiv: 1803.02565, March 2018.
  6. Yasushi Kawase and Atsushi Iwasaki: Approximately Stable Matchings with Budget Constraints, arXiv: 1711.07359, November 2017.
  7. Yasushi Kawase, Kei Kimura, Kazuhisa Makino, and Hanna Sumita: Optimal Matroid Partitioning Problems, arXiv: 1710.00950, September 2017.
  8. Yasushi Kawase: Stochastic Input Models in Online Computing, arXiv: 1709.07601, September 2017.
  9. Yasushi Kawase and Atsushi Iwasaki: Near-feasible stable matchings with budget constraints, arXiv:1705.07643, May 2017.
  10. Yasushi Kawase and Yutaro Yamaguchi: Antimatroids Induced by Matchings, arXiv:1705.05510, May 2017.
  11. Yasushi Kawase and Atsushi Miyauchi: The Densest Subgraph Problem with a Convex/Concave Size Function, arXiv:1703.03603, March 2017.
  12. Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, and Ken-Ichi Kawarabayashi: Optimal Pricing for Submodular Valuations with Bounded Curvature, arXiv:1611.07605, November 2016.
  13. Yasushi Kawase, Kazuhisa Makino, and Kento Seimi: Optimal Composition Ordering Problems for Piecewise Linear Functions, arXiv:1601.05480, January 2016.
  14. Yasushi Kawase, Tomomi Matsui, and Atsushi Miyauchi: Additive Approximation Algorithms for Modularity Maximization, arXiv:1601.03316, January 2016.
  15. Atsushi Miyauchi and Yasushi Kawase: Z-score-based modularity for community detection in networks, arXiv:1501.01909, January 2015.
  16. Xin Han, Yasushi Kawase, and Kazuhisa Makino: Online Unweighted Knapsack Problem with Removal Cost, Mathematical Engineering Technical Reports, METR 2012-29, 17pp., December 2012. PDF
  17. Yasushi Kawase and Kazuhisa Makino: Nash Equilibria with Minimum Potential in Undirected Broadcast Games, Mathematical Engineering Technical Reports, METR 2011-38, 26pp., November 2011. PDF

Theses

  • [Ph. D. Thesis] Algorithmic Studies on Online Knapsack and Related Problems (オンラインナップサックと関連する諸問題に対するアルゴリズム論的研究). University of Tokyo, 2014.
  • [Master Thesis] ネットワークデザインゲームにおけるポテンシャル最小化. University of Tokyo, 2011.
  • [Bachelor Thesis] 主双対法によるオンライン線形計画問題の研究. University of Tokyo, 2009.

Others

  1. 河瀬康志,牧野和久: 無秩序の代償と安定性の代償, オペレーションズ・リサーチ, Vol. 60 No. 6, Pages 337–342, 2015.