default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShinji Imahori
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Yuichi Nagata
, Shinji Imahori:
Creation of Dihedral Escher-like Tilings Based on As-Rigid-As-Possible Deformation. ACM Trans. Graph. 43(2): 18:1-18:18 (2024)- 2023
- [j24]Tatsuki Yamauchi, Mizuyo Takamatsu, Shinji Imahori:
Optimizing train stopping patterns for congestion management. Public Transp. 15(1): 1-29 (2023) - 2022
- [j23]Yuichi Nagata, Shinji Imahori:
Escherization with Large Deformations Based on As-Rigid-As-Possible Shape Modeling. ACM Trans. Graph. 41(2): 11:1-11:16 (2022) - 2021
- [i5]Shinji Imahori:
A 1+O(1/N) approximation algorithm for TTP(2). CoRR abs/2108.08444 (2021) - 2020
- [j22]Yuichi Nagata, Shinji Imahori:
An Efficient Exhaustive Search Algorithm for the Escherization Problem. Algorithmica 82(9): 2502-2534 (2020) - [i4]Yuichi Nagata, Shinji Imahori:
Escherization with Generalized Distance Functions Focusing on Local Structural Similarity. CoRR abs/2011.10175 (2020)
2010 – 2019
- 2019
- [i3]Yuichi Nagata, Shinji Imahori:
An Efficient Algorithm for the Escherization Problem in the Polygon Representation. CoRR abs/1912.09605 (2019) - 2018
- [p3]Shinji Imahori, Mutsunori Yagiura, Hiroshi Nagamochi:
Practical Algorithms for Two-Dimensional Packing of Rectangles. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 571-583 - [p2]Yannan Hu, Hideki Hashimoto, Shinji Imahori, Mutsunori Yagiura:
Practical Algorithms for Two-Dimensional Packing of General Shapes. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 585-609 - 2017
- [j21]Yoko Yamakata, Hirokuni Maeta, Takuya Kadowaki, Tetsuro Sasada, Shinji Imahori, Shinsuke Mori:
Cooking Recipe Search by Pairs of Ingredient and Action - Word Sequence v.s. Flow-graph Representation -. Inf. Media Technol. 12: 71-79 (2017) - [c11]Tatsuki Yamauchi, Mizuyo Takamatsu, Shinji Imahori:
Optimizing Train Stopping Patterns for Congestion Management. ATMOS 2017: 13:1-13:15 - 2016
- [j20]Eishi Chiba, Shinji Imahori:
Maximizing the Total Weight of Just-In-Time Jobs under Multi-Slot Conditions Is NP-Hard. IEICE Trans. Inf. Syst. 99-D(2): 525-528 (2016) - [c10]Yoko Yamakata, Shinji Imahori, Hirokuni Maeta, Shinsuke Mori:
A method for extracting major workflow composed of ingredients, tools, and actions from cooking procedural text. ICME Workshops 2016: 1-6 - 2015
- [j19]Yannan Hu, Hideki Hashimoto, Shinji Imahori, Mutsunori Yagiura:
Efficient implementations of construction heuristics for the rectilinear block packing problem. Comput. Oper. Res. 53: 206-222 (2015) - [c9]Shinji Imahori, Shizuka Kawade, Yoko Yamakata:
Escher-like Tilings with Weights. JCDCGG 2015: 132-142 - 2014
- [j18]Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro:
A 2.75-approximation algorithm for the unconstrained traveling tournament problem. Ann. Oper. Res. 218(1): 237-247 (2014) - [c8]Sho Fukatsu, Yannan Hu, Hideki Hashimoto, Shinji Imahori, Mutsunori Yagiura:
An efficient method for checking overlaps and construction algorithms for the bitmap shape packing problem. IEEM 2014: 1056-1060 - 2013
- [j17]Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, Toshihide Ibaraki:
Recent progress of local search in handling the time window constraints of the vehicle routing problem. Ann. Oper. Res. 204(1): 171-187 (2013) - [c7]Yoko Yamakata, Shinji Imahori, Yuichi Sugiyama, Shinsuke Mori, Katsumi Tanaka:
Feature Extraction and Summarization of Recipes Using Flow Graph. SocInfo 2013: 241-254 - 2012
- [j16]Ryuhei Miyashiro, Tomomi Matsui, Shinji Imahori:
An approximation algorithm for the traveling tournament problem. Ann. Oper. Res. 194(1): 317-324 (2012) - [j15]Yuma Tanaka, Shinji Imahori, Mihiro Sasaki, Mutsunori Yagiura:
An LP-based heuristic algorithm for the node capacitated in-tree packing problem. Comput. Oper. Res. 39(3): 637-646 (2012) - [j14]Shinji Imahori, Yuichiro Miyamoto, Hideki Hashimoto, Yusuke Kobayashi, Mihiro Sasaki, Mutsunori Yagiura:
The complexity of the node capacitated in-tree packing problem. Networks 59(1): 13-21 (2012) - [c6]Shinji Imahori, Yoshiyuki Karuno, Rena Nishizaki, Yui Yoshimoto:
Duplex and quasi-duplex operations in automated food packing systems. SII 2012: 810-815 - 2011
- [j13]Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui:
An Improved Approximation Algorithm for the Traveling Tournament Problem. Algorithmica 61(4): 1077-1091 (2011) - [j12]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
Colorful Strips. Graphs Comb. 27(3): 327-339 (2011) - [j11]Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno:
Algorithmic Folding Complexity. Graphs Comb. 27(3): 341-351 (2011) - [j10]Shinji Imahori, Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming Wang:
Kansei engineering, humans and computers: efficient dynamic programming algorithms for combinatorial food packing problems. Int. J. Biom. 3(3): 228-245 (2011) - [j9]Md. Bahlul Haider, Shinji Imahori, Kokichi Sugihara:
Success guaranteed routing in almost Delaunay planar nets for wireless sensor communication. Int. J. Sens. Networks 9(2): 69-75 (2011) - [i2]Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro:
A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem. CoRR abs/1110.0620 (2011) - 2010
- [j8]Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, Toshihide Ibaraki:
Recent progress of local search in handling the time window constraints of the vehicle routing problem. 4OR 8(3): 221-238 (2010) - [j7]Shinji Imahori, Mutsunori Yagiura:
The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio. Comput. Oper. Res. 37(2): 325-333 (2010) - [c5]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
Colorful Strips. LATIN 2010: 2-13
2000 – 2009
- 2009
- [j6]Shunji Umetani, Mutsunori Yagiura, Shinji Imahori, Takashi Imamichi, Koji Nonobe, Toshihide Ibaraki:
Solving the irregular strip packing problem via guided local search for overlap minimization. Int. Trans. Oper. Res. 16(6): 661-683 (2009) - [c4]Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter:
MARA: Maximum Alternative Routing Algorithm. INFOCOM 2009: 298-306 - [c3]Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara:
Algorithmic Folding Complexity. ISAAC 2009: 452-461 - [c2]Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui:
An Improved Approximation Algorithm for the Traveling Tournament Problem. ISAAC 2009: 679-688 - [i1]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
Colorful Strips. CoRR abs/0904.2115 (2009) - 2008
- [j5]Toshihide Ibaraki, Shinji Imahori, Koji Nonobe, Kensuke Sobue, Takeaki Uno, Mutsunori Yagiura:
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Discret. Appl. Math. 156(11): 2050-2069 (2008) - [p1]Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura:
Hybrid Metaheuristics for Packing Problems. Hybrid Metaheuristics 2008: 185-219 - 2007
- [r1]Mutsunori Yagiura, Hiroshi Nagamochi, Shinji Imahori:
Practical Algorithms for Two-Dimensional Packing. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j4]Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura:
The vehicle routing problem with flexible time windows and traveling times. Discret. Appl. Math. 154(16): 2271-2290 (2006) - [c1]Nobutomo Fujiwara, Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro:
Constructive Algorithms for the Constant Distance Traveling Tournament Problem. PATAT 2006: 135-146 - 2005
- [j3]Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki:
Improved local search algorithms for the rectangle packing problem with general spatial costs. Eur. J. Oper. Res. 167(1): 48-67 (2005) - [j2]Toshihide Ibaraki, Shinji Imahori, Mikio Kubo, T. Masuda, Takeaki Uno, Mutsunori Yagiura:
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints. Transp. Sci. 39(2): 206-232 (2005) - 2003
- [j1]Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki:
Local search algorithms for the rectangle packing problem with general spatial costs. Math. Program. 97(3): 543-569 (2003)
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-10-07 21:16 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:
