default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHajime Matsumura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j15]Yoshimi Egawa, Michitaka Furuya
, Hajime Matsumura:
Existence of a spanning tree having small diameter. Discret. Math. 344(11): 112548 (2021)- 2020
- [j14]Mikio Kano, Hajime Matsumura:
Spanning trees with small diameters. AKCE Int. J. Graphs Comb. 17(1): 329-334 (2020)
2010 – 2019
- 2018
- [j13]Ryota Matsubara, Haruhide Matsuda, Hajime Matsumura:
A spanning k-spider in a graph. Ars Comb. 136: 247-253 (2018) - 2017
- [j12]Ryota Matsubara, Hajime Matsumura, Masao Tsugaki, Tomoki Yamashita:
Degree sum conditions for path-factors with specified end vertices in bipartite graphs. Discret. Math. 340(2): 87-95 (2017) - 2015
- [j11]Hajime Matsumura:
On spanning k-tree in which specified vertices have degree less than k. Discuss. Math. Graph Theory 35(1): 191-196 (2015) - 2014
- [c5]Hisashi Kurasawa, Hiroshi Sato, Atsushi Yamamoto, Hitoshi Kawasaki, Motonori Nakamura, Yohei Fujii, Hajime Matsumura:
Missing sensor value estimation method for participatory sensing environment. PerCom 2014: 103-111 - 2013
- [c4]Yutaka Arakawa, Takayuki Nakamura, Motonori Nakamura, Hajime Matsumura:
UBI-Tree: Indexing Method for Schema-Less Search. COMPSAC Workshops 2013: 283-288 - 2012
- [c3]Hiroshi Sato, Hisashi Kurasawa, Takeru Inoue, Motonori Nakamura, Hajime Matsumura, Kei'ichi Koyanagi:
Distributed Sampling Storage for Statistical Analysis of Massive Sensor Data. CD-ARES 2012: 233-243 - [c2]Hisashi Kurasawa, Hiroshi Sato, Motonori Nakamura, Hajime Matsumura:
Online Top-k Similar Time-Lagged Pattern Pair Search in Multiple Time Series. DEXA (2) 2012: 432-441 - [c1]Hitoshi Kawasaki, Atsushi Yamamoto, Hisashi Kurasawa, Hiroshi Sato, Motonori Nakamura, Hajime Matsumura:
Top of worlds: method for improving motivation to participate in sensing services. UbiComp 2012: 594-595 - 2010
- [j10]Jun Fujisawa, Hajime Matsumura, Tomoki Yamashita:
Degree Bounded Spanning Trees. Graphs Comb. 26(5): 695-720 (2010)
2000 – 2009
- 2009
- [j9]Hikoe Enomoto, Hajime Matsumura:
Cycle-Partitions with Specified Vertices and Edges. Ars Comb. 91 (2009) - [j8]Haruhide Matsuda, Hajime Matsumura:
Degree conditions and degree bounded trees. Discret. Math. 309(11): 3653-3658 (2009) - 2008
- [j7]Ryota Matsubara, Hajime Matsumura:
Partitions of a graph into cycles containing a specified linear forest. Discuss. Math. Graph Theory 28(1): 97-107 (2008) - 2006
- [j6]Shinya Fujita, Hajime Matsumura, Masao Tsugaki, Tomoki Yamashita:
Degree sum conditions and vertex-disjoint cycles in a graph. Australas. J Comb. 35: 237-252 (2006) - [j5]Hajime Matsumura:
Vertex-Disjoint Short Cycles Containing Specified Edges in a Graph. Ars Comb. 80 (2006) - [j4]Haruhide Matsuda, Hajime Matsumura:
On a k-Tree Containing Specified Leaves in a Graph. Graphs Comb. 22(3): 371-381 (2006) - 2005
- [j3]Hajime Matsumura:
Vertex-disjoint 4-cycles containing specified edges in a bipartite graph. Discret. Math. 297(1-3): 78-90 (2005) - [j2]Hajime Matsumura:
Degree Conditions and Degree Bounded Trees. Electron. Notes Discret. Math. 22: 295-298 (2005)
1990 – 1999
- 1996
- [j1]Hisakazu Katoh, Akinori Hashimoto, Hajime Matsumura, Shigeru Yamazaki, Osamu Yamada:
A flexible transmission technique for the satellite ISDB system. IEEE Trans. Broadcast. 42(3): 159-166 (1996)
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-25 05:55 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:
