default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTetsuo Ichimori
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j11]Tetsuo Ichimori:
On rounding off quotas to the nearest integers in the problem of apportionment. JSIAM Lett. 3: 21-24 (2011)- 2010
- [j10]Tetsuo Ichimori:
New apportionment methods and their quota property. JSIAM Lett. 2: 33-36 (2010)
2000 – 2009
- 2006
- [c2]Hiroshi Masuyama, Tetsuo Ichimori, Toshihiko Sasama:
On ability of orthogonal genetic algorithms for the mixed chinese postman problem. ICSOFT (1) 2006: 39-46 - 2005
- [c1]Hiroshi Masuyama, Yuuta Fukudome, Tetsuo Ichimori:
One-to-all and all-to-all broadcasting algorithms in cellular networks. ICETE 2005: 142-145
1990 – 1999
- 1991
- [j9]Tetsuo Ichimori, Naoki Katoh:
A two-commodity sharing problem on networks. Networks 21(5): 547-563 (1991)
1980 – 1989
- 1989
- [j8]Hiroshi Masuyama, Tetsuo Ichimori:
Tolerance of Double-Loop Computer Networks to Multinode Failures. IEEE Trans. Computers 38(5): 738-741 (1989) - 1988
- [j7]Satoru Fujishige, Naoki Katoh, Tetsuo Ichimori:
The Fair Resource Allocation Problem with Submodular Constraints. Math. Oper. Res. 13(1): 164-173 (1988) - 1986
- [j6]Hiroshi Masuyama, Tetsuo Ichimori:
A new method of software structural testing by path analysis. Syst. Comput. Jpn. 17(4): 34-42 (1986) - 1985
- [j5]Nimrod Megiddo, Tetsuo Ichimori:
A Two-Resource Allocation Problem Solvable in Linear Time. Math. Oper. Res. 10(1): 7-16 (1985) - [j4]Tetsuo Ichimori, Toshio Nishida:
Note on a Rectilinear Distance Round-Trip Location Problem. Transp. Sci. 19(1): 84-91 (1985) - 1984
- [j3]Tetsuo Ichimori:
Technical Note - On Min-Max Integer Allocation Problems. Oper. Res. 32(2): 449-450 (1984) - 1983
- [j2]Tetsuo Ichimori, Hiroaki Ishii, Toshio Nishida:
Two routing problems with the limitation of fuel. Discret. Appl. Math. 6(1): 85-89 (1983) - 1982
- [j1]Tetsuo Ichimori, Hiroaki Ishii, Toshio Nishida:
Optimal sharing. Math. Program. 23(1): 341-348 (1982)
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 23:06 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:
