Tadashi Sakuma

Publication Activity (10 Years)

Years Active: 1997-2022
Publications (10 Years): 15

Top Topics

Graphical Structure

Directed Acyclic

Graph Representations

Series Parallel

Top Venues

Discret. Appl. Math.

J. Comb. Optim.

Electron. Notes Discret. Math.

Publications

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