• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

NISHIZEKI Takao  西関 隆夫

ORCIDConnect your ORCID iD *help
Researcher Number 80005545
External Links
Affiliation (based on the past Project Information) *help 2011 – 2013: 関西学院大学, 理工学部, 教授
2010: 関日学院大学, 理工学部, 教授
1997 – 2009: 東北大学, 大学院・情報科学研究科, 教授
2006: Tohoku University, Graduate School of Information Sciences, Professor, 大学院情報科学研究科, 教授
1998: 東北大学, 大学院情報科学研究科, 教授 … More
1993 – 1995: 東北大学, 大学院・情報科学研究科, 教授
1994: Tohoku Univ., Electoronics, Prof., 工学部, 教授
1988 – 1992: Tohoku University, Faculty of Engineering, Professor, 工学部, 教授
1987: 東北大学, 工学部, 助教授 Less
Review Section/Research Field
Principal Investigator
Fundamental theory of informatics / 情報工学 / 計算機科学 / 情報通信工学 / 計算機工学 / Science and Engineering
Except Principal Investigator
Fundamental theory of informatics / General mathematics (including Probability theory/Statistical mathematics)
Keywords
Principal Investigator
アルゴリズム / 辺彩色 / グラフ描画 / 部分k木 / VLSI配線 / 直並列グラフ / Edge-Colorings / Structured Graphs / Algorithms / 構造的グラフ … More / 平面グラフ / グラフ分割 / Edge-Disjoint Paths / 辺素な道 / Algorithm / 離散構造 / 非交差道 / 並列アルゴリズム / Series-Parallel Graphs / VLSI設計 / 設計自動化 / アルゴリズム理論 / グラフ / 3次元VLSI / グラフの辺彩色 / スタイナ-林 / Steiner forest / Disjoint path / Routing / VLSI / チャネル配線 / スタイナー林 / 素な道 / Orthogonal Drawir / List Total Coloring / Partial k-Trees / 直交描画 / リスト全彩色 / Plane graph / Straight line drawing / Inner rectangul drawing / Rectangular drawing / Graph Drawing / 直線描画 / 内部矩形描画 / 矩形描画 / Graph Drawlngs / Series-Paraphs / Partial κ-Trees / 部分K木 / Partial κ-trees / Partial kappa-trees / Distributed processing / Network / Computational geometry / Discrete structure / Combinatorial problem / Parallel processing / 分散処理 / ネットワ-ク / 計算幾何学 / 組合せ問題 / 並列処理 / 3連結成分分解木 / 内部3連結グラフ / 格子凸描画 / グラフ彩色 / 擬多項式時間 / 辺容量 / 公平連結分割 / 全域配送林 / 描画 / 彩色 / 分割 / インターネット高度化 / 情報基礎 / 可視化 / インターネット高速化 / 二層配線 / VLSIレイアウト / NC並列アルゴリズム / 平面領域 / 配線 / 2変数整数計画問題 / 格子点列挙 … More
Except Principal Investigator
アルゴリズム / 彩色 / 分解木 / 部分k木 / coloring / tree-decomposition / partial k-tree / algorithm / Association schemes / Spin models / Computational Geometry / Algorithms / Graph embedding / Connectivity / Cycles and paths of graphs / Combinatorics / 指標表 / 双対グラフ / 連結度 / 埋め込み / 次数 / 閉路 / 分割問題 / 組合せ理論 / スピンモデル / アソシエーションスキーム / 計算幾何 / 曲面への埋込み / グラフ / 組合せ論 / 線形時間 / 多項式時間 Less
  • Research Projects

    (20 results)
  • Research Products

    (184 results)
  • Co-Researchers

    (26 People)
  •  Efficient Algorithms for Partitionings, Colorings and Drawings of Graphs and their ApplicationsPrincipal Investigator

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      2009 – 2013
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kwansei Gakuin University
      Tohoku University
  •  Design Theory of Algorithms for Partial k-Trees

    • Principal Investigator
      ZHOU Xiao
    • Project Period (FY)
      2007 – 2009
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tohoku University
  •  Graph Drawing Algorithms and Applications to VLSI DesignsPrincipal Investigator

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      2007 – 2008
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tohoku University
  •  Unified Methodology for Designing Efficient AlgorithmsPrincipal Investigator

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      2005 – 2006
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tohoku University
  •  グラフ描画アルゴリズムとそのWeb情報検索への応用Principal Investigator

    • Principal Investigator
      西関 隆夫
    • Project Period (FY)
      2004 – 2007
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas
    • Review Section
      Science and Engineering
    • Research Institution
      Tohoku University
  •  The Research for Finding Algorithms to Solve Some Combination Problems on Partial k-Trees

    • Principal Investigator
      ZHOU Xiao
    • Project Period (FY)
      2004 – 2006
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tohoku University
  •  Research on algorithms and theory of graph drawingsPrincipal Investigator

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      2003 – 2004
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tohoku University
  •  A Study on Efficient Graph Algprithms and their EvaluationPrincipal Investigator

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      2001 – 2002
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      計算機科学
    • Research Institution
      Tohoku University
  •  Algorithm Engineering for Structural GraphsPrincipal Investigator

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      1999 – 2000
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      計算機科学
    • Research Institution
      Tohoku University
  •  Paradigm for Designing Efficient Algorithms on Structured GraphsPrincipal Investigator

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      1997 – 1998
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      計算機科学
    • Research Institution
      Tohoku University
  •  3次元VLSIレイアウト設計アルゴリズムに関する研究Principal Investigator

    • Principal Investigator
      西関 隆夫
    • Project Period (FY)
      1995
    • Research Category
      Grant-in-Aid for General Scientific Research (C)
    • Research Field
      情報通信工学
    • Research Institution
      Tohoku University
  •  3次元VLSI設計並列高速アルゴリズムに関する研究Principal Investigator

    • Principal Investigator
      西関 隆夫
    • Project Period (FY)
      1994
    • Research Category
      Grant-in-Aid for General Scientific Research (C)
    • Research Field
      情報通信工学
    • Research Institution
      Tohoku University
  •  3次元VLSI設計超並列アルゴリズムに関する研究Principal Investigator

    • Principal Investigator
      西関 隆夫
    • Project Period (FY)
      1993
    • Research Category
      Grant-in-Aid for General Scientific Research (C)
    • Research Field
      情報通信工学
    • Research Institution
      Tohoku University
  •  3次元VLSI配線並列アルゴリズムに関する研究Principal Investigator

    • Principal Investigator
      西関 隆夫
    • Project Period (FY)
      1992
    • Research Category
      Grant-in-Aid for General Scientific Research (C)
    • Research Field
      情報工学
    • Research Institution
      Tohoku University
  •  Combinatorial Theory

    • Principal Investigator
      ENOMOTO Hikoe
    • Project Period (FY)
      1992 – 1994
    • Research Category
      Grant-in-Aid for Co-operative Research (A)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Keio University
  •  3次元VLSI設計並列アルゴリズムに関する研究Principal Investigator

    • Principal Investigator
      西関 隆夫
    • Project Period (FY)
      1991
    • Research Category
      Grant-in-Aid for General Scientific Research (C)
    • Research Field
      情報工学
    • Research Institution
      Tohoku University
  •  3次元VLSI設計アルゴリズムの効率化に関する研究Principal Investigator

    • Principal Investigator
      西関 隆夫
    • Project Period (FY)
      1990
    • Research Category
      Grant-in-Aid for General Scientific Research (C)
    • Research Field
      情報工学
    • Research Institution
      Tohoku University
  •  Research on efficient algorithms for discrete structuresPrincipal Investigator

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      1990 – 1991
    • Research Category
      Grant-in-Aid for Co-operative Research (A)
    • Research Field
      情報工学
    • Research Institution
      Tohoku University
  •  多種フロ-理論と計算幾何学を用いた3次元VLSI設計アルゴリズムPrincipal Investigator

    • Principal Investigator
      西関 隆夫
    • Project Period (FY)
      1989
    • Research Category
      Grant-in-Aid for General Scientific Research (C)
    • Research Field
      計算機工学
    • Research Institution
      Tohoku University
  •  Approach to 3-D VLSI routing algorithms from computational geometry and network flow theoryPrincipal Investigator

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      1987 – 1988
    • Research Category
      Grant-in-Aid for General Scientific Research (C)
    • Research Field
      計算機工学
    • Research Institution
      TOHOKU UNIVERSITY

