Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTadashi Sakuma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j28]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: 18-28 (2022)- 2021
- [j27]Shinya Fujita, Boram Park, Tadashi Sakuma:
Stable structure on safe set problems in vertex-weighted graphs. Eur. J. Comb. 91: 103211 (2021) - [j26]Tatsuoki Kato, Tomoki Nakamigawa, Tadashi Sakuma:
Pebble exchange group of graphs. Eur. J. Comb. 95: 103325 (2021) - [j25]Misaki Kume, Tsuyoshi Miezaki, Tadashi Sakuma, Hidehiro Shinohara:
Tutte Polynomial, Complete Invariant, and Theta Series. Graphs Comb. 37(5): 1545-1558 (2021) - 2020
- [j24]Naoki Matsumoto, Tomoki Nakamigawa, Tadashi Sakuma:
Convex Grabbing Game of the Point Set on the Plane. Graphs Comb. 36(1): 51-62 (2020) - [c2]Shinya Fujita, Boram Park, Tadashi Sakuma:
Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-. WG 2020: 364-375
2010 – 2019
- 2019
- [j23]Shinya Fujita, Tommy Jensen, Boram Park, Tadashi Sakuma:
On the weighted safe set problem on paths and cycles. J. Comb. Optim. 37(2): 685-701 (2019) - [i3]Tatsuoki Kato, Tomoki Nakamigawa, Tadashi Sakuma:
Pebble Exchange Group of Graphs. CoRR abs/1904.00402 (2019) - 2018
- [j22]Tomoki Nakamigawa, Tadashi Sakuma:
The expansion of a chord diagram and the Tutte polynomial. Discret. Math. 341(6): 1573-1581 (2018) - [j21]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): 1221-1242 (2018) - [j20]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): 81-92 (2018) - 2017
- [j19]Tomoki Nakamigawa, Tadashi Sakuma:
The Expansion of a Chord Diagram and the Tutte Polynomial. Electron. Notes Discret. Math. 61: 917-923 (2017) - 2016
- [j18]Shinya Fujita, Gary MacGillivray, Tadashi Sakuma:
Safe set problem on graphs. Discret. Appl. Math. 215: 106-111 (2016) - [j17]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: 79-84 (2016) - [c1]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: 241-253 - 2015
- [j16]Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma:
Pebble exchange on graphs. Discret. Appl. Math. 184: 139-145 (2015) - [j15]Tadashi Sakuma:
On the Balanced Decomposition Number. Graphs Comb. 31(6): 2377-2380 (2015) - 2014
- [j14]Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma:
Minimum degree conditions for vertex-disjoint even cycles in large graphs. Adv. Appl. Math. 54: 105-120 (2014) - 2012
- [j13]Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma:
Colored pebble motion on graphs. Eur. J. Comb. 33(5): 884-892 (2012) - [i2]Kenji Kashiwabara, Tadashi Sakuma:
On ideal minimally non-packing clutters. CoRR abs/1210.4753 (2012) - [i1]Tadashi Sakuma:
On the balanced decomposition number. CoRR abs/1212.2308 (2012) - 2011
- [j12]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): 1128-1135 (2011) - [j11]Tadashi Sakuma, Hidehiro Shinohara:
On circulant thin Lehman matrices. Electron. Notes Discret. Math. 38: 783-788 (2011) - 2010
- [j10]Kenji Kashiwabara, Tadashi Sakuma:
The positive circuits of oriented matroids with the packing property or idealness. Electron. Notes Discret. Math. 36: 287-294 (2010)
2000 – 2009
- 2009
- [j9]Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma:
Disjoint Even Cycles Packing. Electron. Notes Discret. Math. 34: 113-119 (2009) - [j8]Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma:
Colored Pebble Motion on Graphs (Extended Abstract). Electron. Notes Discret. Math. 34: 185-189 (2009) - 2008
- [j7]Masahiro Hachimori, Hiroshi Kurata, Tadashi Sakuma:
Determining the minimum rank of matroids whose basis graph is common. Electron. Notes Discret. Math. 31: 137-142 (2008) - 2006
- [j6]Kenji Kashiwabara, Tadashi Sakuma:
Grinstead's conjecture is true for graphs with a small clique number. Discret. Math. 306(19-20): 2572-2581 (2006) - [j5]Atsuhiro Nakamoto, Tadashi Sakuma, Yusuke Suzuki:
N-flips in even triangulations on the sphere. J. Graph Theory 51(3): 260-268 (2006) - 2001
- [j4]Tadashi Sakuma:
On kernel-less clique-acyclic orientations of minimally imperfect graphs. Discret. Appl. Math. 115(1-3): 209-219 (2001) - [j3]Komei Fukuda, Alain Prodon, Tadashi Sakuma:
Notes on acyclic orientations and the shelling lemma. Theor. Comput. Sci. 263(1-2): 9-16 (2001) - 2000
- [j2]Tadashi Sakuma:
Forced color classes, intersection graphs and the strong perfect graph conjecture. Theor. Comput. Sci. 235(2): 309-324 (2000)
1990 – 1999
- 1997
- [j1]Tadashi Sakuma:
A counterexample to the bold conjecture. J. Graph Theory 25(2): 165-168 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
