Calculated based on number of publications stored in Pure and citations from Scopus
20052022

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 2022

    Monotone edge ips to an orientation of maximum edge-connectivity a la Nash-Williams

    Ito, T., Iwamasa, Y., Kakimura, N., Kamiyama, N., Kobayashi, Y., Maezawa, S. I., Nozaki, Y., Okamoto, Y. & Ozeki, K., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 1342-1355 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 2021

    Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions

    Takemura, K., Ito, S., Hatano, D., Sumita, H., Fukunaga, T., Kakimura, N. & Kawarabayashi, K. I., 2021, 35th AAAI Conference on Artificial Intelligence, AAAI 2021. Association for the Advancement of Artificial Intelligence, p. 9791-9798 8 p. (35th AAAI Conference on Artificial Intelligence, AAAI 2021; vol. 11A).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 2020

    Market pricing for matroid rank valuations

    Bérczi, K., Kakimura, N. & Kobayashi, Y., 2020 Dec, 31st International Symposium on Algorithms and Computation, ISAAC 2020. Cao, Y., Cheng, S-W. & Li, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 391-3915 3525 p. 39. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 181).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries

    Tsourakakis, C. E., Chen, T., Kakimura, N. & Pachocki, J., 2020, Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2019, Proceedings. Brefeld, U., Fromont, E., Hotho, A., Knobbe, A., Maathuis, M. & Robardet, C. (eds.). Springer, p. 378-394 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11906 LNAI).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)
  • 2019

    Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint

    Huang, C. C. & Kakimura, N., 2019, Algorithms and Data Structures - 16th International Symposium, WADS 2019, Proceedings. Friggstad, Z., Salavatipour, M. R. & Sack, J-R. (eds.). Springer Verlag, p. 438-451 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11646 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    10 Citations (Scopus)
  • Non-zero-sum stackelberg budget allocation game for computational advertising

    Hatano, D., Kuroki, Y., Kawase, Y., Sumita, H., Kakimura, N. & Kawarabayashi, K. I., 2019, PRICAI 2019: Trends in Artificial Intelligence - 16th Pacific Rim International Conference on Artificial Intelligence, Proceedings. Nayak, A. C. & Sharma, A. (eds.). Springer Verlag, p. 568-582 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11670 LNAI).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Shortest reconfiguration of perfect matchings via alternating cycles

    Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., 2019 Sep, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 61. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 144).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Citations (Scopus)
  • Spectral aspects of symmetric matrix signings

    Carlson, C., Chandrasekaran, K., Chang, H. C., Kakimura, N. & Kolla, A., 2019 Aug, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019. Katoen, J-P., Heggernes, P. & Rossmanith, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 81. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 138).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 2018

    Boosting PageRank Scores by Optimizing Internal Link Structure

    Ohsaka, N., Sonobe, T., Kakimura, N., Fukunaga, T., Fujita, S. & Kawarabayashi, K. I., 2018, Database and Expert Systems Applications - 29th International Conference, DEXA 2018, Proceedings. Ma, H., Wagner, R. R., Hartmann, S., Pernul, G. & Hameurlain, A. (eds.). Springer Verlag, p. 424-439 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11029 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)
  • Causal bandits with propagating inference

    Yabe, A., Hatano, D., Sumita, H., Ito, S., Kakimura, N., Fukunaga, T. & Kawarabayashi, K. I., 2018, 35th International Conference on Machine Learning, ICML 2018. Dy, J. & Krause, A. (eds.). International Machine Learning Society (IMLS), p. 8761-8781 21 p. (35th International Conference on Machine Learning, ICML 2018; vol. 12).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Finding a dense subgraph with sparse cut

    Miyauchi, A. & Kakimura, N., 2018 Oct 17, CIKM 2018 - Proceedings of the 27th ACM International Conference on Information and Knowledge Management. Paton, N., Candan, S., Wang, H., Allan, J., Agrawal, R., Labrinidis, A., Cuzzocrea, A., Zaki, M., Srivastava, D., Broder, A. & Schuster, A. (eds.). Association for Computing Machinery, p. 547-556 10 p. (International Conference on Information and Knowledge Management, Proceedings).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    6 Citations (Scopus)
  • The B-branching problem in digraphs

    Kakimura, N., Kamiyama, N. & Takazawa, K., 2018 Aug 1, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018. Potapov, I., Worrell, J. & Spirakis, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 12. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 117).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)
  • Tight approximability of the server allocation problem for real-time applications

    Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y., Okamoto, Y. & Shiitada, T., 2018, Algorithmic Aspects of Cloud Computing - 3rd International Workshop, ALGOCLOUD 2017, Revised Selected Papers. Delis, A., Pallis, G. & Alistarh, D. (eds.). Springer Verlag, p. 41-55 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10739 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    5 Citations (Scopus)
  • 2017

    An improved approximation algorithm for the subpath planning problem and its generalization

    Sumita, H., Yonebayashi, Y., Kakimura, N. & Kawarabayashi, K. I., 2017, 26th International Joint Conference on Artificial Intelligence, IJCAI 2017. Sierra, C. (ed.). International Joint Conferences on Artificial Intelligence, p. 4412-4418 7 p. (IJCAI International Joint Conference on Artificial Intelligence; vol. 0).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    5 Citations (Scopus)
  • Complexity of the multi-service center problem

    Ito, T., Kakimura, N. & Kobayashi, Y., 2017 Dec 1, 28th International Symposium on Algorithms and Computation, ISAAC 2017. Tokuyama, T. & Okamoto, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 92).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)
  • Reconfiguration of maximum-weight b-matchings in a graph

    Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., 2017, Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings. Cao, Y. & Chen, J. (eds.). Springer Verlag, p. 287-296 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10392 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Citations (Scopus)
  • Reducing Recovery Error in Compressive Sensing with Limited Number of Base Stations

    Pakawanwong, P., Suppakitpaisarn, V., Xu, L. & Kakimura, N., 2017 Jul 1, 2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings. Institute of Electrical and Electronics Engineers Inc., p. 1-7 7 p. (2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings; vol. 2018-January).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint

    Huang, C. C., Kakimura, N. & Yoshida, Y., 2017 Aug 1, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017. Rolim, J. D. P., Jansen, K., Williamson, D. P. & Vempala, S. S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 11. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 81).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    12 Citations (Scopus)
  • 2016

    Efficient stabilization of cooperative matching games

    Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., 2016, AAMAS 2016 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), p. 41-49 9 p. (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Citations (Scopus)
  • Exact and approximation algorithms for weighted matroid intersection

    Huang, C. C., Kakimura, N. & Kamiyama, N., 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Association for Computing Machinery, Vol. 1. p. 430-444 15 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    6 Citations (Scopus)
  • Maximizing time-decaying influence in social networks

    Ohsaka, N., Yamaguchi, Y., Kakimura, N. & Kawarabayashi, K. I., 2016, Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2016, Proceedings. Giuseppe, J., Landwehr, N., Manco, G. & Frasconi, P. (eds.). Springer Verlag, p. 132-147 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9851 LNAI).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    14 Citations (Scopus)
  • 2015

    Parameterized complexity of sparse linear complementarity problems

    Sumita, H., Kakimura, N. & Makino, K., 2015 Nov 1, 10th International Symposium on Parameterized and Exact Computation, IPEC 2015. Husfeldt, T., Husfeldt, T. & Kanj, I. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 355-364 10 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 43).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Threshold influence model for allocating advertising budgets

    Miyauchi, A., Iwamasa, Y., Fukunaga, T. & Kakimura, N., 2015, 32nd International Conference on Machine Learning, ICML 2015. Blei, D. & Bach, F. (eds.). International Machine Learning Society (IMLS), p. 1395-1404 10 p. (32nd International Conference on Machine Learning, ICML 2015; vol. 2).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    13 Citations (Scopus)
  • 2014

    Maximum lifetime coverage problems with battery recovery effects

    Fu, N., Suppakitpaisarn, V., Kimura, K. & Kakimura, N., 2014 Feb 9, 2014 IEEE Global Communications Conference, GLOBECOM 2014. Institute of Electrical and Electronics Engineers Inc., p. 118-124 7 p. 7036794. (2014 IEEE Global Communications Conference, GLOBECOM 2014).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    7 Citations (Scopus)
  • Optimal budget allocation: Theoretical guarantee and efficient algorithm

    Soma, T., Kakimura, N., Inaba, K. & Kawarabayashi, K. I., 2014, 31st International Conference on Machine Learning, ICML 2014. International Machine Learning Society (IMLS), p. 556-568 13 p. (31st International Conference on Machine Learning, ICML 2014; vol. 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    43 Citations (Scopus)
  • 2013

    Sparse linear complementarity problems

    Sumita, H., Kakimura, N. & Makino, K., 2013 Sep 9, Algorithms and Complexity - 8th International Conference, CIAC 2013, Proceedings. p. 358-369 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7878 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)
  • 2012

    Erdocombining double acute accents-Pósa property and its algorithmic applications - Parity constraints, subset feedback set, and subset packing

    Kakimura, N., Kawarabayashi, K. I. & Kobayashi, Y., 2012, Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012. p. 1726-1736 11 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    26 Citations (Scopus)
  • Matching problems with delta-matroid constraints

    Kakimura, N. & Takamatsu, M., 2012, Theory of Computing 2012 - Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, CATS 2012. p. 83-92 10 p. (Conferences in Research and Practice in Information Technology Series; vol. 128).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 2011

    Computing knapsack solutions with cardinality robustness

    Kakimura, N., Makino, K. & Seimi, K., 2011 Dec 26, Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings. p. 693-702 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7074 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Citations (Scopus)
  • Robust independence systems

    Kakimura, N. & Makino, K., 2011 Jul 11, Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings. PART 1 ed. p. 367-378 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6755 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Citations (Scopus)
  • Set covering with ordered replacement: Additive and multiplicative gaps

    Eisenbrand, F., Kakimura, N., Rothvoß, T. & Sanità, L., 2011, Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, Proceedings. p. 170-182 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6655 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)
  • 2007

    Sign-solvable linear complementarity problems

    Kakimura, N., 2007, Integer Programming and Combinatorial Optimization - 12th International IPCO Conference, Proceedings. Springer Verlag, p. 397-409 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4513 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution