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

Sakuma Tadashi  佐久間 雅

ORCIDConnect your ORCID iD *help
… Alternative Names

SAKUMA Tadashi  佐久間 雅

Less
Researcher Number 60323458
Other IDs
Affiliation (Current) 2025: 山形大学, 理学部, 教授
Affiliation (based on the past Project Information) *help 2020 – 2022: 山形大学, 理学部, 教授
2018 – 2019: 山形大学, 理学部, 准教授
2016 – 2017: 山形大学, 地域教育文化学部, 准教授
2014 – 2015: 山形大学, 教育文化学部, 准教授
2007 – 2010: Yamagata University, 地域教育文化学部, 准教授 … More
2005 – 2006: 山形大学, 地域教育文化学部, 助教授
2005: The Yamagata University, Associate Professor, 教育学部, 助教授
2001 – 2004: 東京大学, 大学院・総合文化研究科, 助手 Less
Review Section/Research Field
Principal Investigator
Basic Section 12030:Basic mathematics-related / General mathematics (including Probability theory/Statistical mathematics) / Foundations of mathematics/Applied mathematics / General mathematics (including Probability theory/Statistical mathematics)
Except Principal Investigator
Foundations of mathematics/Applied mathematics / Bioinformatics/Life informatics
Keywords
Principal Investigator
Tutte Polynomial / perfect graph / ideal clutter / パッキングとカバリングの理論 / Packing and Covering / network majority / safe set / MFMC-property / blocking polyhedra / packing property … More / clutter / Configulation / Covering / Packing / Hypergraph / Average Hitting Time / Pebble Motion Problem / the MFMC property / Perfect Graph / Ideal Clutter / Blocking型の整数多面体 / Anti-Blocking型整数多面体 / weighted safe set / convex geometry / gold grabbing game / tutte polynomial / 石交換群 / グラフの自己同型群 / lattice / connected safe set / 凸幾何 / tute polynomial / FPTAS / safe number / pebble motion problem / Fibonacci number / average hitting time / safe set problem / Pebble motion problem / Tutte多項式 / フィボナッチ数列 / 期待到達時間 / 巡回群 / ideal cullter / anti-blocking polytope / packing and covering / near factorization / 理想グラフ / MFMC-性 / クラッター / アンチブロッキング型整数多面体 / ブロッキング型整数多面体 / weighted sefe set / Chord Diagram / MFMC Property / Packing Property / Ideal clutter / Euclidean Distance Matrix / Matroid basis graph / the packing property / pebble motion planning / claw-free graph / path-parity / odd-hole recognition / excluded minor / ideality / 禁止マイナー / odd-hole inequality / 禁止のマイナー / Cornuejoulsの予想 / packing-property / perfect-ness / MFMC-ness / ideal-ness / minimally non-packing clutter / minimally non-ideal clutter / Total Dual Integrality / Blocking Polyhedra / MFMC property / ideal / Grin stead's Conjecture / circular graph (circulant) / the Strong Perfect Graph Conjecture / uniquely colorable graph / near-factorization / Grinstaed's Conjecture / circulant / partitionable graph … More
Except Principal Investigator
幾何グラフ / 組合せ論 / 離散数学 / Tutte多項式 / インターレースグラフ / コードダイアグラム / グラフの石交換群 / グラフの自己同型群 / グラフパズル / グラフの自己同型 / グラフ理論 / optimization algorithms / methaheuristic algorithms / Tabu search / molecular phyloaenetic tree / アルゴリズム / 組み合わせ最適化 / バイオインフォマティクス / 生物分子系統樹 / 最適化アルゴリズム / メタヒューリスティック / タブー探索 / 分子系統樹 Less
  • Research Projects

    (8 results)
  • Research Products

    (55 results)
  • Co-Researchers

    (10 People)
  •  Combinatorial structures on packing, covering, and configulation on hypergraphsPrincipal Investigator

    • Principal Investigator
      佐久間 雅
    • Project Period (FY)
      2022 – 2025
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Review Section
      Basic Section 12030:Basic mathematics-related
    • Research Institution
      Yamagata University
  •  Research on similarities and dissimilarities between the blocking and anti-blocking polyhedraPrincipal Investigator

    • Principal Investigator
      Sakuma Tadashi
    • Project Period (FY)
      2018 – 2022
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Review Section
      Basic Section 12030:Basic mathematics-related
    • Research Institution
      Yamagata University
  •  A study of deformation operations of graphs

    • Principal Investigator
      Nakamigawa Tomoki
    • Project Period (FY)
      2016 – 2018
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Foundations of mathematics/Applied mathematics
    • Research Institution
      Shonan Institute of Technology
  •  Similarities between the blocking and anti-blocking polyhedraPrincipal Investigator

    • Principal Investigator
      Sakuma Tadashi
    • Project Period (FY)
      2014 – 2017
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Foundations of mathematics/Applied mathematics
    • Research Institution
      Yamagata University
  •  Toward "good characterizations" of idealness of cluttersPrincipal Investigator

    • Principal Investigator
      SAKUMA Tadashi
    • Project Period (FY)
      2007 – 2010
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Yamagata University
  •  独立集合族に付随するTDI不等式に対する構造定理の構築を目指してPrincipal Investigator

    • Principal Investigator
      佐久間 雅
    • Project Period (FY)
      2004 – 2006
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      Yamagata University
      The University of Tokyo
  •  The construction of rapid algorithms for constructing molecular phylogenetic trees based on the principles of metaheuristic algorithms

    • Principal Investigator
      NAKAMURA Masataka
    • Project Period (FY)
      2003 – 2005
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Bioinformatics/Life informatics
    • Research Institution
      The University of Tokyo
  •  一意彩色可能グラフにおける局所的及び大域的制約構造についての研究Principal Investigator

    • Principal Investigator
      佐久間 雅
    • Project Period (FY)
      2001 – 2002
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      General mathematics (including Probability theory/Statistical mathematics)
    • Research Institution
      The University of Tokyo

All 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2011 2010 2009 2008 2007 2006 2005 Other

All Journal Article Presentation

  • [Journal Article] On the average hitting times of the squares of cycles2022

    • Author(s)
      Doi Yoshiaki、Konno Norio、Nakamigawa Tomoki、Sakuma Tadashi、Segawa Etsuo、Shinohara Hidehiro、Tamura Shunya、Tanaka Yuuho、Toyota Kosuke
    • Journal Title

      Discrete Applied Mathematics

      Volume: 313 Pages: 18-28

    • DOI

      10.1016/j.dam.2022.01.001

    • Data Source
      KAKENHI-PROJECT-19K03616, KAKENHI-PROJECT-22K03398, KAKENHI-PROJECT-18K03388
  • [Journal Article] Pebble exchange group of graphs2021

    • Author(s)
      Kato Tatsuoki、Nakamigawa Tomoki、Sakuma Tadashi
    • Journal Title

      European Journal of Combinatorics

      Volume: 95 Pages: 103325-103325

    • DOI

      10.1016/j.ejc.2021.103325

    • Data Source
      KAKENHI-PROJECT-18K03388
  • [Journal Article] Stable structure on safe set problems in vertex-weighted graphs2021

    • Author(s)
      Fujita Shinya、Park Boram、Sakuma Tadashi
    • Journal Title

      European Journal of Combinatorics

      Volume: 91 Pages: 103211-103211

    • DOI

      10.1016/j.ejc.2020.103211

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K03388, KAKENHI-PROJECT-19K03603
  • [Journal Article] Stable structure on safe set problems in vertex-weighted graphs2020

    • Author(s)
      Shinya Fujita, Boram Park & Tadashi Sakuma
    • Journal Title

      European Journal of Combinatorics

      Volume: In press

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K03388
  • [Journal Article] Tutte Polynomial, Complete Invariant, and Theta Series2020

    • Author(s)
      Kume Misaki、Miezaki Tsuyoshi、Sakuma Tadashi、Shinohara Hidehiro
    • Journal Title

      Graphs and Combinatorics

      Volume: online Issue: 5 Pages: 1-14

    • DOI

      10.1007/s00373-020-02238-w

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K03388, KAKENHI-PROJECT-18K03217
  • [Journal Article] Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II --Recognition and Complexity--2020

    • Author(s)
      Fujita Shinya、Park Boram、Sakuma Tadashi
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 12301 Pages: 364-375

    • DOI

      10.1007/978-3-030-60440-0_29

    • ISBN
      9783030604394, 9783030604400
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K03388, KAKENHI-PROJECT-19K03603
  • [Journal Article] A generalization of the Tutte polynomials2019

    • Author(s)
      Tsuyoshi Miezaki, Manabu Oura, Tadashi Sakuma, Hidehiro Shinohara
    • Journal Title

      Proceedings of the Japan Academy, Ser. A Mathematical Sciences

      Volume: 95 Issue: 10 Pages: 111-113

    • DOI

      10.3792/pjaa.95.111

    • NAID

      40022103495

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K03217, KAKENHI-PROJECT-18K03388, KAKENHI-PROJECT-17K05164
  • [Journal Article] Convex Grabbing Game of the Point Set on the Plane2019

    • Author(s)
      Naoki Matsumoto , Tomoki Nakamigawa & Tadashi Sakuma
    • Journal Title

      Graphs and Combinatorics

      Volume: 36 Issue: 1 Pages: 51-62

    • DOI

      10.1007/s00373-019-02117-z

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K03388
  • [Journal Article] Safe sets in graphs: Graph classes and structural parameters2018

    • Author(s)
      Raquel Agueda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
    • Journal Title

      Journal of Combinatorial Optimization

      Volume: 印刷中 Issue: 4 Pages: 1221-1242

    • DOI

      10.1007/s10878-017-0205-2

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26400185, KAKENHI-PROJECT-18K03388, KAKENHI-PROJECT-17H01698
  • [Journal Article] On Ideal Minimally Non-packing Clutters2018

    • Author(s)
      Kashiwabara Kenji、Sakuma Tadashi
    • Journal Title

      Mathematical Programming and Game Theory. Indian Statistical Institute Series.

      Volume: 3 Pages: 67-86

    • DOI

      10.1007/978-981-13-3059-9_4

    • ISBN
      9789811330582, 9789811330599
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K03388
  • [Journal Article] On ideal minimally non-packing clutters2018

    • Author(s)
      Kenji Kashiwabara and Tadashi Sakuma
    • Journal Title

      Mathematical Programming and Game Theory (Springer research monograph)

      Volume: 印刷中

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-26400185
  • [Journal Article] The Expansion of a Chord Diagram and the Tutte Polynomial2018

    • Author(s)
      Tomoki Nakamigawa and Tadashi Sakuma
    • Journal Title

      Discrete Mathematics

      Volume: 341 Issue: 6 Pages: 1573-1581

    • DOI

      10.1016/j.disc.2018.02.015

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-26400185, KAKENHI-PROJECT-18K03388, KAKENHI-PROJECT-16K05260
  • [Journal Article] On the weighted safe set problem on paths and cycles2018

    • Author(s)
      Fujita Shinya、Jensen Tommy、Park Boram、Sakuma Tadashi
    • Journal Title

      Journal of Combinatorial Optimization

      Volume: 37 Issue: 2 Pages: 685-701

    • DOI

      10.1007/s10878-018-0316-4

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K03388, KAKENHI-PROJECT-15K04979
  • [Journal Article] Safe sets, network majority on weighted trees2017

    • Author(s)
      Bapat Ravindra B.、Fujita Shinya、Legay Sylvain、Manoussakis Yannis、Matsui Yasuko、Sakuma Tadashi、Tuza Zsolt
    • Journal Title

      Networks

      Volume: 71 Issue: 1 Pages: 81-92

    • DOI

      10.1002/net.21794

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K04979, KAKENHI-PROJECT-26400185, KAKENHI-PROJECT-18K03388
  • [Journal Article] The Expansion of a Chord Diagram and the Tutte Polynomial(extended abstract)2017

    • Author(s)
      T. Nakamigawa and T. Sakuma
    • Journal Title

      Electronic Notes in Discrete Mathematics

      Volume: 61 Pages: 917-923

    • DOI

      10.1016/j.endm.2017.07.054

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K05260, KAKENHI-PROJECT-26400185
  • [Journal Article] Network Majority on Tree Topological Network2016

    • Author(s)
      Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza.
    • Journal Title

      Electronic Notes in Discrete Mathematics

      Volume: 54 Pages: 79-84

    • DOI

      10.1016/j.endm.2016.09.015

    • Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26400185
  • [Journal Article] Safe set problem on graphs2016

    • Author(s)
      Shinya Fujita, Gary MacGillivray, Tadashi Sakuma
    • Journal Title

      Discrete Applied Mathematics

      Volume: 215 Pages: 106-111

    • DOI

      10.1016/j.dam.2016.07.020

    • Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-15K04979, KAKENHI-PROJECT-26400185
  • [Journal Article] Safe Sets in Graphs: Graph Classes and Structural Parameters2016

    • Author(s)
      Raquel Agueda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 10043 Pages: 241-253

    • DOI

      10.1007/978-3-319-48749-6_18

    • ISBN
      9783319487489, 9783319487496
    • Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26400185
  • [Journal Article] On the Balanced Decomposition Number2015

    • Author(s)
      Tadashi SAKUMA
    • Journal Title

      Graphs and Combinatorics

      Volume: 31 Issue: 6 Pages: 2377-2380

    • DOI

      10.1007/s00373-015-1526-5

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-26400185
  • [Journal Article] Safe set Problem on Graphs2014

    • Author(s)
      Shinya Fujita, Gary MacGillivray, Tadashi Sakuma
    • Journal Title

      The Proceedings of Bordeaux Graph Workshop 2014 Enseirb-Matmeca & LaBRI, Bordeaux, France, 19-22 November, 2014

      Volume: 1 Pages: 71-72

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-26400185
  • [Journal Article] Pebble exchange on graphs2013

    • Author(s)
      S. Fujita, T. Nakamigawa and T. Sakuma
    • Journal Title

      Discrete Applied Mathematics

      Volume: 184 Pages: 139-145

    • DOI

      10.1016/j.dam.2013.03.009

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23540168, KAKENHI-PROJECT-26400185
  • [Journal Article] N-flips in even triangulations on the torus and Dehn twists preserving monodromies2011

    • Author(s)
      Yusuke Higuchi, Atsushi Nakamoto, Kazuhiro Ota, Tadashi Sakuma
    • Journal Title

      Discrete Mathematics 311(13)

      Pages: 1128-1135

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540110
  • [Journal Article] N-flips in even triangulations on the torus and Dehn twists preserving monodomies2011

    • Author(s)
      Yusuke Higuchi, Atsuhiro Nakamoto, Katsuhiro Ota, Tadashi Sakuma
    • Journal Title

      Discrete Mathematics

      Volume: 311 Pages: 1128-1135

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540110
  • [Journal Article] The Positive circuits of oriented matroids with the packing property or idealness2010

    • Author(s)
      Kashiwaba Kenji, Sakuma Tadashi
    • Journal Title

      Electronic Notes in Discrete Mathematics 36

      Pages: 287-294

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540110
  • [Journal Article] On circular thin Lehman matrices2010

    • Author(s)
      Sakuma Tadashi, Shinohara Hidehiro
    • Journal Title

      応用数学合同研究集会報告集

      Pages: 123-126

    • Data Source
      KAKENHI-PROJECT-19540110
  • [Journal Article] The positive circuits of oriented matroids with the packing property or idealness2010

    • Author(s)
      Kashiwabara Kenji, Tadashi Sakuma
    • Journal Title

      Electronic Notes in Discrete Mathematics

      Volume: 36 Pages: 1287-1294

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540110
  • [Journal Article] Disjoint Even Cycles Packing2009

    • Author(s)
      Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma
    • Journal Title

      Electronic Notes in Discrete Mathematics 34

      Pages: 113-119

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540110
  • [Journal Article] Colored Pebble Motion on Graphs (Extended Abstract)2009

    • Author(s)
      Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma
    • Journal Title

      Electronic Notes in Discrete Mathematics 34

      Pages: 113-119

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540110
  • [Journal Article] Colored Pebble Motion on Graphs(Extended Abstract)2009

    • Author(s)
      Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma
    • Journal Title

      Electronic Notes in Discrete Mathematics 34

      Pages: 185-189

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540110
  • [Journal Article] Pebble Exchange on Graphs (Extended Abstract)2009

    • Author(s)
      Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma
    • Journal Title

      第26回代数的組合せ論シンポジウム報告集

      Pages: 126-132

    • Data Source
      KAKENHI-PROJECT-19540110
  • [Journal Article] Pebble Exchange on Graphs(Extended Abstract)2009

    • Author(s)
      Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma
    • Journal Title

      第26回代数的組合せ論シンポジウム報告集

      Pages: 126-132

    • Data Source
      KAKENHI-PROJECT-19540110
  • [Journal Article] Path-parity-solvability and its heredity2008

    • Author(s)
      Shinya FUJITA, Tadashi SAKUMA
    • Journal Title

      Abstracts of the 20th Workshop on Topological Graph Theorey in Yokohama 1

      Pages: 142-143

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540110
  • [Journal Article] Determining the minimum rank of matroids whose basis graph is common2008

    • Author(s)
      Masahiro HACHIMORI, Hiroshi KURATA, Tadashi SAKUMA
    • Journal Title

      Electronic Notes in Discrete Mathematics 31

      Pages: 137-142

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540110
  • [Journal Article] A group majorization ordering for Euclidean distance matrices.2007

    • Author(s)
      H.Kurata, T.Sakuma
    • Journal Title

      Linear Algebra and its Applications 420

      Pages: 586-595

    • Data Source
      KAKENHI-PROJECT-16740045
  • [Journal Article] Grinstead's Conjecture is true for graphs with a small clique number.2006

    • Author(s)
      K.Kashiwabara, T.Sakuma
    • Journal Title

      Discrete Mathematics 306

      Pages: 2572-2581

    • Data Source
      KAKENHI-PROJECT-16740045
  • [Journal Article] N-Flips in even triangulations on the sphere2006

    • Author(s)
      Atsuhiro Nakamoto, Tadashi Sakuma, Yusuke Suzuki
    • Journal Title

      Journal of Graph Theory 51

      Pages: 260-268

    • Data Source
      KAKENHI-PROJECT-16740045
  • [Journal Article] The Packing Clutter of the Positive Cocircuits of an Oriented Matroid Whose Rank is at most 4,2005

    • Author(s)
      Kenji Kashiwabara, Tadashi Sakuma
    • Journal Title

      The Proceedings of the 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications

      Pages: 303-308

    • Data Source
      KAKENHI-PROJECT-16740045
  • [Journal Article] On circulant thin Lehman matrices, Electronic Notes in Discrete Mathematics

    • Author(s)
      Sakuma Tadashi, Shinohara Hidehiro
    • Journal Title

      Accepted

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540110
  • [Journal Article] Grinstead's Conjecture is true for some fixed $omega(G)$'s.

    • Author(s)
      K.Kashiwabara, T.Sakuma
    • Journal Title

      Discrete Mathematics (未定)

    • Data Source
      KAKENHI-PROJECT-16740045
  • [Journal Article] olored Pebble Motion on Graphs, European Journal of Combinatorics

    • Author(s)
      Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma
    • Journal Title

      accepted

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19540110
  • [Presentation] Network majority and the connected safe set problem2021

    • Author(s)
      Tadashi Sakuma
    • Organizer
      International Symposium on Computational Operations Research and Algorithmic Game Theory
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K03388
  • [Presentation] サイクル の二乗グラフ上の乱歩における期待到達時間の解析2019

    • Author(s)
      土井義耀,中上川友樹,佐久間雅,瀬川悦生,篠原英裕,田中優帆,田村駿也,豊田晃典
    • Organizer
      応用数学合同研究集会報告集(2019) #D033, 7pages.
    • Data Source
      KAKENHI-PROJECT-18K03388
  • [Presentation] Pebble Exchange Group of Graphs2018

    • Author(s)
      Tadashi Sakuma
    • Organizer
      6th Asian Conference on Nonlinear Analysis and Optimization, November 5-9, 2018 at Okinawa Japan
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K05260
  • [Presentation] グラフの石交換群2017

    • Author(s)
      中上川友樹,加藤立隆,佐久間雅
    • Organizer
      応用数学合同研究集会
    • Data Source
      KAKENHI-PROJECT-16K05260
  • [Presentation] Similarities and dissimilarities between the blocking and anti-blocking polyhedra2017

    • Author(s)
      Tadashi SAKUMA
    • Organizer
      2017 Symposium on Mathematical Programming and Game Theory (2017 SMPGT)
    • Place of Presentation
      Indian Statistical Institute, Delhi Centre
    • Year and Date
      2017-01-09
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26400185
  • [Presentation] The expansion of a chord diagram and the Tutte polynomial2017

    • Author(s)
      T. Nakamigawa and T. Sakuma
    • Organizer
      The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K05260
  • [Presentation] Minimally non-ideal clutters and ideal minimally non-packing clutters2017

    • Author(s)
      Tadashi Sakuma
    • Organizer
      The 10th Anniversary Conference on Nonlinear Analysis and Convex Analysis
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26400185
  • [Presentation] コードダイアグラムの展開とTutte多項式2016

    • Author(s)
      中上川 友樹,佐久間 雅
    • Organizer
      2016年度応用数学合同研究集会
    • Place of Presentation
      龍谷大学(滋賀県大津市)
    • Year and Date
      2016-12-15
    • Data Source
      KAKENHI-PROJECT-16K05260
  • [Presentation] ブロッキング型及びアンチブロッキング型整数多面体の類似性について2016

    • Author(s)
      佐久間雅
    • Organizer
      日本数学会 2016年度年会 応用数学分科会 特別講演
    • Place of Presentation
      筑波大学
    • Year and Date
      2016-03-16
    • Invited
    • Data Source
      KAKENHI-PROJECT-26400185
  • [Presentation] The positive circuits of oriented matroids with the packing property or idealness2010

    • Author(s)
      Tadashi Sakuma
    • Organizer
      ISCO Hammamet : International Symposium on Combinatorial Optimization
    • Place of Presentation
      Yasmine Hammamet at El Medina Mediterranea.
    • Data Source
      KAKENHI-PROJECT-19540110
  • [Presentation] The positive circuits of oriented matroids with the packing property or idealness2010

    • Author(s)
      Tadashi Sakuma
    • Organizer
      ISCO Hammamet : International Symposium on Combinatorial Optimization
    • Place of Presentation
      Yasmine Hammamet at El Medina Mediterranea
    • Data Source
      KAKENHI-PROJECT-19540110
  • [Presentation] The positive circuits of oriented matroids with the packing property or idealness.2010

    • Author(s)
      佐久間雅
    • Organizer
      ISCO Hammamet : International Symposium on Combinatorial Optimization
    • Place of Presentation
      Yasmine Hammamet at El Medina Mediterranea.
    • Data Source
      KAKENHI-PROJECT-19540110
  • [Presentation] Colored Pebble Motion on Graphs2009

    • Author(s)
      佐久間雅
    • Organizer
      第26回代数的組合せ論シンポジウム
    • Place of Presentation
      遊学館(山形県生涯学習センター)
    • Year and Date
      2009-06-26
    • Data Source
      KAKENHI-PROJECT-19540110
  • [Presentation] Path-parity-solvability and its heredity2008

    • Author(s)
      Tadashi SAKUMA
    • Organizer
      The 20th Workshop on Topological Graph Theorey in Yokohama
    • Place of Presentation
      Yokohama National University, JAPAN
    • Year and Date
      2008-11-28
    • Data Source
      KAKENHI-PROJECT-19540110
  • [Presentation] Determining the minimum rank of matroids whose basis graph is common2008

    • Author(s)
      Tadashi SAKUMA
    • Organizer
      Topological & Geometric Graph Theory (Dedicated to Hubert de Fraysseix on the Occasion of his 60th birthday)
    • Place of Presentation
      Ecole Normale Superieure, Paris, FRANCE
    • Year and Date
      2008-05-21
    • Data Source
      KAKENHI-PROJECT-19540110
  • 1.  NAKAMURA Masataka (90155854)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 2.  HACHIMORI Masahiro (00344862)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 3.  ITO Motomi (00193524)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 4.  KAWAI Kei (50011664)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 5.  Nakamigawa Tomoki (20386890)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 5 results
  • 6.  柏原 賢二 (70282514)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 1 results
  • 7.  SHINOHARA Hidehiro
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 8.  MIEZAKI Tsuyoshi
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 9.  瀬川 悦生
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 10.  藤田 慎也
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 2 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