All 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 Other

All Journal Article Presentation Book

  • [Book] Handbook of Graph Drawing and Visualization2013

    • Author(s)
      T. Nishizeki, M. D. Saidur
    • Total Pages
      31
    • Publisher
      CRC Press Boca Raton
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Book] Handbook of Graph Drawing and Visualization2013

    • Author(s)
      T. Nishizeki, M. D. Saidur
    • Total Pages
      31
    • Publisher
      CRC Press, Boca Raton
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Book] 「情報処理学会50年のあゆみ」グラフアルゴリズム2010

    • Author(s)
      西関隆夫
    • Total Pages
      3
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Book] 「情報処理学会50年のあゆみ」の章「グラフアルゴリズム」2010

    • Author(s)
      西関隆夫
    • Total Pages
      3
    • Publisher
      情報処理学会
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Book] Planar Graphs: Theory and Algorithms2008

    • Author(s)
      T. Nishizeki and N. Chiba
    • Total Pages
      240
    • Publisher
      Dover Publications
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Book] Planar Graphs : Theory and Algorithms2008

    • Author(s)
      T. Nishizeki and N. Chiba
    • Publisher
      Dover Publications
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Book] PLANAR GRAPH DRAWING2004

    • Author(s)
      T.Nishizeki, Md S.Rahman
    • Total Pages
      312
    • Publisher
      World Scientific
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15500002
  • [Book] PLANAR GRAPH DRAWING2004

    • Author(s)
      T.Nishizeki, Md S.Rahman
    • Total Pages
      312
    • Publisher
      World Scientific
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Book] PLANAR GRAPH DRAWING2004

    • Author(s)
      T.Nishizeki, Md.S.Rahman
    • Total Pages
      312
    • Publisher
      World Scientific
    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Spanning Distribution Trees of Graphs2014

    • Author(s)
      M. Kawabata, T. Nishizeki
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E97.D Issue: 3 Pages: 406-412

    • DOI

      10.1587/transinf.E97.D.406

    • NAID

      130003394855

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Parametric power supply networks2014

    • Author(s)
      S. Morishita, T. Nishizeki
    • Journal Title

      J. Comb. Optim.

      Volume: 印刷中 Issue: 1 Pages: 1-15

    • DOI

      10.1007/s10878-013-9661-5

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Partitioning trees with supply, demand and edge-capacity2013

    • Author(s)
      M. Kawabata, T. Nishizeki
    • Journal Title

      IEICE Trans. on Fundamentals of Elec. Comm. & Comp. Sci.

      Volume: E96-A, No.6 Pages: 1036-1043

    • NAID

      110008746413

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Minimum cost partitions of trees with supply and demand2012

    • Author(s)
      T. Nishizeki, T. Ito
    • Journal Title

      Algorithmica

      Volume: 64 Issue: 3 Pages: 400-415

    • DOI

      10.1007/s00453-011-9573-7

    • NAID

      110008676163

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001, KAKENHI-PROJECT-22700001, KAKENHI-PROJECT-23500001
  • [Journal Article] 内部3連結グラフの格子凸描画2012

    • Author(s)
      西関隆夫, 橋本友也
    • Journal Title

      電子情報通信学会論文誌D

      Volume: J95-D-3 Pages: 356-365

    • NAID

      110008746412

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Partitioning a weighted tree into subtrees with weights in a given range2012

    • Author(s)
      T. Ito, T. Nishizeki, M. Schroder, T. Uno, X. Zhou
    • Journal Title

      Algorithmica

      Volume: 62-3 Issue: 3-4 Pages: 823-841

    • DOI

      10.1007/s00453-010-9485-y

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001, KAKENHI-PROJECT-22700001, KAKENHI-PROJECT-23500001, KAKENHI-PLANNED-24106007
  • [Journal Article] Small grid drawings of planar graphs with balanced partition2012

    • Author(s)
      T. Nishizeki, X. Zhou
    • Journal Title

      J. Combinatorial Optimization

      Volume: 24 Issue: 2 Pages: 99-115

    • DOI

      10.1007/s10878-011-9381-7

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001, KAKENHI-PROJECT-23500001
  • [Journal Article] Absolutely secure messsage transmission using a key sharing graph2012

    • Author(s)
      T. Nishizeki, Y. Indo
    • Journal Title

      Discrete Math., Algorithms and Appl.

      Volume: 4 Issue: 04 Pages: 1250053-1250053

    • DOI

      10.1142/s179383091250053x

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001, KAKENHI-PROJECT-23700007
  • [Journal Article] Size-energy tradeoffs for unite circuits computing symmetric Boolean functions2011

    • Author(s)
      T.Nishizeki, K.Uchizawa
    • Journal Title

      Theoretical Computer Science

      Volume: 412 Issue: 8-10 Pages: 773-782

    • DOI

      10.1016/j.tcs.2010.11.022

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings2011

    • Author(s)
      T. Ito, N. Sakamoto, X. Zhou, T. Nishizeki
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E94-D Issue: 2 Pages: 190-195

    • DOI

      10.1587/transinf.E94.D.190

    • NAID

      130000453878

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Minimizing AND-EXOR expressions for two-variable multiple-valued input binary output functions2010

    • Author(s)
      T.Mizuki, H.Tsubata, T.Nishizeki
    • Journal Title

      Journal of Multiple-Valued Logic and Soft Computing Vol.16, Nos.1-2

      Pages: 197-208

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Octagonal drawings of plane graphs with prescribed face areas2009

    • Author(s)
      Md.S.Rahman, K.Miura, T.Nishizeki
    • Journal Title

      Computational Geometry : Theory and Applications Vol.42, No.3

      Pages: 214-230

    • NAID

      110003178794

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Octagonal drawings of plane graphs with prescribed face areas2009

    • Author(s)
      Md. S. Rahman, K. Miura, T. Nishizeki
    • Journal Title

      Computational Geometry : Theory and Applications

      Volume: 42-3 Issue: 3 Pages: 214-230

    • DOI

      10.1016/j.comgeo.2008.09.002

    • NAID

      110003178794

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Partitioning graphs of supply and demand2009

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Discrete Applied Mathematics Vol.157, Issue 12

      Pages: 2620-2633

    • NAID

      110003206419

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Octagonal drawings of plane graphs with prescribed face areas2009

    • Author(s)
      Md. S. Rahman, K. Miura and T. Nishizeki
    • Journal Title

      Computational Geometry : Theory and Applications 42

      Pages: 214-230

    • NAID

      110003178794

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Open rectangle-of-influence drawings of inner triangulated plane graphs2009

    • Author(s)
      K.Miura, T.Matsuno, T.Nishizeki
    • Journal Title

      Discrete and Computational Geometry 41

      Pages: 643-670

    • NAID

      110004851549

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Partitioning graphs with supply and demand2009

    • Author(s)
      Takehiro Ito, Xiao Zhou, Takao Nishizeki
    • Journal Title

      Discrete Applied Math. 157

      Pages: 2620-2633

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Efficient compression of web graphs2009

    • Author(s)
      Y.Asano, Y.Miyawaki, T.Nishizeki
    • Journal Title

      IEICE Trans.Fundamentals Vol.E92-A, No.10

      Pages: 2454-2462

    • NAID

      10026860065

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Partitioning graphs with supply and demand2009

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Discrete Applied Math. 157

      Pages: 2620-2633

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Octagonal drawings of plane graphs with prescribed face areas2009

    • Author(s)
      M. S. Rahman, K. Miura, and T Nishizeki
    • Journal Title

      Computational Geometry : Theory and Applications 42

      Pages: 214-230

    • NAID

      110003178794

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Approximability of partitioning graphs with supply and demand2008

    • Author(s)
      Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 6

      Pages: 627-650

    • NAID

      110004851550

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Open rectangle-of-influence drawings of inner triangulated plane graphs2008

    • Author(s)
      K. Miura, T. Matsuno and T. Nishizeki
    • Journal Title

      Discrete and Computational Geometry Vol.12, No.2

      Pages: 197-224

    • NAID

      110004851549

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Orthogonal drawings of series-parallel graphs with minimum bends2008

    • Author(s)
      X. Zhou and T. Nishizeki
    • Journal Title

      SIAM J. Discrete Math Vol.22, No.4

      Pages: 1570-1604

    • NAID

      110003499880

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Approximability of partitioning graphs with supply and demand2008

    • Author(s)
      T. Ito, E. D. Demaine, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.6

      Pages: 627-650

    • NAID

      110004851550

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Improvements of HITS algorithms for spam links2008

    • Author(s)
      Y. Asano, Y. Tezuka and T. Nishizeki
    • Journal Title

      IEICE Trans. INF. & SYST. Vol. E-91-D No. 2

      Pages: 200-208

    • NAID

      10026800918

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Approximability of partitioning graphs with supply and demand2008

    • Author(s)
      T. Ito, E.D. Demaine, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.6

      Pages: 627-650

    • NAID

      110004851550

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Improvements of HITS algorithms for spam links2008

    • Author(s)
      Y. Asano, Y. Tezuka and T. Nishizeki
    • Journal Title

      IEICE Trans. INF. & SYST Vol.E-91-D, No.2

      Pages: 200-208

    • NAID

      10026800918

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] A revised transformation protocol for unconditionally secure secret key exchange2008

    • Author(s)
      K. Koizumi, T. Mizuki and T. Nishizeki
    • Journal Title

      Theory Comput. Syst 42

      Pages: 187-221

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Convex grid drawings of plane graphs with rectangular contours2008

    • Author(s)
      K. Miura, A. Kamada and T. Nishizeki
    • Journal Title

      Journal of Graph Algorithms and Applications Vol.12, No.2

      Pages: 197-224

    • NAID

      130005444303

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] A revised transformation protocol for unconditionally secure secret key exchange2008

    • Author(s)
      K. Koizumi, T. Mizuki and T. Nishizeki
    • Journal Title

      Theory Comput Syst 42

      Pages: 187-221

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Algorithms for Finding Distance-Edge-Colorings of Graphs2007

    • Author(s)
      T.Ito, A.Kato, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 5

      Pages: 304-322

    • NAID

      10015530666

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size2007

    • Author(s)
      T.Ito, K.Goto, X.Zhou, T.Nishizeki
    • Journal Title

      IEICE Trans. on Information and Systems Vol.E90-D, No.2

      Pages: 449-456

    • NAID

      130005444301

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] List total colorings of series-parallel graphs2007

    • Author(s)
      Y. Matsuo, X. Zhou and T. Nishizeki
    • Journal Title

      IEICE Trans. on Fundamentals of Electronics, Communication and Computer Science E90-A

      Pages: 907-916

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Total colorings of degenerate graphs2007

    • Author(s)
      Shuji Isobe, Xiao Zhou, Takao Nishizeki
    • Journal Title

      Combinatorica 27

      Pages: 167-182

    • NAID

      110003191839

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Sufficient condition and algorithm for list total colorings of series-parallel graphs2007

    • Author(s)
      Y. Matsuo, X. Zhou and T. Nishizeki
    • Journal Title

      IEICE Trans. Fundamentals Vol.E90-A, No.5

      Pages: 907-916

    • NAID

      110007519153

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size,2007

    • Author(s)
      T.Ito, K.Goto, X.Zhou, T.Nishizeki
    • Journal Title

      IEICE Trans. on Information and Systems Vol. E90-D

      Pages: 449-456

    • NAID

      130005444301

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size2007

    • Author(s)
      Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
    • Journal Title

      IEICE Trans. on Information and Systems E90-D

      Pages: 449-456

    • NAID

      130005444301

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size2007

    • Author(s)
      T.Ito, K.Goto, X.Zhou, T.Nishizeki
    • Journal Title

      IEICE Trans. INF. & SYST. E90-D

      Pages: 449-456

    • NAID

      130005444301

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size2007

    • Author(s)
      T. Ito, K. Goto, X. Zhou and T. Nishizeki
    • Journal Title

      IEICE Trans. on Information and Systems E90-D

      Pages: 449-456

    • NAID

      130005444301

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2007

    • Author(s)
      T.Ito, A. Kato, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.5,No.2

      Pages: 304-322

    • NAID

      10015530666

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2007

    • Author(s)
      Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 5

      Pages: 304-322

    • NAID

      10015530666

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Sufficient condition and Algorithm for list total colorings of series-parallel graphs2007

    • Author(s)
      Y. Matsuo, X. Zhou and T. Nishizeki
    • Journal Title

      IEICE Trans. Fundamentals Vol. E90-A No. 5

      Pages: 907-916

    • NAID

      110007519153

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2007

    • Author(s)
      T. Ito, K. Goto, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 5

      Pages: 304-322

    • NAID

      10015530666

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Algorithms for Finding Distance-Edge-Colorings of Graphs,2007

    • Author(s)
      T.Ito, A.Kato, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol. 5

      Pages: 304-322

    • NAID

      10015530666

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size2007

    • Author(s)
      T.Ito, K.Goto, X.Zhou, T.Nishizeki
    • Journal Title

      IEICE Trans. INF. & SYST Vol.E90-D No.2

      Pages: 449-456

    • NAID

      130005444301

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2007

    • Author(s)
      T. Ito, A. Kato, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.5, No.2

      Pages: 304-322

    • NAID

      10015530666

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] List total colorings of series-parallel graphs2007

    • Author(s)
      Yuki Matsuo, Xiao Zhou, Takao Nishizeki
    • Journal Title

      IEICE Trans.on Fundamentals of Electronics, Communications and Computer Sciences E90-A

      Pages: 907-916

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2007

    • Author(s)
      T. Ito, A. Kato, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol. 5, No. 2

      Pages: 304-322

    • NAID

      10015530666

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Sufficient condition and Algorithm for list total colorings of series-parallel graphs2007

    • Author(s)
      Y. Matsuo, X. Zhou and T. Nishizeki
    • Journal Title

      IEICE Trans. Fundamentals Vol.E90-A No.5

      Pages: 907-916

    • NAID

      110007519153

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Total colorings of degenerate graphs2007

    • Author(s)
      S. Isobe, X. Zhou and T. Nishizeki
    • Journal Title

      Combinatorica Vol.27No.2

      Pages: 167-182

    • NAID

      110003191839

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size2007

    • Author(s)
      T.Ito, K.Goto, X.Zhou, Takao Nishizeki
    • Journal Title

      IEICE Trans. on Information and Systems Vol. E90-D・No.2

      Pages: 449-456

    • NAID

      130005444301

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Total colorings of degenerate graphs2007

    • Author(s)
      S. Isobe, X. Zhou and T. Nishizeki
    • Journal Title

      Combinatorica Vol.27, No.2

      Pages: 167-182

    • NAID

      110003191839

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Total colorings of degenerate graphs2007

    • Author(s)
      S. Isobe, X. Zhou and T. Nishizeki
    • Journal Title

      Combinatorica 27

      Pages: 167-182

    • NAID

      110003191839

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Mining communities on the web using a max-flow and site-oriented framework2006

    • Author(s)
      Y.Asano, T.Nishizeki, M.Toyoda, M.Kitsunegawa
    • Journal Title

      IEICE Trans. on Information and Systems Vol.E89-D・No.10

      Pages: 2606-2615

    • NAID

      110007538465

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Inner rectangular drawings of plane graphs2006

    • Author(s)
      K.Miura, H.Haga, T.Nishizeki
    • Journal Title

      International Journal of Computational Geometry & Applications Vol.16, Nos.2 & 3

      Pages: 249-270

    • NAID

      110003206388

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Mining communities on the web using a max-flow and site-oriented framework,2006

    • Author(s)
      Y.Asano, T.Nishizeki, M.Toyoda, M.Kitsunegawa
    • Journal Title

      IEICE Trans, on Information and Systems Vol.E89-D

      Pages: 2606-2615

    • NAID

      110007538465

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Security index for digital fingerprinting2006

    • Author(s)
      K.Banno, S.Orihara, T.Mizuki, T.Nishizeki
    • Journal Title

      IEICE Trans.Fundamentals Vol.E-89-A・No.1

      Pages: 169-177

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Partitioning a Graph of Bounded Tree-Width to Connected Subgraphs of Almost Uniform Size2006

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 4

      Pages: 142-154

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size2006

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol. 4, No. 1

      Pages: 142-154

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Mining communities on the web using a max-flow and site-oriented framework2006

    • Author(s)
      Y.Asano, T.Nishizeki, M.Toyoda, M.Kitsunegawa
    • Journal Title

      IEICE Trans. INF. & SYST. E89-D

      Pages: 2606-2615

    • NAID

      110007538465

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Convex drawings of plane graphs of minimum outer apices2006

    • Author(s)
      K.Miura, M.Azuma, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.17, No.5

      Pages: 1115-1127

    • NAID

      110003499885

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Security index for digital fingerprinting2006

    • Author(s)
      K.Banno, S.Orihara, T.Mizuki, T.Nishizeki
    • Journal Title

      IEICE Trans. Fundamentals E89-A

      Pages: 169-177

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Convex grid drawings of plane graphs with rectangular contours2006

    • Author(s)
      A.Kamada, K.Miura, T.Nishizeki
    • Journal Title

      Proc. of ISAAC2006, LNCS 4288

      Pages: 131-140

    • NAID

      130005444303

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size2006

    • Author(s)
      Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
    • Journal Title

      IEICE Trans. on Information and Systems E90-D

      Pages: 449-456

    • NAID

      130005444301

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Convex drawings of plane graphs of minimum outer apices,2006

    • Author(s)
      K.Miura, M.Azuma, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.17

      Pages: 1115-1127

    • NAID

      110003499885

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Convex grid drawings of four-connected plane graphs2006

    • Author(s)
      K.Miura, S.-I.Nakano, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.17, No.5

      Pages: 1032-1060

    • NAID

      110003191298

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Convex grid drawings of four-connected plane graphs2006

    • Author(s)
      K.Miura, S.-I.Nakano, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.17・No.5

      Pages: 1032-1060

    • NAID

      110003191298

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size,2006

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol. 4

      Pages: 142-154

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Inner rectangular drawings of plane graphs2006

    • Author(s)
      K.Miura, H.Haga, T.Nishizeki
    • Journal Title

      International Journal of Computational Geometry & Applications Vol.16・Nos.2&3

      Pages: 249-270

    • NAID

      110003206388

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Security index for digital fingerprinting,2006

    • Author(s)
      K.Banno, S.Orihara, T.Mizuki, T.Nishizeki
    • Journal Title

      IEICE Trans. Fundamentals Vol.E-89-A

      Pages: 169-177

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Inner rectangular drawings of plane graphs2006

    • Author(s)
      K.Miura, H.Haga, T.Nishizeki
    • Journal Title

      International Journal of Computational Geometry & Applications Vol.16 Nos.2 & 3

      Pages: 249-270

    • NAID

      110003206388

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Convex drawings of plane graphs of minimum outer apices2006

    • Author(s)
      K.Miura, M.Azuma, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.17・No.5

      Pages: 1115-1127

    • NAID

      110003499885

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Sufficient condition and algorithm for list total colorings of series-parallel graphs2006

    • Author(s)
      Y.Matsuo, X.Zhou, T.Nishizeki
    • Journal Title

      Proc. of 9th Japan-Korea joint workshop on Algorithms and Computation

      Pages: 49-56

    • NAID

      110007519153

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Convex grid drawings of four-connected plane graphs2006

    • Author(s)
      K.Miura, S.-I.Nakano, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science 17

      Pages: 1032-1060

    • NAID

      110003191298

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Inner rectangular drawings of plane graphs2006

    • Author(s)
      K.Miura, H.Haga, T.Nishizeki
    • Journal Title

      International Journal of Computational Geometry & Applications 16

      Pages: 249-270

    • NAID

      110003206388

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size2006

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.4, No.1

      Pages: 142-154

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Mining communities on the web using a max-flow and site-oriented framework2006

    • Author(s)
      Y.Asano, T.Nishizeki, M.Toyoda, M.Kitsunegawa
    • Journal Title

      IEICE Trans. on Information and Systems E89-D, No.10

      Pages: 2606-2615

    • NAID

      110007538465

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size2006

    • Author(s)
      T.Ito, K.Goto, X.Zhou, T.Nishizeki
    • Journal Title

      Proc. of COCOON2006, LNCS 4112

      Pages: 63-72

    • NAID

      130005444301

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size2006

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 4

      Pages: 142-154

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Approximability of partitioning graphs with supply and demand2006

    • Author(s)
      T.Ito, E.D.Demaine, X.Zhou, T.Nishizeki
    • Journal Title

      Proc. of ISAAC2006, LNCS 4288

      Pages: 121-130

    • NAID

      110004851550

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Security index for digital fingerprinting2006

    • Author(s)
      K.Banno, S.Orihara, T.Mizuki, T.Nishizeki
    • Journal Title

      IEICE Trans.Fundamentals Vol.E-89-A・No.1

      Pages: 169-177

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Convex grid drawings of four-connected plane graphs,2006

    • Author(s)
      K.Miura, S.-I.Nakano, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vo1.17

      Pages: 1032-1060

    • NAID

      110003191298

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Inner rectangular drawings of plane graphs,2006

    • Author(s)
      K.Miura, H.Haga, T.Nishizeki
    • Journal Title

      International Journal of Computational Geometry & Applications Vol. 16

      Pages: 249-270

    • NAID

      110003206388

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Convex grid drawings of four-connected plane graphs2006

    • Author(s)
      K.Miura, S.-I.Nakano, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.17 No.5

      Pages: 1032-1060

    • NAID

      110003191298

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Convex drawings of plane graphs of minimum outer apices2006

    • Author(s)
      K.Miura, M.Azuma, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science 17

      Pages: 1115-1127

    • NAID

      110003499885

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Convex Grid Drawings of Plane Graphs with Rectangular Contours2006

    • Author(s)
      A.Kamada, K.Miura, T.Nishizeki
    • Journal Title

      Proc. of ISAAC2006, LNCS 4288

      Pages: 131-140

    • NAID

      110004851548

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size2006

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol. 4・No. 1

      Pages: 142-154

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Convex drawings of plane graphs of minimum outer apices2006

    • Author(s)
      K.Miura, M.Azuma, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.17 No.5

      Pages: 1115-1127

    • NAID

      110003499885

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] List colorings of series-parallel graphs2005

    • Author(s)
      X.Zhou, Y.Matsuo, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 3

      Pages: 47-60

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15500002
  • [Journal Article] List total colorings of series-parallel graphs,2005

    • Author(s)
      X.Zhou, Y.Matsuo, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 3

      Pages: 47-60

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] List total colorings of series-parallel graphs2005

    • Author(s)
      X.Zhou, Y.Matsuo, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 3

      Pages: 47-60

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning trees of supply and demand2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International J. of Found. of Computer Science 16

      Pages: 803-827

    • NAID

      110003178704

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs2005

    • Author(s)
      Md.S.Rahman, N.Egi, T.Nishizeki
    • Journal Title

      IEICE TransINF.& SYST. Vol.E88-D・No.1

      Pages: 23-30

    • NAID

      110003214131

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning trees of supply and demand2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.16・No.4

      Pages: 803-827

    • NAID

      110003178704

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs2005

    • Author(s)
      Md.S.Rahman, N.Egi, T.Nishizeki
    • Journal Title

      IEICE Trans.INF.& SYST. Vol.E88-D・NO.1

      Pages: 23-30

    • NAID

      110003214131

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Canonical decomposition, realizer, schnyder labeling and orderly spanning trees of plane graphs2005

    • Author(s)
      K.Miura, M.Azuma, T.Nishizeki
    • Journal Title

      International J. of Found. of Computer Science 16

      Pages: 117-141

    • NAID

      130005443597

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning trees of supply and demand2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.16, No.4

      Pages: 803-827

    • NAID

      110003178704

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Orthogonal drawing of series-parallel graphs with minimum bends2005

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Proc.of ISAAC 2005

      Pages: 166-175

    • NAID

      110003499880

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Canonical decomposition, realizer, Schnyder labeling and orderly spanning trees of plane graphs2005

    • Author(s)
      K.Miura, M.Azuma, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.16・No.1

      Pages: 117-141

    • NAID

      130005443597

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs2005

    • Author(s)
      Md.S.Rahman, N.Egi, T.Nishizeki
    • Journal Title

      IEICE Trans.INF. & SYST. E88-D 1

      Pages: 23-30

    • NAID

      110003214131

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework2005

    • Author(s)
      Y.Asano, T.Nishizeki, M.Toyoda
    • Journal Title

      Proc.of WISE 2005

      Pages: 1-14

    • NAID

      110007538465

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2005

    • Author(s)
      T.Ito, A.Kato, X.Zhou, T.Nishizeki
    • Journal Title

      Proc.of COCOON 2005, Lect.Notes in Comp.Sci(Springer-verlag) 3595

      Pages: 798-807

    • NAID

      10015530666

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] List total colorings of series-parallel graphs2005

    • Author(s)
      X.Zhou, Y.Matsuo, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 3

      Pages: 47-60

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs2005

    • Author(s)
      Md.S.Rahman, N.Egi, T.Nishizeki
    • Journal Title

      IEICE Trans.INF.& SYST E88-D

      Pages: 23-30

    • NAID

      110003214131

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs,2005

    • Author(s)
      Md.S.Rahman, N.Egi, T.Nishizeki
    • Journal Title

      IEICE Trans. INF. & SYST. Vol.E88-D

      Pages: 23-30

    • NAID

      110003214131

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs2005

    • Author(s)
      Md.S.Rahman, N.Egi, T.Nishizeki
    • Journal Title

      IEICE Trans. INF. & SYST. E88-D

      Pages: 23-30

    • NAID

      110003214131

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] List colorings of series-parallel graphs2005

    • Author(s)
      X.Zhou, Y.Matsuo, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 3

      Pages: 47-60

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning trees of supply and demand2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science 16

      Pages: 803-827

    • NAID

      110003178704

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning trees of supply and demand2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.16 No.4

      Pages: 803-827

    • NAID

      110003178704

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Canonical decomposition, realizer, Schnyder labeling and orderly spanning trees of plane graphs2005

    • Author(s)
      K.Miura, M.Azuma, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.16・No.1

      Pages: 117-141

    • NAID

      130005443597

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Canonical decomposition, realizer, schnyder labeling and orderly spanning trees of plane graphs2005

    • Author(s)
      K.Miura, M.Azuma, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science 16

      Pages: 117-141

    • NAID

      130005443597

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Partitioning trees of supply and demand2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.16・No.4

      Pages: 803-827

    • NAID

      110003178704

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] List total colorings of series-parallel graphs2005

    • Author(s)
      X.Zhou, Y.Matsuo, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms 3(1)

      Pages: 47-60

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Orthogonal drawings of series-parallel graphs with minimum bends2005

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Proc.of ISAAC 2005, Lect.Notes in Comp.Sci(Springer-verlag) 3827

      Pages: 166-175

    • NAID

      110003499880

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Canonical decomposition, realizer, schnyder labeling and orderly spanning trees of plane graphs,2005

    • Author(s)
      K.Miura, M.Azuma, T.Nishizeki
    • Journal Title

      International J. of Found. of Computer Science Vol.16

      Pages: 117-141

    • NAID

      130005443597

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Mining communities on the web using a max-flow and a site-oriented framework2005

    • Author(s)
      Y.Asano, T.Nishizeki, M.Toyoda
    • Journal Title

      Proc.of WISE 2005

      Pages: 1-14

    • NAID

      110007538465

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Partitioning trees of supply and demand,2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International J. of Found. of Computer Science Vol. 16

      Pages: 803-827

    • NAID

      110003178704

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Algorithm for the cost edge-coloring of trees2004

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Combinatorial Optimization 8(1)

      Pages: 97-108

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Cost total colorings of trees2004

    • Author(s)
      S.Isobe, X.Zhou, T.Nishizeki
    • Journal Title

      IEICE Trans.INF. & SYST E-87D 2

      Pages: 337-342

    • NAID

      110003223354

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Cost total colorings of trees2004

    • Author(s)
      S.Isobe, X.Zhou, T.Nishizeki
    • Journal Title

      IEICE Trans. INF. & SYST. E-87

      Pages: 337-342

    • NAID

      110003223354

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Algorithms for drawing plane graphs,2004

    • Author(s)
      T.Nishizeki, K.Miura, Md.S.Rahman
    • Journal Title

      IEICE Trans. INF. & SYST. Vol.E-87

      Pages: 281-289

    • NAID

      110003223347

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Cost total colorings of trees,2004

    • Author(s)
      S.Isobe, X.Zhou, T.Nishizeki
    • Journal Title

      IEICE Trans. INF. & SYST. Vol.E-87

      Pages: 337-342

    • NAID

      110003223354

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Multicolorings of series-parallel graphs2004

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Algorithmica 38

      Pages: 271-297

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15500002
  • [Journal Article] Algorithms for drawing plane graphs2004

    • Author(s)
      T.Nishizeki, K.Miura, Md.S.Rahman
    • Journal Title

      IEICE Trans.INF.& SYST Vol.E-87・ No.2

      Pages: 281-289

    • NAID

      110003223347

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-15500002
  • [Journal Article] Rectangular Drawings of Planar Graphs2004

    • Author(s)
      Md.S.Rahman, Takao Nishizeki, Shubhashis Ghosh
    • Journal Title

      Journal of Algorithms 50(1)

      Pages: 62-78

    • NAID

      110003494010

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Algorithms for drawing plane graphs2004

    • Author(s)
      T.Nishizeki, K.Miura, Md.S.Rahman
    • Journal Title

      IEICE Trans.INF.& SYST E-87・No.2

      Pages: 281-289

    • NAID

      110003223347

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Rectangular Drawings of Planar Graphs2004

    • Author(s)
      Md.S.Rahman, T.Nishizeki, S.Ghosh
    • Journal Title

      Journal of Algorithms 50

      Pages: 62-78

    • NAID

      110003494010

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15500002
  • [Journal Article] Planar Graph Drawing2004

    • Author(s)
      T.Nishizeki, Md S.Rahman
    • Journal Title

      World Scientific

      Pages: 312-312

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-15500002
  • [Journal Article] Algorithms for drawing plane graphs2004

    • Author(s)
      T.Nishizeki, K.Miura, Md.S.Rahman
    • Journal Title

      IEICE Trans.INF. & SYST. E-87D 2

      Pages: 281-289

    • NAID

      110003223347

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Algorithms for drawing plane graphs2004

    • Author(s)
      T.Nishizeki, K.Miura, Md.S.Rahman
    • Journal Title

      IEICE Trans. INF. & SYST. E-87

      Pages: 281-289

    • NAID

      110003223347

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Multicolorings of series-parallel graphs,2004

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Algorithmica 38

      Pages: 271-297

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Rectangular Drawings of Planar Graphs2004

    • Author(s)
      Md.S.Rahman, T.Nishizeki, S.Ghosh
    • Journal Title

      Journal of Algorithms 50

      Pages: 62-78

    • NAID

      110003494010

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Algorithm for the cost edge-coloring of trees,2004

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Combinatorial Optimization 8

      Pages: 97-108

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Algorithm for the cost edge-coloring of trees2004

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Combinatorial Optimization 8

      Pages: 97-108

    • Data Source
      KAKENHI-PROJECT-15500002
  • [Journal Article] Rectangular Drawings of Planar Graphs,2004

    • Author(s)
      Md.S.Rahman, T.Nishizeki, S.Ghosh
    • Journal Title

      Journal of Algorithms 50

      Pages: 62-78

    • NAID

      110003494010

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Multicolorings of series-parallel graphs2004

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Algorithmica 38

      Pages: 271-297

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Algorithm for the cost edge-coloring of trees2004

    • Author(s)
      X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Combinatorial Optimization 8

      Pages: 97-108

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Algorithms for drawing plane graphs2004

    • Author(s)
      T.Nishizeki, K.Miura, Md.S.Rahman
    • Journal Title

      IEICE Trans.INF.& SYST Vol.E-87・No.2

      Pages: 281-289

    • NAID

      110003223347

    • Data Source
      KAKENHI-PROJECT-15500002
  • [Journal Article] Algorithms for drawing plane graphs2004

    • Author(s)
      T.Nishizeki, K.Miura, Md.S.Rahman
    • Journal Title

      IEICE Trans. INF. & SYST Vol.E-87・No.2

      Pages: 281-289

    • NAID

      110003223347

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15500002
  • [Journal Article] Web-linkage viewer : drawing links in the web based on a site-oriented framework2004

    • Author(s)
      Y.Asano, T.Nishizeki
    • Journal Title

      Proc.of GD 2003 LNCS2912

      Pages: 498-499

    • Data Source
      KAKENHI-PROJECT-16500002
  • [Journal Article] Web-linkage viewer : drawing links in the web based on a site-oriented framework2004

    • Author(s)
      Y.Asano, T.Nishizeki
    • Journal Title

      Proc.of GD 2003 LNCS2912

      Pages: 498-499

    • Data Source
      KAKENHI-PROJECT-15500002
  • [Journal Article] Finding a region with the minimum total L_1 distance from prescribed terminals2003

    • Author(s)
      Y.Kusakari, T.Nishizeki
    • Journal Title

      Algorithmica 35

      Pages: 225-256

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15500002
  • [Journal Article] A linear algorithm for compact box-drawings of trees2003

    • Author(s)
      Md.S.Rahman, T.Nishizeki, M.Naznin
    • Journal Title

      NETWORKS 42・3

      Pages: 160-164

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15500002
  • [Journal Article] Finding a region with the minimum total L_1 distance fromprescribed terminals2003

    • Author(s)
      Y.Kusakari, T.Nishizeki
    • Journal Title

      Algorithmica 35

      Pages: 225-256

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-15500002
  • [Journal Article] Orthogonal drawings of series-parallel graphs with minimum bends

    • Author(s)
      X. Zhou and T. Nishizeki
    • Journal Title

      SIAM J. Discrete Math. (採録決定)

    • NAID

      110003499880

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Partitioning graphs with supply and demand

    • Author(s)
      T. Ito, X. Zhou and T. Nishizeki
    • Journal Title

      Discrete Applied Math. (採録決定)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Journal Article] Approximability of partitioning graphs with supply and demand

    • Author(s)
      T. Ito, E. Demaine, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms (採録決定)

    • NAID

      110004851550

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Presentation] Spanning Distribution Trees of Graphs2013

    • Author(s)
      T. Nishizeki
    • Organizer
      FAW-AAIM 2013
    • Place of Presentation
      大連海事大学,中国
    • Year and Date
      2013-06-26
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Parametric Power Supply Networks2013

    • Author(s)
      T. Nishizeki
    • Organizer
      COCOON 2013
    • Place of Presentation
      杭州浙江大学,中国
    • Year and Date
      2013-06-21
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Algorithms for Bandwidth Consecutive Multicolorings of Graphs2012

    • Author(s)
      T. Nishizeki
    • Organizer
      FAW-AAIM 2012
    • Place of Presentation
      北京大学,中国
    • Year and Date
      2012-05-14
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Absolutely secure message transmission using a key sharing graph-Extended Abstract-2011

    • Author(s)
      Y.Indo, T.Mizuki, T.Nishizeki
    • Organizer
      ISORA2011
    • Place of Presentation
      中国,敦煌
    • Year and Date
      2011-08-28
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Partitioning trees with supply, demand and edge-capacity-Extended Absutract-2011

    • Author(s)
      M.Kawabata, T.Nishizeki
    • Organizer
      ISORA2011
    • Place of Presentation
      中国,敦煌
    • Year and Date
      2011-08-28
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Small grid drawings of planar graphs with balanced bipartition2010

    • Author(s)
      X.Zhou, T.Hikino, T.Nishizeki
    • Organizer
      WALCOM 2010
    • Place of Presentation
      BUET (バングラデシュ)
    • Year and Date
      2010-02-10
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Minimum cost partitions of trees with supply and demand2010

    • Author(s)
      T. Nishizeki
    • Organizer
      ISAAC 2010
    • Place of Presentation
      amada Plaza Jeju, Korea
    • Year and Date
      2010-12-17
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Grid drawings of planar graphs with balanced bipartition2010

    • Author(s)
      X.Zhou, T.Hikino, T.Nishizeki
    • Organizer
      In Proc.of the 4th Workshop on Algorithms and Computation(WALCOM'10), Lect.Notes in Computer Science, Springer
    • Place of Presentation
      Dhaka, Bangladesh
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Presentation] Grid drawings of planar graphs with balanced bipartition2010

    • Author(s)
      Xiao Zhou, Takashi Hikino, Takao Nishizeki
    • Organizer
      Proc. of the 4th Workshop on Algorithms and Computation (WALCOM'10), Lect. Notes in Computer Science, Springer
    • Place of Presentation
      Dhaka, Bangladesh
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Presentation] Convex drawings of internally triconnected plane graphs on O(n^2)grids2009

    • Author(s)
      X.Zhou, T.Nishizeki
    • Organizer
      ISAAC 2009
    • Place of Presentation
      Ala Moana Hotel (アメリカ)
    • Year and Date
      2009-12-18
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Convex drawings of internally triconnected plane graphs on O(n^2)grids2009

    • Author(s)
      X.Zhou, T.Nishizeki
    • Organizer
      In Proc.of the 20th Annual International Symposium on Algorithms and Computation(ISAAC'09), Lect.Notes in Computer Science. Springer
    • Place of Presentation
      Hawaii, USA
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Presentation] Convex drawings of internally triconnected plane graphs on O(n^2) grids2009

    • Author(s)
      Xiao Zhou, Takao Nishizeki
    • Organizer
      Proc. of the 20th Annual International Symposium on Algorithms and Computation (ISAAC'09), Lect. Notes in Computer Science, Springer
    • Place of Presentation
      Hawaii, USA
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Presentation] Size and energy of threshold circuits computing mod functions2009

    • Author(s)
      K.Uchizawa, T.Nishizeki, E.Takimoto
    • Organizer
      MFCS 2009
    • Place of Presentation
      Novy Smokoveg, High Tatras (スロバキア)
    • Year and Date
      2009-08-28
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Energy complexity and depth of threshold circuits2009

    • Author(s)
      K.Uchizawa, T.Nishizeki, E.Takimoto
    • Organizer
      FCT 2009
    • Place of Presentation
      ブロツワフ工科大学(ポーランド)
    • Year and Date
      2009-09-02
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Efficient compression of web graphs2008

    • Author(s)
      Y. Asano, Y. Miyawaki and T. Nishizeki
    • Organizer
      COCOON 2008
    • Place of Presentation
      中国・大連市
    • Year and Date
      2008-07-27
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Presentation] Partitioning a weighted tree to subtrees of almost uniform size2008

    • Author(s)
      Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki
    • Organizer
      Proc. of the 19th Annual International Symposium on Algorithms and Computation (ISAAC'08), Lect. Notes in Computer Science, Springer
    • Place of Presentation
      Gold Coast, Australia
    • Data Source
      KAKENHI-PROJECT-19500001
  • [Presentation] Partitioning a weighted tree to subtrees of almost uniform size2008

    • Author(s)
      T. Ito, T. Uno, X. Zhou and T. Nishizeki
    • Organizer
      Proc. of ISAAC 2008, Lect. Notes in Comp. Sci
    • Place of Presentation
      Springer-verlag(5369, 196-207)
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Presentation] Partitioning a weighted tree to subtrees of almost uniform size2008

    • Author(s)
      T. Ito, T. Uno, X. Zhou and T. Nishizeki
    • Organizer
      ISAAC 2008
    • Place of Presentation
      オーストラリア・ゴールドコースト
    • Year and Date
      2008-12-15
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Presentation] Efficient compression of web graphs2008

    • Author(s)
      Y. Asano, Y. Miyawaki and T. Nishizeki
    • Organizer
      Proc. of COCOON 2008, Lect. Notes in Comp. Sci
    • Place of Presentation
      Springer-verlag(5092, 1-11)
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Presentation] Improvements of HITS algorithms for spam links2007

    • Author(s)
      Y. Asano, Y. Tezuka and T. Nishizeki
    • Organizer
      APWeb/Waim 2007
    • Place of Presentation
      中国・黄山
    • Year and Date
      2007-06-17
    • Data Source
      KAKENHI-PROJECT-16092203
  • [Presentation] Orthogonal drawings of series-parallel graphs with minimum bends2007

    • Author(s)
      X. Zhou and T. Nishizeki
    • Organizer
      Proc. of WALCOM
    • Place of Presentation
      (3-12)
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Presentation] Inner rectangular drawings of plane graphs : application of graph drawing to VLSI layout2007

    • Author(s)
      T. Nishizeki
    • Organizer
      Proc. of WALCOM 2007
    • Place of Presentation
      (1-2)
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Presentation] Improvements of HITS algorithms for spam links2007

    • Author(s)
      Y. Asano, Y. Tezuka and T. Nishizeki
    • Organizer
      Proc. of APWeb/Waim 2007, Lect. Notes in Comp. Sci
    • Place of Presentation
      Springer-verlag(4505, 479-490)
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Presentation] Parametric Power Supply Network

    • Author(s)
      T. Nishizeki
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      飯坂温泉伊勢谷,福島市
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Parametric Power Supply Networks

    • Author(s)
      S. Morishita, T. Nishizeki
    • Organizer
      COCOON 2013
    • Place of Presentation
      杭州浙江大学,中国
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Spanning Distribution Trees of Graphs

    • Author(s)
      M. Kawabata, T. Nishizeki
    • Organizer
      FAW-AAIM 2013
    • Place of Presentation
      大連海事大学,中国
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] 直並列グラフの全域配送木

    • Author(s)
      T. Nishizeki
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      飯坂温泉伊勢谷,福島市
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Algorithms for Bandwidth Consecutive Multicolorings of Graphs

    • Author(s)
      T. Nishizeki
    • Organizer
      FAW-AAIM2013
    • Place of Presentation
      北京大学, 中国
    • Data Source
      KAKENHI-PROJECT-21500001
  • 1.  ZHOU Xiao (10272022)
    # of Collaborated Projects: 11 results
    # of Collaborated Products: 81 results
  • 2.  NAKANO Shin-ichi (30227855)
    # of Collaborated Projects: 6 results
    # of Collaborated Products: 0 results
  • 3.  鈴木 均 (70206522)
    # of Collaborated Projects: 6 results
    # of Collaborated Products: 0 results
  • 4.  ITO Takehiro (40431548)
    # of Collaborated Projects: 5 results
    # of Collaborated Products: 22 results
  • 5.  MIURA Kazuyuki (80333871)
    # of Collaborated Projects: 4 results
    # of Collaborated Products: 21 results
  • 6.  ASANO Yasuhito (20361157)
    # of Collaborated Projects: 4 results
    # of Collaborated Products: 10 results
  • 7.  RAHMAN Md.Saidur (60361151)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 16 results
  • 8.  UCHIZAWA Kei (90510248)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 3 results
  • 9.  IMAI Hiroshi (80183010)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 10.  SAITO Akira (90186924)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 11.  WATANABE Toshimasa (80112184)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 12.  HIRATA Tomio (10144205)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 13.  HAGIHARA Ken-ichi (00133140)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 14.  KATOH Naoki (40145826)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 15.  ENOMOTO Hikoe (00011669)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 16.  NEGAMI Seiya (40164652)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 17.  BANNAI Eiichi (10011652)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 18.  MAEHARA Hiroshi (60044921)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 19.  渡辺 治 (80158617)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 20.  安浦 寛人 (80135540)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 21.  梅尾 博司 (80132356)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 22.  五十嵐 善英 (60006260)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 23.  浅野 孝夫 (90124544)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 24.  江川 嘉美 (70147502)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 25.  加納 幹雄 (20099823)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 26.  草苅 良至 (50302203)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi