Publications of Takehiro ITO


Refereed Papers in Journals

  1. Takehiro Ito, Xiao Zhou and Takao Nishizeki,
    Partitioning Graphs of Supply and Demand,
    Discrete Applied Mathematics, Vol. 157, Issue 12, pp. 2620-2633, June 2009.
    (Special issue of Second Workshop on Graph Classes, Optimization, and Width Parameters, 2005)

  2. Takehiro Ito, Erik D. Demaine, Xiao Zhou and Takao Nishizeki,
    Approximability of Partitioning Graphs with Supply and Demand,
    Journal of Discrete Algorithms, Vol. 6, No. 4, pp. 627-650, 2008.

  3. Takehiro Ito, Akira Kato, Xiao Zhou and Takao Nishizeki,
    Algorithms for Finding Distance-Edge-Colorings of Graphs,
    Journal of Discrete Algorithms, Vol. 5, No. 2, pp. 304-322, 2007.

  4. Takehiro Ito, Kazuya Goto, Xiao Zhou and Takao Nishizeki,
    Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size,
    IEICE Trans. on Information and Systems, Vol. E90-D, No. 2, pp. 449-456, 2007.

  5. Takehiro Ito, Xiao Zhou and Takao Nishizeki,
    Partitioning a Graph of Bounded Tree-Width to Connected Subgraphs of Almost Uniform Size,
    Journal of Discrete Algorithms, Vol. 4, No. 1, pp. 142-154, 2006.

  6. Takehiro Ito, Xiao Zhou and Takao Nishizeki,
    Partitioning Trees of Supply and Demand,
    International Journal of Foundations of Computer Science, Vol. 16, No. 4, pp. 803-827, 2005.
    (This paper received Noguchi Incentive Award.)

  7. Takehiro Ito, Takao Nishizeki and Xiao Zhou,
    Algorithms for Multicolorings of Partial k-Trees,
    IEICE Trans. on Information and Systems, Vol. E86-D, No. 2, pp. 191-200, 2003.
    (This paper received the TELECOM System Technology Award for Student.)



Refereed Papers in Conferences

  1. Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki and Ryuhei Uehara,
    Route-Enabling Graph Orientation Problems,
    in Proceedings of the 20th Annual International Symposium on Algorithms and Computation (ISAAC 2009),
    Lecture Notes in Computer Science, Vol. 5878, pp. 403-412, 2009.

  2. Takehiro Ito, Marcin Kamiński, Daniël Paulusma and Dimitrios M. Thilikos,
    Parameterizing Cut Sets in a Graph by the Number of Their Components,
    in Proceedings of the 20th Annual International Symposium on Algorithms and Computation (ISAAC 2009),
    Lecture Notes in Computer Science, Vol. 5878, pp. 605-615, 2009.

  3. Takehiro Ito, William S. Kennedy and Bruce A. Reed,
    A Characterization of Graphs with Fractional Total Chromatic Number Equal to Δ+2,
    in Proceedings of the V Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2009),
    Electronic Notes in Discrete Mathematics, Vol. 35, pp. 235-240, 2009.

  4. Takehiro Ito, Marcin Kamiński and Erik D. Demaine,
    Reconfiguration of List Edge-Colorings in a Graph,
    in Proceedings of the 11th Algorithms and Data Structures Symposium (WADS 2009),
    Lecture Notes in Computer Science Vol. 5664, pp. 375-386, 2009.

  5. Takehiro Ito, Takeaki Uno, Xiao Zhou and Takao Nishizeki,
    Partitioning a Weighted Tree to Subtrees of Almost Uniform Size,
    in Proceedings of the 19th Annual International Symposium on Algorithms and Computation (ISAAC 2008),
    Lecture Notes in Computer Science Vol. 5369, pp. 196-207, 2008.
    (This paper received the Best Paper Award from ISAAC 2008.)

  6. Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara and Yushi Uno,
    On the Complexity of Reconfiguration Problems,
    in Proceedings of the 19th Annual International Symposium on Algorithms and Computation (ISAAC 2008),
    Lecture Notes in Computer Science Vol. 5369, pp. 28-39, 2008.

  7. Takehiro Ito, Erik D. Demaine, Xiao Zhou and Takao Nishizeki,
    Approximability of Partitioning Graphs with Supply and Demand,
    in Proceedings of the 17th Annual International Symposium on Algorithms and Computation (ISAAC 2006),
    Lecture Notes in Computer Science Vol. 4288, pp. 121-130, 2006.

  8. Takehiro Ito, Kazuya Goto, Xiao Zhou and Takao Nishizeki,
    Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size,
    in Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON 2006),
    Lecture Notes in Computer Science Vol. 4112, pp. 63-72, 2006.

  9. Takehiro Ito, Akira Kato, Xiao Zhou and Takao Nishizeki,
    Algorithms for Finding Distance-Edge-Colorings of Graphs,
    in Proceedings of the 11th Annual International Computing and Combinatorics Conference (COCOON 2005),
    Lecture Notes in Computer Science Vol. 3595, pp. 798-807, 2005.

  10. Takehiro Ito, Xiao Zhou and Takao Nishizeki,
    Partitioning Graphs of Supply and Demand,
    in Proceedings of the 2005 IEEE International Symposium on Circuits and Systems (ISCAS 2005),
    pp. 160-163, 2005.

  11. Takehiro Ito, Xiao Zhou and Takao Nishizeki,
    Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size,
    in Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004),
    Lecture Notes in Computer Science Vol. 3353, pp. 365-376, 2004.

  12. Takehiro Ito, Xiao Zhou and Takao Nishizeki,
    Partitioning Trees of Supply and Demand,
    in Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC 2002),
    Lecture Notes in Computer Science Vol. 2518, pp. 612-623, 2002.
    (This paper received the Young C&C Author's Prize.)

  13. Takehiro Ito, Takao Nishizeki and Xiao Zhou,
    Algorithms for the Multicolorings of Partial k-Trees,
    in Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON 2002),
    Lecture Notes in Computer Science Vol. 2387, pp. 430-439, 2002.



Invited Talk



Other Reports, Abstracts

(restricted to articles in English)

  1. Takehiro Ito,
    Partitioning Graphs of Supply and Demand,
    in Proceedings of Workshop on Algorithms and Computation 2007 (WALCOM 2007),
    pp. 162-179, 2007.

  2. Takehiro Ito, Yoshio Okamoto and Takeshi Tokuyama,
    Algorithms for the Full Steiner Tree Problem,
    in Proceedings of ICALP 2006 Affiliated Workshop "Improving Exponential Time Algorithms," (iETA),
    pp. 39-45, 2006.

  3. Takehiro Ito, Xiao Zhou and Takao Nishizeki,
    Algorithm for Partitioning Graphs of Bounded Tree-Width of Supply and Demand,
    in Proceedings of the 4th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications (JH 2005),
    pp. 114-121, 2005.


Last Updated: December 28, 2009

HOME