Publications

Back to the top page in Japanese / English

Papers in journals

  1. Takuro Fukunaga,
    Graph orientations with set connectivity requirements
    Discrete Mathematics, in press
    DOI: 10.1016/j.disc.2012.04.004
  2. Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi,
    Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
    Algorithmica, Volume 62, Issue 3 (2012), 787-806
    DOI: 10.1007/s00453-010-9483-0
  3. Hirofumi Aota, Takuro Fukunaga, Hiroshi Nagamochi,
    An approximation algorithm for locating maximal disks within convex polygons
    International Journal of Computational Geometry & Applications, vol. 21, issue 6 (2011), 661-684
    DOI: 10.1142/S0218195911003858
  4. Takuro Fukunaga,
    All 4-edge-connected HHD-free graphs are Z3-connected,
    Graphs and Combinatorics, vol. 27, issue 5, 2011, pp. 647-659
    DOI: 10.1007/s00373-010-0995-9
    KURENAI: http://hdl.handle.net/2433/147263
  5. Takuro Fukunaga, Hiroshi Nagamochi,
    Network design with weighted degree constraints,
    Discrete Optimization, vol. 7, issue 4, November 2010, pp. 246–255
    DOI: 10.1016/j.disopt.2010.05.004
    KURENAI: http://hdl.handle.net/2433/128835
  6. Takuro Fukunaga, Hiroshi Nagamochi,
    Network design with edge-connectivity and degree constraints
    Theory of Computing Systems, Volume 45, Issue 3 (2009), pp. 512-532
    DOI: 10.1007/s00224-008-9149-3
    KURENAI: http://hdl.handle.net/2433/87748
  7. Takuro Fukunaga, Hiroshi Nagamochi,
    Eulerian Detachments with Local Edge-Connectivity
    Discrete Applied Mathematics, vol. 157, issue 4, February 2009, pp. 691-698
    DOI: 10.1016/j.dam.2008.08.001.
  8. Takuro Fukunaga, Hiroshi Nagamochi,
    Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds,
    Journal of the Operations Research Society of Japan,
    Vol. 50, No. 4, December 2007, pp. 339-350.
    (Some results in this paper can be improved. See corrections of my dissertatin.)
  9. André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh,
    Approximability of the capacitated b-edge dominating set problem
    Theoretical Computer Science,
    Vol. 385, October 2007, pp. 202-213
    DOI: 10.1016/j.tcs.2007.06.009
  10. Takuro Fukunaga, Hiroshi Nagamochi,
    Generalizing the induced matching by edge capacity constraints,
    Discrete Optimization,
    Vol. 4, Issue 2, June 2007, pp. 198-205
    DOI: 10.1016/j.disopt.2006.11.004
  11. Takuro Fukunaga, Hiroshi Nagamochi,
    Approximating a generalization of metric TSP,
    IEICE Transactions on Information and Systems,
    Special Section on Foundations of Computer Science,
    Vol. E90-D, No. 2, February, 2007, pp. 432-439.
  12. Takuro Fukunaga, Toshihide Ibaraki,
    Knowledge based support vector machines,
    International Journal of Engineering Intelligent Systems for Electrical Engineering and Communications,
    Special Issue on Knowledge Engineering, Vol. 13, No. 4, 2005, pp. 259-267.

