Tadashi Sakuma

34 papers B 1C 1Journal 32
YearRankTypeTitle / Venue / Authors
2025 J jnl
On the order of the shortest solution sequences for the pebble motion problems.
CoRR
Tomoki Nakamigawa, Tadashi Sakuma
2022 J jnl
On the average hitting times of the squares of cycles.
Discret. Appl. Math.
Yoshiaki Doi, Norio Konno, Tomoki Nakamigawa, Tadashi Sakuma, Etsuo Segawa, Hidehiro Shinohara, Shunya Tamura, Yuuho Tanaka, Kosuke Toyota
2021 J jnl
Pebble exchange group of graphs.
Eur. J. Comb.
Tatsuoki Kato, Tomoki Nakamigawa, Tadashi Sakuma
2021 J jnl
Stable structure on safe set problems in vertex-weighted graphs.
Eur. J. Comb.
Shinya Fujita, Boram Park, Tadashi Sakuma
2021 J jnl
Tutte Polynomial, Complete Invariant, and Theta Series.
Graphs Comb.
Misaki Kume, Tsuyoshi Miezaki, Tadashi Sakuma, Hidehiro Shinohara
2020 J jnl
Convex Grabbing Game of the Point Set on the Plane.
Graphs Comb.
Naoki Matsumoto, Tomoki Nakamigawa, Tadashi Sakuma
2020 B conf
Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-.
WG
Shinya Fujita, Boram Park, Tadashi Sakuma
2019 J jnl
On the weighted safe set problem on paths and cycles.
J. Comb. Optim.
Shinya Fujita, Tommy Jensen, Boram Park, Tadashi Sakuma
2019 J jnl
Pebble Exchange Group of Graphs.
CoRR
Tatsuoki Kato, Tomoki Nakamigawa, Tadashi Sakuma
2018 J jnl
Safe sets in graphs: Graph classes and structural parameters.
J. Comb. Optim.
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
2018 J jnl
Safe sets, network majority on weighted trees.
Networks
Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza
2018 J jnl
The expansion of a chord diagram and the Tutte polynomial.
Discret. Math.
Tomoki Nakamigawa, Tadashi Sakuma
2017 J jnl
The Expansion of a Chord Diagram and the Tutte Polynomial.
Electron. Notes Discret. Math.
Tomoki Nakamigawa, Tadashi Sakuma
2016 J jnl
Network Majority on Tree Topological Network.
Electron. Notes Discret. Math.
Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza
2016 C conf
Safe Sets in Graphs: Graph Classes and Structural Parameters.
COCOA
Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
2016 J jnl
Safe set problem on graphs.
Discret. Appl. Math.
Shinya Fujita, Gary MacGillivray, Tadashi Sakuma
2015 J jnl
On the Balanced Decomposition Number.
Graphs Comb.
Tadashi Sakuma
2015 J jnl
Pebble exchange on graphs.
Discret. Appl. Math.
Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma
2014 J jnl
Minimum degree conditions for vertex-disjoint even cycles in large graphs.
Adv. Appl. Math.
Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma
2012 J jnl
Colored pebble motion on graphs.
Eur. J. Comb.
Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma
2012 J jnl
On ideal minimally non-packing clutters
CoRR
Kenji Kashiwabara, Tadashi Sakuma
2012 J jnl
On the balanced decomposition number.
CoRR
Tadashi Sakuma
2011 J jnl
N-flips in even triangulations on the torus and Dehn twists preserving monodromies.
Discret. Math.
Yusuke Higuchi, Atsuhiro Nakamoto, Katsuhiro Ota, Tadashi Sakuma
2011 J jnl
On circulant thin Lehman matrices.
Electron. Notes Discret. Math.
Tadashi Sakuma, Hidehiro Shinohara
2010 J jnl
The positive circuits of oriented matroids with the packing property or idealness.
Electron. Notes Discret. Math.
Kenji Kashiwabara, Tadashi Sakuma
2009 J jnl
Colored Pebble Motion on Graphs (Extended Abstract).
Electron. Notes Discret. Math.
Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma
2009 J jnl
Disjoint Even Cycles Packing.
Electron. Notes Discret. Math.
Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma
2008 J jnl
Determining the minimum rank of matroids whose basis graph is common.
Electron. Notes Discret. Math.
Masahiro Hachimori, Hiroshi Kurata, Tadashi Sakuma
2006 J jnl
Grinstead's conjecture is true for graphs with a small clique number.
Discret. Math.
Kenji Kashiwabara, Tadashi Sakuma
2006 J jnl
N-flips in even triangulations on the sphere.
J. Graph Theory
Atsuhiro Nakamoto, Tadashi Sakuma, Yusuke Suzuki
2001 J jnl
Notes on acyclic orientations and the shelling lemma.
Theor. Comput. Sci.
Komei Fukuda, Alain Prodon, Tadashi Sakuma
2001 J jnl
On kernel-less clique-acyclic orientations of minimally imperfect graphs.
Discret. Appl. Math.
Tadashi Sakuma
2000 J jnl
Forced color classes, intersection graphs and the strong perfect graph conjecture.
Theor. Comput. Sci.
Tadashi Sakuma
1997 J jnl
A counterexample to the bold conjecture.
J. Graph Theory
Tadashi Sakuma