Tadashi Sakuma

According to our database, Tadashi Sakuma authored at least 30 papers between 1997 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

On the average hitting times of the squares of cycles.

Yoshiaki Doi, Norio Konno, Tomoki Nakamigawa, Tadashi Sakuma, Etsuo Segawa, Hidehiro Shinohara, Shunya Tamura, Yuuho Tanaka, Kosuke Toyota

Discret. Appl. Math., 2022

2021

Tutte Polynomial, Complete Invariant, and Theta Series.

Misaki Kume, Tsuyoshi Miezaki, Tadashi Sakuma, Hidehiro Shinohara

Graphs Comb., 2021

Pebble exchange group of graphs.

Tatsuoki Kato, Tomoki Nakamigawa, Tadashi Sakuma

Eur. J. Comb., 2021

Stable structure on safe set problems in vertex-weighted graphs.

Shinya Fujita, Boram Park, Tadashi Sakuma

Eur. J. Comb., 2021

2020

Convex Grabbing Game of the Point Set on the Plane.

Naoki Matsumoto, Tomoki Nakamigawa, Tadashi Sakuma

Graphs Comb., 2020

Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-.

Shinya Fujita, Boram Park, Tadashi Sakuma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

2019

On the weighted safe set problem on paths and cycles.

Shinya Fujita, Tommy Jensen, Boram Park, Tadashi Sakuma

J. Comb. Optim., 2019

2018

Safe sets, network majority on weighted trees.

Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza

Networks, 2018

Safe sets in graphs: Graph classes and structural parameters.

Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu

J. Comb. Optim., 2018

2017

The Expansion of a Chord Diagram and the Tutte Polynomial.

Tomoki Nakamigawa, Tadashi Sakuma

Electron. Notes Discret. Math., 2017

2016

Network Majority on Tree Topological Network.

Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza

Electron. Notes Discret. Math., 2016

Safe set problem on graphs.

Shinya Fujita, Gary MacGillivray, Tadashi Sakuma

Discret. Appl. Math., 2016

Safe Sets in Graphs: Graph Classes and Structural Parameters.

Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

On the Balanced Decomposition Number.

Tadashi Sakuma

Graphs Comb., 2015

Pebble exchange on graphs.

Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma

Discret. Appl. Math., 2015

2014

Minimum degree conditions for vertex-disjoint even cycles in large graphs.

Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma

Adv. Appl. Math., 2014

2012

Colored pebble motion on graphs.

Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma

Eur. J. Comb., 2012

On ideal minimally non-packing clutters

Kenji Kashiwabara, Tadashi Sakuma

CoRR, 2012

2011

On circulant thin Lehman matrices.

Tadashi Sakuma, Hidehiro Shinohara

Electron. Notes Discret. Math., 2011

N-flips in even triangulations on the torus and Dehn twists preserving monodromies.

Yusuke Higuchi, Atsuhiro Nakamoto, Katsuhiro Ota, Tadashi Sakuma

Discret. Math., 2011

2010

The positive circuits of oriented matroids with the packing property or idealness.

Kenji Kashiwabara, Tadashi Sakuma

Electron. Notes Discret. Math., 2010

2009

Colored Pebble Motion on Graphs (Extended Abstract).

Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma

Electron. Notes Discret. Math., 2009

Disjoint Even Cycles Packing.

Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma

Electron. Notes Discret. Math., 2009

2008

Determining the minimum rank of matroids whose basis graph is common.

Masahiro Hachimori, Hiroshi Kurata, Tadashi Sakuma

Electron. Notes Discret. Math., 2008

2006

N-flips in even triangulations on the sphere.

Atsuhiro Nakamoto, Tadashi Sakuma, Yusuke Suzuki

J. Graph Theory, 2006

Grinstead's conjecture is true for graphs with a small clique number.

Kenji Kashiwabara, Tadashi Sakuma

Discret. Math., 2006

2001

Notes on acyclic orientations and the shelling lemma.

Komei Fukuda, Alain Prodon, Tadashi Sakuma

Theor. Comput. Sci., 2001

On kernel-less clique-acyclic orientations of minimally imperfect graphs.

Tadashi Sakuma

Discret. Appl. Math., 2001

2000

Forced color classes, intersection graphs and the strong perfect graph conjecture.

Tadashi Sakuma

Theor. Comput. Sci., 2000

1997

A counterexample to the bold conjecture.

Tadashi Sakuma

J. Graph Theory, 1997