Papers in proceedings of conferences

  1. Takuro Fukunaga,
    Approximating minimum cost source location problems with local vertex-connectivity demands
    Proceedings of the 8th Annual Conference on Theory and Applications of Models of Computation (TAMC),
    May 23-25, 2011, Tokyo, Japan
    Lecture Notes in Computer Science, Vol. 6648, pp. 428-439
    DOI: 10.1007/978-3-642-20877-5_42
  2. Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi,
    FPTAS's for Some Cut Problems in Weighted Trees
    Proceedings of the 4th International Frontiers of Algorithmics Workshop (FAW 2010),
    August 11-13, 2010, Wuhan University, Wuhan, China,
    Lecture Notes in Computer Science, Vol. 6213, pp. 210-221
    DOI: 10.1007/978-3-642-14553-7_21
  3. Takuro Fukunaga,
    Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
    Proceedings of the 14th Conference on Integer Programming and Combinatorial Optimization (IPCO XIV),
    June 9-11, 2010, Lausanne, Switzerland,
    Lecture Notes in Computer Science, Vol. 6080, pp. 15-28
    DOI: 10.1007/978-3-642-13036-6_2
  4. Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi,
    Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
    Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC),
    December 16-18, 2009, Hawaii, USA,
    Lecture Notes in Computer Science, Vol. 5878, pp. 55-64
    DOI: 10.1007/978-3-642-10631-6_8
  5. Takuro Fukunaga,
    Graph Orientations with Set Connectivity Requirements
    Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC),
    December 16-18, 2009, Hawaii, USA,
    Lecture Notes in Computer Science, Vol. 5878, pp. 265-274
    DOI: 10.1007/978-3-642-10631-6_28
  6. Takuro Fukunaga,
    All 4-edge-connected HHD-free graphs are Z_3-connected,
    Proceedings of 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,
    May 16-19, 2009, Budapest, Hungary,
    pp. 65-74.
  7. Takuro Fukunaga, Hiroshi Nagamochi,
    Network design with weighted degree constraints,
    Proceedings of Third Annual Workshop on Algorithms and Computation (WALCOM),
    February 18-20, 2009, Indian Statistical Institute, Kolkata, India,
    Lecture Notes in Computer Science, Vol. 5431, pp. 214-225
    DOI: 10.1007/978-3-642-00202-1_19
  8. Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi,
    Robust cost colorings,
    Proceedings of ACM-SIAM Symposium on Discrete Mathematics (SODA),
    January 20-22, 2008, Holiday Inn Golden Gateway, San Francisco, California,
    pp. 1204-1212.
  9. Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi,
    Rent-or-buy scheduling and cost coloring problems,
    Proceedings of the Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2007),
    December 12-14, 2007, New Delhi, India,
    Lecture Notes in Computer Science, Vol. 4855, pp. 84-95
    DOI: 10.1007/978-3-540-77050-3_7
  10. Takuro Fukunaga, Hiroshi Nagamochi,
    The set connector problem in graphs,
    Proceedings of the 12th Conference on Integer Programming and Combinatorial Optimization (IPCO),
    June 25-27, 2007, Cornell University, Ithaca, New York,
    Lecture Notes in Computer Science, vol. 4513, pp. 484-498
    DOI: 10.1007/978-3-540-72792-7_36
  11. Takuro Fukunaga, Hiroshi Nagamochi,
    Network design with edge-connectivity and degree constraints,
    Proceedings of Fourth Workshop on Approximation and Online Algorithms (WAOA),
    September 14-15, 2006, ETH Zürich, Zürich, Switzerland,
    Lecture Notes in Computer Science, vol. 4368, pp. 188-201
    DOI: 10.1007/11970125_15
  12. Takuro Fukunaga, Hiroshi Nagamochi,
    Some theorems on detachments preserving local-edge-connectivity,
    Proceedings of 5th Cracow Conference on Graph Theory,
    September 11-15, 2006, Ustron, Poland,
    Electronic Notes in Discrete Mathematics, Volume 24, pp. 173-180 [link].
  13. Takuro Fukunaga, Hiroshi Nagamochi,
    Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds,
    Proceedings of the 9th Japan-Korea Joint Workshop on Algorithm and Computation (WAAC),
    July 4-5, 2006, Hokkaido University, Sapporo, Japan, pp. 25-32.
  14. Takuro Fukunaga, Hiroshi Nagamochi,
    Approximation algorithms for the b-edge dominating set problem and its related problems,
    Proceedings of the Eleventh International Computing and Combinatorics Conference (COCOON),
    August 16-19, 2005, Kunming, China,
    Lecture Notes in Computer Science, vol. 3595, pp. 747-756
    DOI: 10.1007/11533719_76
  15. Takuro Fukunaga, Hiroshi Nagamochi,
    Edge packing problem with edge capacity constraints,
    Proceedings of the 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,
    June 3-6, 2005, Budapest, Hungary, pp. 69-75.
  16. Takuro Fukunaga, Toshihide Ibaraki,
    Knowledge based SVM,
    Proceedings of the International Conference on Knowledge Engineering and Decision Support,
    July 21-23, 2004, Porto, Portugal, pp. 135-142.

Technical reports

  1. Takuro Fukunaga, R. Ravi
    Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
    arXiv:1203.3578
    Submitted on March 15, 2012, revised on March 29, 2012.
  2. Hirofumi Aota, Takuro Fukunaga, Hiroshi Nagamochi,
    Dynamic Programming Based Approximation Scheme for Locating Disks within Convex Polygons,
    Technical report 2010-017, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University,
    submitted on December 14, 2010 [pdf file].
  3. Takuro Fukunaga,
    Approximation algorithms for the source location problem with local vertex-connectivity demands,
    Technical report 2010-013, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University,
    submitted on October 28, 2010, revised on December 20, 2010 [pdf file].
  4. Takuro Fukunaga,
    Computing minimum multiway cuts in hypergraphs from hypertree packings,
    Technical report 2009-016, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University,
    submitted on August 5, 2009 [pdf file].
  5. Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi,
    Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems,
    Technical report 2009-012, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University,
    submitted on April 13, 2009, revised on June 15, 2009 [pdf file].
  6. Takuro Fukunaga,
    Set connectivity and graph orientation theorems,
    Technical report 2009-001, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University,
    submitted on January 7, 2009 [pdf file].
  7. Takuro Fukunaga,
    All 4-edge-connected HHD-free graphs are Z_3-connected,
    Technical report 2008-009, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University,
    submitted on August 13, 2008 [pdf file] [supplement].
  8. Takuro Fukunaga, Hiroshi Nagamochi,
    Network design with weighted degree constraints,
    Technical report 2008-005, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University,
    submitted on April 24, 2008 [pdf file].
  9. Takuro Fukunaga, Hiroshi Nagamochi,
    Network design with edge-connectivity and degree constraints,
    Technical report 2006-012, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University,
    submitted on October 4, 2006 [pdf file].
  10. Takuro Fukunaga, Hiroshi Nagamochi,
    Eulerian detachments with local-edge-connectivity,
    Technical report 2006-006, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University,
    submitted on May 8, 2006 [pdf file].
  11. Takuro Fukunaga, Hiroshi Nagamochi,
    Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds,
    Technical report 2005-010, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University,
    submitted on September 19, 2005, revised on January 17, 2006 [pdf file].

Theses

  1. Approximation algorithms to the network design problems,
    Ph.D. thesis, Graduate School of Informatics, Kyoto University, January 2007
    Supervised by Hiroshi Nagamochi
    KURENAI: http://hdl.handle.net/2433/93464 (corrections).
  2. Approximation algorithms for b-edge dominating set problem and related problems,
    Master's thesis, Graduate School of Informatics, Kyoto University, March 2005
    Supervised by Hiroshi Nagamochi.
  3. Applying rules in support vector machines (in Japanese),
    Bachelor's thesis, Faculty of Engineering, Kyoto University, March 2003
    Supervised by Toshihide Ibaraki.

Back to the top page in Japanese / English

This page is updated on May 01, 2012