{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:05:54Z","timestamp":1740099954698,"version":"3.37.3"},"reference-count":43,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000646","name":"JSPS KAKENHI","doi-asserted-by":"publisher","award":["20K11998"],"award-info":[{"award-number":["20K11998"]}],"id":[{"id":"10.13039\/501100000646","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,1,4]]},"DOI":"10.1109\/imcom51814.2021.9377349","type":"proceedings-article","created":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T20:18:40Z","timestamp":1616012320000},"page":"1-8","source":"Crossref","is-referenced-by-count":5,"title":["An Efficient Scheme for the Generation of Ordered Trees in Constant Amortized Time"],"prefix":"10.1109","author":[{"given":"Victor","family":"Parque","sequence":"first","affiliation":[]},{"given":"Tomoyuki","family":"Miyashita","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.asr.2020.09.040"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/RCAR.2017.8311950"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2014.1002780"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/322169.322171","article-title":"A note on enumerating binary trees","volume":"27","author":"m","year":"1980","journal-title":"Journal of the ACM"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/322077.322082"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/359423.359434"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3205651.3208316"},{"key":"ref36","first-page":"1","article-title":"One rule to grow them all: A general theory of neuronal branching and its practical application","volume":"6","author":"hermann","year":"2010","journal-title":"PLoS Computational Biology"},{"key":"ref35","first-page":"135","author":"eeckman","year":"1994","journal-title":"NeMoSys A System for Realistic Single Neuron Modeling"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3828.214141"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.120665"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2018.00294"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2929995"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569913"},{"journal-title":"Combinatorial Algorithms","year":"1998","author":"kreher","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970166"},{"journal-title":"An Introduction to the Analysis of Algorithms","year":"2013","author":"sedgewick","key":"ref15"},{"journal-title":"Reading Mass","year":"0","author":"knuth","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1080\/00207168708803562"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00240-5"},{"key":"ref19","first-page":"33","article-title":"Constant time generation of trees with specified diameter","author":"nakano","year":"2005","journal-title":"Graph-Theoretic Concepts in Computer Science"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2017.04.007"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2018.00057"},{"key":"ref27","article-title":"Generating all trees, history of combinatorial generation","volume":"4","author":"knuth","year":"2006","journal-title":"The Art of Computer Programming fascicle 4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2017.00063"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.12.082"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90075-7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3205651.3208310"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2020.02.075"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2019.102172"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3205651.3208316"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.04.007"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.02.035"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2011.11.001"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00026-N"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00202-1_13"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.1998.724803"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/0209055"},{"key":"ref41","first-page":"4634","article-title":"Near-optimal edge evaluation in explicit generalized binomial graphs","author":"choudhury","year":"2017","journal-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems ser NIPS'17"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/0206055"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1125994.1125995"},{"key":"ref43","first-page":"53","author":"gecks","year":"2009","journal-title":"Sensor-Based Online Planning of Time-Optimized Paths in Dynamic Environments"},{"key":"ref25","first-page":"939","article-title":"The advantages of forward thinking in generating rooted and free trees","author":"li","year":"1999","journal-title":"Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms ser SODA ‘99"}],"event":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","start":{"date-parts":[[2021,1,4]]},"location":"Seoul, Korea (South)","end":{"date-parts":[[2021,1,6]]}},"container-title":["2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9377321\/9377322\/09377349.pdf?arnumber=9377349","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:44:02Z","timestamp":1652197442000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9377349\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,4]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/imcom51814.2021.9377349","relation":{},"subject":[],"published":{"date-parts":[[2021,1,4]]}}}