Research Areas
-
Natural Science / Basic mathematics
Graduating School
-
The University of Tokyo, Faculty of Liberal Arts
1992.03, Graduated
Graduate School
-
The University of Tokyo, Graduate School, Division of General Culture, Systems Science, General Systems Studies, Department of Graphics and Computer Sciences
Master's Course, 1994.03, Completed
-
The University of Tokyo, Graduate School, Division of General Culture, Systems Science, General Systems Studies, Department of Graphics and Computer Sciences
Doctor's Course, 1997.03, Completed
External Career
-
Department of Advanced Social and International Studies, Graduate School of Arts and Sciences, The University of Tokyo, Research Assistant, 2000.05 - 2005.03
Academic Society Affiliations
-
The Operations Research Society of Japan
-
The Mathematical Society of Japan
Papers
-
On the average hitting times of the squares of cycles, Discrete Applied Mathematics, 313 18-28, 2022.05
Yoshiaki Doi, Norio Konno, Tomoki Nakamigawa, Tadashi Sakuma, Etsuo Segawa, Hidehiro Shinohara, Shunya Tamura, Yuuho Tanaka, Kosuke Toyota
Multiple Authorship (Only Japanese)
-
Tutte polynomial, complete invariant, and theta series, Graphs and Combinatorics, 37 1545-1558, 2021.10
Misaki Kume, Tsuyoshi Miezaki, Tadashi Sakuma, Hidehiro Shinohara
Multiple Authorship (Only Japanese)
-
Pebble exchange group of graphs, European Journal of Combinatorics, 95(103325) , 2021.06
Tatsuoki Kato, Tomoki Nakamigawa, Tadashi Sakuma
Multiple Authorship (Only Japanese)
-
Stable structure on safe set problems in vertex-weighted graphs, European Journal of Combinatorics, 91 , 2021.01
Shinya Fujita, Boram Park, Tadashi Sakuma
Multiple Authorship (Including Foreigners)
-
Stable Structure on Safe Set Problems in Vertex-weighted Graphs II -- Recognition and Complexity -- (In: Graph-Theoretic Concepts in Computer Science: 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers), Lecture Notes in Computer Science, 12301 364-375, 2020.10
Shinya Fujita, Boram Park and Tadashi Sakuma
Multiple Authorship (Including Foreigners)
-
Convex grabbing game of the point set on the plane, Graphs and Combinatorics, 36(1) 51-62, 2020.01
Naoki Matsumoto, Tomoki Nakamigawa, Tadashi Sakuma
Multiple Authorship (Only Japanese)
-
A generalization of the Tutte polynomials, Proceedings of the Japan Academy, Ser. A Mathematical Sciences, 95(10) 111-113, 2019.11
Tsuyoshi MIEZAKI, Manabu OURA, Tadashi SAKUMA, Hidehiro SHINOHARA
Multiple Authorship (Only Japanese)
-
On the weighted safe set problem on paths and cycles, Journal of Combinatorial Optimization, 37(2) 685-701, 2019.02
Shinya Fujita, Tommy Jensen, Boram Park, Tadashi Sakuma
Multiple Authorship (Including Foreigners)
-
On ideal minimally non-packing clutters, Mathematical Programming and Game Theory, edited by S.K. Neogy, R.B. Bapat, Dipti Dubey, Springer Research Monograph (Indian Statistical Institute Series), 67-86, 2018.11
Kenji Kashiwabara and Tadashi Sakuma
Multiple Authorship (Only Japanese)
-
Safe sets in graphs: Graph classes and structural parameters, Journal of Combinatorial Optimization, 36(4) 1221-1242, 2018.11
Raquel A´ 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
Multiple Authorship (Including Foreigners)
-
The Expansion of a Chord Diagram and the Tutte Polynomial, Discrete Mathematics, 341 1573-1581, 2018.06
Tomoki Nakamigawa, Tadashi Sakuma
Multiple Authorship (Only Japanese)
-
Safe Sets, Network Majority on Weighted Trees, Networks, 71(1) 81-92, 2018.01
Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza
Multiple Authorship (Including Foreigners)
-
The Expansion of a Chord Diagram and the Tutte Polynomial (Proceedings of European Conference on Combinatorics, Graph Theory and Applications 2017), Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics, 61C 917-923, 2017.08
Tomoki Nakamigawa, Tadashi Sakuma
Multiple Authorship (Only Japanese)
-
Safe set problem on graphs, Discrete Applied Mathematics, 215 106-111, 2016.12
Shinya Fujita, Gary MacGillivray, Tadashi Sakuma
Multiple Authorship (Including Foreigners)
-
Network Majority on Tree Topological Network, Electronic Notes in Discrete Mathematics, 54 79-84, 2016.10
Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza
Multiple Authorship (Including Foreigners)
-
Safe Sets in Graphs: Graph Classes and Structural Parameters, Lecture Notes in Computer Science, 10043 241-253, 2016.10
Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
Multiple Authorship (Including Foreigners)
-
On the Balanced Decomposition Number, Graphs and Combinatorics, 31(6) 2377-2380, 2015.11
Tadashi SAKUMA
Single Author
-
Pebble exchange on graphs, Discrete Applied Mathematics, 184(31) 139-145, 2015.03
Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma
Multiple Authorship (Only Japanese)
-
On circulant thin Lehman matrices, Journal of Algebraic Combinatorics, 40(4) 939-959, 2014.12
Tadashi Sakuma, Hidehiro Shinohara
Multiple Authorship (Only Japanese)
-
Minimum degree conditions for vertex-disjoint even cycles in large graphs, Advances in Applied Mathematics, 54 105-120, 2014.03
Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma
Multiple Authorship (Only Japanese)
-
Krasner near-factorizations and 1-overlapped factorizations, The Seventh European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2013, edited by Jaroslav Nešetril and Marco Pellegrini (Publications of the Scuola Normale Superiore/CRM Series, Vol.16, Springer Verlag), 391-395, 2013.10
Tadashi SAKUMA, Hidehiro SHINOHARA
Multiple Authorship (Only Japanese)
-
Colored Pebble Motion on Graphs, European Journal of Combinatorics, 33(5) 884-892, 2012.07
Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma
Multiple Authorship (Only Japanese)
-
On circulant thin Lehman matrices (Proceedings of The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011), Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics, 38(1) 783-788, 2011.12
Tadashi Sakuma, Hidehiro Shinohara
Multiple Authorship (Only Japanese)
-
N-flips in even triangulations on the torus and Dehn twists preserving monodromies, Discrete Mathematics, 311(13) 1128-1135, 2011.07
Yusuke Higuchi, Atsuhiro Nakamoto, Katsuhiro Ota, Tadashi Sakuma
Multiple Authorship (Only Japanese)
-
The positive circuits of oriented matroids with the packing property or idealness (Proceedings of ISCO 2010 - International Symposium on Combinatorial Optimization), Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics, 36(1) 287-294, 2010.08
Kenji Kashiwabara, Tadashi Sakuma
Multiple Authorship (Only Japanese)
-
Disjoint Even Cycle Packing (Proceedings of European Conference on Combinatorics, Graph Theory and Applications 2009), Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics, 34(1) 113-119, 2009.08
Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma
Multiple Authorship (Only Japanese)
-
Colored Pebble Motion on Graphs (Extended Abstract) (Proceedings of European Conference on Combinatorics, Graph Theory and Applications 2009), Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics, 34(1) 185-189, 2009.08
Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma
Multiple Authorship (Only Japanese)
-
Determining the minimum rank of matroids whose basis graph is common (Proceedings of The International Conference on Topological and Geometric Graph Theory 2008), Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics, 31(1) 137-142, 2008.08
Masahiro HACHIMORI, Hiroshi KURATA, Tadashi SAKUMA
Multiple Authorship (Only Japanese)
-
A group majorization ordering for Euclidean distance matrices, Linear Algebra and its Applications, 420(2-3) 586-595, 2007.01
Hiroshi Kurata and Tadashi Sakuma
Multiple Authorship (Only Japanese)
-
Grinstead's Conjecture is true for graphs with a small clique number, Discrete Mathmatics, 306(19-20) 2572-2581, 2006.10
Kenji Kashiwabara and Tadashi Sakuma
Multiple Authorship (Only Japanese)
-
N-Flip in Even Triangulations on the Sphere, Journal of Graph Theory, 51(3) 260-268, 2006.03
A. Nakamoto, T. Sakuma, Y. Suzuki.
Multiple Authorship (Only Japanese)
-
On the Kernel-less Clique-Acyclic Orientations of Minimally Imperfect Graphs, Descrate Applied Mathematics, 115(1-3) 209-219, 2001.11
Tadashi Sakuma
Single Author
-
Note on Acyclic Orientations and the Shelling Lemma, Theoretical Computer Science, 263(1-2) 9-16, 2001.07
K. Fukuda, A. Prodon and T. Sakuma.
Multiple Authorship (Including Foreigners)
-
Forced Color Classes, Intersection Graphs and the Strong Perfect Graph Conjecture, Theoretical Computer Science, 235(2) 309-324, 2000.03
Tadashi Sakuma
Single Author
-
On the Flip Operations of Clique-Acyclic Orientations of Graphs, Yokohama Mathematical Journal, 47 143-163, 1999.10
Y. Hiraishi, T. Sakuma
Multiple Authorship (Only Japanese)
-
A counterexample to the bold conjecture, Journal of Graph Theory, 25(2) 165-168, 1997.06
Tadashi Sakuma
Single Author
Grant-in-Aid for Scientific Research
-
Grant-in-Aid for Scientific Research(C),2022.04 - 2026.03
-
Grant-in-Aid for Scientific Research(C),2018.04 - 2022.03
-
Grant-in-Aid for Scientific Research(C),2018.04 - 2019.03
-
Grant-in-Aid for Scientific Research(C),2014.04 - 2018.03,Research on similarity between blocking-type and anti-blocking-type polyhedra
-
Grant-in-Aid for Scientific Research(C),2007.04 - 2011.03
-
Grant-in-Aid for Young Scientists(B),2004.04 - 2007.03
-
Grant-in-Aid for Young Scientists(B),2001.03 - 2003.04
-
Grant-in-Aid for JSPS Fellows,1998.04 - 2000.03
-
Grant-in-Aid for JSPS Fellows,1994.04 - 1997.03
Presentations
-
International Symposium on Computational Operations Research and Algorithmic Game Theory , International presentation, 2021.03, Network majority and the connected safe set problem, Oral presentation (invited, special)
-
2017 Symposium on Mathematical Programming and Game Theory (2017 SMPGT), International presentation, 2017.01, Similarities and dissimilarities between the blocking and anti-blocking polyhedra, Oral presentation (invited, special)
-
Mathematical Society of Japan 2016 Annual Meeting Talk Invited by Applied Mathematics Section, Domestic presentation, 2016.03, Similarities and dissimilarities between the blocking and anti-blocking polyhedra, Oral presentation (invited, special)
Recommended URL
-
PERFECT PAPERS
http://users.encs.concordia.ca/~chvatal/perfect/papers.html
Here is a bibliography of selected papers on perfect graphs.
Science and Technology in General
-
PERFECT PROBLEMS
http://users.encs.concordia.ca/~chvatal/perfect/problems.html
Science and Technology in General
-
Perfect Graphs
http://www.aimath.org/WWN/perfectgraph/
This web page highlights some of the conjectures and open problems concerning Perfect Graphs.
Science and Technology in General
-
Bold Conjecture (Wolfram MathWorld)
http://mathworld.wolfram.com/BoldConjecture.html
Bold Conjecture
A pair of vertices (x,y) of a graph G is called an omega-critical pair if omega(G+xy)>omega(G), where G+xy denotes the graph obtained by adding the edge xy to G and omega(H) is the clique number of H. The omega-critical pairs are never edges in G. A maximal stable set S of G is called a forced color class of G if S meets every omega-clique of G, and omega-critical pairs within S form a connected graph.
In 1993, G. Bacsó conjectured that if G is a uniquely omega-colorable perfect graph, then G has at least one forced color class. This conjecture is called the bold conjecture, and implies the strong perfect graph theorem. However, a counterexample of the conjecture was subsequently found by Sakuma (1997).Science and Technology in General