Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "tree node"
download as .bib file
@article{DBLP:journals/fcsc/JinCLLW24,
author = {Peiquan Jin and
Zhaole Chu and
Gaocong Liu and
Yongping Luo and
Shouhong Wan},
title = {Optimizing B\({}^{\mbox{+}}\)-tree for hybrid memory with in-node
hotspot cache and eADR awareness},
journal = {Frontiers Comput. Sci.},
volume = {18},
number = {5},
pages = {185606},
year = {2024},
url = {https://doi.org/10.1007/s11704-023-3344-x},
doi = {10.1007/S11704-023-3344-X},
timestamp = {Sun, 14 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fcsc/JinCLLW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iotj/DagheroBMMPP24,
author = {Francesco Daghero and
Alessio Burrello and
Enrico Macii and
Paolo Montuschi and
Massimo Poncino and
Daniele Jahier Pagliari},
title = {Dynamic Decision Tree Ensembles for Energy-Efficient Inference on
IoT Edge Nodes},
journal = {{IEEE} Internet Things J.},
volume = {11},
number = {1},
pages = {742--757},
year = {2024},
url = {https://doi.org/10.1109/JIOT.2023.3286276},
doi = {10.1109/JIOT.2023.3286276},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iotj/DagheroBMMPP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jips/YangHL24,
author = {Yang Yang and
Shengbo Hu and
Guiju Lu},
title = {Dynamic Caching Routing Strategy for {LEO} Satellite Nodes Based on
Gradient Boosting Regression Tree},
journal = {J. Inf. Process. Syst.},
volume = {20},
number = {1},
pages = {131--147},
year = {2024},
url = {https://doi.org/10.3745/JIPS.03.0193},
doi = {10.3745/JIPS.03.0193},
timestamp = {Tue, 26 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jips/YangHL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ress/WeiHZ24,
author = {Wei Wei and
Qiuyuan Hu and
Qinghui Zhang},
title = {Improving node connectivity by optimized dual tree-based effective
node consolidation},
journal = {Reliab. Eng. Syst. Saf.},
volume = {242},
pages = {109747},
year = {2024},
url = {https://doi.org/10.1016/j.ress.2023.109747},
doi = {10.1016/J.RESS.2023.109747},
timestamp = {Sat, 20 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ress/WeiHZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tvcg/JinJTC24,
author = {Yuanzhe Jin and
Tim J. A. de Jong and
Martijn Tennekes and
Min Chen},
title = {Radial Icicle Tree {(RIT):} Node Separation and Area Constancy},
journal = {{IEEE} Trans. Vis. Comput. Graph.},
volume = {30},
number = {1},
pages = {251--261},
year = {2024},
url = {https://doi.org/10.1109/TVCG.2023.3327178},
doi = {10.1109/TVCG.2023.3327178},
timestamp = {Sat, 13 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tvcg/JinJTC24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ida/NuijtenM24,
author = {Wouter W. L. Nuijten and
Vlado Menkovski},
editor = {Ioanna Miliou and
Nico Piatkowski and
Panagiotis Papapetrou},
title = {Node Classification in Random Trees},
booktitle = {Advances in Intelligent Data Analysis {XXII} - 22nd International
Symposium on Intelligent Data Analysis, {IDA} 2024, Stockholm, Sweden,
April 24-26, 2024, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14641},
pages = {105--116},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-58547-0\_9},
doi = {10.1007/978-3-031-58547-0\_9},
timestamp = {Sat, 04 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ida/NuijtenM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/DaiJLM24,
author = {Tianxiang Dai and
Yufan Jiang and
Yong Li and
Fei Mei},
title = {NodeGuard: {A} Highly Efficient Two-Party Computation Framework for
Training Large-Scale Gradient Boosting Decision Tree},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {535},
year = {2024},
url = {https://eprint.iacr.org/2024/535},
timestamp = {Wed, 24 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/DaiJLM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/SummaF23,
author = {Marco Di Summa and
Syed Md Omar Faruk},
title = {Critical node/edge detection problems on trees},
journal = {4OR},
volume = {21},
number = {3},
pages = {439--455},
year = {2023},
url = {https://doi.org/10.1007/s10288-022-00518-0},
doi = {10.1007/S10288-022-00518-0},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/4or/SummaF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/access/LeeAL23,
author = {Bo{-}Hyun Lee and
Mijin An and
Sang{-}Won Lee},
title = {A Case for Space Compaction of B-Tree Nodes on Flash Storage},
journal = {{IEEE} Access},
volume = {11},
pages = {38149--38156},
year = {2023},
url = {https://doi.org/10.1109/ACCESS.2023.3267084},
doi = {10.1109/ACCESS.2023.3267084},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/access/LeeAL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fi/TianYH23,
author = {Zhenyu Tian and
Jiali You and
Linlin Hu},
title = {A Reverse Shortest Path Tree-Based Multicast Joining Node Selection
Method},
journal = {Future Internet},
volume = {15},
number = {5},
pages = {156},
year = {2023},
url = {https://doi.org/10.3390/fi15050156},
doi = {10.3390/FI15050156},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fi/TianYH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jifs/ZhouM23,
author = {Wenjun Zhou and
Jianmin Ma},
title = {Influence of tree-based multi-layer node information on scoring accuracy
and speed of speaker verification},
journal = {J. Intell. Fuzzy Syst.},
volume = {45},
number = {6},
pages = {11601--11611},
year = {2023},
url = {https://doi.org/10.3233/jifs-232304},
doi = {10.3233/JIFS-232304},
timestamp = {Mon, 18 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jifs/ZhouM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/kais/YangZ23,
author = {Boyu Yang and
Weiguo Zheng},
title = {Near-optimal Steiner tree computation powered by node embeddings},
journal = {Knowl. Inf. Syst.},
volume = {65},
number = {11},
pages = {4563--4583},
year = {2023},
url = {https://doi.org/10.1007/s10115-023-01893-8},
doi = {10.1007/S10115-023-01893-8},
timestamp = {Wed, 20 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/kais/YangZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pacmmod/Du00H23,
author = {Xinyu Du and
Xingyi Zhang and
Sibo Wang and
Zengfeng Huang},
title = {Efficient Tree-SVD for Subset Node Embedding over Large Dynamic Graphs},
journal = {Proc. {ACM} Manag. Data},
volume = {1},
number = {1},
pages = {96:1--96:26},
year = {2023},
url = {https://doi.org/10.1145/3588950},
doi = {10.1145/3588950},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pacmmod/Du00H23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/prl/BoriaKYB23,
author = {Nicolas Boria and
Jana Kiederle and
Florian Yger and
David B. Blumenthal},
title = {The edge-preservation similarity for comparing rooted, unordered,
node-labeled trees},
journal = {Pattern Recognit. Lett.},
volume = {167},
pages = {189--195},
year = {2023},
url = {https://doi.org/10.1016/j.patrec.2023.02.017},
doi = {10.1016/J.PATREC.2023.02.017},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/prl/BoriaKYB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aicas/ShenFTYS23,
author = {Ziyang Shen and
Chaoming Fang and
Fengshi Tian and
Jie Yang and
Mohamad Sawan},
title = {{PN-TMS:} Pruned Node-fusion Tree-based Multicast Scheme for Efficient
Neuromorphic Systems},
booktitle = {5th {IEEE} International Conference on Artificial Intelligence Circuits
and Systems, {AICAS} 2023, Hangzhou, China, June 11-13, 2023},
pages = {1--5},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/AICAS57966.2023.10168590},
doi = {10.1109/AICAS57966.2023.10168590},
timestamp = {Mon, 24 Jul 2023 15:56:17 +0200},
biburl = {https://dblp.org/rec/conf/aicas/ShenFTYS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aiccc/Tan23,
author = {Swee Chuan Tan},
title = {Enhancing Regression Tree Predictions with Terminal-Node Anomaly Detection},
booktitle = {6th Artificial Intelligence and Cloud Computing Conference, {AICCC}
2023, Kyoto, Japan, December 16-18, 2023},
pages = {21--26},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3639592.3639596},
doi = {10.1145/3639592.3639596},
timestamp = {Sat, 04 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aiccc/Tan23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cacml/ChenHWX023,
author = {Ping Chen and
Jingjing Hu and
Zhitao Wu and
Ruoting Xiong and
Wei Ren},
title = {MergeTree: a Tree Model with Merged Nodes for Threat Induction},
booktitle = {Proceedings of the 2023 2nd Asia Conference on Algorithms, Computing
and Machine Learning, {CACML} 2023, Shanghai, China, March 17-19,
2023},
pages = {49--53},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3590003.3590012},
doi = {10.1145/3590003.3590012},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cacml/ChenHWX023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/LopezGH23,
author = {Marina de la Cruz L{\'{o}}pez and
Oscar Garnica and
Jos{\'{e}} Ignacio Hidalgo},
editor = {Sara Silva and
Lu{\'{\i}}s Paquete},
title = {Tree-Based Grammatical Evolution with Non-Encoding Nodes},
booktitle = {Companion Proceedings of the Conference on Genetic and Evolutionary
Computation, {GECCO} 2023, Companion Volume, Lisbon, Portugal, July
15-19, 2023},
pages = {63--64},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3583133.3596944},
doi = {10.1145/3583133.3596944},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gecco/LopezGH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icsai/ZhaoWC23,
author = {Yan Zhao and
Qiang Wang and
Xiaofeng Chen},
editor = {Shaowen Yao and
Zhenli He and
Zheng Xiao and
Wanqing Tu and
Kenli Li and
Lipo Wang},
title = {Optimizing Blockchain Broadcast with Node-Cluster Tree Routing},
booktitle = {9th International Conference on Systems and Informatics, {ICSAI} 2023,
Changsha, China, December 16-18, 2023},
pages = {1--6},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/ICSAI61474.2023.10423349},
doi = {10.1109/ICSAI61474.2023.10423349},
timestamp = {Thu, 29 Feb 2024 20:53:03 +0100},
biburl = {https://dblp.org/rec/conf/icsai/ZhaoWC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iros/PfeifferEP23,
author = {Kai Pfeiffer and
Leonardo Edgar and
Quang{-}Cuong Pham},
title = {Monte-Carlo Tree Search with Prioritized Node Expansion for Multi-Goal
Task Planning},
booktitle = {{IROS}},
pages = {8255--8261},
year = {2023},
url = {https://doi.org/10.1109/IROS55552.2023.10342430},
doi = {10.1109/IROS55552.2023.10342430},
timestamp = {Fri, 05 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iros/PfeifferEP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ksem/QuWY23,
author = {Lianwei Qu and
Yong Wang and
Jing Yang},
editor = {Zhi Jin and
Yuncheng Jiang and
Robert Andrei Buchmann and
Yaxin Bi and
Ana{-}Maria Ghiran and
Wenjun Ma},
title = {Critical Node Privacy Protection Based on Random Pruning of Critical
Trees},
booktitle = {Knowledge Science, Engineering and Management - 16th International
Conference, {KSEM} 2023, Guangzhou, China, August 16-18, 2023, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14117},
pages = {51--58},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-40283-8\_5},
doi = {10.1007/978-3-031-40283-8\_5},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ksem/QuWY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/Balliu0KOS23,
author = {Alkida Balliu and
Sebastian Brandt and
Fabian Kuhn and
Dennis Olivetti and
Gustav Schmid},
editor = {Rotem Oshman},
title = {On the Node-Averaged Complexity of Locally Checkable Problems on Trees},
booktitle = {37th International Symposium on Distributed Computing, {DISC} 2023,
October 10-12, 2023, L'Aquila, Italy},
series = {LIPIcs},
volume = {281},
pages = {7:1--7:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.DISC.2023.7},
doi = {10.4230/LIPICS.DISC.2023.7},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wdag/Balliu0KOS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-04518,
author = {Kai Pfeiffer and
Leonardo Edgar and
Quang{-}Cuong Pham},
title = {Monte-Carlo Tree Search with Prioritized Node Expansion for Multi-Goal
Task Planning},
journal = {CoRR},
volume = {abs/2303.04518},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.04518},
doi = {10.48550/ARXIV.2303.04518},
eprinttype = {arXiv},
eprint = {2303.04518},
timestamp = {Wed, 15 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-04518.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-09789,
author = {Francesco Daghero and
Alessio Burrello and
Enrico Macii and
Paolo Montuschi and
Massimo Poncino and
Daniele Jahier Pagliari},
title = {Dynamic Decision Tree Ensembles for Energy-Efficient Inference on
IoT Edge Nodes},
journal = {CoRR},
volume = {abs/2306.09789},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.09789},
doi = {10.48550/ARXIV.2306.09789},
eprinttype = {arXiv},
eprint = {2306.09789},
timestamp = {Thu, 22 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-09789.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-10481,
author = {Yuanzhe Jin and
Tim J. A. de Jong and
Martijn Tennekes and
Min Chen},
title = {Radial Icicle Tree {(RIT):} Node Separation and Area Constancy},
journal = {CoRR},
volume = {abs/2307.10481},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.10481},
doi = {10.48550/ARXIV.2307.10481},
eprinttype = {arXiv},
eprint = {2307.10481},
timestamp = {Wed, 26 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-10481.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-04251,
author = {Alkida Balliu and
Sebastian Brandt and
Fabian Kuhn and
Dennis Olivetti and
Gustav Schmid},
title = {On the Node-Averaged Complexity of Locally Checkable Problems on Trees},
journal = {CoRR},
volume = {abs/2308.04251},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.04251},
doi = {10.48550/ARXIV.2308.04251},
eprinttype = {arXiv},
eprint = {2308.04251},
timestamp = {Tue, 22 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-04251.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-12167,
author = {Wouter W. L. Nuijten and
Vlado Menkovski},
title = {Node classification in random trees},
journal = {CoRR},
volume = {abs/2311.12167},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.12167},
doi = {10.48550/ARXIV.2311.12167},
eprinttype = {arXiv},
eprint = {2311.12167},
timestamp = {Wed, 29 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-12167.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-07566,
author = {Kennedy E. Ehimwenma and
Junfeng Wang and
Ze Zheng and
Hongyu Zhou},
title = {A symbolic-arithmetic for teaching double-black node removal in red-black
trees},
journal = {CoRR},
volume = {abs/2312.07566},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.07566},
doi = {10.48550/ARXIV.2312.07566},
eprinttype = {arXiv},
eprint = {2312.07566},
timestamp = {Thu, 04 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-07566.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-11540,
author = {Tatsuya Akutsu and
Avraham A. Melkman and
Atsuhiro Takasu},
title = {On the Trade-off between the Number of Nodes and the Number of Trees
in a Random Forest},
journal = {CoRR},
volume = {abs/2312.11540},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.11540},
doi = {10.48550/ARXIV.2312.11540},
eprinttype = {arXiv},
eprint = {2312.11540},
timestamp = {Tue, 16 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-11540.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/NezhadJI22,
author = {Ezzat Mohammad Nezhad and
Mehri Javanian and
Ramin Imany{-}Nabiyyi},
title = {Weakly protected nodes in random binary search trees},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {56},
pages = {2},
year = {2022},
url = {https://doi.org/10.1051/ita/2022002},
doi = {10.1051/ITA/2022002},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/NezhadJI22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HillBV22,
author = {Alessandro Hill and
Roberto Baldacci and
Stefan Vo{\ss}},
title = {Optimal Steiner trees under node and edge privacy conflicts},
journal = {J. Comb. Optim.},
volume = {43},
number = {5},
pages = {1509--1533},
year = {2022},
url = {https://doi.org/10.1007/s10878-020-00690-1},
doi = {10.1007/S10878-020-00690-1},
timestamp = {Wed, 14 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HillBV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangGJQ22,
author = {Qiao Zhang and
Xiucui Guan and
Junhua Jia and
Xinqiang Qian},
title = {The sum of root-leaf distance interdiction problem by upgrading edges/nodes
on trees},
journal = {J. Comb. Optim.},
volume = {44},
number = {1},
pages = {74--93},
year = {2022},
url = {https://doi.org/10.1007/s10878-021-00819-w},
doi = {10.1007/S10878-021-00819-W},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangGJQ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jmlr/WilmsB22,
author = {Ines Wilms and
Jacob Bien},
title = {Tree-based Node Aggregation in Sparse Graphical Models},
journal = {J. Mach. Learn. Res.},
volume = {23},
pages = {243:1--243:36},
year = {2022},
url = {http://jmlr.org/papers/v23/21-0105.html},
timestamp = {Wed, 07 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jmlr/WilmsB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/WangDL22,
author = {Yuyang Wang and
Dezun Dong and
Fei Lei},
title = {Understanding node connection modes in Multi-Rail Fat-tree},
journal = {J. Parallel Distributed Comput.},
volume = {167},
pages = {199--210},
year = {2022},
url = {https://doi.org/10.1016/j.jpdc.2022.04.019},
doi = {10.1016/J.JPDC.2022.04.019},
timestamp = {Wed, 06 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jpdc/WangDL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/midm/MondalDAWMBSH22,
author = {Rahul Mondal and
Minh Dung Do and
Nasimuddin Ahmed and
Daniel Walke and
Daniel Micheel and
David Broneske and
Gunter Saake and
Robert Heyer},
title = {Decision tree learning in Neo4j on homogeneous and unconnected graph
nodes from biological and clinical datasets},
journal = {{BMC} Medical Informatics Decis. Mak.},
volume = {22-S},
number = {6},
pages = {347},
year = {2022},
url = {https://doi.org/10.1186/s12911-023-02112-8},
doi = {10.1186/S12911-023-02112-8},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/midm/MondalDAWMBSH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FortzGM22,
author = {Bernard Fortz and
Luis Gouveia and
Pedro Moura},
title = {A comparison of node-based and arc-based hop-indexed formulations
for the Steiner tree problem with hop constraints},
journal = {Networks},
volume = {80},
number = {2},
pages = {178--192},
year = {2022},
url = {https://doi.org/10.1002/net.22086},
doi = {10.1002/NET.22086},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FortzGM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GalesiR22,
author = {Nicola Galesi and
Fariba Ranjbar},
title = {Tight bounds to localize failure nodes on trees, grids and through
embeddings under boolean network tomography},
journal = {Theor. Comput. Sci.},
volume = {919},
pages = {103--117},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.03.035},
doi = {10.1016/J.TCS.2022.03.035},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GalesiR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dasfaa/LiuLJ22,
author = {Gaocong Liu and
Yongping Luo and
Peiquan Jin},
editor = {Arnab Bhattacharya and
Janice Lee and
Mong Li and
Divyakant Agrawal and
P. Krishna Reddy and
Mukesh K. Mohania and
Anirban Mondal and
Vikram Goyal and
Rage Uday Kiran},
title = {HATree: {A} Hotness-Aware Tree Index with In-Node Hotspot Cache for
NVM/DRAM-Based Hybrid Memory Architecture},
booktitle = {Database Systems for Advanced Applications - 27th International Conference,
{DASFAA} 2022, Virtual Event, April 11-14, 2022, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {13245},
pages = {560--568},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-00123-9\_44},
doi = {10.1007/978-3-031-00123-9\_44},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dasfaa/LiuLJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpads/CuiGCCCY22,
author = {Jianqun Cui and
Shuang Gong and
Yanan Chang and
Ziyi Chen and
Huanhuan Chen and
Yi Yang},
title = {An Improved Spray And Wait Algorithm Based on the Node Social Tree},
booktitle = {28th {IEEE} International Conference on Parallel and Distributed Systems,
{ICPADS} 2022, Nanjing, China, January 10-12, 2023},
pages = {65--72},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/ICPADS56603.2022.00017},
doi = {10.1109/ICPADS56603.2022.00017},
timestamp = {Thu, 06 Apr 2023 14:52:40 +0200},
biburl = {https://dblp.org/rec/conf/icpads/CuiGCCCY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-10618,
author = {Cassius Manuel},
title = {An Upper Bound of the Information Flow From Children to Parent Node
on Trees},
journal = {CoRR},
volume = {abs/2204.10618},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.10618},
doi = {10.48550/ARXIV.2204.10618},
eprinttype = {arXiv},
eprint = {2204.10618},
timestamp = {Mon, 25 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-10618.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-11818,
author = {John Gliksberg and
Jean{-}No{\"{e}}l Quintin and
Pedro Javier Garc{\'{\i}}a},
title = {Node-Type-Based Load-Balancing Routing for Parallel Generalized Fat-Trees},
journal = {CoRR},
volume = {abs/2211.11818},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.11818},
doi = {10.48550/ARXIV.2211.11818},
eprinttype = {arXiv},
eprint = {2211.11818},
timestamp = {Thu, 24 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-11818.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/access/ZhouYLL21,
author = {Anan Zhou and
Benshun Yi and
Yusheng Liu and
Laigan Luo},
title = {An Optimal Tree-Structured Repair Scheme of Multiple Failure Nodes
for Distributed Storage Systems},
journal = {{IEEE} Access},
volume = {9},
pages = {21843--21858},
year = {2021},
url = {https://doi.org/10.1109/ACCESS.2021.3054954},
doi = {10.1109/ACCESS.2021.3054954},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/access/ZhouYLL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/adt/ZhengWSYTPBM21,
author = {Guangcong Zheng and
Cong Wang and
Weijie Shao and
Ying Yuan and
Zejie Tian and
Sancheng Peng and
Ali Kashif Bashir and
Shahid Mumtaz},
title = {A single-player Monte Carlo tree search method combined with node
importance for virtual network embedding},
journal = {Ann. des T{\'{e}}l{\'{e}}communications},
volume = {76},
number = {5-6},
pages = {297--312},
year = {2021},
url = {https://doi.org/10.1007/s12243-020-00772-5},
doi = {10.1007/S12243-020-00772-5},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/adt/ZhengWSYTPBM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/GuanLZ21,
author = {Xiucui Guan and
Chao Liu and
Qiao Zhang},
title = {The Critical Node Problem Based on Connectivity Index and Properties
of Components on Trees},
journal = {Asia Pac. J. Oper. Res.},
volume = {38},
number = {1},
pages = {2050041:1--2050041:27},
year = {2021},
url = {https://doi.org/10.1142/S0217595920500414},
doi = {10.1142/S0217595920500414},
timestamp = {Thu, 01 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apjor/GuanLZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/complexity/LiuWFZ21,
author = {Jinglian Liu and
Daling Wang and
Shi Feng and
Yifei Zhang},
title = {An Approach of Community Search with Minimum Spanning Tree Based on
Node Embedding},
journal = {Complex.},
volume = {2021},
pages = {6673444:1--6673444:13},
year = {2021},
url = {https://doi.org/10.1155/2021/6673444},
doi = {10.1155/2021/6673444},
timestamp = {Tue, 08 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/complexity/LiuWFZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijuwbcs/HaripriyaV21,
author = {M. P. Haripriya and
P. Venkadesh},
title = {Trust aware IoT enhanced B-tree node authentication for secured 5G
wireless communication},
journal = {Int. J. Ultra Wideband Commun. Syst.},
volume = {4},
number = {3/4},
pages = {139--146},
year = {2021},
url = {https://doi.org/10.1504/IJUWBCS.2021.119133},
doi = {10.1504/IJUWBCS.2021.119133},
timestamp = {Wed, 08 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijuwbcs/HaripriyaV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DrmotaFHN21,
author = {Michael Drmota and
Michael Fuchs and
Hsien{-}Kuei Hwang and
Ralph Neininger},
title = {Node profiles of symmetric digital search trees: Concentration properties},
journal = {Random Struct. Algorithms},
volume = {58},
number = {3},
pages = {430--467},
year = {2021},
url = {https://doi.org/10.1002/rsa.20979},
doi = {10.1002/RSA.20979},
timestamp = {Thu, 25 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DrmotaFHN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sensors/HanLYR21,
author = {Yang Han and
Chunbao Liu and
Lingyun Yan and
Lei Ren},
title = {Design of Decision Tree Structure with Improved {BPNN} Nodes for High-Accuracy
Locomotion Mode Recognition Using a Single {IMU}},
journal = {Sensors},
volume = {21},
number = {2},
pages = {526},
year = {2021},
url = {https://doi.org/10.3390/s21020526},
doi = {10.3390/S21020526},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sensors/HanLYR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cluster/WangLD21,
author = {Yuyang Wang and
Fei Lei and
Dezun Dong},
title = {Exploring Node Connection Modes in Multi-Rail Fat-tree},
booktitle = {{IEEE} International Conference on Cluster Computing, {CLUSTER} 2021,
Portland, OR, USA, September 7-10, 2021},
pages = {811--812},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/Cluster48925.2021.00071},
doi = {10.1109/CLUSTER48925.2021.00071},
timestamp = {Fri, 15 Oct 2021 14:43:26 +0200},
biburl = {https://dblp.org/rec/conf/cluster/WangLD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/globecom/HuangfuZZ21,
author = {Yingying Huangfu and
Liang Zhou and
Fan Zhou},
title = {Detecting Abnormal Nodes in Cluster-tree Networks via the Likelihood
Ratio Test of Packet Losses},
booktitle = {{IEEE} Global Communications Conference, {GLOBECOM} 2021, Madrid,
Spain, December 7-11, 2021},
pages = {1--6},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/GLOBECOM46510.2021.9685322},
doi = {10.1109/GLOBECOM46510.2021.9685322},
timestamp = {Mon, 15 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/globecom/HuangfuZZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kes/AzadC0M21,
author = {Mohammad Azad and
Igor Chikalov and
Shahid Hussain and
Mikhail Moshkov},
editor = {Jaroslaw Watr{\'{o}}bski and
Wojciech Salabun and
Carlos Toro and
Cecilia Zanni{-}Merk and
Robert J. Howlett and
Lakhmi C. Jain},
title = {Minimizing Number of Nodes in Decision Trees with Hypotheses},
booktitle = {Knowledge-Based and Intelligent Information {\&} Engineering Systems:
Proceedings of the 25th International Conference KES-2021, Virtual
Event / Szczecin, Poland, 8-10 September 2021},
series = {Procedia Computer Science},
volume = {192},
pages = {232--240},
publisher = {Elsevier},
year = {2021},
url = {https://doi.org/10.1016/j.procs.2021.08.024},
doi = {10.1016/J.PROCS.2021.08.024},
timestamp = {Mon, 24 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/kes/AzadC0M21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/paap/PanCFZ21,
author = {Zhiyong Pan and
Baolei Cheng and
Jianxi Fan and
Huanwen Zhang},
title = {A Parallel Algorithm to Construct Node-Independent Spanning Trees
on the Line Graph of Locally Twisted Cube},
booktitle = {12th International Symposium on Parallel Architectures, Algorithms
and Programming, {PAAP} 2021, Xi'an, China, December 10-12, 2021},
pages = {9--13},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/PAAP54281.2021.9720456},
doi = {10.1109/PAAP54281.2021.9720456},
timestamp = {Wed, 09 Mar 2022 08:59:57 +0100},
biburl = {https://dblp.org/rec/conf/paap/PanCFZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/saci/SzabomicronB21,
author = {J{\'{o}}zsef Z. Szab{\'{o}} and
P{\'{e}}ter Bakucz},
title = {Reliability of a Transport Node based on Fuzzy Fault Tree Analysis},
booktitle = {15th {IEEE} International Symposium on Applied Computational Intelligence
and Informatics, {SACI} 2021, Timisoara, Romania, May 19-21, 2021},
pages = {305--310},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/SACI51354.2021.9465556},
doi = {10.1109/SACI51354.2021.9465556},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/saci/SzabomicronB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wsc/CandelieriP21,
author = {Antonio Candelieri and
Giulia Pedrielli},
title = {Treed-Gaussian Processes with Support Vector Machines as Nodes For
Nonstationary Bayesian Optimization},
booktitle = {Winter Simulation Conference, {WSC} 2021, Phoenix, AZ, USA, December
12-15, 2021},
pages = {1--12},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/WSC52266.2021.9715514},
doi = {10.1109/WSC52266.2021.9715514},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wsc/CandelieriP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jaihc/ThilagavathiM21,
title = {{ERTC:} an Enhanced {RSSI} based Tree Climbing mechanism for well-planned
path localization in {WSN} using the virtual force of Mobile Anchor
Node},
journal = {J. Ambient Intell. Humaniz. Comput.},
volume = {12},
number = {6},
pages = {6665--6676},
year = {2021},
note = {Withdrawn.},
url = {https://doi.org/10.1007/s12652-020-02286-3},
doi = {10.1007/S12652-020-02286-3},
timestamp = {Wed, 08 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jaihc/ThilagavathiM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cn/MadhjaNV20,
author = {Adelina Madhja and
Sotiris E. Nikoletseas and
Alexandros A. Voudouris},
title = {Energy-aware tree network formation among computationally weak nodes},
journal = {Comput. Networks},
volume = {168},
year = {2020},
url = {https://doi.org/10.1016/j.comnet.2019.107068},
doi = {10.1016/J.COMNET.2019.107068},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cn/MadhjaNV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/ChengFLLLC20,
author = {Baolei Cheng and
Jianxi Fan and
Qiang Lyu and
Cheng{-}Kuan Lin and
Xiaoyan Li and
Guo Chen},
title = {Constructing Node-Independent Spanning Trees in Augmented Cubes},
journal = {Fundam. Informaticae},
volume = {176},
number = {2},
pages = {103--128},
year = {2020},
url = {https://doi.org/10.3233/FI-2020-1965},
doi = {10.3233/FI-2020-1965},
timestamp = {Thu, 07 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fuin/ChengFLLLC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicetd/Matsuura20,
author = {Hiroshi Matsuura},
title = {Tree Node Switching Algorithm for Minimum Energy Cost Aggregation
Tree Problem in Wireless Sensor Networks},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {103-D},
number = {11},
pages = {2250--2261},
year = {2020},
url = {https://doi.org/10.1587/transinf.2020EDP7010},
doi = {10.1587/TRANSINF.2020EDP7010},
timestamp = {Mon, 18 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ieicetd/Matsuura20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcomsys/SengathirM20,
author = {Sengathir Janakiraman and
Deva Priya M.},
title = {An Energy-Proficient Clustering-Inspired Routing Protocol using Improved
Bkd-tree for Enhanced Node Stability and Network Lifetime in Wireless
Sensor Networks},
journal = {Int. J. Commun. Syst.},
volume = {33},
number = {16},
year = {2020},
url = {https://doi.org/10.1002/dac.4575},
doi = {10.1002/DAC.4575},
timestamp = {Wed, 14 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcomsys/SengathirM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HosteinsS20,
author = {Pierre Hosteins and
Rosario Scatamacchia},
title = {The stochastic critical node problem over trees},
journal = {Networks},
volume = {76},
number = {3},
pages = {381--401},
year = {2020},
url = {https://doi.org/10.1002/net.21948},
doi = {10.1002/NET.21948},
timestamp = {Sat, 19 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HosteinsS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nn/AbpeikarGFM20,
author = {Shadi Abpeikar and
Mehdi Ghatee and
Gian Luca Foresti and
Christian Micheloni},
title = {Adaptive neural tree exploiting expert nodes to classify high-dimensional
data},
journal = {Neural Networks},
volume = {124},
pages = {20--38},
year = {2020},
url = {https://doi.org/10.1016/j.neunet.2019.12.029},
doi = {10.1016/J.NEUNET.2019.12.029},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/nn/AbpeikarGFM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sensors/CasagrandeMMVL20,
author = {Rog{\'{e}}rio Ant{\^{o}}nio Casagrande and
Ricardo de Moraes and
Carlos Montez and
Francisco Vasques and
{\'{E}}rico Le{\~{a}}o},
title = {A New Association Scheme for Handling Node Mobility in Cluster-Tree
Wireless Sensor Networks},
journal = {Sensors},
volume = {20},
number = {19},
pages = {5694},
year = {2020},
url = {https://doi.org/10.3390/s20195694},
doi = {10.3390/S20195694},
timestamp = {Thu, 11 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sensors/CasagrandeMMVL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tac/SepehrM20,
author = {Firoozeh Sepehr and
Donatello Materassi},
title = {Blind Learning of Tree Network Topologies in the Presence of Hidden
Nodes},
journal = {{IEEE} Trans. Autom. Control.},
volume = {65},
number = {3},
pages = {1014--1028},
year = {2020},
url = {https://doi.org/10.1109/TAC.2019.2915153},
doi = {10.1109/TAC.2019.2915153},
timestamp = {Wed, 20 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tac/SepehrM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tsmc/OlasupoO20,
author = {Tajudeen Olawale Olasupo and
Carlos E. Otero},
title = {The Impacts of Node Orientation on Radio Propagation Models for Airborne-Deployed
Sensor Networks in Large-Scale Tree Vegetation Terrains},
journal = {{IEEE} Trans. Syst. Man Cybern. Syst.},
volume = {50},
number = {1},
pages = {256--269},
year = {2020},
url = {https://doi.org/10.1109/TSMC.2017.2737473},
doi = {10.1109/TSMC.2017.2737473},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tsmc/OlasupoO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpr/CabreraGMNPP20,
author = {Diana Lucia Farfan Cabrera and
Nicolas Gogin and
David Morland and
Beno{\^{\i}}t Naegel and
Dimitri Papathanassiou and
Nicolas Passat},
title = {Segmentation of Axillary and Supraclavicular Tumoral Lymph Nodes in
{PET/CT:} {A} Hybrid CNN/Component-Tree Approach},
booktitle = {25th International Conference on Pattern Recognition, {ICPR} 2020,
Virtual Event / Milan, Italy, January 10-15, 2021},
pages = {6672--6679},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/ICPR48806.2021.9412343},
doi = {10.1109/ICPR48806.2021.9412343},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icpr/CabreraGMNPP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictc/ChoSPP20,
author = {Joonmyun Cho and
Young{-}Sung Son and
Jun Hee Park and
Chan{-}Won Park},
title = {An Application of {LSTM} Recurrent Networks to Expanding of Search
Tree Nodes in Symbolic Planning},
booktitle = {International Conference on Information and Communication Technology
Convergence, {ICTC} 2020, Jeju Island, Korea (South), October 21-23,
2020},
pages = {1293--1295},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/ICTC49870.2020.9289296},
doi = {10.1109/ICTC49870.2020.9289296},
timestamp = {Tue, 02 Feb 2021 11:06:03 +0100},
biburl = {https://dblp.org/rec/conf/ictc/ChoSPP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-03167,
author = {Evgenii Safronov},
title = {Node Templates to improve Reusability and Modularity of Behavior Trees},
journal = {CoRR},
volume = {abs/2002.03167},
year = {2020},
url = {https://arxiv.org/abs/2002.03167},
eprinttype = {arXiv},
eprint = {2002.03167},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-03167.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cluster/Xingrong19,
author = {Sun Xingrong},
title = {Research on time series data mining algorithm based on Bayesian node
incremental decision tree},
journal = {Clust. Comput.},
volume = {22},
number = {Supplement},
pages = {10361--10370},
year = {2019},
url = {https://doi.org/10.1007/s10586-017-1358-6},
doi = {10.1007/S10586-017-1358-6},
timestamp = {Tue, 29 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cluster/Xingrong19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cmot/KouahlaAASM19,
author = {Zineddine Kouahla and
Adeel Anjum and
Sheeraz Akram and
Tanzila Saba and
Jos{\'{e}} Martinez},
title = {XM-tree: data driven computational model by using metric extended
nodes with non-overlapping in high-dimensional metric spaces},
journal = {Comput. Math. Organ. Theory},
volume = {25},
number = {2},
pages = {196--223},
year = {2019},
url = {https://doi.org/10.1007/s10588-018-9272-x},
doi = {10.1007/S10588-018-9272-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cmot/KouahlaAASM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/concurrency/MuLWA19,
author = {Yashuang Mu and
Xiaodong Liu and
Lidong Wang and
Aamer Bilal Asghar},
title = {A parallel tree node splitting criterion for fuzzy decision trees},
journal = {Concurr. Comput. Pract. Exp.},
volume = {31},
number = {17},
year = {2019},
url = {https://doi.org/10.1002/cpe.5268},
doi = {10.1002/CPE.5268},
timestamp = {Wed, 03 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/concurrency/MuLWA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BlancoM19,
author = {V{\'{\i}}ctor Blanco and
Alfredo Mar{\'{\i}}n},
title = {Upgrading nodes in tree-shaped hub location},
journal = {Comput. Oper. Res.},
volume = {102},
pages = {75--90},
year = {2019},
url = {https://doi.org/10.1016/j.cor.2018.10.007},
doi = {10.1016/J.COR.2018.10.007},
timestamp = {Thu, 20 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/BlancoM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/evi/HemalathaPV19,
author = {C. Sweetlin Hemalatha and
Ravi Pathak and
V. Vaidehi},
title = {Hybrid decision trees for data streams based on Incremental Flexible
Naive Bayes prediction at leaf nodes},
journal = {Evol. Intell.},
volume = {12},
number = {4},
pages = {515--526},
year = {2019},
url = {https://doi.org/10.1007/s12065-019-00252-3},
doi = {10.1007/S12065-019-00252-3},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/evi/HemalathaPV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ife/ThaoM19,
author = {Cheng Thao and
Ethan V. Munson},
title = {Using versioned trees, change detection and node identity for three-way
{XML} merging},
journal = {{SICS} Softw.-Intensive Cyber Phys. Syst.},
volume = {34},
number = {1},
pages = {3--16},
year = {2019},
url = {https://doi.org/10.1007/s00450-013-0253-5},
doi = {10.1007/S00450-013-0253-5},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ife/ThaoM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijdcf/LongLP19,
author = {Min Long and
You Li and
Fei Peng},
title = {Dynamic Provable Data Possession of Multiple Copies in Cloud Storage
Based on Full-Node of {AVL} Tree},
journal = {Int. J. Digit. Crime Forensics},
volume = {11},
number = {1},
pages = {126--137},
year = {2019},
url = {https://doi.org/10.4018/IJDCF.2019010110},
doi = {10.4018/IJDCF.2019010110},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijdcf/LongLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijsnet/LiscanoOSS19,
author = {Ramiro Liscano and
Nadra Ben Otman and
Shahram Shah{-}Heydari and
Dixit Sharma},
title = {Fixed node assisted collection tree protocol for mobile wireless sensor
networks},
journal = {Int. J. Sens. Networks},
volume = {31},
number = {3},
pages = {133--144},
year = {2019},
url = {https://doi.org/10.1504/IJSNET.2019.103040},
doi = {10.1504/IJSNET.2019.103040},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijsnet/LiscanoOSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NingLJ19,
author = {Baoling Ning and
Jianzhong Li and
Shouxu Jiang},
title = {Balanced tree partition problems with virtual nodes},
journal = {J. Comb. Optim.},
volume = {37},
number = {4},
pages = {1249--1265},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0351-1},
doi = {10.1007/S10878-018-0351-1},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/NingLJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jis/Al-NsourSA19,
author = {Esam Al{-}Nsour and
Azzam Sleit and
Mohammad Aref Alshraideh},
title = {{SOLD:} {A} node-Splitting algorithm for R-tree based on Objects'
Locations Distribution},
journal = {J. Inf. Sci.},
volume = {45},
number = {2},
year = {2019},
url = {https://doi.org/10.1177/0165551518785561},
doi = {10.1177/0165551518785561},
timestamp = {Tue, 27 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jis/Al-NsourSA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/ChengFLJL19,
author = {Baolei Cheng and
Jianxi Fan and
Cheng{-}Kuan Lin and
Xiaohua Jia and
Xiaoyan Li},
title = {Constructing node-independent spanning trees on the line graph of
the hypercube by an independent forest scheme},
journal = {J. Parallel Distributed Comput.},
volume = {134},
pages = {104--115},
year = {2019},
url = {https://doi.org/10.1016/j.jpdc.2019.08.006},
doi = {10.1016/J.JPDC.2019.08.006},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/ChengFLJL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/SuratiJG19,
author = {Shivangi Surati and
Devesh C. Jinwala and
Sanjay Garg},
title = {BMMI-tree: {A} Peer-to-Peer \emph{m}-ary tree using 1-\emph{m} node
splitting for an efficient multidimensional complex query search},
journal = {J. Parallel Distributed Comput.},
volume = {125},
pages = {1--17},
year = {2019},
url = {https://doi.org/10.1016/j.jpdc.2018.09.018},
doi = {10.1016/J.JPDC.2018.09.018},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/SuratiJG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Angelopoulos19,
author = {Spyros Angelopoulos},
title = {Parameterized Analysis of the Online Priority and Node-Weighted Steiner
Tree Problems},
journal = {Theory Comput. Syst.},
volume = {63},
number = {6},
pages = {1413--1447},
year = {2019},
url = {https://doi.org/10.1007/s00224-019-09922-2},
doi = {10.1007/S00224-019-09922-2},
timestamp = {Thu, 08 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Angelopoulos19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/netmahib/Angel19,
author = {D. Angel},
title = {A graph theoretical approach for node covering in tree based architectures
and its application to bioinformatics},
journal = {Netw. Model. Anal. Health Informatics Bioinform.},
volume = {8},
number = {1},
pages = {12},
year = {2019},
url = {https://doi.org/10.1007/s13721-019-0193-5},
doi = {10.1007/S13721-019-0193-5},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/netmahib/Angel19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sensors/StrumbergerMTB19,
author = {Ivana Strumberger and
Miroslav Minovic and
Milan Tuba and
Nebojsa Bacanin},
title = {Performance of Elephant Herding Optimization and Tree Growth Algorithm
Adapted for Node Localization in Wireless Sensor Networks},
journal = {Sensors},
volume = {19},
number = {11},
pages = {2515},
year = {2019},
url = {https://doi.org/10.3390/s19112515},
doi = {10.3390/S19112515},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sensors/StrumbergerMTB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/soco/MasoneNSS19,
author = {Adriano Masone and
Maria Elena Nenni and
Antonio Sforza and
Claudio Sterle},
title = {The Minimum Routing Cost Tree Problem - State of the art and a core-node
based heuristic algorithm},
journal = {Soft Comput.},
volume = {23},
number = {9},
pages = {2947--2957},
year = {2019},
url = {https://doi.org/10.1007/s00500-018-3557-3},
doi = {10.1007/S00500-018-3557-3},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/soco/MasoneNSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cec/MaWWDHZW19,
author = {Wubin Ma and
Rui Wang and
Weichao Wang and
Su Deng and
Hongbin Huang and
Tao Zhang and
Jibin Wu},
title = {Inverted-file R-tree Index Nodes Clustering Based on Multi-objective
Optimization},
booktitle = {{IEEE} Congress on Evolutionary Computation, {CEC} 2019, Wellington,
New Zealand, June 10-13, 2019},
pages = {3341--3347},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/CEC.2019.8790216},
doi = {10.1109/CEC.2019.8790216},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cec/MaWWDHZW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cis/GuoWY19,
author = {Wei Guo and
Yong Wang and
Miao Ye},
title = {A New Construction Method of Regeneration Tree for Single Node Fault
Repair Mechanism in Distributed Storage System},
booktitle = {15th International Conference on Computational Intelligence and Security,
{CIS} 2019, Macao, SAR, China, December 13-16, 2019},
pages = {40--44},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/CIS.2019.00017},
doi = {10.1109/CIS.2019.00017},
timestamp = {Wed, 18 Mar 2020 18:15:29 +0100},
biburl = {https://dblp.org/rec/conf/cis/GuoWY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csps/YuZQLY019,
author = {Xiaofeng Yu and
Bingjie Zhang and
Hanqin Qin and
Tian Le and
Hao Yang and
Jing Liang},
editor = {Qilian Liang and
Wei Wang and
Xin Liu and
Zhenyu Na and
Min Jia and
Baoju Zhang},
title = {A Modified Genetic Fuzzy Tree Based Moving Strategy for Nodes with
Different Sensing Range in Heterogeneous {WSN}},
booktitle = {Communications, Signal Processing, and Systems - Proceedings of the
8th International Conference on Communications, Signal Processing,
and Systems, {CSPS} 2019, Urumqi, China, 20-22 July 2019},
series = {Lecture Notes in Electrical Engineering},
volume = {571},
pages = {2050--2056},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-981-13-9409-6\_248},
doi = {10.1007/978-981-13-9409-6\_248},
timestamp = {Thu, 09 Apr 2020 10:53:46 +0200},
biburl = {https://dblp.org/rec/conf/csps/YuZQLY019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eidwt/ChidaGONDE019,
author = {Ryusei Chida and
Yinzhe Guo and
Ryuji Oma and
Shigenari Nakamura and
Dilawaer Duolikun and
Tomoya Enokido and
Makoto Takizawa},
editor = {Leonard Barolli and
Fatos Xhafa and
Zahoor Ali Khan and
Hamad Odhabi},
title = {Implementation of Fog Nodes in the Tree-Based Fog Computing {(TBFC)}
Model of the IoT},
booktitle = {Advances in Internet, Data and Web Technologies, The 7th International
Conference on Emerging Internet, Data and Web Technologies, EIDWT-2019s,
Fujairah Campus, United Arab Emirates, 26-28 February 2019},
series = {Lecture Notes on Data Engineering and Communications Technologies},
volume = {29},
pages = {92--102},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-12839-5\_8},
doi = {10.1007/978-3-030-12839-5\_8},
timestamp = {Thu, 19 Mar 2020 13:11:18 +0100},
biburl = {https://dblp.org/rec/conf/eidwt/ChidaGONDE019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fmec/Gergeleit19,
author = {Martin Gergeleit},
title = {Autotree: Connecting Cheap IoT Nodes with an Auto-Configuring WiFi
Tree Network},
booktitle = {Fourth International Conference on Fog and Mobile Edge Computing,
{FMEC} 2019, Rome, Italy, June 10-13, 2019},
pages = {199--203},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/FMEC.2019.8795311},
doi = {10.1109/FMEC.2019.8795311},
timestamp = {Wed, 16 Oct 2019 14:14:56 +0200},
biburl = {https://dblp.org/rec/conf/fmec/Gergeleit19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icmv/LuoMH19,
author = {Man Luo and
Xia Min and
Benxiong Huang},
editor = {Wolfgang Osten and
Dmitry P. Nikolaev},
title = {Large scale stencil registration method based on two-node tree},
booktitle = {Twelfth International Conference on Machine Vision, {ICMV} 2019, Amsterdam,
The Netherlands, 16-18 November 2019},
series = {{SPIE} Proceedings},
volume = {11433},
pages = {1143336},
publisher = {{SPIE}},
year = {2019},
url = {https://doi.org/10.1117/12.2557160},
doi = {10.1117/12.2557160},
timestamp = {Thu, 29 Oct 2020 18:10:00 +0100},
biburl = {https://dblp.org/rec/conf/icmv/LuoMH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/AkashKAS19,
author = {Pritom Saha Akash and
Md. Eusha Kadir and
Amin Ahsan Ali and
Mohammad Shoyaib},
editor = {Sarit Kraus},
title = {Inter-node Hellinger Distance based Decision Tree},
booktitle = {Proceedings of the Twenty-Eighth International Joint Conference on
Artificial Intelligence, {IJCAI} 2019, Macao, China, August 10-16,
2019},
pages = {1967--1973},
publisher = {ijcai.org},
year = {2019},
url = {https://doi.org/10.24963/ijcai.2019/272},
doi = {10.24963/IJCAI.2019/272},
timestamp = {Tue, 20 Aug 2019 16:18:18 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/AkashKAS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ithings/WangS19,
author = {Xingbo Wang and
Zhen Shen},
title = {Computing Symmetric Brothers of a Node in a Perfect Binary Tree},
booktitle = {2019 International Conference on Internet of Things (iThings) and
{IEEE} Green Computing and Communications (GreenCom) and {IEEE} Cyber,
Physical and Social Computing (CPSCom) and {IEEE} Smart Data (SmartData),
iThings/GreenCom/CPSCom/SmartData 2019, Atlanta, GA, USA, July 14-17,
2019},
pages = {385--388},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/iThings/GreenCom/CPSCom/SmartData.2019.00084},
doi = {10.1109/ITHINGS/GREENCOM/CPSCOM/SMARTDATA.2019.00084},
timestamp = {Thu, 24 Oct 2019 15:55:06 +0200},
biburl = {https://dblp.org/rec/conf/ithings/WangS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itnac/JimG19,
author = {Lincy Elizebeth Jim and
Mark A. Gregory},
title = {Improvised {MANET} Selfish Node Detection using Artificial Immune
System based Decision Tree},
booktitle = {29th International Telecommunication Networks and Applications Conference,
{ITNAC} 2019, Auckland, New Zealand, November 27-29, 2019},
pages = {1--6},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/ITNAC46935.2019.9077968},
doi = {10.1109/ITNAC46935.2019.9077968},
timestamp = {Mon, 04 May 2020 16:58:48 +0200},
biburl = {https://dblp.org/rec/conf/itnac/JimG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-10086,
author = {Jason M. Klusowski},
title = {Best Split Nodes for Regression Trees},
journal = {CoRR},
volume = {abs/1906.10086},
year = {2019},
url = {http://arxiv.org/abs/1906.10086},
eprinttype = {arXiv},
eprint = {1906.10086},
timestamp = {Fri, 28 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-10086.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-04329,
author = {Nachum Dershowitz},
title = {Nonleaf Patterns in Trees: Protected Nodes and Fine Numbers},
journal = {CoRR},
volume = {abs/1908.04329},
year = {2019},
url = {http://arxiv.org/abs/1908.04329},
eprinttype = {arXiv},
eprint = {1908.04329},
timestamp = {Mon, 19 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-04329.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cluster/VijayarajSP19,
title = {Node discovery with development of routing tree in wireless networks},
journal = {Clust. Comput.},
volume = {22},
number = {5},
pages = {10861--10871},
year = {2019},
note = {Withdrawn.},
url = {https://doi.org/10.1007/s10586-017-1211-y},
doi = {10.1007/S10586-017-1211-Y},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cluster/VijayarajSP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/basesearch/Sun18a,
author = {Yahui Sun},
title = {Classical, prize-collecting and node-weighted Steiner tree problems
in graphs},
school = {University of Melbourne, Parkville, Victoria, Australia},
year = {2018},
url = {https://hdl.handle.net/11343/214000},
timestamp = {Thu, 20 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/basesearch/Sun18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/access/YuL18,
author = {Xiaofeng Yu and
Jing Liang},
title = {Genetic Fuzzy Tree Based Node Moving Strategy of Target Tracking in
Multimodal Wireless Sensor Network},
journal = {{IEEE} Access},
volume = {6},
pages = {25764--25772},
year = {2018},
url = {https://doi.org/10.1109/ACCESS.2018.2835162},
doi = {10.1109/ACCESS.2018.2835162},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/access/YuL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cce/ChenY18,
author = {Zhiping Chen and
Zhe Yan},
title = {Scenario tree reduction methods through clustering nodes},
journal = {Comput. Chem. Eng.},
volume = {109},
pages = {96--111},
year = {2018},
url = {https://doi.org/10.1016/j.compchemeng.2017.10.017},
doi = {10.1016/J.COMPCHEMENG.2017.10.017},
timestamp = {Thu, 28 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cce/ChenY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/YoshiharaKY18,
author = {Tomohiro Yoshihara and
Dai Kobayashi and
Haruo Yokota},
title = {Concurrency Control Protocol for Parallel B-Tree Structures That Improves
the Efficiency of Request Transfers and SMOs within a Node},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {101-D},
number = {1},
pages = {152--170},
year = {2018},
url = {https://doi.org/10.1587/transinf.2016EDP7437},
doi = {10.1587/TRANSINF.2016EDP7437},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/YoshiharaKY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijaacs/YangZCLL18,
author = {Weijun Yang and
Yun Zhang and
Yuanfeng Chen and
Jianqi Liu and
Genyi Liu},
title = {A heuristic approximation algorithm for the Steiner tree based on
prior multicast nodes},
journal = {Int. J. Auton. Adapt. Commun. Syst.},
volume = {11},
number = {3},
pages = {193--208},
year = {2018},
url = {https://doi.org/10.1504/IJAACS.2018.10014824},
doi = {10.1504/IJAACS.2018.10014824},
timestamp = {Sat, 25 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijaacs/YangZCLL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tsur18,
author = {Dekel Tsur},
title = {Succinct data structures for nearest colored node in a tree},
journal = {Inf. Process. Lett.},
volume = {132},
pages = {6--10},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.10.001},
doi = {10.1016/J.IPL.2017.10.001},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tsur18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BuchananWB18,
author = {Austin Buchanan and
Yiming Wang and
Sergiy Butenko},
title = {Algorithms for node-weighted Steiner tree and maximum-weight connected
subgraph},
journal = {Networks},
volume = {72},
number = {2},
pages = {238--248},
year = {2018},
url = {https://doi.org/10.1002/net.21825},
doi = {10.1002/NET.21825},
timestamp = {Wed, 03 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BuchananWB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GawrychowskiLMW18,
author = {Pawel Gawrychowski and
Gad M. Landau and
Shay Mozes and
Oren Weimann},
title = {The nearest colored node in a tree},
journal = {Theor. Comput. Sci.},
volume = {710},
pages = {66--73},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.08.021},
doi = {10.1016/J.TCS.2017.08.021},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GawrychowskiLMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tsp/TianST18,
author = {Yu{-}Ping Tian and
Xiao{-}Jing Sun and
Ouya Tian},
title = {Detection Performance of the Majority Dominance Rule in m-Ary Relay
Trees With Node and Link Failures},
journal = {{IEEE} Trans. Signal Process.},
volume = {66},
number = {6},
pages = {1469--1482},
year = {2018},
url = {https://doi.org/10.1109/TSP.2017.2788418},
doi = {10.1109/TSP.2017.2788418},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tsp/TianST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/IEEEssd/KhedherLD18,
author = {Marwa Khedher and
Hend Liouane and
Ali Douik},
title = {Optimized Minimum Spanning Tree for Border Nodes Selection in Wireless
Sensor Networks},
booktitle = {15th International Multi-Conference on Systems, Signals {\&} Devices,
{SSD} 2018, Yassmine Hammamet, Tunisia, March 19-22, 2018},
pages = {660--665},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.1109/SSD.2018.8570484},
doi = {10.1109/SSD.2018.8570484},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/IEEEssd/KhedherLD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BahraniL18,
author = {Maryam Bahrani and
J{\'{e}}r{\'{e}}mie O. Lumbroso},
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {Split-Decomposition Trees with Prime Nodes: Enumeration and Random
Generation of Cactus Graphs},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
pages = {143--157},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062.13},
doi = {10.1137/1.9781611975062.13},
timestamp = {Mon, 02 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BahraniL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apsec/CaiWFOKY18,
author = {Hua Cai and
Hironori Washizaki and
Yoshiaki Fukazawa and
Takao Okubo and
Haruhiko Kaiya and
Nobukazu Yoshioka},
editor = {Nobukazu Yoshioka and
Hironori Washizaki and
Eduardo B. Fern{\'{a}}ndez and
Tomoko Kaneko and
Shuichiro Yamamoto and
Fuyuki Ishikawa and
Foutse Khomh and
Giuliano Antoniol},
title = {Restructuring Attack Trees to Identify Incorrect or Missing Relationships
between Nodes},
booktitle = {Proceedings of the International Workshop on Evidence-based Security
and Privacy in the Wild and the 1st International Workshop on Machine
Learning Systems Engineering co-located with 25th Asia-Pacific Software
Engineering Conference {(APSEC} 2018), Nara, Japan, December 4, 2018},
series = {{CEUR} Workshop Proceedings},
volume = {2809},
pages = {18--25},
publisher = {CEUR-WS.org},
year = {2018},
url = {https://ceur-ws.org/Vol-2809/WESPr-18\_03.pdf},
timestamp = {Fri, 10 Mar 2023 16:22:12 +0100},
biburl = {https://dblp.org/rec/conf/apsec/CaiWFOKY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hpca/GliksbergQG18,
author = {John Gliksberg and
Jean{-}No{\"{e}}l Quintin and
Pedro Javier Garc{\'{\i}}a},
title = {Node-Type-Based Load-Balancing Routing for Parallel Generalized Fat-Trees},
booktitle = {4th {IEEE} International Workshop on High-Performance Interconnection
Networks in the Exascale and Big-Data Era, HiPINEB@HPCA 2018, Vienna,
Austria, February 24, 2018},
pages = {9--15},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/HiPINEB.2018.00010},
doi = {10.1109/HIPINEB.2018.00010},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/hpca/GliksbergQG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icccnt/StanzinM18,
author = {Tsewang Stanzin and
Mahendra Kumar Murmu},
title = {Minimum Spanning Tree in Cognitive Radio Networks: {A} Distributed
Approach to Maintain for Node Failures},
booktitle = {9th International Conference on Computing, Communication and Networking
Technologies, {ICCCNT} 2018, Bengaluru, India, July 10-12, 2018},
pages = {1--6},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.1109/ICCCNT.2018.8493920},
doi = {10.1109/ICCCNT.2018.8493920},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icccnt/StanzinM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icmc2/0002KK18,
author = {Suman Roy and
Srinivasan Krishnaswamy and
P. Vinod Kumar},
editor = {Debdas Ghosh and
Debasis Giri and
Ram N. Mohapatra and
Ekrem Savas and
Kouichi Sakurai and
L. P. Singh},
title = {On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs},
booktitle = {Mathematics and Computing - 4th International Conference, {ICMC} 2018,
Varanasi, India, January 9-11, 2018, Revised Selected Papers},
series = {Communications in Computer and Information Science},
volume = {834},
pages = {110--117},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-981-13-0023-3\_11},
doi = {10.1007/978-981-13-0023-3\_11},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icmc2/0002KK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sc/PollardJHB18,
author = {Samuel D. Pollard and
Nikhil Jain and
Stephen Herbein and
Abhinav Bhatele},
title = {Evaluation of an interference-free node allocation policy on fat-tree
clusters},
booktitle = {Proceedings of the International Conference for High Performance Computing,
Networking, Storage, and Analysis, {SC} 2018, Dallas, TX, USA, November
11-16, 2018},
pages = {26:1--26:13},
publisher = {{IEEE} / {ACM}},
year = {2018},
url = {http://dl.acm.org/citation.cfm?id=3291691},
timestamp = {Mon, 12 Nov 2018 09:05:15 +0100},
biburl = {https://dblp.org/rec/conf/sc/PollardJHB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-05252,
author = {V{\'{\i}}ctor Blanco and
Alfredo Mar{\'{\i}}n},
title = {Upgrading nodes in tree-shaped hub location},
journal = {CoRR},
volume = {abs/1802.05252},
year = {2018},
url = {http://arxiv.org/abs/1802.05252},
eprinttype = {arXiv},
eprint = {1802.05252},
timestamp = {Thu, 20 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-05252.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-06456,
author = {Pierre Hosteins and
Rosario Scatamacchia},
title = {The Stochastic Critical Node Problem over Trees},
journal = {CoRR},
volume = {abs/1812.06456},
year = {2018},
url = {http://arxiv.org/abs/1812.06456},
eprinttype = {arXiv},
eprint = {1812.06456},
timestamp = {Tue, 01 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-06456.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/JonesP17,
author = {Bradley R. Jones and
Art F. Y. Poon},
title = {node.dating: dating ancestors in phylogenetic trees in {R}},
journal = {Bioinform.},
volume = {33},
number = {6},
pages = {932--934},
year = {2017},
url = {https://doi.org/10.1093/bioinformatics/btw744},
doi = {10.1093/BIOINFORMATICS/BTW744},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/JonesP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/SunMH17,
author = {Yahui Sun and
Chenkai Ma and
Saman K. Halgamuge},
title = {The node-weighted Steiner tree approach to identify elements of cancer-related
signaling pathways},
journal = {{BMC} Bioinform.},
volume = {18},
number = {16},
pages = {53--65},
year = {2017},
url = {https://doi.org/10.1186/s12859-017-1958-4},
doi = {10.1186/S12859-017-1958-4},
timestamp = {Thu, 20 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcbi/SunMH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jap/AbrahamBD17,
author = {Romain Abraham and
Aymen Bouaziz and
Jean{-}Fran{\c{c}}ois Delmas},
title = {Local limits of Galton-Watson trees conditioned on the number of protected
nodes},
journal = {J. Appl. Probab.},
volume = {54},
number = {1},
pages = {55--65},
year = {2017},
url = {https://doi.org/10.1017/jpr.2016.86},
doi = {10.1017/JPR.2016.86},
timestamp = {Thu, 16 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jap/AbrahamBD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/BogdanowiczG17,
author = {Damian Bogdanowicz and
Krzysztof Giaro},
title = {Comparing Phylogenetic Trees by Matching Nodes Using the Transfer
Distance Between Partitions},
journal = {J. Comput. Biol.},
volume = {24},
number = {5},
pages = {422--435},
year = {2017},
url = {https://doi.org/10.1089/cmb.2016.0204},
doi = {10.1089/CMB.2016.0204},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/BogdanowiczG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ZhuW0W17,
author = {Daxin Zhu and
Yingjie Wu and
Lei Wang and
Xiaodong Wang},
title = {A note on the largest number of red nodes in red-black trees},
journal = {J. Discrete Algorithms},
volume = {43},
pages = {81--94},
year = {2017},
url = {https://doi.org/10.1016/j.jda.2017.03.001},
doi = {10.1016/J.JDA.2017.03.001},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/ZhuW0W17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/NachmansonNBZH17,
author = {Lev Nachmanson and
Arlind Nocaj and
Sergey Bereg and
Leishi Zhang and
Alexander E. Holroyd},
title = {Node Overlap Removal by Growing a Tree},
journal = {J. Graph Algorithms Appl.},
volume = {21},
number = {5},
pages = {857--872},
year = {2017},
url = {https://doi.org/10.7155/jgaa.00442},
doi = {10.7155/JGAA.00442},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/NachmansonNBZH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jota/ParilinaZ17,
author = {Elena M. Parilina and
Georges Zaccour},
title = {Node-Consistent Shapley Value for Games Played over Event Trees with
Random Terminal Time},
journal = {J. Optim. Theory Appl.},
volume = {175},
number = {1},
pages = {236--254},
year = {2017},
url = {https://doi.org/10.1007/s10957-017-1148-6},
doi = {10.1007/S10957-017-1148-6},
timestamp = {Tue, 07 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jota/ParilinaZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/HussainAC17,
author = {Zaid A. Hussain and
Bader F. AlBdaiwi and
Anton Cern{\'{y}}},
title = {Node-independent spanning trees in Gaussian networks},
journal = {J. Parallel Distributed Comput.},
volume = {109},
pages = {324--332},
year = {2017},
url = {https://doi.org/10.1016/j.jpdc.2017.06.018},
doi = {10.1016/J.JPDC.2017.06.018},
timestamp = {Mon, 20 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jpdc/HussainAC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/kbs/XuWLDG17,
author = {Ji Xu and
Guoyin Wang and
Tianrui Li and
Weihui Deng and
Guanglei Gou},
title = {Fat node leading tree for data stream clustering with density peaks},
journal = {Knowl. Based Syst.},
volume = {120},
pages = {99--117},
year = {2017},
url = {https://doi.org/10.1016/j.knosys.2016.12.025},
doi = {10.1016/J.KNOSYS.2016.12.025},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/kbs/XuWLDG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/FischettiLLLMRS17,
author = {Matteo Fischetti and
Markus Leitner and
Ivana Ljubic and
Martin Luipersbeck and
Michele Monaci and
Max Resch and
Domenico Salvagnin and
Markus Sinnl},
title = {Thinning out Steiner trees: a node-based model for uniform edge costs},
journal = {Math. Program. Comput.},
volume = {9},
number = {2},
pages = {203--229},
year = {2017},
url = {https://doi.org/10.1007/s12532-016-0111-0},
doi = {10.1007/S12532-016-0111-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mpc/FischettiLLLMRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sensors/LiuJWYS17,
author = {Jun Liu and
Peng Jiang and
Feng Wu and
Shan{-}en Yu and
Chunyue Song},
title = {Node Redeployment Algorithm Based on Stratified Connected Tree for
Underwater Sensor Networks},
journal = {Sensors},
volume = {17},
number = {1},
pages = {27},
year = {2017},
url = {https://doi.org/10.3390/s17010027},
doi = {10.3390/S17010027},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sensors/LiuJWYS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csps/YuL0L17,
author = {Xiaofeng Yu and
Xiaoxu Liu and
Jie Ren and
Jing Liang},
editor = {Qilian Liang and
Jiasong Mu and
Min Jia and
Wei Wang and
Xuhong Feng and
Baoju Zhang},
title = {A Genetic Fuzzy Tree Based Moving Strategy for a Group of Nodes in
Heterogeneous {WSN}},
booktitle = {Communications, Signal Processing, and Systems - Proceedings of the
2017 International Conference on Communications, Signal Processing,
and Systems, {CSPS} 2017, Harbin, China, 14-16 July 2017},
series = {Lecture Notes in Electrical Engineering},
volume = {463},
pages = {2501--2508},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-981-10-6571-2\_304},
doi = {10.1007/978-981-10-6571-2\_304},
timestamp = {Thu, 16 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/csps/YuL0L17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gski/Zhang17,
author = {Huanming Zhang},
editor = {Hanning Yuan and
Jing Geng and
Chuanlu Liu and
Fuling Bian and
Tisinee Surapunt},
title = {Message Passing Algorithm Based on Cut-Node Tree},
booktitle = {Geo-Spatial Knowledge and Intelligence - 5th International Conference,
{GSKI} 2017, Chiang Mai, Thailand, December 8-10, 2017, Revised Selected
Papers, Part {I}},
series = {Communications in Computer and Information Science},
volume = {848},
pages = {608--614},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-981-13-0893-2\_63},
doi = {10.1007/978-981-13-0893-2\_63},
timestamp = {Sun, 24 Jun 2018 18:48:11 +0200},
biburl = {https://dblp.org/rec/conf/gski/Zhang17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ic2it/Srisura17,
author = {Benjawan Srisura},
editor = {Phayung Meesad and
Sunantha Sodsee and
Herwig Unger},
title = {Impurity Measurement in Selecting Decision Node Tree that Tolerate
Noisy Cases},
booktitle = {Recent Advances in Information and Communication Technology 2017 -
Proceedings of the 13th International Conference on Computing and
Information Technology (IC2IT), Bangkok, Thailand, 6-7 July, 2017},
series = {Advances in Intelligent Systems and Computing},
volume = {566},
pages = {13--21},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-60663-7\_2},
doi = {10.1007/978-3-319-60663-7\_2},
timestamp = {Wed, 21 Jun 2017 11:50:38 +0200},
biburl = {https://dblp.org/rec/conf/ic2it/Srisura17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdim/Lipinski17,
author = {Zbigniew Lipinski},
title = {Minimum node weight spanning trees searching algorithm for broadcast
transmission in sensor networks},
booktitle = {Twelfth International Conference on Digital Information Management,
{ICDIM} 2017, Fukuoka, Japan, September 12-14, 2017},
pages = {150--154},
publisher = {{IEEE}},
year = {2017},
url = {https://doi.org/10.1109/ICDIM.2017.8244691},
doi = {10.1109/ICDIM.2017.8244691},
timestamp = {Wed, 16 Oct 2019 14:14:49 +0200},
biburl = {https://dblp.org/rec/conf/icdim/Lipinski17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/ShangGCT17,
author = {Lei Shang and
Michele Garraffa and
Federico Della Croce and
Vincent T'kindt},
editor = {Daniel Lokshtanov and
Naomi Nishimura},
title = {Merging Nodes in Search Trees: an Exact Exponential Algorithm for
the Single Machine Total Tardiness Scheduling Problem},
booktitle = {12th International Symposium on Parameterized and Exact Computation,
{IPEC} 2017, September 6-8, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {89},
pages = {28:1--28:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.28},
doi = {10.4230/LIPICS.IPEC.2017.28},
timestamp = {Fri, 16 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/ShangGCT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kivs/PopovicKB17,
author = {Miroslav Popovic and
Ramin Khalili and
Jean{-}Yves Le Boudec},
title = {Performance comparison of node-redundant multicast distribution trees
in {SDN} networks},
booktitle = {2017 International Conference on Networked Systems, NetSys 2017, G{\"{o}}ttingen,
Germany, March 13-16, 2017},
pages = {1--8},
publisher = {{IEEE}},
year = {2017},
url = {https://doi.org/10.1109/NetSys.2017.7903946},
doi = {10.1109/NETSYS.2017.7903946},
timestamp = {Wed, 16 Oct 2019 14:14:53 +0200},
biburl = {https://dblp.org/rec/conf/kivs/PopovicKB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/trustcom/LiuZY17,
author = {Yao Liu and
Qingkai Zeng and
Pinghai Yuan},
title = {NodeLeaper: Lower Overhead Oblivious {AVL} Tree},
booktitle = {2017 {IEEE} Trustcom/BigDataSE/ICESS, Sydney, Australia, August 1-4,
2017},
pages = {487--493},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/Trustcom/BigDataSE/ICESS.2017.275},
doi = {10.1109/TRUSTCOM/BIGDATASE/ICESS.2017.275},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/trustcom/LiuZY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/AgrawalLM17,
author = {Akanksha Agrawal and
Daniel Lokshtanov and
Amer E. Mouawad},
editor = {Hans L. Bodlaender and
Gerhard J. Woeginger},
title = {Critical Node Cut Parameterized by Treewidth and Solution Size is
W[1]-Hard},
booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International
Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10520},
pages = {32--44},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-68705-6\_3},
doi = {10.1007/978-3-319-68705-6\_3},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/AgrawalLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/gis/X17ns,
editor = {Shashi Shekhar and
Hui Xiong and
Xun Zhou},
title = {Extended Node Tree},
booktitle = {Encyclopedia of {GIS}},
pages = {583},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-17885-1\_100397},
doi = {10.1007/978-3-319-17885-1\_100397},
timestamp = {Fri, 03 Apr 2020 17:07:19 +0200},
biburl = {https://dblp.org/rec/reference/gis/X17ns.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HussainAC17,
author = {Zaid A. Hussain and
Bader F. AlBdaiwi and
Anton Cern{\'{y}}},
title = {Node-Independent Spanning Trees in Gaussian Networks},
journal = {CoRR},
volume = {abs/1701.02991},
year = {2017},
url = {http://arxiv.org/abs/1701.02991},
eprinttype = {arXiv},
eprint = {1701.02991},
timestamp = {Mon, 20 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HussainAC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-10647,
author = {Maryam Bahrani and
J{\'{e}}r{\'{e}}mie O. Lumbroso},
title = {Split-Decomposition Trees with Prime Nodes: Enumeration and Random
Generation of Cactus Graphs},
journal = {CoRR},
volume = {abs/1711.10647},
year = {2017},
url = {http://arxiv.org/abs/1711.10647},
eprinttype = {arXiv},
eprint = {1711.10647},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-10647.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apin/WuCLY16,
author = {Chia{-}Chi Wu and
Yen{-}Liang Chen and
Yi{-}Hung Liu and
Xiangyu Yang},
title = {Decision tree induction with a constrained number of leaf nodes},
journal = {Appl. Intell.},
volume = {45},
number = {3},
pages = {673--685},
year = {2016},
url = {https://doi.org/10.1007/s10489-016-0785-z},
doi = {10.1007/S10489-016-0785-Z},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apin/WuCLY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cmmm/BirjandiAP16,
author = {Mehdi Birjandi and
Seyyed Mohammad Taghi Ayatollahi and
Saeedeh Pourahmad},
title = {The Reliability of Classification of Terminal Nodes in {GUIDE} Decision
Tree to Predict the Nonalcoholic Fatty Liver Disease},
journal = {Comput. Math. Methods Medicine},
volume = {2016},
pages = {3874086:1--3874086:11},
year = {2016},
url = {https://doi.org/10.1155/2016/3874086},
doi = {10.1155/2016/3874086},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cmmm/BirjandiAP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comcom/LiuNPW16,
author = {Bing{-}Hong Liu and
Ngoc{-}Tu Nguyen and
Van{-}Trung Pham and
Wei{-}Sheng Wang},
title = {Constrained node-weighted Steiner tree based algorithms for constructing
a wireless sensor network to cover maximum weighted critical square
grids},
journal = {Comput. Commun.},
volume = {81},
pages = {52--60},
year = {2016},
url = {https://doi.org/10.1016/j.comcom.2015.07.027},
doi = {10.1016/J.COMCOM.2015.07.027},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comcom/LiuNPW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/HoshikaM16,
author = {Daiki Hoshika and
Eiji Miyano},
title = {Approximation Algorithms for Packing Element-Disjoint Steiner Trees
on Bounded Terminal Nodes},
journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.},
volume = {99-A},
number = {6},
pages = {1059--1066},
year = {2016},
url = {https://doi.org/10.1587/transfun.E99.A.1059},
doi = {10.1587/TRANSFUN.E99.A.1059},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/HoshikaM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/igtr/ParilinaZ16,
author = {Elena M. Parilina and
Georges Zaccour},
title = {Strategic Support of Node-Consistent Cooperative Outcomes in Dynamic
Games Played Over Event Trees},
journal = {{IGTR}},
volume = {18},
number = {2},
pages = {1640002:1--1640002:16},
year = {2016},
url = {https://doi.org/10.1142/S0219198916400028},
doi = {10.1142/S0219198916400028},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/igtr/ParilinaZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijaacs/CuiGYFWY16,
author = {Jianqun Cui and
Kuan Gao and
Yongjia Ye and
Jing Fan and
Libing Wu and
Yi Yang},
title = {Multicast tree construction: a nodes' relative leaving probability
algorithm based on {NICE} in {ALM}},
journal = {Int. J. Auton. Adapt. Commun. Syst.},
volume = {9},
number = {1/2},
pages = {4--19},
year = {2016},
url = {https://doi.org/10.1504/IJAACS.2016.075385},
doi = {10.1504/IJAACS.2016.075385},
timestamp = {Mon, 23 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijaacs/CuiGYFWY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocnet/Li0ZH16,
author = {Xiao Li and
Wei Ji and
Shicheng Zhang and
Kangrui Huang},
title = {Signaling Free Localization of Link and Node Failures in an Optical
Mesh-Tree Network},
journal = {{JOCN}},
volume = {8},
number = {4},
pages = {263--271},
year = {2016},
url = {https://doi.org/10.1364/jocn.8.000263},
doi = {10.1364/JOCN.8.000263},
timestamp = {Tue, 18 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocnet/Li0ZH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/SinnlL16,
author = {Markus Sinnl and
Ivana Ljubic},
title = {A node-based layered graph approach for the Steiner tree problem with
revenues, budget and hop-constraints},
journal = {Math. Program. Comput.},
volume = {8},
number = {4},
pages = {461--490},
year = {2016},
url = {https://doi.org/10.1007/s12532-016-0102-1},
doi = {10.1007/S12532-016-0102-1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mpc/SinnlL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/swevo/LimaDSFJB16,
author = {Telma Woerle de Lima and
Alexandre Cl{\'{a}}udio Botazzo Delbem and
Anderson da Silva Soares and
Fernando Marques Federson and
Jo{\~{a}}o Bosco Augusto London Junior and
Jeffrey Van Baalen},
title = {Node-depth phylogenetic-based encoding, a spanning-tree representation
for evolutionary algorithms. part {I:} Proposal and properties analysis},
journal = {Swarm Evol. Comput.},
volume = {31},
pages = {1--10},
year = {2016},
url = {https://doi.org/10.1016/j.swevo.2016.05.001},
doi = {10.1016/J.SWEVO.2016.05.001},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/swevo/LimaDSFJB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/0001LY16,
author = {Michael Fuchs and
C.{-}K. Lee and
G.{-}R. Yu},
title = {On 2-protected nodes in random digital trees},
journal = {Theor. Comput. Sci.},
volume = {622},
pages = {111--122},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.02.007},
doi = {10.1016/J.TCS.2016.02.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/0001LY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tjs/AlBdaiwiHCA16,
author = {Bader F. AlBdaiwi and
Zaid A. Hussain and
Anton Cern{\'{y}} and
Robert E. L. Aldred},
title = {Edge-disjoint node-independent spanning trees in dense Gaussian networks},
journal = {J. Supercomput.},
volume = {72},
number = {12},
pages = {4718--4736},
year = {2016},
url = {https://doi.org/10.1007/s11227-016-1768-x},
doi = {10.1007/S11227-016-1768-X},
timestamp = {Mon, 20 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tjs/AlBdaiwiHCA16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cec/SunH16,
author = {Yahui Sun and
Saman K. Halgamuge},
title = {Fast algorithms inspired by Physarum polycephalum for node weighted
steiner tree problem with multiple terminals},
booktitle = {{IEEE} Congress on Evolutionary Computation, {CEC} 2016, Vancouver,
BC, Canada, July 24-29, 2016},
pages = {3254--3260},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/CEC.2016.7744201},
doi = {10.1109/CEC.2016.7744201},
timestamp = {Thu, 20 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cec/SunH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GawrychowskiLMW16,
author = {Pawel Gawrychowski and
Gad M. Landau and
Shay Mozes and
Oren Weimann},
editor = {Roberto Grossi and
Moshe Lewenstein},
title = {The Nearest Colored Node in a Tree},
booktitle = {27th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2016,
June 27-29, 2016, Tel Aviv, Israel},
series = {LIPIcs},
volume = {54},
pages = {25:1--25:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CPM.2016.25},
doi = {10.4230/LIPICS.CPM.2016.25},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/cpm/GawrychowskiLMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/embc/FeuillatreNT16,
author = {Helene Feuillatre and
Jean{-}Claude Nunes and
Christine Toumoulin},
title = {Inexact coronary tree matching algorithm with artificial nodes},
booktitle = {38th Annual International Conference of the {IEEE} Engineering in
Medicine and Biology Society, {EMBC} 2016, Orlando, FL, USA, August
16-20, 2016},
pages = {4153--4156},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/EMBC.2016.7591641},
doi = {10.1109/EMBC.2016.7591641},
timestamp = {Wed, 16 Oct 2019 14:14:50 +0200},
biburl = {https://dblp.org/rec/conf/embc/FeuillatreNT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/NachmansonNBZH16,
author = {Lev Nachmanson and
Arlind Nocaj and
Sergey Bereg and
Leishi Zhang and
Alexander E. Holroyd},
editor = {Yifan Hu and
Martin N{\"{o}}llenburg},
title = {Node Overlap Removal by Growing a Tree},
booktitle = {Graph Drawing and Network Visualization - 24th International Symposium,
{GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9801},
pages = {33--43},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-50106-2\_3},
doi = {10.1007/978-3-319-50106-2\_3},
timestamp = {Sat, 17 Dec 2022 21:30:20 +0100},
biburl = {https://dblp.org/rec/conf/gd/NachmansonNBZH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/globecom/DjenouriBCB16,
author = {Djamel Djenouri and
Miloud Bagaa and
Ali Chelli and
Ilangko Balasingham},
title = {Energy Harvesting Aware Minimum Spanning Tree for Survivable {WSN}
with Minimum Relay Node Addition},
booktitle = {2016 {IEEE} Globecom Workshops, Washington, DC, USA, December 4-8,
2016},
pages = {1--6},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/GLOCOMW.2016.7848891},
doi = {10.1109/GLOCOMW.2016.7848891},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/globecom/DjenouriBCB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kesw/GargiuloAMPS16,
author = {Francesco Gargiulo and
Flora Amato and
Vincenzo Moscato and
Antonio Picariello and
Giancarlo Sperl{\`{\i}}},
editor = {Axel{-}Cyrille Ngonga Ngomo and
Petr Kremen},
title = {Nearest Query on Distributed Binary Trees Starting from a Random Node},
booktitle = {Knowledge Engineering and Semantic Web - 7th International Conference,
{KESW} 2016, Prague, Czech Republic, September 21-23, 2016, Proceedings},
series = {Communications in Computer and Information Science},
volume = {649},
pages = {257--271},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-45880-9\_20},
doi = {10.1007/978-3-319-45880-9\_20},
timestamp = {Mon, 26 Jun 2023 20:49:00 +0200},
biburl = {https://dblp.org/rec/conf/kesw/GargiuloAMPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lcn/DisterhoftG16,
author = {Andreas Disterh{\"{o}}ft and
Kalman Graffi},
title = {Convex Hull Watchdog: Mitigation of Malicious Nodes in Tree-Based
{P2P} Monitoring Systems},
booktitle = {41st {IEEE} Conference on Local Computer Networks, {LCN} 2016, Dubai,
United Arab Emirates, November 7-10, 2016},
pages = {52--60},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/LCN.2016.16},
doi = {10.1109/LCN.2016.16},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lcn/DisterhoftG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/med/Materassi16,
author = {Donatello Materassi},
title = {Reconstructing tree structures of dynamic systems with hidden nodes
under nonlinear dynamics},
booktitle = {24th Mediterranean Conference on Control and Automation, {MED} 2016,
Athens, Greece, June 21-24, 2016},
pages = {1331--1336},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/MED.2016.7535992},
doi = {10.1109/MED.2016.7535992},
timestamp = {Wed, 16 Oct 2019 14:14:56 +0200},
biburl = {https://dblp.org/rec/conf/med/Materassi16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ByrkaLM16,
author = {Jaroslaw Byrka and
Mateusz Lewandowski and
Carsten Moldenhauer},
editor = {Rasmus Pagh},
title = {Approximation Algorithms for Node-Weighted Prize-Collecting Steiner
Tree Problems on Planar Graphs},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {2:1--2:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.2},
doi = {10.4230/LIPICS.SWAT.2016.2},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/ByrkaLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tag/Sloan16,
author = {Rose Sloan},
editor = {David Chiang and
Alexander Koller},
title = {Node-based Induction of Tree-Substitution Grammars},
booktitle = {Proceedings of the 12th International Workshop on Tree Adjoining Grammars
and Related Formalisms (TAG+12), June 29 - July 1, 2016, Heinrich
Heine University, D{\"{u}}sseldorf, Germany},
pages = {77--84},
publisher = {The Association for Computer Linguistics},
year = {2016},
url = {https://aclanthology.org/W16-3308/},
timestamp = {Fri, 06 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tag/Sloan16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlBdaiwiHCA16,
author = {Bader F. AlBdaiwi and
Zaid A. Hussain and
Anton Cern{\'{y}} and
Robert E. L. Aldred},
title = {Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks},
journal = {CoRR},
volume = {abs/1601.06915},
year = {2016},
url = {http://arxiv.org/abs/1601.06915},
eprinttype = {arXiv},
eprint = {1601.06915},
timestamp = {Mon, 20 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlBdaiwiHCA16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ByrkaLM16,
author = {Jaroslaw Byrka and
Mateusz Lewandowski and
Carsten Moldenhauer},
title = {Approximation algorithms for node-weighted prize-collecting Steiner
tree problems on planar graphs},
journal = {CoRR},
volume = {abs/1601.02481},
year = {2016},
url = {http://arxiv.org/abs/1601.02481},
eprinttype = {arXiv},
eprint = {1601.02481},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ByrkaLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LiuT16b,
author = {Yun{-}Ching Liu and
Yoshimasa Tsuruoka},
title = {Asymmetric Move Selection Strategies in Monte-Carlo Tree Search: Minimizing
the Simple Regret at Max Nodes},
journal = {CoRR},
volume = {abs/1605.02321},
year = {2016},
url = {http://arxiv.org/abs/1605.02321},
eprinttype = {arXiv},
eprint = {1605.02321},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LiuT16b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MozafariVJL16,
author = {Azadeh Sadat Mozafari and
David V{\'{a}}zquez and
Mansour Jamzad and
Antonio M. L{\'{o}}pez},
title = {Node-Adapt, Path-Adapt and Tree-Adapt: Model-Transfer Domain Adaptation
for Random Forest},
journal = {CoRR},
volume = {abs/1611.02886},
year = {2016},
url = {http://arxiv.org/abs/1611.02886},
eprinttype = {arXiv},
eprint = {1611.02886},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MozafariVJL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/NachmansonNBZH16,
author = {Lev Nachmanson and
Arlind Nocaj and
Sergey Bereg and
Leishi Zhang and
Alexander E. Holroyd},
title = {Node Overlap Removal by Growing a Tree},
journal = {CoRR},
volume = {abs/1608.02653},
year = {2016},
url = {http://arxiv.org/abs/1608.02653},
eprinttype = {arXiv},
eprint = {1608.02653},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/NachmansonNBZH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Tsur16,
author = {Dekel Tsur},
title = {Succinct data-structure for nearest colored node in a tree},
journal = {CoRR},
volume = {abs/1609.01400},
year = {2016},
url = {http://arxiv.org/abs/1609.01400},
eprinttype = {arXiv},
eprint = {1609.01400},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Tsur16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/automatica/ParilinaZ15,
author = {Elena M. Parilina and
Georges Zaccour},
title = {Node-consistent core for games played over event trees},
journal = {Autom.},
volume = {53},
pages = {304--311},
year = {2015},
url = {https://doi.org/10.1016/j.automatica.2015.01.007},
doi = {10.1016/J.AUTOMATICA.2015.01.007},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/automatica/ParilinaZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/PeresC15,
author = {Am{\'{e}}lie Peres and
Hugues Roest Crollius},
title = {Improving duplicated nodes position in vertebrate gene trees},
journal = {{BMC} Bioinform.},
volume = {16},
number = {{S-3}},
pages = {A9},
year = {2015},
url = {https://doi.org/10.1186/1471-2105-16-S3-A9},
doi = {10.1186/1471-2105-16-S3-A9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/PeresC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/DuL15,
author = {Rosena R. X. Du and
Fu Liu},
title = {Factorizations of Cycles and Multi-Noded Rooted Trees},
journal = {Graphs Comb.},
volume = {31},
number = {3},
pages = {551--575},
year = {2015},
url = {https://doi.org/10.1007/s00373-013-1404-y},
doi = {10.1007/S00373-013-1404-Y},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/DuL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/MiyaharaHS15,
author = {Kazuki Miyahara and
Kenji Hashimoto and
Hiroyuki Seki},
title = {Node Query Preservation for Deterministic Linear Top-Down Tree Transducers},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {98-D},
number = {3},
pages = {512--523},
year = {2015},
url = {https://doi.org/10.1587/transinf.2014FCP0014},
doi = {10.1587/TRANSINF.2014FCP0014},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/MiyaharaHS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijitn/Meghanathan15,
author = {Natarajan Meghanathan},
title = {A Benchmarking Algorithm for Maximum Bottleneck Node Trust Score-based
Data Gathering Trees in Wireless Sensor Networks},
journal = {Int. J. Interdiscip. Telecommun. Netw.},
volume = {7},
number = {3},
pages = {13--35},
year = {2015},
url = {https://doi.org/10.4018/IJITN.2015070102},
doi = {10.4018/IJITN.2015070102},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijitn/Meghanathan15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Misra15,
author = {Jayadev Misra},
title = {Mapping among the nodes of infinite trees: {A} variation of K{\H{o}}nig's
infinity lemma},
journal = {Inf. Process. Lett.},
volume = {115},
number = {5},
pages = {548--549},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.01.005},
doi = {10.1016/J.IPL.2015.01.005},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Misra15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WatelWBB15,
author = {Dimitri Watel and
Marc{-}Antoine Weisser and
C{\'{e}}dric Bentz and
Dominique Barth},
title = {An {FPT} algorithm in polynomial space for the Directed Steiner Tree
problem with Limited number of Diffusing nodes},
journal = {Inf. Process. Lett.},
volume = {115},
number = {2},
pages = {275--279},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.09.027},
doi = {10.1016/J.IPL.2014.09.027},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WatelWBB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jap/MahmoudW15,
author = {Hosam M. Mahmoud and
Mark Daniel Ward},
title = {Asymptotic Properties of Protected Nodes in Random Recursive Trees},
journal = {J. Appl. Probab.},
volume = {52},
number = {1},
pages = {290--297},
year = {2015},
url = {https://doi.org/10.1017/S0021900200012365},
doi = {10.1017/S0021900200012365},
timestamp = {Thu, 16 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jap/MahmoudW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AntonopoulosHMN15,
author = {Timos Antonopoulos and
Dag Hovland and
Wim Martens and
Frank Neven},
title = {Deciding Twig-definability of Node Selecting Tree Automata},
journal = {Theory Comput. Syst.},
volume = {57},
number = {4},
pages = {967--1007},
year = {2015},
url = {https://doi.org/10.1007/s00224-015-9623-7},
doi = {10.1007/S00224-015-9623-7},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AntonopoulosHMN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nca/ZhangY15,
author = {Hao Zhang and
Dongyi Ye},
title = {Key-node-based local search discrete artificial bee colony algorithm
for obstacle-avoiding rectilinear Steiner tree construction},
journal = {Neural Comput. Appl.},
volume = {26},
number = {4},
pages = {875--898},
year = {2015},
url = {https://doi.org/10.1007/s00521-014-1760-4},
doi = {10.1007/S00521-014-1760-4},
timestamp = {Mon, 08 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/nca/ZhangY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/npa/Meghanathan15a,
author = {Natarajan Meghanathan},
title = {A Generic Algorithm to Determine Maximum Bottleneck Node Weight-based
Data Gathering Trees for Wireless Sensor Networks},
journal = {Netw. Protoc. Algorithms},
volume = {7},
number = {3},
pages = {18--51},
year = {2015},
url = {https://doi.org/10.5296/npa.v7i3.7961},
doi = {10.5296/NPA.V7I3.7961},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/npa/Meghanathan15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ploscb/HallWR15,
author = {Matthew Hall and
Mark E. J. Woolhouse and
Andrew Rambaut},
title = {Epidemic Reconstruction in a Phylogenetics Framework: Transmission
Trees as Partitions of the Node Set},
journal = {PLoS Comput. Biol.},
volume = {11},
number = {12},
year = {2015},
url = {https://doi.org/10.1371/journal.pcbi.1004613},
doi = {10.1371/JOURNAL.PCBI.1004613},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ploscb/HallWR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scn/RenugadeviM15,
author = {N. Renugadevi and
C. Mala},
title = {Pruned nodes in ternary key tree during batch rekeying in group key
agreement for cognitive radio ad hoc networks},
journal = {Secur. Commun. Networks},
volume = {8},
number = {18},
pages = {4289--4307},
year = {2015},
url = {https://doi.org/10.1002/sec.1342},
doi = {10.1002/SEC.1342},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scn/RenugadeviM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sensors/JiangWJ15,
author = {Peng Jiang and
Xingmin Wang and
Lurong Jiang},
title = {Node Deployment Algorithm Based on Connected Tree for Underwater Sensor
Networks},
journal = {Sensors},
volume = {15},
number = {7},
pages = {16763--16785},
year = {2015},
url = {https://doi.org/10.3390/s150716763},
doi = {10.3390/S150716763},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sensors/JiangWJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compsac/MiyoshiJM15,
author = {Kazunori Miyoshi and
Masahiro Jibiki and
Tutomu Murase},
editor = {Sheikh Iqbal Ahamed and
Carl K. Chang and
William C. Chu and
Ivica Crnkovic and
Pao{-}Ann Hsiung and
Gang Huang and
Jingwei Yang},
title = {Self-Organization of Shortest Spanning Tree and Optimal Sink Node
Position for Various Shapes of Large-Scale Wireless Sensor Networks},
booktitle = {39th {IEEE} Annual Computer Software and Applications Conference,
{COMPSAC} 2015, Taichung, Taiwan, July 1-5, 2015. Volume 2},
pages = {647--652},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/COMPSAC.2015.36},
doi = {10.1109/COMPSAC.2015.36},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compsac/MiyoshiJM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dsdis/AlajeelyAD15,
author = {Majeed Alajeely and
Asma'a Ahmad and
Robin Doss},
title = {Malicious Node Traceback in Opportunistic Networks Using Merkle Trees},
booktitle = {{IEEE} International Conference on Data Science and Data Intensive
Systems, {DSDIS} 2015, Sydney, Australia, December 11-13, 2015},
pages = {147--152},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/DSDIS.2015.86},
doi = {10.1109/DSDIS.2015.86},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dsdis/AlajeelyAD15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ficta/YadavT15,
author = {Ajay Kumar Yadav and
Sachin Tripathi},
editor = {Swagatam Das and
Tandra Pal and
Samarjit Kar and
Suresh Chandra Satapathy and
Jyotsna Kumar Mandal},
title = {A Tree Based Multicast Routing Protocol Using Reliable Neighbor Node
for Wireless Mobile Ad-Hoc Networks},
booktitle = {Proceedings of the 4th International Conference on Frontiers in Intelligent
Computing: Theory and Applications, {FICTA} 2015, Durgapur, India,
16-18 November 2015},
series = {Advances in Intelligent Systems and Computing},
volume = {404},
pages = {455--465},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-81-322-2695-6\_38},
doi = {10.1007/978-81-322-2695-6\_38},
timestamp = {Thu, 24 Oct 2019 09:15:54 +0200},
biburl = {https://dblp.org/rec/conf/ficta/YadavT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fskd/SiaGLG15,
author = {Yeong Kang Sia and
Hock Guan Goh and
Soung{-}Yue Liew and
Ming{-}Lee Gan},
title = {Spanning Multi-Tree Algorithm for node and traffic Balancing in multi-sink
wireless sensor networks},
booktitle = {12th International Conference on Fuzzy Systems and Knowledge Discovery,
{FSKD} 2015, Zhangjiajie, China, August 15-17, 2015},
pages = {2190--2195},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/FSKD.2015.7382292},
doi = {10.1109/FSKD.2015.7382292},
timestamp = {Wed, 16 Oct 2019 14:14:57 +0200},
biburl = {https://dblp.org/rec/conf/fskd/SiaGLG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iciip/Meghanathan15,
author = {Natarajan Meghanathan},
title = {Node Lifetime - Network Lifetime Tradeoff for Data Gathering Trees
in Wireless Sensor Networks},
booktitle = {{IPAC} '15: International Conference on Intelligent Information Processing,
Security and Advanced Communication, Batna, Algeria, November, 2015},
pages = {18:1--18:5},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2816839.2816905},
doi = {10.1145/2816839.2816905},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iciip/Meghanathan15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icip/SouzaRLM15,
author = {Roberto Souza and
Let{\'{\i}}cia Rittner and
Roberto de Alencar Lotufo and
Rubens Campos Machado},
title = {An array-based node-oriented max-tree representation},
booktitle = {2015 {IEEE} International Conference on Image Processing, {ICIP} 2015,
Quebec City, QC, Canada, September 27-30, 2015},
pages = {3620--3624},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/ICIP.2015.7351479},
doi = {10.1109/ICIP.2015.7351479},
timestamp = {Thu, 08 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icip/SouzaRLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lion/NikolaevBS15,
author = {Alexey Nikolaev and
Mikhail Batsyn and
Pablo San Segundo},
editor = {Clarisse Dhaenens and
Laetitia Jourdan and
Marie{-}El{\'{e}}onore Marmion},
title = {Reusing the Same Coloring in the Child Nodes of the Search Tree for
the Maximum Clique Problem},
booktitle = {Learning and Intelligent Optimization - 9th International Conference,
{LION} 9, Lille, France, January 12-15, 2015. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8994},
pages = {275--280},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-19084-6\_27},
doi = {10.1007/978-3-319-19084-6\_27},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lion/NikolaevBS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stast/BulleeMPJH15,
author = {Jan{-}Willem Bullee and
Lorena Montoya and
Wolter Pieters and
Marianne Junger and
Pieter H. Hartel},
editor = {Giampaolo Bella and
Gabriele Lenzini},
title = {Regression Nodes: Extending Attack Trees with Data from Social Sciences},
booktitle = {2015 Workshop on Socio-Technical Aspects in Security and Trust, {STAST}
2015, Verona, Italy, July 13, 2015},
pages = {17--23},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/STAST.2015.11},
doi = {10.1109/STAST.2015.11},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stast/BulleeMPJH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CalvaneseGLV15,
author = {Diego Calvanese and
Giuseppe De Giacomo and
Maurizio Lenzerini and
Moshe Y. Vardi},
title = {Node Selection Query Languages for Trees},
journal = {CoRR},
volume = {abs/1509.08979},
year = {2015},
url = {http://arxiv.org/abs/1509.08979},
eprinttype = {arXiv},
eprint = {1509.08979},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CalvaneseGLV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/hal/Merabet14,
author = {Massinissa Merabet},
title = {Solutions optimales des probl{\`{e}}mes de recouvrement sous contraintes
sur le degr{\'{e}} des n{\oe}uds. (Optimal solutions of problems
of finding spanning tree with constraints on the degree of the nodes)},
school = {Montpellier 2 University, France},
year = {2014},
url = {https://tel.archives-ouvertes.fr/tel-01684758},
timestamp = {Tue, 21 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/hal/Merabet14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dke/PolaTT14,
author = {Ives Rene Venturini Pola and
Caetano Traina Jr. and
Agma Juci Machado Traina},
title = {The NOBH-tree: Improving in-memory metric access methods by using
metric hyperplanes with non-overlapping nodes},
journal = {Data Knowl. Eng.},
volume = {94},
pages = {65--88},
year = {2014},
url = {https://doi.org/10.1016/j.datak.2014.09.001},
doi = {10.1016/J.DATAK.2014.09.001},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dke/PolaTT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/GouveiaLL14,
author = {Luis Eduardo Neves Gouveia and
Markus Leitner and
Ivana Ljubic},
title = {Hop constrained Steiner trees with multiple root nodes},
journal = {Eur. J. Oper. Res.},
volume = {236},
number = {1},
pages = {100--112},
year = {2014},
url = {https://doi.org/10.1016/j.ejor.2013.11.029},
doi = {10.1016/J.EJOR.2013.11.029},
timestamp = {Mon, 21 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/GouveiaLL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/WasaKUA14,
author = {Kunihiro Wasa and
Yusaku Kaneta and
Takeaki Uno and
Hiroki Arimura},
title = {Constant Time Enumeration of Subtrees with Exactly \emph{k} Nodes
in a Tree},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {97-D},
number = {3},
pages = {421--430},
year = {2014},
url = {https://doi.org/10.1587/transinf.E97.D.421},
doi = {10.1587/TRANSINF.E97.D.421},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/WasaKUA14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijdsn/YuanXZS14,
author = {Liyong Yuan and
Lin Xu and
Yi{-}hua Zhu and
Cong Sun},
title = {A Novel Mesh Routing Using the Nodes with Identical Tree Level},
journal = {Int. J. Distributed Sens. Networks},
volume = {10},
year = {2014},
url = {https://doi.org/10.1155/2014/647421},
doi = {10.1155/2014/647421},
timestamp = {Tue, 01 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijdsn/YuanXZS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijnm/JabbarifarD14,
author = {Masoume Jabbarifar and
Michel R. Dagenais},
title = {Reference node selection in dynamic tree},
journal = {Int. J. Netw. Manag.},
volume = {24},
number = {6},
pages = {450--468},
year = {2014},
url = {https://doi.org/10.1002/nem.1874},
doi = {10.1002/NEM.1874},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijnm/JabbarifarD14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HolenderskiBL14,
author = {Mike Holenderski and
Reinder J. Bril and
Johan J. Lukkien},
title = {Red-black trees with relative node keys},
journal = {Inf. Process. Lett.},
volume = {114},
number = {11},
pages = {591--596},
year = {2014},
url = {https://doi.org/10.1016/j.ipl.2014.06.004},
doi = {10.1016/J.IPL.2014.06.004},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HolenderskiBL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jidm/SperandioPPG14,
author = {Ricardo C. Sperandio and
Zenilton K. G. Patroc{\'{\i}}nio Jr. and
Hugo Bastos de Paula and
Silvio Jamil Ferzoli Guimar{\~{a}}es},
title = {Exploring Strategies for Minimizing Overlap Between Nodes in a Multimodal
Metric Tree},
journal = {J. Inf. Data Manag.},
volume = {5},
number = {2},
pages = {181--193},
year = {2014},
url = {https://sol.sbc.org.br/journals/index.php/jidm/article/view/1533},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jidm/SperandioPPG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jis/SleitA14,
author = {Azzam Sleit and
Esam Al{-}Nsour},
title = {Corner-based splitting: An improved node splitting algorithm for R-tree},
journal = {J. Inf. Sci.},
volume = {40},
number = {2},
pages = {222--236},
year = {2014},
url = {https://doi.org/10.1177/0165551513516709},
doi = {10.1177/0165551513516709},
timestamp = {Thu, 06 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jis/SleitA14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jolpe/PatraCC14,
author = {Biswajit Patra and
Amlan Chakrabarti and
Sanatan Chattopadhyay},
title = {Post Optimization of a Clock Tree for Dynamic Clock Tree Power Reduction
in 45 nm and Below Technology Nodes},
journal = {J. Low Power Electron.},
volume = {10},
number = {1},
pages = {32--37},
year = {2014},
url = {https://doi.org/10.1166/jolpe.2014.1309},
doi = {10.1166/JOLPE.2014.1309},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jolpe/PatraCC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DemaineHK14,
author = {Erik D. Demaine and
Mohammad Taghi Hajiaghayi and
Philip N. Klein},
title = {Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs},
journal = {{ACM} Trans. Algorithms},
volume = {10},
number = {3},
pages = {13:1--13:20},
year = {2014},
url = {https://doi.org/10.1145/2601070},
doi = {10.1145/2601070},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/DemaineHK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangCT14,
author = {Yong Zhang and
Francis Y. L. Chin and
Hing{-}Fung Ting},
title = {Constant-competitive tree node assignment},
journal = {Theor. Comput. Sci.},
volume = {518},
pages = {10--21},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.05.014},
doi = {10.1016/J.TCS.2013.05.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZhangCT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tpds/LinY14,
author = {Hwa{-}Chun Lin and
Hsiu{-}Ming Yang},
title = {An Approximation Algorithm for Constructing Degree-Dependent Node-Weighted
Multicast Trees},
journal = {{IEEE} Trans. Parallel Distributed Syst.},
volume = {25},
number = {8},
pages = {1976--1985},
year = {2014},
url = {https://doi.org/10.1109/TPDS.2013.108},
doi = {10.1109/TPDS.2013.108},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tpds/LinY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/HoshikaM14,
author = {Daiki Hoshika and
Eiji Miyano},
editor = {Qianping Gu and
Pavol Hell and
Boting Yang},
title = {Approximation Algorithms for Packing Element-Disjoint Steiner Trees
on Bounded Terminal Nodes},
booktitle = {Algorithmic Aspects in Information and Management - 10th International
Conference, {AAIM} 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8546},
pages = {100--111},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07956-1\_10},
doi = {10.1007/978-3-319-07956-1\_10},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/HoshikaM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/adhoc-now/ZorbasR14,
author = {Dimitrios Zorbas and
Tahiry Razafindralambo},
editor = {Song Guo and
Jaime Lloret and
Pietro Manzoni and
Stefan Ruehrup},
title = {Extending Network Tree Lifetime with Mobile and Rechargeable Nodes},
booktitle = {Ad-hoc, Mobile, and Wireless Networks - 13th International Conference,
{ADHOC-NOW} 2014, Benidorm, Spain, June 22-27, 2014 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8487},
pages = {223--236},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07425-2\_17},
doi = {10.1007/978-3-319-07425-2\_17},
timestamp = {Tue, 25 Aug 2020 09:34:49 +0200},
biburl = {https://dblp.org/rec/conf/adhoc-now/ZorbasR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cwsn/DaiMLMC14,
author = {Guoyong Dai and
Chunyu Miao and
Yidong Li and
Keji Mao and
Qingzhang Chen},
editor = {Limin Sun and
Huadong Ma and
Dingyi Fang and
Jinping Niu and
Wei Wang},
title = {Study on Tree-Based Clustering {MDS} Algorithm for Nodes Localization
in WSNs},
booktitle = {Advances in Wireless Sensor Networks - The 8th China Conference, {CWSN}
2014, Xi'an, China, October 31-November 2, 2014. Revised Selected
Papers},
series = {Communications in Computer and Information Science},
volume = {501},
pages = {176--186},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-46981-1\_17},
doi = {10.1007/978-3-662-46981-1\_17},
timestamp = {Fri, 02 Nov 2018 09:39:31 +0100},
biburl = {https://dblp.org/rec/conf/cwsn/DaiMLMC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cyberc/JeonL14,
author = {Hae Sook Jeon and
Won Don Lee},
title = {Performance Measurement of Decision Tree Excluding Insignificant Leaf
Nodes},
booktitle = {2014 International Conference on Cyber-Enabled Distributed Computing
and Knowledge Discovery, CyberC 2014, Shanghai, China, October 13-15,
2014},
pages = {122--127},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CyberC.2014.29},
doi = {10.1109/CYBERC.2014.29},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cyberc/JeonL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/elinfocom/KimYL14,
author = {Bo{-}Kyeong Kim and
Chang{-}Jun Yeo and
Dong{-}Ho Lee},
title = {A B-tree employing a cascade memory node on {NAND} flash SSDs},
booktitle = {International Conference on Electronics, Information and Communications,
{ICEIC} 2014, Kota Kinabalu, Sabah, Malaysia, January 15-18, 2014},
pages = {1--2},
publisher = {{IEEE}},
year = {2014},
url = {https://doi.org/10.1109/ELINFOCOM.2014.6914424},
doi = {10.1109/ELINFOCOM.2014.6914424},
timestamp = {Mon, 09 Aug 2021 14:54:02 +0200},
biburl = {https://dblp.org/rec/conf/elinfocom/KimYL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/grc/Hussain14,
author = {Shahid Hussain},
title = {Greedy heuristics for minimization of number of terminal nodes in
decision trees},
booktitle = {2014 {IEEE} International Conference on Granular Computing, GrC 2014,
Noboribetsu, Japan, October 22-24, 2014},
pages = {112--115},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/GRC.2014.6982817},
doi = {10.1109/GRC.2014.6982817},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/grc/Hussain14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itsc/GuanF14,
author = {Tianyi Guan and
Christian W. Frey},
title = {Using ensemble of decision trees with {SVM} nodes to learn the behaviour
of a transmission control software},
booktitle = {17th International {IEEE} Conference on Intelligent Transportation
Systems, {ITSC} 2014, Qingdao, China, October 8-11, 2014},
pages = {1323--1328},
publisher = {{IEEE}},
year = {2014},
url = {https://doi.org/10.1109/ITSC.2014.6957870},
doi = {10.1109/ITSC.2014.6957870},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/itsc/GuanF14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kes/Hussain14,
author = {Shahid Hussain},
editor = {Piotr Jedrzejowicz and
Lakhmi C. Jain and
Robert J. Howlett and
Ireneusz Czarnowski},
title = {Total Path Length and Number of Terminal Nodes for Decision Trees},
booktitle = {18th International Conference in Knowledge Based and Intelligent Information
and Engineering Systems, {KES} 2014, Gdynia, Poland, 15-17 September
2014},
series = {Procedia Computer Science},
volume = {35},
pages = {514--521},
publisher = {Elsevier},
year = {2014},
url = {https://doi.org/10.1016/j.procs.2014.08.132},
doi = {10.1016/J.PROCS.2014.08.132},
timestamp = {Thu, 08 Jul 2021 16:04:01 +0200},
biburl = {https://dblp.org/rec/conf/kes/Hussain14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/AlqahtaniE14,
author = {Hasna Mohsen Alqahtani and
Thomas Erlebach},
editor = {Viliam Geffert and
Bart Preneel and
Branislav Rovan and
Julius Stuller and
A Min Tjoa},
title = {Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded
Treewidth},
booktitle = {{SOFSEM} 2014: Theory and Practice of Computer Science - 40th International
Conference on Current Trends in Theory and Practice of Computer Science,
Nov{\'{y}} Smokovec, Slovakia, January 26-29, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8327},
pages = {65--76},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-04298-5\_7},
doi = {10.1007/978-3-319-04298-5\_7},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/AlqahtaniE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Meghanathan14a,
author = {Natarajan Meghanathan},
title = {An Algorithm to Determine Energy-aware Maximal Leaf Nodes Data Gathering
Tree for Wireless Sensor Networks},
journal = {CoRR},
volume = {abs/1412.2338},
year = {2014},
url = {http://arxiv.org/abs/1412.2338},
eprinttype = {arXiv},
eprint = {1412.2338},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Meghanathan14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MeghanathanM14,
author = {Natarajan Meghanathan and
Philip Mumford},
title = {Node Failure Time and Coverage Loss Time Analysis for Maximum Stability
Vs Minimum Distance Spanning Tree based Data Gathering in Mobile Sensor
Networks},
journal = {CoRR},
volume = {abs/1412.0366},
year = {2014},
url = {http://arxiv.org/abs/1412.0366},
eprinttype = {arXiv},
eprint = {1412.0366},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MeghanathanM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/WuZWW14,
author = {Yingjie Wu and
Daxin Zhu and
Lei Wang and
Xiaodong Wang},
title = {A note on the largest number of red nodes in red-black trees},
journal = {CoRR},
volume = {abs/1406.3092},
year = {2014},
url = {http://arxiv.org/abs/1406.3092},
eprinttype = {arXiv},
eprint = {1406.3092},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/WuZWW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/ZhangM0Q14,
author = {Jinsheng Zhang and
Qiumao Ma and
Wensheng Zhang and
Daji Qiao},
title = {{KT-ORAM:} {A} Bandwidth-efficient {ORAM} Built on K-ary Tree of {PIR}
Nodes},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {624},
year = {2014},
url = {http://eprint.iacr.org/2014/624},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/ZhangM0Q14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/adhoc/ChakrabortyCNK13,
author = {Suchetana Chakraborty and
Sandip Chakraborty and
Sukumar Nandi and
Sushanta Karmakar},
title = {Convergecast tree management from arbitrary node failure in sensor
network},
journal = {Ad Hoc Networks},
volume = {11},
number = {6},
pages = {1796--1819},
year = {2013},
url = {https://doi.org/10.1016/j.adhoc.2013.04.004},
doi = {10.1016/J.ADHOC.2013.04.004},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/adhoc/ChakrabortyCNK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AddisSG13,
author = {Bernardetta Addis and
Marco Di Summa and
Andrea Grosso},
title = {Identifying critical nodes in undirected graphs: Complexity results
and polynomial algorithms for the case of bounded treewidth},
journal = {Discret. Appl. Math.},
volume = {161},
number = {16-17},
pages = {2349--2360},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.03.021},
doi = {10.1016/J.DAM.2013.03.021},
timestamp = {Sat, 02 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AddisSG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/LuoCQLQ13,
author = {Guangchun Luo and
Hao Chen and
Caihui Qu and
Yuhai Liu and
Ke Qin},
title = {An Efficient Algorithm for Node-Weighted Tree Partitioning with Subtrees'
Weights in a Given Range},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {96-D},
number = {2},
pages = {270--277},
year = {2013},
url = {https://doi.org/10.1587/transinf.E96.D.270},
doi = {10.1587/TRANSINF.E96.D.270},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/LuoCQLQ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcomsys/TangZSNLHW13,
author = {Jine Tang and
ZhangBing Zhou and
Lei Shu and
Jianwei Niu and
Jin Liu and
Qiping Hu and
Qun Wang},
title = {Skewness-aware clustering tree for unevenly distributed spatial sensor
nodes in smart city},
journal = {Int. J. Commun. Syst.},
volume = {26},
number = {9},
pages = {1143--1162},
year = {2013},
url = {https://doi.org/10.1002/dac.2477},
doi = {10.1002/DAC.2477},
timestamp = {Thu, 30 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcomsys/TangZSNLHW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BazganTV13a,
author = {Cristina Bazgan and
Sonia Toubaline and
Daniel Vanderpooten},
title = {Critical edges/nodes for the minimum spanning tree problem: complexity
and approximation},
journal = {J. Comb. Optim.},
volume = {26},
number = {1},
pages = {178--189},
year = {2013},
url = {https://doi.org/10.1007/s10878-011-9449-4},
doi = {10.1007/S10878-011-9449-4},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BazganTV13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Hirai13,
author = {Hiroshi Hirai},
title = {Half-integrality of node-capacitated multiflows and tree-shaped facility
locations on trees},
journal = {Math. Program.},
volume = {137},
number = {1-2},
pages = {503--530},
year = {2013},
url = {https://doi.org/10.1007/s10107-011-0506-7},
doi = {10.1007/S10107-011-0506-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Hirai13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nca/LuoZPLZ13,
author = {Linkai Luo and
Xiao{-}Dong Zhang and
Hong Peng and
Weihang Lv and
Yan Zhang},
title = {A new pruning method for decision tree based on structural risk of
leaf node},
journal = {Neural Comput. Appl.},
volume = {22},
number = {Supplement-1},
pages = {17--26},
year = {2013},
url = {https://doi.org/10.1007/s00521-012-1055-6},
doi = {10.1007/S00521-012-1055-6},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nca/LuoZPLZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tods/Cheney13,
author = {James Cheney},
title = {Revisiting "forward node-selecting queries over trees"},
journal = {{ACM} Trans. Database Syst.},
volume = {38},
number = {2},
pages = {13},
year = {2013},
url = {https://doi.org/10.1145/2487259.2487265},
doi = {10.1145/2487259.2487265},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tods/Cheney13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tsp/ZhangCPMH13,
author = {Zhenliang Zhang and
Edwin K. P. Chong and
Ali Pezeshki and
William Moran and
Stephen D. Howard},
title = {Detection Performance in Balanced Binary Relay Trees With Node and
Link Failures},
journal = {{IEEE} Trans. Signal Process.},
volume = {61},
number = {9},
pages = {2165--2177},
year = {2013},
url = {https://doi.org/10.1109/TSP.2013.2246156},
doi = {10.1109/TSP.2013.2246156},
timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tsp/ZhangCPMH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tvt/ShihCHP13,
author = {Yuan{-}Yao Shih and
Wei{-}Ho Chung and
Pi{-}Cheng Hsiu and
Ai{-}Chun Pang},
title = {A Mobility-Aware Node Deployment and Tree Construction Framework for
ZigBee Wireless Networks},
journal = {{IEEE} Trans. Veh. Technol.},
volume = {62},
number = {6},
pages = {2763--2779},
year = {2013},
url = {https://doi.org/10.1109/TVT.2013.2245693},
doi = {10.1109/TVT.2013.2245693},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tvt/ShihCHP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cdc/WangT13,
author = {Wei Wang and
Choon Yik Tang},
title = {Distributed computation of node and edge betweenness on tree graphs},
booktitle = {Proceedings of the 52nd {IEEE} Conference on Decision and Control,
{CDC} 2013, Florence, Italy, December 10-13, 2013},
pages = {43--48},
publisher = {{IEEE}},
year = {2013},
url = {https://doi.org/10.1109/CDC.2013.6759856},
doi = {10.1109/CDC.2013.6759856},
timestamp = {Fri, 04 Mar 2022 13:29:02 +0100},
biburl = {https://dblp.org/rec/conf/cdc/WangT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KonemannSS13,
author = {Jochen K{\"{o}}nemann and
Sina Sadeghian Sadeghabad and
Laura Sanit{\`{a}}},
title = {An {LMP} O(log n)-Approximation Algorithm for Node Weighted Prize
Collecting Steiner Tree},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {568--577},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.67},
doi = {10.1109/FOCS.2013.67},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KonemannSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iciap/PhamBDR13,
author = {The Anh Pham and
Sabine Barrat and
Mathieu Delalandre and
Jean{-}Yves Ramel},
editor = {Alfredo Petrosino},
title = {An Efficient Indexing Scheme Based on Linked-Node m-Ary Tree Structure},
booktitle = {Image Analysis and Processing - {ICIAP} 2013 - 17th International
Conference, Naples, Italy, September 9-13, 2013. Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8156},
pages = {752--762},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-41181-6\_76},
doi = {10.1007/978-3-642-41181-6\_76},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iciap/PhamBDR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iciar/SkouraNBM13,
author = {Angeliki Skoura and
Tatyana Nuzhnaya and
Predrag R. Bakic and
Vasilis Megalooikonomou},
editor = {Mohamed Kamel and
Aur{\'{e}}lio J. C. Campilho},
title = {Detecting and Localizing Tree Nodes in Anatomic Structures of Branching
Topology},
booktitle = {Image Analysis and Recognition - 10th International Conference, {ICIAR}
2013, P{\'{o}}voa do Varzim, Portugal, June 26-28, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7950},
pages = {485--493},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39094-4\_55},
doi = {10.1007/978-3-642-39094-4\_55},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iciar/SkouraNBM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icoin/LeeL13,
author = {Sookyoung Lee and
Meejeong Lee},
title = {{QRMSC:} Efficient QoS-aware relay node placement in wireless sensor
networks using Minimum Steiner tree on the Convex hull},
booktitle = {The International Conference on Information Networking 2013, {ICOIN}
2013, Bangkok, Thailand, January 28-30, 2013},
pages = {36--41},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/ICOIN.2013.6496348},
doi = {10.1109/ICOIN.2013.6496348},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icoin/LeeL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sc/WeltonSM13,
author = {Benjamin Welton and
Evan Samanas and
Barton P. Miller},
editor = {William Gropp and
Satoshi Matsuoka},
title = {Mr. Scan: extreme scale density-based clustering using a tree-based
network of {GPGPU} nodes},
booktitle = {International Conference for High Performance Computing, Networking,
Storage and Analysis, SC'13, Denver, CO, {USA} - November 17 - 21,
2013},
pages = {84:1--84:11},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2503210.2503262},
doi = {10.1145/2503210.2503262},
timestamp = {Wed, 16 Oct 2019 14:14:57 +0200},
biburl = {https://dblp.org/rec/conf/sc/WeltonSM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/ManethS13,
author = {Sebastian Maneth and
Tom Sebastian},
editor = {Sebastian Maneth},
title = {XPath Node Selection over Grammar-Compressed Trees},
booktitle = {Proceedings Second International Workshop on Trends in Tree Automata
and Tree Transducers, {TTATT} 2013, Hanoi, Vietnam, 19/10/2013},
series = {{EPTCS}},
volume = {134},
pages = {38--48},
year = {2013},
url = {https://doi.org/10.4204/EPTCS.134.5},
doi = {10.4204/EPTCS.134.5},
timestamp = {Wed, 12 Sep 2018 01:05:14 +0200},
biburl = {https://dblp.org/rec/journals/corr/ManethS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/MiyaharaHS13,
author = {Kazuki Miyahara and
Kenji Hashimoto and
Hiroyuki Seki},
editor = {Sebastian Maneth},
title = {Node Query Preservation for Deterministic Linear Top-Down Tree Transducers},
booktitle = {Proceedings Second International Workshop on Trends in Tree Automata
and Tree Transducers, {TTATT} 2013, Hanoi, Vietnam, 19/10/2013},
series = {{EPTCS}},
volume = {134},
pages = {27--37},
year = {2013},
url = {https://doi.org/10.4204/EPTCS.134.4},
doi = {10.4204/EPTCS.134.4},
timestamp = {Wed, 12 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MiyaharaHS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-2127,
author = {Jochen K{\"{o}}nemann and
Sina Sadeghian Sadeghabad and
Laura Sanit{\`{a}}},
title = {An {LMP} O(log n)-Approximation Algorithm for Node Weighted Prize
Collecting Steiner Tree},
journal = {CoRR},
volume = {abs/1302.2127},
year = {2013},
url = {http://arxiv.org/abs/1302.2127},
eprinttype = {arXiv},
eprint = {1302.2127},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-2127.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CoudertHM12,
author = {David Coudert and
Florian Huc and
Dorian Mazauric},
title = {A Distributed Algorithm for Computing the Node Search Number in Trees},
journal = {Algorithmica},
volume = {63},
number = {1-2},
pages = {158--190},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9524-3},
doi = {10.1007/S00453-011-9524-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CoudertHM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/DuP12,
author = {Rosena R. X. Du and
Helmut Prodinger},
title = {Notes on protected nodes in digital search trees},
journal = {Appl. Math. Lett.},
volume = {25},
number = {6},
pages = {1025--1028},
year = {2012},
url = {https://doi.org/10.1016/j.aml.2011.11.017},
doi = {10.1016/J.AML.2011.11.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/appml/DuP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/MahmoudW12,
author = {Hosam M. Mahmoud and
Mark Daniel Ward},
title = {Asymptotic distribution of two-protected nodes in random binary search
trees},
journal = {Appl. Math. Lett.},
volume = {25},
number = {12},
pages = {2218--2222},
year = {2012},
url = {https://doi.org/10.1016/j.aml.2012.06.005},
doi = {10.1016/J.AML.2012.06.005},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/appml/MahmoudW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/TanakaISY12,
author = {Yuma Tanaka and
Shinji Imahori and
Mihiro Sasaki and
Mutsunori Yagiura},
title = {An LP-based heuristic algorithm for the node capacitated in-tree packing
problem},
journal = {Comput. Oper. Res.},
volume = {39},
number = {3},
pages = {637--646},
year = {2012},
url = {https://doi.org/10.1016/j.cor.2011.05.019},
doi = {10.1016/J.COR.2011.05.019},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/TanakaISY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/MiyoshiJM12,
author = {Kazunori Miyoshi and
Masahiro Jibiki and
Tutomu Murase},
title = {Fully Distributed Self-Organization of Shortest Spanning Tree and
Optimal Sink Node Position for Large-Scale Wireless Sensor Network},
journal = {{IEICE} Trans. Commun.},
volume = {95-B},
number = {2},
pages = {449--459},
year = {2012},
url = {https://doi.org/10.1587/transcom.E95.B.449},
doi = {10.1587/TRANSCOM.E95.B.449},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/MiyoshiJM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jip/TreeprapinKHN12,
author = {Kriengsak Treeprapin and
Akimitsu Kanzaki and
Takahiro Hara and
Shojiro Nishio},
title = {Effective Node Deployment in Sparse Mobile Sensor Networks},
journal = {J. Inf. Process.},
volume = {20},
number = {1},
pages = {104--113},
year = {2012},
url = {https://doi.org/10.2197/ipsjjip.20.104},
doi = {10.2197/IPSJJIP.20.104},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jip/TreeprapinKHN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jise/ChenC12,
author = {Yangjun Chen and
Yibin Chen},
title = {Subtree Reconstruction, Query Node Intervals and Tree Pattern Query
Evaluation},
journal = {J. Inf. Sci. Eng.},
volume = {28},
number = {2},
pages = {263--293},
year = {2012},
url = {http://www.iis.sinica.edu.tw/page/jise/2012/201203\_03},
timestamp = {Fri, 16 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jise/ChenC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/Zahavi12,
author = {Eitan Zahavi},
title = {Fat-tree routing and node ordering providing contention free traffic
for {MPI} global collectives},
journal = {J. Parallel Distributed Comput.},
volume = {72},
number = {11},
pages = {1423--1432},
year = {2012},
url = {https://doi.org/10.1016/j.jpdc.2012.01.018},
doi = {10.1016/J.JPDC.2012.01.018},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/Zahavi12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/midm/TakadaSNMHNKKSITT12,
author = {Masahiro Takada and
Masahiro Sugimoto and
Yasuhiro Naito and
Hyeong{-}Gon Moon and
Wonshik Han and
Dong{-}Young Noh and
Masahide Kondo and
Katsumasa Kuroi and
Hironobu Sasano and
Takashi Inamoto and
Masaru Tomita and
Masakazu Toi},
title = {Prediction of axillary lymph node metastasis in primary breast cancer
patients using a decision tree-based model},
journal = {{BMC} Medical Informatics Decis. Mak.},
volume = {12},
pages = {54},
year = {2012},
url = {https://doi.org/10.1186/1472-6947-12-54},
doi = {10.1186/1472-6947-12-54},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/midm/TakadaSNMHNKKSITT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DuhamelGMS12,
author = {Christophe Duhamel and
Luis Eduardo Neves Gouveia and
Pedro Moura and
Maur{\'{\i}}cio C. de Souza},
title = {Models and heuristics for the \emph{k} -degree constrained minimum
spanning tree problem with node-degree costs},
journal = {Networks},
volume = {60},
number = {1},
pages = {1--18},
year = {2012},
url = {https://doi.org/10.1002/net.20445},
doi = {10.1002/NET.20445},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DuhamelGMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FuscoP12,
author = {Emanuele G. Fusco and
Andrzej Pelc},
title = {Distributed tree comparison with nodes of limited memory},
journal = {Networks},
volume = {60},
number = {4},
pages = {235--244},
year = {2012},
url = {https://doi.org/10.1002/net.21463},
doi = {10.1002/NET.21463},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FuscoP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ImahoriMHKSY12,
author = {Shinji Imahori and
Yuichiro Miyamoto and
Hideki Hashimoto and
Yusuke Kobayashi and
Mihiro Sasaki and
Mutsunori Yagiura},
title = {The complexity of the node capacitated in-tree packing problem},
journal = {Networks},
volume = {59},
number = {1},
pages = {13--21},
year = {2012},
url = {https://doi.org/10.1002/net.20476},
doi = {10.1002/NET.20476},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ImahoriMHKSY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ShenS12,
author = {Siqian Shen and
J. Cole Smith},
title = {Polynomial-time algorithms for solving a class of critical node problems
on trees and series-parallel graphs},
journal = {Networks},
volume = {60},
number = {2},
pages = {103--119},
year = {2012},
url = {https://doi.org/10.1002/net.20464},
doi = {10.1002/NET.20464},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ShenS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pcs/Korotkov12,
author = {A. Korotkov},
title = {A new double sorting-based node splitting algorithm for R-tree},
journal = {Program. Comput. Softw.},
volume = {38},
number = {3},
pages = {109--118},
year = {2012},
url = {https://doi.org/10.1134/S0361768812030024},
doi = {10.1134/S0361768812030024},
timestamp = {Sun, 06 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pcs/Korotkov12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sensors/McGarryK12,
author = {Scott McGarry and
Chris Knight},
title = {Development and Successful Application of a Tree Movement Energy Harvesting
Device, to Power a Wireless Sensor Node},
journal = {Sensors},
volume = {12},
number = {9},
pages = {12110--12125},
year = {2012},
url = {https://doi.org/10.3390/s120912110},
doi = {10.3390/S120912110},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sensors/McGarryK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/FlocchiniEPPS12,
author = {Paola Flocchini and
Toni Mesa Enriquez and
Linda Pagli and
Giuseppe Prencipe and
Nicola Santoro},
title = {Distributed Minimum Spanning Tree Maintenance for Transient Node Failures},
journal = {{IEEE} Trans. Computers},
volume = {61},
number = {3},
pages = {408--414},
year = {2012},
url = {https://doi.org/10.1109/TC.2010.228},
doi = {10.1109/TC.2010.228},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/FlocchiniEPPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/twc/ChangC12,
author = {Ronald Y. Chang and
Wei{-}Ho Chung},
title = {Best-First Tree Search with Probabilistic Node Ordering for {MIMO}
Detection: Generalization and Performance-Complexity Tradeoff},
journal = {{IEEE} Trans. Wirel. Commun.},
volume = {11},
number = {2},
pages = {780--789},
year = {2012},
url = {https://doi.org/10.1109/TWC.2011.121911.110568},
doi = {10.1109/TWC.2011.121911.110568},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/twc/ChangC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/amt/TanLP12,
author = {Ying Tan and
Hong Luo and
Shou{-}Li Peng},
editor = {Runhe Huang and
Ali A. Ghorbani and
Gabriella Pasi and
Takahira Yamaguchi and
Neil Y. Yen and
Beijing Jin},
title = {Distribution of Node Characteristics in Complex Networks of Tree Class},
booktitle = {Active Media Technology - 8th International Conference, {AMT} 2012,
Macau, China, December 4-7, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7669},
pages = {451--462},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35236-2\_45},
doi = {10.1007/978-3-642-35236-2\_45},
timestamp = {Mon, 14 Dec 2020 08:24:12 +0100},
biburl = {https://dblp.org/rec/conf/amt/TanLP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cicsyn/TanSCLT12,
author = {Shee Eng Tan and
Zhan Wei Siew and
Yit Kwong Chin and
Scott Carr Ken Lye and
Kenneth Tze Kin Teo},
editor = {David Al{-}Dabass and
Pichaya Tandayya and
Jasmy Yunus and
Apichat Heednacram and
Zuwairie Ibrahim},
title = {Minimizing Network Coding Nodes in Multicast Tree Construction via
Genetic Algorithm},
booktitle = {Fourth International Conference on Computational Intelligence, Communication
Systems and Networks, CICSyN 2012, Phuket, Thailand, July 24-26, 2012},
pages = {399--404},
publisher = {{IEEE}},
year = {2012},
url = {https://doi.org/10.1109/CICSyN.2012.79},
doi = {10.1109/CICSYN.2012.79},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cicsyn/TanSCLT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cluster/LiLLLLW12,
author = {Liang Li and
Hong Liu and
Peiyu Liu and
Taoying Liu and
Wei Li and
Hao Wang},
title = {A Node-based Parallel Game Tree Algorithm Using GPUs},
booktitle = {2012 {IEEE} International Conference on Cluster Computing, {CLUSTER}
2012, Beijing, China, September 24-28, 2012},
pages = {18--26},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CLUSTER.2012.45},
doi = {10.1109/CLUSTER.2012.45},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cluster/LiLLLLW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dexa/QuL12,
author = {Jun{-}Feng Qu and
Mengchi Liu},
editor = {Stephen W. Liddle and
Klaus{-}Dieter Schewe and
A Min Tjoa and
Xiaofang Zhou},
title = {Mining Frequent Itemsets Using Node-Sets of a Prefix-Tree},
booktitle = {Database and Expert Systems Applications - 23rd International Conference,
{DEXA} 2012, Vienna, Austria, September 3-6, 2012. Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {7446},
pages = {453--467},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32600-4\_34},
doi = {10.1007/978-3-642-32600-4\_34},
timestamp = {Wed, 20 Nov 2019 16:52:45 +0100},
biburl = {https://dblp.org/rec/conf/dexa/QuL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/diagrams/BurchRGW12,
author = {Michael Burch and
Michael Raschke and
Miriam Greis and
Daniel Weiskopf},
editor = {Philip T. Cox and
Beryl Plimmer and
Peter J. Rodgers},
title = {Enriching Indented Pixel Tree Plots with Node-Oriented Quantitative,
Categorical, Relational, and Time-Series Data},
booktitle = {Diagrammatic Representation and Inference - 7th International Conference,
Diagrams 2012, Canterbury, UK, July 2-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7352},
pages = {102--116},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31223-6\_14},
doi = {10.1007/978-3-642-31223-6\_14},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/diagrams/BurchRGW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icccn/MotohashiFHTM12,
author = {Tomoki Motohashi and
Akihiro Fujimoto and
Yusuke Hirota and
Hideki Tode and
Koso Murakami},
title = {Construction Method of Overlapped Cluster-Trees Considering Inter-Node
Distance for Resilient Video Streaming},
booktitle = {21st International Conference on Computer Communications and Networks,
{ICCCN} 2012, Munich, Germany, July 30 - August 2, 2012},
pages = {1--8},
publisher = {{IEEE}},
year = {2012},
url = {https://doi.org/10.1109/ICCCN.2012.6289285},
doi = {10.1109/ICCCN.2012.6289285},
timestamp = {Wed, 16 Oct 2019 14:14:49 +0200},
biburl = {https://dblp.org/rec/conf/icccn/MotohashiFHTM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/AntonopoulosHMN12,
author = {Timos Antonopoulos and
Dag Hovland and
Wim Martens and
Frank Neven},
editor = {Alin Deutsch},
title = {Deciding twig-definability of node selecting tree automata},
booktitle = {15th International Conference on Database Theory, {ICDT} '12, Berlin,
Germany, March 26-29, 2012},
pages = {61--73},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2274576.2274584},
doi = {10.1145/2274576.2274584},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icdt/AntonopoulosHMN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iconip/SheenA12,
author = {Shina Sheen and
R. Anitha},
editor = {Tingwen Huang and
Zhigang Zeng and
Chuandong Li and
Chi{-}Sing Leung},
title = {A Novel Node Splitting Criteria for Decision Trees Based on Theil
Index},
booktitle = {Neural Information Processing - 19th International Conference, {ICONIP}
2012, Doha, Qatar, November 12-15, 2012, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {7664},
pages = {435--443},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34481-7\_53},
doi = {10.1007/978-3-642-34481-7\_53},
timestamp = {Tue, 30 Jun 2020 11:04:50 +0200},
biburl = {https://dblp.org/rec/conf/iconip/SheenA12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/GouveiaLL12,
author = {Luis Eduardo Neves Gouveia and
Markus Leitner and
Ivana Ljubic},
editor = {Ali Ridha Mahjoub and
Vangelis Markakis and
Ioannis Milis and
Vangelis Th. Paschos},
title = {On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes},
booktitle = {Combinatorial Optimization - Second International Symposium, {ISCO}
2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7422},
pages = {201--212},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32147-4\_19},
doi = {10.1007/978-3-642-32147-4\_19},
timestamp = {Mon, 21 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/GouveiaLL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rsctc/ChikalovHM12a,
author = {Igor Chikalov and
Shahid Hussain and
Mikhail Moshkov},
editor = {Jingtao Yao and
Yan Yang and
Roman Slowinski and
Salvatore Greco and
Huaxiong Li and
Sushmita Mitra and
Lech Polkowski},
title = {Relationships between Number of Nodes and Number of Misclassifications
for Decision Trees},
booktitle = {Rough Sets and Current Trends in Computing - 8th International Conference,
{RSCTC} 2012, Chengdu, China, August 17-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7413},
pages = {212--218},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32115-3\_25},
doi = {10.1007/978-3-642-32115-3\_25},
timestamp = {Fri, 26 Mar 2021 08:28:30 +0100},
biburl = {https://dblp.org/rec/conf/rsctc/ChikalovHM12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/smc/TamuraHN12,
author = {Shinji Tamura and
Teruhisa Hochin and
Hiroki Nomiya},
title = {Concurrency control program generation by decreasing nodes of program
trees in genetic programming},
booktitle = {Proceedings of the {IEEE} International Conference on Systems, Man,
and Cybernetics, {SMC} 2012, Seoul, Korea (South), October 14-17,
2012},
pages = {1023--1028},
publisher = {{IEEE}},
year = {2012},
url = {https://doi.org/10.1109/ICSMC.2012.6377863},
doi = {10.1109/ICSMC.2012.6377863},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/smc/TamuraHN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/vda/RosenbaumH12,
author = {Ren{\'{e}} Rosenbaum and
Bernd Hamann},
editor = {Pak Chung Wong and
David L. Kao and
Ming C. Hao and
Chaomei Chen and
Robert Kosara and
Mark A. Livingston and
Jinah Park and
Ian Roberts},
title = {Evaluation of progressive treemaps to convey tree and node properties},
booktitle = {Visualization and Data Analysis 2012, Burlingame, CA, USA, January
23-25, 2012},
series = {{SPIE} Proceedings},
volume = {8294},
pages = {82940F},
publisher = {{SPIE}},
year = {2012},
url = {https://doi.org/10.1117/12.907581},
doi = {10.1117/12.907581},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/vda/RosenbaumH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wowmom/ReinhardtMSZS12,
author = {Andreas Reinhardt and
Olivia Morar and
Silvia Santini and
Sebastian Z{\"{o}}ller and
Ralf Steinmetz},
title = {{CBFR:} Bloom filter routing with gradual forgetting for tree-structured
wireless sensor networks with mobile nodes},
booktitle = {2012 {IEEE} International Symposium on a World of Wireless, Mobile
and Multimedia Networks, WoWMoM 2012, San Francisco, CA, USA, June
25-28, 2012},
pages = {1--9},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/WoWMoM.2012.6263685},
doi = {10.1109/WOWMOM.2012.6263685},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wowmom/ReinhardtMSZS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-0244,
author = {Zhenliang Zhang and
Edwin K. P. Chong and
Ali Pezeshki and
William Moran and
Stephen D. Howard},
title = {Detection Performance in Balanced Binary Relay Trees with Node and
Link Failures},
journal = {CoRR},
volume = {abs/1206.0244},
year = {2012},
url = {http://arxiv.org/abs/1206.0244},
eprinttype = {arXiv},
eprint = {1206.0244},
timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-0244.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arobots/YamaneYN11,
author = {Katsu Yamane and
Yoshifumi Yamaguchi and
Yoshihiko Nakamura},
title = {Human motion database with a binary tree and node transition graphs},
journal = {Auton. Robots},
volume = {30},
number = {1},
pages = {87--98},
year = {2011},
url = {https://doi.org/10.1007/s10514-010-9206-z},
doi = {10.1007/S10514-010-9206-Z},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arobots/YamaneYN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comcom/SenelY11,
author = {Fatih Senel and
Mohamed F. Younis},
title = {Relay node placement in structurally damaged wireless sensor networks
via triangular steiner tree approximation},
journal = {Comput. Commun.},
volume = {34},
number = {16},
pages = {1932--1941},
year = {2011},
url = {https://doi.org/10.1016/j.comcom.2011.05.010},
doi = {10.1016/J.COMCOM.2011.05.010},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comcom/SenelY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/GouveiaMS11,
author = {Luis Eduardo Neves Gouveia and
Pedro Moura and
Amaro de Sousa},
title = {Prize collecting Steiner trees with node degree dependent costs},
journal = {Comput. Oper. Res.},
volume = {38},
number = {1},
pages = {234--245},
year = {2011},
url = {https://doi.org/10.1016/j.cor.2010.04.016},
doi = {10.1016/J.COR.2010.04.016},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/GouveiaMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/SummaGL11,
author = {Marco Di Summa and
Andrea Grosso and
Marco Locatelli},
title = {Complexity of the critical node problem over trees},
journal = {Comput. Oper. Res.},
volume = {38},
number = {12},
pages = {1766--1774},
year = {2011},
url = {https://doi.org/10.1016/j.cor.2011.02.016},
doi = {10.1016/J.COR.2011.02.016},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/SummaGL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cstat/LinsenB11,
author = {Lars Linsen and
Sabine Behrendt},
title = {Linked treemap: a 3D treemap-nodelink layout for visualizing hierarchical
structures},
journal = {Comput. Stat.},
volume = {26},
number = {4},
pages = {679},
year = {2011},
url = {https://doi.org/10.1007/s00180-011-0272-2},
doi = {10.1007/S00180-011-0272-2},
timestamp = {Wed, 08 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cstat/LinsenB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/itiis/LiuLZ11,
author = {Luming Liu and
Zhihao Ling and
Yun Zuo},
title = {Low-delay Node-disjoint Multi-path Routing using Complementary Trees
for Industrial Wireless Sensor Networks},
journal = {{KSII} Trans. Internet Inf. Syst.},
volume = {5},
number = {11},
pages = {2052--2067},
year = {2011},
url = {https://doi.org/10.3837/tiis.2011.11.010},
doi = {10.3837/TIIS.2011.11.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/itiis/LiuLZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChanCTZ11,
author = {Joseph Wun{-}Tat Chan and
Francis Y. L. Chin and
Hing{-}Fung Ting and
Yong Zhang},
title = {Online tree node assignment with resource augmentation},
journal = {J. Comb. Optim.},
volume = {22},
number = {3},
pages = {359--377},
year = {2011},
url = {https://doi.org/10.1007/s10878-010-9292-z},
doi = {10.1007/S10878-010-9292-Z},
timestamp = {Thu, 22 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChanCTZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jip/TreeprapinKHN11,
author = {Kriengsak Treeprapin and
Akimitsu Kanzaki and
Takahiro Hara and
Shojiro Nishio},
title = {A Node Deployment Strategy for Efficient Sensing with Mobile Sensors
in Sparse Sensor Networks},
journal = {J. Inf. Process.},
volume = {19},
pages = {103--117},
year = {2011},
url = {https://doi.org/10.2197/ipsjjip.19.103},
doi = {10.2197/IPSJJIP.19.103},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jip/TreeprapinKHN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DingX11,
author = {Wei Ding and
Guoliang Xue},
title = {A linear time algorithm for computing a most reliable source on a
tree network with faulty nodes},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {3},
pages = {225--232},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2009.08.003},
doi = {10.1016/J.TCS.2009.08.003},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DingX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcsv/MathewT11,
author = {Reji Mathew and
David S. Taubman},
title = {Scalable Modeling of Motion and Boundary Geometry With Quad-Tree Node
Merging},
journal = {{IEEE} Trans. Circuits Syst. Video Technol.},
volume = {21},
number = {2},
pages = {178--192},
year = {2011},
url = {https://doi.org/10.1109/TCSVT.2011.2106270},
doi = {10.1109/TCSVT.2011.2106270},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcsv/MathewT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tsp/BertrandM11,
author = {Alexander Bertrand and
Marc Moonen},
title = {Distributed Adaptive Estimation of Node-Specific Signals in Wireless
Sensor Networks With a Tree Topology},
journal = {{IEEE} Trans. Signal Process.},
volume = {59},
number = {5},
pages = {2196--2210},
year = {2011},
url = {https://doi.org/10.1109/TSP.2011.2108290},
doi = {10.1109/TSP.2011.2108290},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tsp/BertrandM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dgci/PassatN11,
author = {Nicolas Passat and
Beno{\^{\i}}t Naegel},
editor = {Isabelle Debled{-}Rennesson and
Eric Domenjoud and
Bertrand Kerautret and
Philippe Even},
title = {Selection of Relevant Nodes from Component-Trees in Linear Time},
booktitle = {Discrete Geometry for Computer Imagery - 16th {IAPR} International
Conference, {DGCI} 2011, Nancy, France, April 6-8, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6607},
pages = {453--464},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-19867-0\_38},
doi = {10.1007/978-3-642-19867-0\_38},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/dgci/PassatN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/NaorPS11,
author = {Joseph Naor and
Debmalya Panigrahi and
Mohit Singh},
editor = {Rafail Ostrovsky},
title = {Online Node-Weighted Steiner Tree and Related Problems},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {210--219},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.65},
doi = {10.1109/FOCS.2011.65},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/NaorPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hpsr/TangHRSTF11,
author = {Limin Tang and
Wanjun Huang and
Miguel Razo and
Arularasi Sivasankaran and
Marco Tacca and
Andrea Fumagalli},
title = {Multicast tree computation in networks with multicast incapable nodes},
booktitle = {Proceedings of the 12th {IEEE} International Conference on High Performance
Switching and Routing, {HPSR} 2011, 4-6 July 2011, Cartagena, Spain},
pages = {95--100},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/HPSR.2011.5986010},
doi = {10.1109/HPSR.2011.5986010},
timestamp = {Wed, 16 Oct 2019 14:14:57 +0200},
biburl = {https://dblp.org/rec/conf/hpsr/TangHRSTF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icc/ChangC11,
author = {Ronald Y. Chang and
Wei{-}Ho Chung},
title = {Efficient Tree-Search {MIMO} Detection with Probabilistic Node Ordering},
booktitle = {Proceedings of {IEEE} International Conference on Communications,
{ICC} 2011, Kyoto, Japan, 5-9 June, 2011},
pages = {1--5},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/icc.2011.5962688},
doi = {10.1109/ICC.2011.5962688},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icc/ChangC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ieeevast/GomezBPS11,
author = {John Alexis Guerra G{\'{o}}mez and
Audra Buck{-}Coleman and
Catherine Plaisant and
Ben Shneiderman},
title = {TreeVersity: Comparing tree structures by topology and node's attributes
differences},
booktitle = {6th {IEEE} Conference on Visual Analytics Science and Technology,
{IEEE} {VAST} 2011, Providence, RI, USA, October 23-28, 2011},
pages = {275--276},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/VAST.2011.6102471},
doi = {10.1109/VAST.2011.6102471},
timestamp = {Tue, 11 Aug 2020 14:39:34 +0200},
biburl = {https://dblp.org/rec/conf/ieeevast/GomezBPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/Zahavi11,
author = {Eitan Zahavi},
title = {Fat-Trees Routing and Node Ordering Providing Contention Free Traffic
for {MPI} Global Collectives},
booktitle = {25th {IEEE} International Symposium on Parallel and Distributed Processing,
{IPDPS} 2011, Anchorage, Alaska, USA, 16-20 May 2011 - Workshop Proceedings},
pages = {761--770},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/IPDPS.2011.219},
doi = {10.1109/IPDPS.2011.219},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/Zahavi11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isocc/EomCL11,
author = {Ki{-}woong Eom and
Won{-}young Chung and
Yong{-}Surk Lee},
title = {A novel sequential tree algorithm based on the status of the processing
nodes to reduce congestion},
booktitle = {International SoC Design Conference, {ISOCC} 2011, Jeju, South Korea,
November 17-18, 2011},
pages = {211--214},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/ISOCC.2011.6138747},
doi = {10.1109/ISOCC.2011.6138747},
timestamp = {Wed, 30 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isocc/EomCL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/smc/ChandraK11,
author = {B. Chandra and
Venkatanareshbabu Kuppili},
title = {Heterogeneous node split measure for decision tree construction},
booktitle = {Proceedings of the {IEEE} International Conference on Systems, Man
and Cybernetics, Anchorage, Alaska, USA, October 9-12, 2011},
pages = {872--877},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/ICSMC.2011.6083761},
doi = {10.1109/ICSMC.2011.6083761},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/smc/ChandraK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/vcip/WuD11,
author = {Yongdong Wu and
Robert H. Deng},
editor = {Jar{-}Ferr Yang and
Hsueh{-}Ming Hang and
Masayuki Tanimoto and
Tsuhan Chen},
title = {Zero-error watermarking on jpeg images by shuffling huffman tree nodes},
booktitle = {2011 {IEEE} Visual Communications and Image Processing, {VCIP} 2011,
Tainan, Taiwan, November 6-9, 2011},
pages = {1--4},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/VCIP.2011.6115939},
doi = {10.1109/VCIP.2011.6115939},
timestamp = {Wed, 16 Oct 2019 14:14:52 +0200},
biburl = {https://dblp.org/rec/conf/vcip/WuD11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/natosec/MatheisM11,
author = {Kenneth Matheis and
Spyros S. Magliveras},
editor = {Dean Crnkovic and
Vladimir D. Tonchev},
title = {Generating rooted trees of m nodes uniformly at random},
booktitle = {Information Security, Coding Theory and Related Combinatorics},
series = {{NATO} Science for Peace and Security Series - {D:} Information and
Communication Security},
volume = {29},
pages = {17--26},
publisher = {{IOS} Press},
year = {2011},
url = {https://doi.org/10.3233/978-1-60750-663-8-17},
doi = {10.3233/978-1-60750-663-8-17},
timestamp = {Tue, 16 May 2017 14:24:21 +0200},
biburl = {https://dblp.org/rec/series/natosec/MatheisM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-3315,
author = {Fabricio L. Forgerini and
Nuno Crokidakis and
Sergey N. Dorogovtsev and
Jos{\'{e}} F. F. Mendes},
title = {Evolution of spatially embedded branching trees with interacting nodes},
journal = {CoRR},
volume = {abs/1110.3315},
year = {2011},
url = {http://arxiv.org/abs/1110.3315},
eprinttype = {arXiv},
eprint = {1110.3315},
timestamp = {Tue, 26 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-3315.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/candc/PlonskiR10,
author = {Piotr Plonski and
Jan P. Radomski},
title = {Quick path finding - Quick algorithmic solution for unambiguous labeling
of phylogenetic tree nodes},
journal = {Comput. Biol. Chem.},
volume = {34},
number = {5-6},
pages = {300--307},
year = {2010},
url = {https://doi.org/10.1016/j.compbiolchem.2010.10.002},
doi = {10.1016/J.COMPBIOLCHEM.2010.10.002},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/candc/PlonskiR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KubaP10,
author = {Markus Kuba and
Alois Panholzer},
title = {On the distribution of distances between specified nodes in increasing
trees},
journal = {Discret. Appl. Math.},
volume = {158},
number = {5},
pages = {489--506},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2009.10.014},
doi = {10.1016/J.DAM.2009.10.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KubaP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GouveiaM10,
author = {Luis Eduardo Neves Gouveia and
Pedro Moura},
title = {Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations},
journal = {Electron. Notes Discret. Math.},
volume = {36},
pages = {985--992},
year = {2010},
url = {https://doi.org/10.1016/j.endm.2010.05.125},
doi = {10.1016/J.ENDM.2010.05.125},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/GouveiaM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcbdd/WangZ10,
author = {Jingjing Wang and
Mengxia Zhu},
title = {A parallel approach to multiple sequences alignment and phylogenetic
tree node labelling},
journal = {Int. J. Comput. Biol. Drug Des.},
volume = {3},
number = {3},
pages = {226--236},
year = {2010},
url = {https://doi.org/10.1504/IJCBDD.2010.038027},
doi = {10.1504/IJCBDD.2010.038027},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcbdd/WangZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YuBMZZ10,
author = {Cui Yu and
James Bailey and
Julian Montefusco and
Rui Zhang and
Jiling Zhong},
title = {Enhancing the B\({}^{\mbox{+}}\)-tree by dynamic node popularity caching},
journal = {Inf. Process. Lett.},
volume = {110},
number = {7},
pages = {268--273},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.01.008},
doi = {10.1016/J.IPL.2010.01.008},
timestamp = {Tue, 16 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YuBMZZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jis/Al-BadarnehYH10,
author = {Amer F. Al{-}Badarneh and
Qussai Yaseen and
Ismail Hmeidi},
title = {A new enhancement to the R-tree node splitting},
journal = {J. Inf. Sci.},
volume = {36},
number = {1},
pages = {3--18},
year = {2010},
url = {https://doi.org/10.1177/0165551509340360},
doi = {10.1177/0165551509340360},
timestamp = {Thu, 06 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jis/Al-BadarnehYH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/XuWDWZLW10,
author = {XiaoHua Xu and
Yuexuan Wang and
Hongwei Du and
Peng{-}Jun Wan and
Feng Zou and
Xianyue Li and
Weili Wu},
title = {Approximations for node-weighted Steiner tree in unit disk graphs},
journal = {Optim. Lett.},
volume = {4},
number = {3},
pages = {405--416},
year = {2010},
url = {https://doi.org/10.1007/s11590-010-0194-x},
doi = {10.1007/S11590-010-0194-X},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ol/XuWDWZLW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pr/ChandraKP10,
author = {B. Chandra and
Ravi Kothari and
Pallath Paul},
title = {A new node splitting measure for decision tree construction},
journal = {Pattern Recognit.},
volume = {43},
number = {8},
pages = {2725--2731},
year = {2010},
url = {https://doi.org/10.1016/j.patcog.2010.02.025},
doi = {10.1016/J.PATCOG.2010.02.025},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pr/ChandraKP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sac/SandriZ10,
author = {Marco Sandri and
Paola Zuccolotto},
title = {Analysis and correction of bias in Total Decrease in Node Impurity
measures for tree-based algorithms},
journal = {Stat. Comput.},
volume = {20},
number = {4},
pages = {393--407},
year = {2010},
url = {https://doi.org/10.1007/s11222-009-9132-0},
doi = {10.1007/S11222-009-9132-0},
timestamp = {Wed, 25 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sac/SandriZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ACISicis/JinC10,
author = {Rize Jin and
Tae{-}Sun Chung},
editor = {Tokuro Matsuo and
Naohiro Ishii and
Roger Y. Lee},
title = {Node Compression Techniques Based on Cache-Sensitive B+-Tree},
booktitle = {9th {IEEE/ACIS} International Conference on Computer and Information
Science, {IEEE/ACIS} {ICIS} 2010, 18-20 August 2010, Yamagata, Japan},
pages = {133--138},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/ICIS.2010.9},
doi = {10.1109/ICIS.2010.9},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ACISicis/JinC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/CalvaneseGLV10,
author = {Diego Calvanese and
Giuseppe De Giacomo and
Maurizio Lenzerini and
Moshe Y. Vardi},
editor = {Maria Fox and
David Poole},
title = {Node Selection Query Languages for Trees},
booktitle = {Proceedings of the Twenty-Fourth {AAAI} Conference on Artificial Intelligence,
{AAAI} 2010, Atlanta, Georgia, USA, July 11-15, 2010},
pages = {279--284},
publisher = {{AAAI} Press},
year = {2010},
url = {https://doi.org/10.1609/aaai.v24i1.7598},
doi = {10.1609/AAAI.V24I1.7598},
timestamp = {Mon, 04 Sep 2023 16:23:45 +0200},
biburl = {https://dblp.org/rec/conf/aaai/CalvaneseGLV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/doceng/ThaoM10,
author = {Cheng Thao and
Ethan V. Munson},
editor = {Apostolos Antonacopoulos and
Michael J. Gormish and
Rolf Ingold},
title = {Using versioned tree data structure, change detection and node identity
for three-way {XML} merging},
booktitle = {Proceedings of the 2010 {ACM} Symposium on Document Engineering, Manchester,
United Kingdom, September 21-24, 2010},
pages = {77--86},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1860559.1860578},
doi = {10.1145/1860559.1860578},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/doceng/ThaoM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fskd/GongK10,
author = {Jun Gong and
Shengnan Ke},
editor = {Maozhen Li and
Qilian Liang and
Lipo Wang and
Yibin Song},
title = {A new node-split algorithm in R-tree based on spatial clustering},
booktitle = {Seventh International Conference on Fuzzy Systems and Knowledge Discovery,
{FSKD} 2010, 10-12 August 2010, Yantai, Shandong, China},
pages = {2081--2085},
publisher = {{IEEE}},
year = {2010},
url = {https://doi.org/10.1109/FSKD.2010.5569703},
doi = {10.1109/FSKD.2010.5569703},
timestamp = {Sat, 25 Jun 2022 17:37:25 +0200},
biburl = {https://dblp.org/rec/conf/fskd/GongK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/globecom/LinY10,
author = {Hwa{-}Chun Lin and
Hsiu{-}Ming Yang},
title = {An Approximation Algorithm for Constructing Multicast Trees with Degree-Dependent
Node Costs},
booktitle = {Proceedings of the Global Communications Conference, 2010. {GLOBECOM}
2010, 6-10 December 2010, Miami, Florida, {USA}},
pages = {1--5},
publisher = {{IEEE}},
year = {2010},
url = {https://doi.org/10.1109/GLOCOM.2010.5683842},
doi = {10.1109/GLOCOM.2010.5683842},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/globecom/LinY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icde/MorishimaTT10,
author = {Atsuyuki Morishima and
Keishi Tajima and
Masateru Tadaishi},
editor = {Feifei Li and
Mirella M. Moro and
Shahram Ghandeharizadeh and
Jayant R. Haritsa and
Gerhard Weikum and
Michael J. Carey and
Fabio Casati and
Edward Y. Chang and
Ioana Manolescu and
Sharad Mehrotra and
Umeshwar Dayal and
Vassilis J. Tsotras},
title = {Optimal tree node ordering for child/descendant navigations},
booktitle = {Proceedings of the 26th International Conference on Data Engineering,
{ICDE} 2010, March 1-6, 2010, Long Beach, California, {USA}},
pages = {840--843},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/ICDE.2010.5447848},
doi = {10.1109/ICDE.2010.5447848},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icde/MorishimaTT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icica/ZhangZLX10,
author = {Hong{-}Lin Zhang and
Chunyuan Zhang and
Dong Liu and
Gui{-}Wu Xie},
editor = {Rongbo Zhu and
Yanchun Zhang and
Baoxiang Liu and
Chunfeng Liu},
title = {Importance Measure Method for Dynamic Fault Tree Based on Isomorphic
Node},
booktitle = {Information Computing and Applications - First International Conference,
{ICICA} 2010, Tangshan, China, October 15-18, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6377},
pages = {9--16},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16167-4\_2},
doi = {10.1007/978-3-642-16167-4\_2},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icica/ZhangZLX10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ike/Chen10,
author = {Yangjun Chen},
editor = {Hamid R. Arabnia and
Ray R. Hashemi and
Gregory Vert and
Anitha Chennamaneni and
Ashu M. G. Solo},
title = {Data Stream Transformation and Query Node Arrays: {A} New Way to Evaluate
Tree Pattern Queries},
booktitle = {Proceedings of the 2010 International Conference on Information {\&}
Knowledge Engineering, {IKE} 2010, July 12-15, 2010, Las Vegas Nevada,
{USA}},
pages = {72--78},
publisher = {{CSREA} Press},
year = {2010},
timestamp = {Thu, 09 Dec 2010 14:37:43 +0100},
biburl = {https://dblp.org/rec/conf/ike/Chen10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BazganTT10,
author = {Cristina Bazgan and
Sonia Toubaline and
Zsolt Tuza},
editor = {Costas S. Iliopoulos and
William F. Smyth},
title = {Complexity of Most Vital Nodes for Independent Set in Graphs Related
to Tree Structures},
booktitle = {Combinatorial Algorithms - 21st International Workshop, {IWOCA} 2010,
London, UK, July 26-28, 2010, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6460},
pages = {154--166},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-19222-7\_17},
doi = {10.1007/978-3-642-19222-7\_17},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BazganTT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/FuscoP10,
author = {Emanuele G. Fusco and
Andrzej Pelc},
editor = {Boaz Patt{-}Shamir and
T{\'{\i}}naz Ekim},
title = {Distributed Tree Comparison with Nodes of Limited Memory},
booktitle = {Structural Information and Communication Complexity, 17th International
Colloquium, {SIROCCO} 2010, Sirince, Turkey, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6058},
pages = {142--156},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13284-1\_12},
doi = {10.1007/978-3-642-13284-1\_12},
timestamp = {Fri, 17 Apr 2020 13:19:16 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/FuscoP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sisap/BarrosoRP10,
author = {Marcelo Barroso and
Nora Reyes and
Rodrigo Paredes},
editor = {Paolo Ciaccia and
Marco Patella},
title = {Enlarging nodes to improve dynamic spatial approximation trees},
booktitle = {Third International Workshop on Similarity Search and Applications,
{SISAP} 2010, 18-19 September 2010, Istanbul, Turkey},
pages = {41--48},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1862344.1862351},
doi = {10.1145/1862344.1862351},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sisap/BarrosoRP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tag/HanPS10,
author = {Chung{-}Hye Han and
David Potter and
Dennis Ryan Storoshenko},
editor = {Srinivas Bangalore and
Robert Frank and
Maribel Romero},
title = {Non-local Right Node Raising: an Analysis using Delayed Tree-Local
{MC-TAG}},
booktitle = {Proceedings of the 10th International Workshop on Tree Adjoining Grammar
and Related Frameworks, {TAG} 2010, Yale University, New Haven, CT,
USA, June 10-12, 2010},
pages = {9--16},
publisher = {Linguistic Department, Yale University},
year = {2010},
url = {https://aclanthology.org/W10-4402/},
timestamp = {Mon, 30 Aug 2021 16:58:55 +0200},
biburl = {https://dblp.org/rec/conf/tag/HanPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/xsym/GrimsmoBH10,
author = {Nils Grimsmo and
Truls Amundsen Bj{\o}rklund and
Magnus Lie Hetland},
editor = {Mong{-}Li Lee and
Jeffrey Xu Yu and
Zohra Bellahsene and
Rainer Unland},
title = {Linear Computation of the Maximum Simultaneous Forward and Backward
Bisimulation for Node-Labeled Trees},
booktitle = {Database and {XML} Technologies - 7th International {XML} Database
Symposium, XSym 2010, Singapore, September 17, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6309},
pages = {18--32},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15684-7\_3},
doi = {10.1007/978-3-642-15684-7\_3},
timestamp = {Tue, 14 May 2019 10:00:49 +0200},
biburl = {https://dblp.org/rec/conf/xsym/GrimsmoBH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-2764,
author = {Karl Malbrain},
title = {A Blink Tree latch method and protocol to support synchronous node
deletion},
journal = {CoRR},
volume = {abs/1009.2764},
year = {2010},
url = {http://arxiv.org/abs/1009.2764},
eprinttype = {arXiv},
eprint = {1009.2764},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-2764.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-0958,
author = {Punit Sharma and
Partha Sarathi Mandal},
title = {Reconstruction of Aggregation Tree in spite of Faulty Nodes in Wireless
Sensor Networks},
journal = {CoRR},
volume = {abs/1010.0958},
year = {2010},
url = {http://arxiv.org/abs/1010.0958},
eprinttype = {arXiv},
eprint = {1010.0958},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-0958.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RemyS09,
author = {Jan Remy and
Angelika Steger},
title = {Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems},
journal = {Algorithmica},
volume = {55},
number = {1},
pages = {240--267},
year = {2009},
url = {https://doi.org/10.1007/s00453-007-9114-6},
doi = {10.1007/S00453-007-9114-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RemyS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csse/PengTXYZ09,
author = {Chao Peng and
Yasuo Tan and
Naixue Xiong and
Laurence Tianruo Yang and
Hong Zhu},
title = {Approximation algorithms for inner-node weighted minimum spanning
trees},
journal = {Comput. Syst. Sci. Eng.},
volume = {24},
number = {3},
year = {2009},
timestamp = {Fri, 09 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csse/PengTXYZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/icl/Macedo09,
author = {M{\'{a}}rio Macedo},
title = {Are there so many sons per node in a wireless sensor network data
aggregation tree?},
journal = {{IEEE} Commun. Lett.},
volume = {13},
number = {4},
pages = {245--247},
year = {2009},
url = {https://doi.org/10.1109/LCOMM.2009.082003},
doi = {10.1109/LCOMM.2009.082003},
timestamp = {Thu, 20 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/icl/Macedo09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/icl/ZhangZ09,
author = {Feng Zhang and
Wen{-}De Zhong},
title = {{\(\rho\)}p-Cycle based tree protection of optical multicast traffic
for combined link and node failure recovery in {WDM} mesh networks},
journal = {{IEEE} Commun. Lett.},
volume = {13},
number = {1},
pages = {40--42},
year = {2009},
url = {https://doi.org/10.1109/LCOMM.2009.081376},
doi = {10.1109/LCOMM.2009.081376},
timestamp = {Thu, 20 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/icl/ZhangZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijaacs/JiangJZ09,
author = {Wenchao Jiang and
Hai Jin and
Yanhong Zhou},
title = {Probing multiple node-disjoint paths using multi-labelled tree traversing},
journal = {Int. J. Auton. Adapt. Commun. Syst.},
volume = {2},
number = {2},
pages = {175--200},
year = {2009},
url = {https://doi.org/10.1504/IJAACS.2009.024420},
doi = {10.1504/IJAACS.2009.024420},
timestamp = {Sun, 30 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijaacs/JiangJZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZouLGW09,
author = {Feng Zou and
Xianyue Li and
Suogang Gao and
Weili Wu},
title = {Node-weighted Steiner tree approximation in unit disk graphs},
journal = {J. Comb. Optim.},
volume = {18},
number = {4},
pages = {342--349},
year = {2009},
url = {https://doi.org/10.1007/s10878-009-9229-6},
doi = {10.1007/S10878-009-9229-6},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ZouLGW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/masa/ShuklaRT09,
author = {D. Shukla and
Yashwant Singh Rajput and
Narendra Singh Thakur},
title = {Estimation of spanning tree mean-edge using node sampling},
journal = {Model. Assist. Stat. Appl.},
volume = {4},
number = {1},
pages = {23--37},
year = {2009},
url = {https://doi.org/10.3233/MAS-2009-0105},
doi = {10.3233/MAS-2009-0105},
timestamp = {Thu, 16 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/masa/ShuklaRT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/JayaveluRY09,
author = {Giridhar Jayavelu and
Srinivasan Ramasubramanian and
Ossama Younis},
title = {Maintaining colored trees for disjoint multipath routing under node
failures},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {17},
number = {1},
pages = {346--359},
year = {2009},
url = {http://doi.acm.org/10.1145/1514070.1514094},
doi = {10.1145/1514070.1514094},
timestamp = {Mon, 23 Mar 2009 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ton/JayaveluRY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ai/AndronescuB09,
author = {Mirela Andronescu and
Mark Brodie},
editor = {Yong Gao and
Nathalie Japkowicz},
title = {Decision Tree Learning Using a Bayesian Approach at Each Node},
booktitle = {Advances in Artificial Intelligence, 22nd Canadian Conference on Artificial
Intelligence, Canadian {AI} 2009, Kelowna, Canada, May 25-27, 2009,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5549},
pages = {4--15},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-01818-3\_4},
doi = {10.1007/978-3-642-01818-3\_4},
timestamp = {Thu, 28 Sep 2023 12:27:09 +0200},
biburl = {https://dblp.org/rec/conf/ai/AndronescuB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apnoms/HolopainenK09,
author = {Visa Holopainen and
Raimo Kantola},
editor = {Choong Seon Hong and
Toshio Tonouchi and
Yan Ma and
Chi{-}Shih Chao},
title = {Tackling the Delay-Cost and Time-Cost Trade-Offs in Computation of
Node-Protected Multicast Tree Pairs},
booktitle = {Management Enabling the Future Internet for Changing Business and
New Computing Services, 12th Asia-Pacific Network Operations and Management
Symposium, {APNOMS} 2009, Jeju, South Korea, September 23-25, 2009,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5787},
pages = {273--282},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04492-2\_28},
doi = {10.1007/978-3-642-04492-2\_28},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/apnoms/HolopainenK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cae/JeppAJWS09,
author = {Pauline Jepp and
Bruno Ara{\'{u}}jo and
Joaquim A. Jorge and
Brian Wyvill and
Mario Costa Sousa},
editor = {Oliver Deussen and
Peter Hall},
title = {Style Nodes and Repolygonization for Hierarchical Tree-Based Implicit
Surface Modelling},
booktitle = {5th International Symposium on Computational Aesthetics in Graphics,
Visualization, and Imaging, CAe 2009, Victoria, BC, Canada, 2009,
Proceedings},
pages = {41--48},
publisher = {Eurographics Association},
year = {2009},
url = {https://doi.org/10.2312/COMPAESTH/COMPAESTH09/041-048},
doi = {10.2312/COMPAESTH/COMPAESTH09/041-048},
timestamp = {Thu, 04 Aug 2022 09:49:26 +0200},
biburl = {https://dblp.org/rec/conf/cae/JeppAJWS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/FukuharaT09,
author = {Hideaki Fukuhara and
Eiji Takimoto},
editor = {Rod Downey and
Prabhu Manyem},
title = {Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees
with Parity Nodes},
booktitle = {Theory of Computing 2009, Fifteenth Computing: The Australasian Theory
Symposium, {CATS} 2009, Wellington, New Zealand, January 2009},
series = {{CRPIT}},
volume = {94},
pages = {89--98},
publisher = {Australian Computer Society},
year = {2009},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV94Fukuhara.html},
timestamp = {Mon, 08 Feb 2021 13:26:47 +0100},
biburl = {https://dblp.org/rec/conf/cats/FukuharaT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cisis/TreeprapinKHN09,
author = {Kriengsak Treeprapin and
Akimitsu Kanzaki and
Takahiro Hara and
Shojiro Nishio},
editor = {Leonard Barolli and
Fatos Xhafa and
Hui{-}Huang Hsu},
title = {An Efficient Node Deployment Strategy Strategy in Sparse Sensor Networks},
booktitle = {2009 International Conference on Complex, Intelligent and Software
Intensive Systems, {CISIS} 2009, Fukuoka, Japan, March 16-19, 2009},
pages = {1060--1065},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CISIS.2009.100},
doi = {10.1109/CISIS.2009.100},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cisis/TreeprapinKHN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/LiXZDWWW09,
author = {Xianyue Li and
XiaoHua Xu and
Feng Zou and
Hongwei Du and
Peng{-}Jun Wan and
Yuexuan Wang and
Weili Wu},
editor = {Ding{-}Zhu Du and
Xiaodong Hu and
Panos M. Pardalos},
title = {A {PTAS} for Node-Weighted Steiner Tree in Unit Disk Graphs},
booktitle = {Combinatorial Optimization and Applications, Third International Conference,
{COCOA} 2009, Huangshan, China, June 10-12, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5573},
pages = {36--48},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02026-1\_4},
doi = {10.1007/978-3-642-02026-1\_4},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/LiXZDWWW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ChanCTZ09,
author = {Joseph Wun{-}Tat Chan and
Francis Y. L. Chin and
Hing{-}Fung Ting and
Yong Zhang},
editor = {Hung Q. Ngo},
title = {Online Tree Node Assignment with Resource Augmentation},
booktitle = {Computing and Combinatorics, 15th Annual International Conference,
{COCOON} 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5609},
pages = {358--367},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02882-3\_36},
doi = {10.1007/978-3-642-02882-3\_36},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/ChanCTZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eusipco/BertrandM09,
author = {Alexander Bertrand and
Marc Moonen},
title = {Distributed adaptive node-specific {MMSE} signal estimation in sensor
networks with a tree topology},
booktitle = {17th European Signal Processing Conference, {EUSIPCO} 2009, Glasgow,
Scotland, UK, August 24-28, 2009},
pages = {794--798},
publisher = {{IEEE}},
year = {2009},
url = {https://ieeexplore.ieee.org/document/7077830/},
timestamp = {Mon, 09 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/eusipco/BertrandM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ica3pp/LeeJW09,
author = {Chia{-}Wei Lee and
Justie Su{-}tzu Juan and
Tai{-}Lung Wu},
editor = {Arrems Hua and
Shih{-}Liang Chang},
title = {An On-Line Parallel Algorithm for Node Ranking of Trees},
booktitle = {Algorithms and Architectures for Parallel Processing, 9th International
Conference, {ICA3PP} 2009, Taipei, Taiwan, June 8-11, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5574},
pages = {384--395},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03095-6\_37},
doi = {10.1007/978-3-642-03095-6\_37},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ica3pp/LeeJW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DemaineHK09a,
author = {Erik D. Demaine and
MohammadTaghi Hajiaghayi and
Philip N. Klein},
editor = {Susanne Albers and
Alberto Marchetti{-}Spaccamela and
Yossi Matias and
Sotiris E. Nikoletseas and
Wolfgang Thomas},
title = {Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs},
booktitle = {Automata, Languages and Programming, 36th International Colloquium,
{ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {5555},
pages = {328--340},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02927-1\_28},
doi = {10.1007/978-3-642-02927-1\_28},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DemaineHK09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icip/MathewT09,
author = {Reji Mathew and
David S. Taubman},
title = {Joint scalable modeling of motion and boundary geometry with quad-tree
node merging},
booktitle = {Proceedings of the International Conference on Image Processing, {ICIP}
2009, 7-10 November 2009, Cairo, Egypt},
pages = {3745--3748},
publisher = {{IEEE}},
year = {2009},
url = {https://doi.org/10.1109/ICIP.2009.5414498},
doi = {10.1109/ICIP.2009.5414498},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icip/MathewT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iconip/HayashiZ09,
author = {Hirotomo Hayashi and
Qiangfu Zhao},
editor = {Chi{-}Sing Leung and
Minho Lee and
Jonathan Hoyin Chan},
title = {Improvement of the Neural Network Trees through Fine-Tuning of the
Threshold of Each Internal Node},
booktitle = {Neural Information Processing, 16th International Conference, {ICONIP}
2009, Bangkok, Thailand, December 1-5, 2009, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {5863},
pages = {657--666},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10677-4\_75},
doi = {10.1007/978-3-642-10677-4\_75},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/iconip/HayashiZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwcmc/ErlebachS09,
author = {Thomas Erlebach and
Ambreen Shahnaz},
editor = {Mohsen Guizani and
Peter M{\"{u}}ller and
Klaus{-}Peter F{\"{a}}hnrich and
Athanasios V. Vasilakos and
Yan Zhang and
Jun Zhang},
title = {Approximating node-weighted multicast trees in wireless ad-hoc networks},
booktitle = {Proceedings of the International Conference on Wireless Communications
and Mobile Computing: Connecting the World Wirelessly, {IWCMC} 2009,
Leipzig, Germany, June 21-24, 2009},
pages = {639--643},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1582379.1582518},
doi = {10.1145/1582379.1582518},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwcmc/ErlebachS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/netcom/GuptaBM09,
author = {Pankaj Gupta and
Tarun Bansal and
Manoj Misra},
title = {{MSTBBN:} M-way Search Tree Based Base Station to Node Communication
Protocol for Wireless Sensor Networks},
booktitle = {First International Conference on Networks and Communications, NetCoM
2009, Chennai, India, December 27-29, 2009},
pages = {23--27},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/NetCoM.2009.78},
doi = {10.1109/NETCOM.2009.78},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/netcom/GuptaBM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rss/YamaneYN09,
author = {Katsu Yamane and
Yoshifumi Yamaguchi and
Yoshihiko Nakamura},
editor = {Jeff Trinkle and
Yoky Matsuoka and
Jos{\'{e}} A. Castellanos},
title = {Human motion database with a binary tree and node transition graphs},
booktitle = {Robotics: Science and Systems V, University of Washington, Seattle,
USA, June 28 - July 1, 2009},
publisher = {The {MIT} Press},
year = {2009},
url = {http://www.roboticsproceedings.org/rss05/p4.html},
doi = {10.15607/RSS.2009.V.004},
timestamp = {Wed, 07 Dec 2022 22:58:51 +0100},
biburl = {https://dblp.org/rec/conf/rss/YamaneYN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0906-0379,
author = {Mugurel Ionut Andreica and
Eliana{-}Dina Tirsa and
Nicolae Tapus},
title = {Data Distribution Optimization using Offline Algorithms and a Peer-to-Peer
Small Diameter Tree Architecture with Bounded Node Degrees},
journal = {CoRR},
volume = {abs/0906.0379},
year = {2009},
url = {http://arxiv.org/abs/0906.0379},
eprinttype = {arXiv},
eprint = {0906.0379},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0906-0379.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/CordoneT08,
author = {Roberto Cordone and
Marco Trubian},
title = {A Relax-and-Cut Algorithm for the Knapsack Node Weighted Steiner Tree
Problem},
journal = {Asia Pac. J. Oper. Res.},
volume = {25},
number = {3},
pages = {373--391},
year = {2008},
url = {https://doi.org/10.1142/S0217595908001791},
doi = {10.1142/S0217595908001791},
timestamp = {Tue, 12 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apjor/CordoneT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/Panholzer08,
author = {Alois Panholzer},
title = {Analysis of Some Parameters for Random Nodes in Priority Trees},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {10},
number = {2},
year = {2008},
url = {https://doi.org/10.46298/dmtcs.447},
doi = {10.46298/DMTCS.447},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/Panholzer08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/ZouLKW08,
author = {Feng Zou and
Xianyue Li and
Donghyun Kim and
Weili Wu},
editor = {Boting Yang and
Ding{-}Zhu Du and
Cao An Wang},
title = {Two Constant Approximation Algorithms for Node-Weighted Steiner Tree
in Unit Disk Graphs},
booktitle = {Combinatorial Optimization and Applications, Second International
Conference, {COCOA} 2008, St. John's, NL, Canada, August 21-24, 2008.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5165},
pages = {278--285},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85097-7\_26},
doi = {10.1007/978-3-540-85097-7\_26},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/ZouLKW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dmin/PhamDLL08,
author = {Nguyen{-}Khang Pham and
Thanh{-}Nghi Do and
Philippe Lenca and
St{\'{e}}phane Lallich},
editor = {Robert Stahlbock and
Sven F. Crone and
Stefan Lessmann},
title = {Using Local Node Information in Decision Trees: Coupling a Local Labeling
Rule with an Off-centered Entropy},
booktitle = {Proceedings of The 2008 International Conference on Data Mining, {DMIN}
2008, July 14-17, 2008, Las Vegas, USA, 2 Volumes},
pages = {117--123},
publisher = {{CSREA} Press},
year = {2008},
timestamp = {Wed, 28 Oct 2009 09:53:14 +0100},
biburl = {https://dblp.org/rec/conf/dmin/PhamDLL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/RaeymaekersB08,
author = {Stefan Raeymaekers and
Maurice Bruynooghe},
editor = {Malik Ghallab and
Constantine D. Spyropoulos and
Nikos Fakotakis and
Nikolaos M. Avouris},
title = {Sub Node Extraction with Tree Based Wrappers},
booktitle = {{ECAI} 2008 - 18th European Conference on Artificial Intelligence,
Patras, Greece, July 21-25, 2008, Proceedings},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {178},
pages = {137--141},
publisher = {{IOS} Press},
year = {2008},
url = {https://doi.org/10.3233/978-1-58603-891-5-137},
doi = {10.3233/978-1-58603-891-5-137},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ecai/RaeymaekersB08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/LimaRD08,
author = {Telma Woerle de Lima and
Franz Rothlauf and
Alexandre C. B. Delbem},
editor = {Conor Ryan and
Maarten Keijzer},
title = {The node-depth encoding: analysis and application to the bounded-diameter
minimum spanning tree problem},
booktitle = {Genetic and Evolutionary Computation Conference, {GECCO} 2008, Proceedings,
Atlanta, GA, USA, July 12-16, 2008},
pages = {969--976},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1389095.1389279},
doi = {10.1145/1389095.1389279},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gecco/LimaRD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/globecom/FernandezLVL08,
author = {Gonzalo M. Fern{\'{a}}ndez and
David Larrabeiti and
Carmen V{\'{a}}zquez and
Pedro Contreras Lallana},
title = {Power-Cost-Effective Node Architecture for Light-Tree Routing in {WDM}
Networks},
booktitle = {Proceedings of the Global Communications Conference, 2008. {GLOBECOM}
2008, New Orleans, LA, USA, 30 November - 4 December 2008},
pages = {2719--2724},
publisher = {{IEEE}},
year = {2008},
url = {https://doi.org/10.1109/GLOCOM.2008.ECP.521},
doi = {10.1109/GLOCOM.2008.ECP.521},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/globecom/FernandezLVL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccsa/KimKCCY08,
author = {Yonghyoun Kim and
Hyuncheol Kim and
Jin{-}Wook Chung and
Kwang{-}Jong Cho and
Ki{-}Sung Yu},
editor = {Osvaldo Gervasi and
Beniamino Murgante and
Antonio Lagan{\`{a}} and
David Taniar and
Youngsong Mun and
Marina L. Gavrilova},
title = {Network Stability Assessment Using the Number of Tree Adjacent to
an Articulation Node},
booktitle = {Computational Science and Its Applications - {ICCSA} 2008, International
Conference, Perugia, Italy, June 30 - July 3, 2008, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {5073},
pages = {1229--1241},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69848-7\_98},
doi = {10.1007/978-3-540-69848-7\_98},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/iccsa/KimKCCY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icnc/ChengLQ08,
author = {Deqiang Cheng and
Jin Lu and
Jiansheng Qian},
editor = {Maozu Guo and
Liang Zhao and
Lipo Wang},
title = {A Solution to Select Multicast Service Nodes of Hierarchical Overlay
Multicast Tree Based on Immune Evolution},
booktitle = {Fourth International Conference on Natural Computation, {ICNC} 2008,
Jinan, Shandong, China, 18-20 October 2008, Volume 1},
pages = {35--39},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/ICNC.2008.301},
doi = {10.1109/ICNC.2008.301},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icnc/ChengLQ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icuimc/LeeYKL08,
author = {Minsoo Lee and
Hyejung Yoon and
Yearn Jeong Kim and
Yoon{-}kyung Lee},
editor = {Won Kim and
Hyung{-}Jin Choi},
title = {{SMILE} tree: a stream data multi-query indexing technique with level-dimension
nodes and extended-range nodes},
booktitle = {Proceedings of the 2nd International Conference on Ubiquitous Information
Management and Communication, {ICUIMC} 2008, Suwon, Korea, January
31 - February 01, 2008},
pages = {101--107},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1352793.1352814},
doi = {10.1145/1352793.1352814},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icuimc/LeeYKL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/gis/X08ls,
editor = {Shashi Shekhar and
Hui Xiong},
title = {Extended Node Tree},
booktitle = {Encyclopedia of {GIS}},
pages = {307},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-35973-1\_398},
doi = {10.1007/978-0-387-35973-1\_398},
timestamp = {Fri, 03 Apr 2020 17:07:19 +0200},
biburl = {https://dblp.org/rec/reference/gis/X08ls.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/GuanZ07,
author = {Xiucui Guan and
Jianzhong Zhang},
title = {Improving multicut in directed trees by upgrading nodes},
journal = {Eur. J. Oper. Res.},
volume = {183},
number = {3},
pages = {971--980},
year = {2007},
url = {https://doi.org/10.1016/j.ejor.2005.12.044},
doi = {10.1016/J.EJOR.2005.12.044},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/GuanZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KubaP07,
author = {Markus Kuba and
Alois Panholzer},
title = {On the degree distribution of the nodes in increasing trees},
journal = {J. Comb. Theory, Ser. {A}},
volume = {114},
number = {4},
pages = {597--618},
year = {2007},
url = {https://doi.org/10.1016/j.jcta.2006.08.003},
doi = {10.1016/J.JCTA.2006.08.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KubaP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jss/NeedhamJ07,
author = {Donald M. Needham and
S. A. Jones},
title = {A software fault tree key node metric},
journal = {J. Syst. Softw.},
volume = {80},
number = {9},
pages = {1530--1540},
year = {2007},
url = {https://doi.org/10.1016/j.jss.2007.01.042},
doi = {10.1016/J.JSS.2007.01.042},
timestamp = {Sun, 01 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jss/NeedhamJ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/CarmeGLN07,
author = {Julien Carme and
R{\'{e}}mi Gilleron and
Aur{\'{e}}lien Lemay and
Joachim Niehren},
title = {Interactive learning of node selecting tree transducer},
journal = {Mach. Learn.},
volume = {66},
number = {1},
pages = {33--67},
year = {2007},
url = {https://doi.org/10.1007/s10994-006-9613-8},
doi = {10.1007/S10994-006-9613-8},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ml/CarmeGLN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pr/Altincay07,
author = {Hakan Altin{\c{c}}ay},
title = {Decision trees using model ensemble-based nodes},
journal = {Pattern Recognit.},
volume = {40},
number = {12},
pages = {3540--3551},
year = {2007},
url = {https://doi.org/10.1016/j.patcog.2007.03.023},
doi = {10.1016/J.PATCOG.2007.03.023},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pr/Altincay07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PanholzerP07,
author = {Alois Panholzer and
Helmut Prodinger},
title = {Level of nodes in increasing trees revisited},
journal = {Random Struct. Algorithms},
volume = {31},
number = {2},
pages = {203--226},
year = {2007},
url = {https://doi.org/10.1002/rsa.20161},
doi = {10.1002/RSA.20161},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PanholzerP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MossR07,
author = {Anna Moss and
Yuval Rabani},
title = {Approximation Algorithms for Constrained Node Weighted Steiner Tree
Problems},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {2},
pages = {460--481},
year = {2007},
url = {https://doi.org/10.1137/S0097539702420474},
doi = {10.1137/S0097539702420474},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MossR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tods/Olteanu07,
author = {Dan Olteanu},
title = {Forward node-selecting queries over trees},
journal = {{ACM} Trans. Database Syst.},
volume = {32},
number = {1},
pages = {3},
year = {2007},
url = {https://doi.org/10.1145/1206049.1206052},
doi = {10.1145/1206049.1206052},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tods/Olteanu07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/virology/Prakash07,
author = {Chandra Prakash},
title = {B-tree with fixed node size and no minimum degree},
journal = {J. Comput. Virol.},
volume = {3},
number = {3},
pages = {211--219},
year = {2007},
url = {https://doi.org/10.1007/s11416-007-0035-3},
doi = {10.1007/S11416-007-0035-3},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/virology/Prakash07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ACISicis/HanSHL07,
author = {Jun Han and
Zhaohao Sun and
Jinpeng Huai and
Xian Li},
title = {An Efficient Node Partitioning Algorithm for the Capacitated Minimum
Spanning Tree Problem},
booktitle = {6th Annual {IEEE/ACIS} International Conference on Computer and Information
Science {(ICIS} 2007), 11-13 July 2007, Melbourne, Australia},
pages = {575--580},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/ICIS.2007.56},
doi = {10.1109/ICIS.2007.56},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ACISicis/HanSHL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/adbis/PolaTT07,
author = {Ives Rene Venturini Pola and
Caetano Traina Jr. and
Agma J. M. Traina},
editor = {Yannis E. Ioannidis and
Boris Novikov and
Boris Rachev},
title = {The MM-Tree: {A} Memory-Based Metric Tree Without Overlap Between
Nodes},
booktitle = {Advances in Databases and Information Systems, 11th East European
Conference, {ADBIS} 2007, Varna, Bulgaria, September 29-October 3,
2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4690},
pages = {157--171},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-75185-4\_13},
doi = {10.1007/978-3-540-75185-4\_13},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/adbis/PolaTT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/FlocchiniEPPS07,
author = {Paola Flocchini and
Toni Mesa Enriquez and
Linda Pagli and
Giuseppe Prencipe and
Nicola Santoro},
editor = {Anne{-}Marie Kermarrec and
Luc Boug{\'{e}} and
Thierry Priol},
title = {Distributed Computation of All Node Replacements of a Minimum Spanning
Tree},
booktitle = {Euro-Par 2007, Parallel Processing, 13th International Euro-Par Conference,
Rennes, France, August 28-31, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4641},
pages = {598--607},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74466-5\_63},
doi = {10.1007/978-3-540-74466-5\_63},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/europar/FlocchiniEPPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifsa/LopezLPT07,
author = {Federico Del Razo L{\'{o}}pez and
Anne Laurent and
Pascal Poncelet and
Maguelonne Teisseire},
editor = {Patricia Melin and
Oscar Castillo and
Luis T. Aguilar and
Janusz Kacprzyk and
Witold Pedrycz},
title = {Fuzzy Tree Mining: Go Soft on Your Nodes},
booktitle = {Foundations of Fuzzy Logic and Soft Computing, 12th International
Fuzzy Systems Association World Congress, {IFSA} 2007, Cancun, Mexico,
June 18-21, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4529},
pages = {145--154},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72950-1\_15},
doi = {10.1007/978-3-540-72950-1\_15},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ifsa/LopezLPT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscc/IkikardesHKM07,
author = {Tunc Ikikardes and
Markus Hofbauer and
August Kaelin and
Martin May},
title = {A Robust, Responsive, Distributed Tree-Based Routing Algorithm Guaranteeing
{N} Valid Links per Node in Wireless Ad-Hoc Networks},
booktitle = {Proceedings of the 12th {IEEE} Symposium on Computers and Communications
{(ISCC} 2007), July 1-4, Aveiro, Portugal},
pages = {455--462},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/ISCC.2007.4381586},
doi = {10.1109/ISCC.2007.4381586},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iscc/IkikardesHKM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wwic/KimL07,
author = {Hyun{-}Ki Kim and
Tae{-}Jin Lee},
editor = {Fernando Boavida and
Edmundo Monteiro and
Saverio Mascolo and
Yevgeni Koucheryavy},
title = {A Flexible Tree-Based Routing Protocol with a Mesh Relaying Node in
Multi-hop Wireless Mesh Networks},
booktitle = {Wired/Wireless Internet Communications, 5th International Conference,
{WWIC} 2007, Coimbra, Portugal, May 23-25, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4517},
pages = {326--337},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72697-5\_28},
doi = {10.1007/978-3-540-72697-5\_28},
timestamp = {Thu, 03 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wwic/KimL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/sci/Valiente07,
author = {Gabriel Valiente},
editor = {Abraham Kandel and
Horst Bunke and
Mark Last},
title = {Efficient Algorithms on Trees and Graphs with Unique Node Labels},
booktitle = {Applied Graph Theory in Computer Vision and Pattern Recognition},
series = {Studies in Computational Intelligence},
volume = {52},
pages = {137--149},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-68020-8\_5},
doi = {10.1007/978-3-540-68020-8\_5},
timestamp = {Fri, 09 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/series/sci/Valiente07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/CordoneT06,
author = {Roberto Cordone and
Marco Trubian},
title = {An exact algorithm for the node weighted Steiner tree problem},
journal = {4OR},
volume = {4},
number = {2},
pages = {124--144},
year = {2006},
url = {https://doi.org/10.1007/s10288-005-0081-y},
doi = {10.1007/S10288-005-0081-Y},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/CordoneT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/ChoL06,
author = {Hee K. Cho and
Chae Y. Lee},
title = {Multicast tree rearrangement to recover node failures in overlay multicast
networks},
journal = {Comput. Oper. Res.},
volume = {33},
pages = {581--594},
year = {2006},
url = {https://doi.org/10.1016/j.cor.2004.07.018},
doi = {10.1016/J.COR.2004.07.018},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/ChoL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/LinG06,
author = {Lin Lin and
Mitsuo Gen},
title = {Node-Based Genetic Algorithm for Communication Spanning Tree Problem},
journal = {{IEICE} Trans. Commun.},
volume = {89-B},
number = {4},
pages = {1091--1098},
year = {2006},
url = {https://doi.org/10.1093/ietcom/e89-b.4.1091},
doi = {10.1093/IETCOM/E89-B.4.1091},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/LinG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JavanianV06,
author = {Mehri Javanian and
Mohammad Q. Vahidi{-}Asl},
title = {Depth of nodes in random recursive \emph{k}-ary trees},
journal = {Inf. Process. Lett.},
volume = {98},
number = {3},
pages = {115--118},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.11.020},
doi = {10.1016/J.IPL.2005.11.020},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JavanianV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangLJ06,
author = {Xianchao Zhang and
Weifa Liang and
He Jiang},
title = {Flow equivalent trees in undirected node-edge-capacitated planar graphs},
journal = {Inf. Process. Lett.},
volume = {100},
number = {3},
pages = {110--115},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2006.06.001},
doi = {10.1016/J.IPL.2006.06.001},
timestamp = {Wed, 03 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangLJ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Gittenberger06,
author = {Bernhard Gittenberger},
title = {Nodes of large degree in random trees and forests},
journal = {Random Struct. Algorithms},
volume = {28},
number = {3},
pages = {374--385},
year = {2006},
url = {https://doi.org/10.1002/rsa.20119},
doi = {10.1002/RSA.20119},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Gittenberger06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dba/ShresthaKYSS06,
author = {Shambhu Shrestha and
Aki Kobayashi and
Katsunori Yamaoka and
Yoshinori Sakai and
Noboru Sonehara},
editor = {M. H. Hamza},
title = {Efficient Content Location Algorithm for Content Distribution Networks
based on Distributed Construction of Search Tree from Contents of
Proximal Nodes},
booktitle = {{IASTED} International Conference on Databases and Applications, part
of the 24th Multi-Conference on Applied Informatics, Innsbruck, Austria,
February 14-16, 2006},
pages = {101--108},
publisher = {{IASTED/ACTA} Press},
year = {2006},
timestamp = {Fri, 19 May 2006 12:55:05 +0200},
biburl = {https://dblp.org/rec/conf/dba/ShresthaKYSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icde/LimKKK06,
author = {Sang{-}Hyuk Lim and
Kyong{-}I Ku and
Ki{-}Chang Kim and
Yoo{-}Sung Kim},
editor = {Roger S. Barga and
Xiaofang Zhou},
title = {A Node Split Algorithm Reducing Overlapped Index Spaces in M-tree
Index},
booktitle = {Proceedings of the 22nd International Conference on Data Engineering
Workshops, {ICDE} 2006, 3-7 April 2006, Atlanta, GA, {USA}},
pages = {15},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/ICDEW.2006.14},
doi = {10.1109/ICDEW.2006.14},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icde/LimKKK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icgi/LemayNG06,
author = {Aur{\'{e}}lien Lemay and
Joachim Niehren and
R{\'{e}}mi Gilleron},
editor = {Yasubumi Sakakibara and
Satoshi Kobayashi and
Kengo Sato and
Tetsuro Nishino and
Etsuji Tomita},
title = {Learning n-Ary Node Selecting Tree Transducers from Completely Annotated
Examples},
booktitle = {Grammatical Inference: Algorithms and Applications, 8th International
Colloquium, {ICGI} 2006, Tokyo, Japan, September 20-22, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4201},
pages = {253--267},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11872436\_21},
doi = {10.1007/11872436\_21},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/icgi/LemayNG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icsnc/zhenjiangy06,
author = {Zhen{-}Jiang Zhang and
Yun Liu},
title = {An Energy-Efficient Redundant Nodes Tree Mechanism for Wireless Sensor
Networks},
booktitle = {Proceedings of the International Conference on Systems and Networks
Communications {(ICSNC} 2006), October 29 - November 3, 2006, Papeete,
Tahiti, French Polynesia},
pages = {63},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/ICSNC.2006.19},
doi = {10.1109/ICSNC.2006.19},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icsnc/zhenjiangy06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/serp/NeedhamJ06,
author = {Donald M. Needham and
Sean Jones},
editor = {Hamid R. Arabnia and
Hassan Reza},
title = {Supporting Software Fault Tree Analysis Using a Key Node Metric},
booktitle = {Proceedings of the International Conference on Software Engineering
Research and Practice {\&} Conference on Programming Languages
and Compilers, {SERP} 2006, Las Vegas, Nevada, USA, June 26-29, 2006,
Volume 2},
pages = {727--733},
publisher = {{CSREA} Press},
year = {2006},
timestamp = {Thu, 10 May 2007 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/serp/NeedhamJ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coling/Kallmeyer05,
author = {Laura Kallmeyer},
title = {Tree-Local Multicomponent Tree-Adjoining Grammars with Shared Nodes},
journal = {Comput. Linguistics},
volume = {31},
number = {2},
pages = {187--225},
year = {2005},
url = {https://doi.org/10.1162/0891201054223968},
doi = {10.1162/0891201054223968},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coling/Kallmeyer05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/FeiY05,
author = {Zongming Fei and
Mengkun Yang},
title = {Restoring Delivery Tree from Node Failures in Overlay Multicast},
journal = {{IEICE} Trans. Commun.},
volume = {88-B},
number = {5},
pages = {2046--2053},
year = {2005},
url = {https://doi.org/10.1093/ietcom/e88-b.5.2046},
doi = {10.1093/IETCOM/E88-B.5.2046},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/FeiY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/IbarakiVY05,
author = {Toshihide Ibaraki and
Yann Vax{\`{e}}s and
Xiao Guang Yang},
title = {Lowering eccentricity of a tree by node upgrading},
journal = {Networks},
volume = {45},
number = {4},
pages = {232--239},
year = {2005},
url = {https://doi.org/10.1002/net.20069},
doi = {10.1002/NET.20069},
timestamp = {Fri, 22 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/IbarakiVY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/RemyS05,
author = {Jan Remy and
Angelika Steger},
editor = {Chandra Chekuri and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems},
booktitle = {Approximation, Randomization and Combinatorial Optimization, Algorithms
and Techniques, 8th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop
on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA,
August 22-24, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3624},
pages = {221--232},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11538462\_19},
doi = {10.1007/11538462\_19},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/RemyS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cnsr/ZouNH05,
author = {Shoudong Zou and
Ioanis Nikolaidis and
Janelle J. Harms},
title = {{ENCAST:} Energy-Critical Node Aware Spanning Tree for Sensor Networks},
booktitle = {Third Annual Conference on Communication Networks and Services Research
{(CNSR} 2005), 16-18 May 2005, Halifax, Novia Scotia, Canada},
pages = {249--254},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CNSR.2005.32},
doi = {10.1109/CNSR.2005.32},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cnsr/ZouNH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infovis/ZhaoMC05,
author = {Shengdong Zhao and
Michael J. McGuffin and
Mark H. Chignell},
editor = {John T. Stasko and
Matthew O. Ward},
title = {Elastic Hierarchies: Combining Treemaps and Node-Link Diagrams},
booktitle = {{IEEE} Symposium on Information Visualization (InfoVis 2005), 23-25
October 2005, Minneapolis, MN, {USA}},
pages = {57--64},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/INFVIS.2005.1532129},
doi = {10.1109/INFVIS.2005.1532129},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/infovis/ZhaoMC05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mldm/BunkeDIK05,
author = {Horst Bunke and
Peter J. Dickinson and
Christophe Irniger and
Miro Kraetzl},
editor = {Petra Perner and
Atsushi Imiya},
title = {Analysis of Time Series of Graphs: Prediction of Node Presence by
Means of Decision Tree Learning},
booktitle = {Machine Learning and Data Mining in Pattern Recognition, 4th International
Conference, {MLDM} 2005, Leipzig, Germany, July 9-11, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3587},
pages = {366--375},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11510888\_36},
doi = {10.1007/11510888\_36},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/mldm/BunkeDIK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/naacl/KazamaT05,
author = {Jun'ichi Kazama and
Kentaro Torisawa},
title = {Speeding up Training with Tree Kernels for Node Relation Labeling},
booktitle = {{HLT/EMNLP} 2005, Human Language Technology Conference and Conference
on Empirical Methods in Natural Language Processing, Proceedings of
the Conference, 6-8 October 2005, Vancouver, British Columbia, Canada},
pages = {137--144},
publisher = {The Association for Computational Linguistics},
year = {2005},
url = {https://aclanthology.org/H05-1018/},
timestamp = {Fri, 06 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/naacl/KazamaT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pakdd/NakamuraK05,
author = {Atsuyoshi Nakamura and
Mineichi Kudo},
editor = {Tu Bao Ho and
David Wai{-}Lok Cheung and
Huan Liu},
title = {Mining Frequent Trees with Node-Inclusion Constraints},
booktitle = {Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia
Conference, {PAKDD} 2005, Hanoi, Vietnam, May 18-20, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3518},
pages = {850--860},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11430919\_101},
doi = {10.1007/11430919\_101},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pakdd/NakamuraK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pdcat/FleischerGLTW05,
author = {Rudolf Fleischer and
Qi Ge and
Jian Li and
Shijun Tian and
Haitao Wang},
title = {Approximating Spanning Trees with Inner Nodes Cost},
booktitle = {Sixth International Conference on Parallel and Distributed Computing,
Applications and Technologies {(PDCAT} 2005), 5-8 December 2005, Dalian,
China},
pages = {660--664},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/PDCAT.2005.91},
doi = {10.1109/PDCAT.2005.91},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pdcat/FleischerGLTW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/MahmoudT04,
author = {Hosam M. Mahmoud and
Tatsuie Tsukiji},
title = {Limit laws for terminal nodes in random circuits with restricted fan-out:
a family of graphs generalizing binary search trees},
journal = {Acta Informatica},
volume = {41},
number = {2-3},
pages = {99--110},
year = {2004},
url = {https://doi.org/10.1007/s00236-004-0152-0},
doi = {10.1007/S00236-004-0152-0},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/MahmoudT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/NardelliPW04,
author = {Enrico Nardelli and
Guido Proietti and
Peter Widmayer},
title = {Nearly Linear Time Minimum Spanning Tree Maintenance for Transient
Node Failures},
journal = {Algorithmica},
volume = {40},
number = {2},
pages = {119--132},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1099-9},
doi = {10.1007/S00453-004-1099-9},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/NardelliPW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Deutsch04a,
author = {Emeric Deutsch},
title = {Ordered trees with prescribed root degrees, node degrees, and branch
lengths},
journal = {Discret. Math.},
volume = {282},
number = {1-3},
pages = {89--94},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2003.10.021},
doi = {10.1016/J.DISC.2003.10.021},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Deutsch04a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/KawatraB04,
author = {Rakesh Kawatra and
Dennis L. Bricker},
title = {Design of a degree-constrained minimal spanning tree with unreliable
links and node outage costs},
journal = {Eur. J. Oper. Res.},
volume = {156},
number = {1},
pages = {73--82},
year = {2004},
url = {https://doi.org/10.1016/S0377-2217(03)00071-7},
doi = {10.1016/S0377-2217(03)00071-7},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/KawatraB04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieiceee/CancelaRR04,
author = {H{\'{e}}ctor Cancela and
Franco Robledo Amoza and
Gerardo Rubino},
title = {Finding Steiner trees with degree 1 terminal nodes},
journal = {{IEICE} Electron. Express},
volume = {1},
number = {9},
pages = {258--262},
year = {2004},
url = {https://doi.org/10.1587/elex.1.258},
doi = {10.1587/ELEX.1.258},
timestamp = {Wed, 14 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieiceee/CancelaRR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/IdwanML04,
author = {Sahar A. Idwan and
Dinesh P. Mehta and
Mario Alberto L{\'{o}}pez},
title = {Fast Pursuit Of Mobile Nodes Using {TPR} Trees},
journal = {Int. J. Found. Comput. Sci.},
volume = {15},
number = {5},
pages = {753--772},
year = {2004},
url = {https://doi.org/10.1142/S012905410400273X},
doi = {10.1142/S012905410400273X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/IdwanML04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pami/MalerbaECA04,
author = {Donato Malerba and
Floriana Esposito and
Michelangelo Ceci and
Annalisa Appice},
title = {Top-Down Induction of Model Trees with Regression and Splitting Nodes},
journal = {{IEEE} Trans. Pattern Anal. Mach. Intell.},
volume = {26},
number = {5},
pages = {612--625},
year = {2004},
url = {https://doi.org/10.1109/TPAMI.2004.1273937},
doi = {10.1109/TPAMI.2004.1273937},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pami/MalerbaECA04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tkde/TaoP04,
author = {Yufei Tao and
Dimitris Papadias},
title = {Performance Analysis of R*-Trees with Arbitrary Node Extents},
journal = {{IEEE} Trans. Knowl. Data Eng.},
volume = {16},
number = {6},
pages = {653--668},
year = {2004},
url = {https://doi.org/10.1109/TKDE.2004.13},
doi = {10.1109/TKDE.2004.13},
timestamp = {Thu, 29 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tkde/TaoP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cis/LiPC04,
author = {Yamin Li and
Shietung Peng and
Wanming Chu},
editor = {Jun Zhang and
Ji{-}Huan He and
Yuxi Fu},
title = {Binomial-Tree Fault Tolerant Routing in Dual-Cubes with Large Number
of Faulty Nodes},
booktitle = {Computational and Information Science, First International Symposium,
{CIS} 2004, Shanghai, China, December 16-18, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3314},
pages = {51--56},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30497-5\_9},
doi = {10.1007/978-3-540-30497-5\_9},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/cis/LiPC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icde/Lomet04,
author = {David B. Lomet},
editor = {Z. Meral {\"{O}}zsoyoglu and
Stanley B. Zdonik},
title = {Simple, Robust and Highly Concurrent B-trees with Node Deletion},
booktitle = {Proceedings of the 20th International Conference on Data Engineering,
{ICDE} 2004, 30 March - 2 April 2004, Boston, MA, {USA}},
pages = {18--27},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/ICDE.2004.1319981},
doi = {10.1109/ICDE.2004.1319981},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icde/Lomet04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icgi/CarmeLN04,
author = {Julien Carme and
Aur{\'{e}}lien Lemay and
Joachim Niehren},
editor = {Georgios Paliouras and
Yasubumi Sakakibara},
title = {Learning Node Selecting Tree Transducer from Completely Annotated
Examples},
booktitle = {Grammatical Inference: Algorithms and Applications, 7th International
Colloquium, {ICGI} 2004, Athens, Greece, October 11-13, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3264},
pages = {91--102},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30195-0\_9},
doi = {10.1007/978-3-540-30195-0\_9},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/icgi/CarmeLN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tag/KallmeyerY04,
author = {Laura Kallmeyer and
SinWon Yoon},
editor = {Owen Rambow and
Matthew Stone},
title = {Tree-local {MCTAG} with Shared Nodes: Word Order Variation in German
and Korean},
booktitle = {Proceedings of the 7th International Workshop on Tree Adjoining Grammar
and Related Formalisms, {TAG+} 2004, Vancouver, Canada, May 20-22,
2004},
pages = {40--47},
publisher = {Simon Fraser University},
year = {2004},
url = {https://aclanthology.org/W04-3306/},
timestamp = {Fri, 06 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tag/KallmeyerY04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/taln/KallmeyerY04,
author = {Laura Kallmeyer and
SinWon Yoon},
editor = {Philippe Blache and
No{\"{e}}l Nguyen and
Nouredine Chenfour and
Abdenbi Rajouani},
title = {Tree-local {MCTAG} with Shared Nodes: An Analysis ofWord Order Variation
in German and Korean},
booktitle = {Actes de la 11{\`{e}}me conf{\'{e}}rence sur le Traitement Automatique
des Langues Naturelles. Articles longs, {TALN} 2004, F{\`{e}}s, Maroc,
April 2004},
pages = {229--238},
publisher = {{ATALA}},
year = {2004},
url = {https://aclanthology.org/2004.jeptalnrecital-long.24/},
timestamp = {Fri, 06 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/taln/KallmeyerY04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/Panholzer03,
author = {Alois Panholzer},
title = {The Height Distribution of Nodes in Non-Crossing Trees},
journal = {Ars Comb.},
volume = {69},
year = {2003},
timestamp = {Tue, 02 Dec 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/Panholzer03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/doceng/Vion-Dury03,
author = {Jean{-}Yves Vion{-}Dury},
title = {XPath on left and right sides of rules: toward compact {XML} tree
rewriting through node patterns},
booktitle = {Proceedings of the 2003 {ACM} Symposium on Document Engineering, Grenoble,
France, November 20-22, 2003},
pages = {19--25},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/958220.958225},
doi = {10.1145/958220.958225},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/doceng/Vion-Dury03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ismis/CeciAM03,
author = {Michelangelo Ceci and
Annalisa Appice and
Donato Malerba},
editor = {Ning Zhong and
Zbigniew W. Ras and
Shusaku Tsumoto and
Einoshin Suzuki},
title = {Comparing Simplification Methods for Model Trees with Regression and
Splitting Nodes},
booktitle = {Foundations of Intelligent Systems, 14th International Symposium,
{ISMIS} 2003, Maebashi City, Japan, October 28-31, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2871},
pages = {49--56},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39592-8\_8},
doi = {10.1007/978-3-540-39592-8\_8},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/ismis/CeciAM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lcn/HanMS03,
author = {Jun Han and
Graham McMahon and
Stephen Sugden},
title = {A Node-oriented Branch and Bound Algorithm for the Capacitated Minimum
Spanning Tree Problem},
booktitle = {28th Annual {IEEE} Conference on Local Computer Networks {(LCN} 2003),
The Conference on Leading Edge and Practical Computer Networking,
20-24 October 2003, Bonn/K{\"{o}}nigswinter, Germany, Proceedings},
pages = {460--469},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/LCN.2003.1243172},
doi = {10.1109/LCN.2003.1243172},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lcn/HanMS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mldm/CeciAM03,
author = {Michelangelo Ceci and
Annalisa Appice and
Donato Malerba},
editor = {Petra Perner and
Azriel Rosenfeld},
title = {Simplification Methods for Model Trees with Regression and Splitting
Nodes},
booktitle = {Machine Learning and Data Mining in Pattern Recognition, Third International
Conference, {MLDM} 2003, Leipzig, Germany, July 5-7, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2734},
pages = {20--34},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45065-3\_3},
doi = {10.1007/3-540-45065-3\_3},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/mldm/CeciAM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sebd/AppiceCEM03,
author = {Annalisa Appice and
Michelangelo Ceci and
Floriana Esposito and
Donato Malerba},
editor = {Sergio Flesca and
Sergio Greco and
Domenico Sacc{\`{a}} and
Ester Zumpano},
title = {Mining Model Trees with Regression and Splitting Nodes},
booktitle = {Proceedings of the Eleventh Italian Symposium on Advanced Database
Systems, {SEBD} 2003, Cetraro (CS), Italy, June 24-27, 2003},
pages = {495--506},
publisher = {Rubettino Editore},
year = {2003},
timestamp = {Mon, 06 Oct 2003 12:10:27 +0200},
biburl = {https://dblp.org/rec/conf/sebd/AppiceCEM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmetrics/HankinsP03,
author = {Richard A. Hankins and
Jignesh M. Patel},
editor = {Bill Cheng and
Satish K. Tripathi and
Jennifer Rexford and
William H. Sanders},
title = {Effect of node size on the performance of cache-conscious B\({}^{\mbox{+}}\)-trees},
booktitle = {Proceedings of the International Conference on Measurements and Modeling
of Computer Systems, {SIGMETRICS} 2003, June 9-14, 2003, San Diego,
CA, {USA}},
pages = {283--294},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/781027.781063},
doi = {10.1145/781027.781063},
timestamp = {Fri, 30 Jul 2021 16:13:32 +0200},
biburl = {https://dblp.org/rec/conf/sigmetrics/HankinsP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/vldb/Koch03,
author = {Christoph Koch},
editor = {Johann Christoph Freytag and
Peter C. Lockemann and
Serge Abiteboul and
Michael J. Carey and
Patricia G. Selinger and
Andreas Heuer},
title = {Efficient Processing of Expressive Node-Selecting Queries on {XML}
Data in Secondary Storage: {A} Tree Automata-based Approach},
booktitle = {Proceedings of 29th International Conference on Very Large Data Bases,
{VLDB} 2003, Berlin, Germany, September 9-12, 2003},
pages = {249--260},
publisher = {Morgan Kaufmann},
year = {2003},
url = {http://www.vldb.org/conf/2003/papers/S09P01.pdf},
doi = {10.1016/B978-012722442-8/50030-6},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/vldb/Koch03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/Csuros02,
author = {Mikl{\'{o}}s Cs{\"{u}}r{\"{o}}s},
title = {Fast Recovery of Evolutionary Trees with Thousands of Nodes},
journal = {J. Comput. Biol.},
volume = {9},
number = {2},
pages = {277--297},
year = {2002},
url = {https://doi.org/10.1089/10665270252935467},
doi = {10.1089/10665270252935467},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/Csuros02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/neco/CoughlanY02,
author = {James M. Coughlan and
Alan L. Yuille},
title = {Bayesian A* Tree Search with Expected {O(N)} Node Expansions: Applications
to Road Tracking},
journal = {Neural Comput.},
volume = {14},
number = {8},
pages = {1929--1958},
year = {2002},
url = {https://doi.org/10.1162/089976602760128072},
doi = {10.1162/089976602760128072},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/neco/CoughlanY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eusipco/AltonWK02,
author = {Kam{-}Fai Chan Alton and
Kam{-}Tim Woo and
Chi{-}Wah Kok},
title = {Vector quantization fast search algorithm using hyperplane based k-dimensional
multi-node search tree},
booktitle = {11th European Signal Processing Conference, {EUSIPCO} 2002, Toulouse,
France, September 3-6, 2002},
pages = {1--4},
publisher = {{IEEE}},
year = {2002},
url = {https://ieeexplore.ieee.org/document/7071990/},
timestamp = {Mon, 09 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/eusipco/AltonWK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/globecom/XueCT02,
author = {Guoliang Xue and
Li Chen and
Krishnaiyan Thulasiraman},
title = {Delay reduction in redundant trees for preplanned protection against
single link/node failure in 2-connected graphs},
booktitle = {Proceedings of the Global Telecommunications Conference, 2002. {GLOBECOM}
'02, Taipei, Taiwan, 17-21 November, 2002},
pages = {2691--2695},
publisher = {{IEEE}},
year = {2002},
url = {https://doi.org/10.1109/GLOCOM.2002.1189118},
doi = {10.1109/GLOCOM.2002.1189118},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/globecom/XueCT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infovis/PlaisantGB02,
author = {Catherine Plaisant and
Jesse Grosjean and
Benjamin B. Bederson},
editor = {Pak Chung Wong and
Keith Andrews},
title = {SpaceTree: Supporting Exploration in Large Node Link Tree, Design
Evolution and Empirical Evaluation},
booktitle = {2002 {IEEE} Symposium on Information Visualization (InfoVis 2002),
27 October - 1 November 2002, Boston, MA, {USA}},
pages = {57--64},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/INFVIS.2002.1173148},
doi = {10.1109/INFVIS.2002.1173148},
timestamp = {Wed, 16 Oct 2019 14:14:53 +0200},
biburl = {https://dblp.org/rec/conf/infovis/PlaisantGB02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscas/ChanWK02,
author = {Kam{-}Fai Chan and
Kam{-}Tim Woo and
Chi{-}Wah Kok},
title = {Vector quantization fast search algorithm using hyperplane based k-dimensional
multi-node search tree},
booktitle = {Proceedings of the 2002 International Symposium on Circuits and Systems,
{ISCAS} 2002, Scottsdale, Arizona, USA, May 26-29, 2002},
pages = {793--796},
publisher = {{IEEE}},
year = {2002},
url = {https://doi.org/10.1109/ISCAS.2002.1009960},
doi = {10.1109/ISCAS.2002.1009960},
timestamp = {Wed, 16 Oct 2019 14:14:49 +0200},
biburl = {https://dblp.org/rec/conf/iscas/ChanWK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ismis/MalerbaACM02,
author = {Donato Malerba and
Annalisa Appice and
Michelangelo Ceci and
Marianna Monopoli},
editor = {Mohand{-}Said Hacid and
Zbigniew W. Ras and
Djamel A. Zighed and
Yves Kodratoff},
title = {Trading-Off Local versus Global Effects of Regression Nodes in Model
Trees},
booktitle = {Foundations of Intelligent Systems, 13th International Symposium,
{ISMIS} 2002, Lyon, France, June 27-29, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2366},
pages = {393--402},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-48050-1\_43},
doi = {10.1007/3-540-48050-1\_43},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/ismis/MalerbaACM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sac/FuTS02,
author = {Yongjian Fu and
Jui{-}Che Teng and
S. R. Subramanya},
editor = {Gary B. Lamont and
Hisham Haddad and
George A. Papadopoulos and
Brajendra Panda},
title = {Node splitting algorithms in tree-structured high-dimensional indexes
for similarity search},
booktitle = {Proceedings of the 2002 {ACM} Symposium on Applied Computing (SAC),
March 10-14, 2002, Madrid, Spain},
pages = {766--770},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/508791.508940},
doi = {10.1145/508791.508940},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sac/FuTS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DasL01,
author = {B. Das and
Michael C. Loui},
title = {Reconstructing a Minimum Spanning Tree after Deletion of Any Node},
journal = {Algorithmica},
volume = {31},
number = {4},
pages = {530--547},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0061-3},
doi = {10.1007/S00453-001-0061-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DasL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jalc/Kemp01,
author = {Rainer Kemp},
title = {On the Expected Number of Leftist Nodes in Simply Generated Trees},
journal = {J. Autom. Lang. Comb.},
volume = {6},
number = {3},
pages = {313--343},
year = {2001},
url = {https://doi.org/10.25596/jalc-2001-313},
doi = {10.25596/JALC-2001-313},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jalc/Kemp01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/Csuros01,
author = {Mikl{\'{o}}s Cs{\"{u}}r{\"{o}}s},
editor = {Thomas Lengauer},
title = {Fast recovery of evolutionary trees with thousands of nodes},
booktitle = {Proceedings of the Fifth Annual International Conference on Computational
Biology, {RECOMB} 2001, Montr{\'{e}}al, Qu{\'{e}}bec, Canada,
April 22-25, 2001},
pages = {104--113},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/369133.369178},
doi = {10.1145/369133.369178},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/Csuros01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MossR01,
author = {Anna Moss and
Yuval Rabani},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Approximation algorithms for constrained for constrained node weighted
steiner tree problems},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {373--382},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380826},
doi = {10.1145/380752.380826},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MossR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/MoonP00,
author = {John W. Moon and
Helmut Prodinger},
title = {A Bijective Proof of an Identity Concerning Nodes of Fixed Degree
in Planted Trees},
journal = {Ars Comb.},
volume = {55},
year = {2000},
timestamp = {Wed, 17 Dec 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/MoonP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ress/PhilipsonW00,
author = {L. L. Philipson and
P. D. Wilde},
title = {Sampling of uncertain probabilities at event tree nodes with multiple
branches},
journal = {Reliab. Eng. Syst. Saf.},
volume = {70},
number = {2},
pages = {197--203},
year = {2000},
url = {https://doi.org/10.1016/S0951-8320(00)00061-2},
doi = {10.1016/S0951-8320(00)00061-2},
timestamp = {Tue, 25 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ress/PhilipsonW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PengHHKT00,
author = {Sheng{-}Lung Peng and
Chin{-}Wen Ho and
Tsan{-}sheng Hsu and
Ming{-}Tat Ko and
Chuan Yi Tang},
title = {Edge and node searching problems on trees},
journal = {Theor. Comput. Sci.},
volume = {240},
number = {2},
pages = {429--446},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00241-8},
doi = {10.1016/S0304-3975(99)00241-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PengHHKT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/edbt/TrainaTSF00,
author = {Caetano Traina Jr. and
Agma J. M. Traina and
Bernhard Seeger and
Christos Faloutsos},
editor = {Carlo Zaniolo and
Peter C. Lockemann and
Marc H. Scholl and
Torsten Grust},
title = {Slim-Trees: High Performance Metric Trees Minimizing Overlap Between
Nodes},
booktitle = {Advances in Database Technology - {EDBT} 2000, 7th International Conference
on Extending Database Technology, Konstanz, Germany, March 27-31,
2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1777},
pages = {51--65},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46439-5\_4},
doi = {10.1007/3-540-46439-5\_4},
timestamp = {Thu, 23 Jun 2022 19:56:44 +0200},
biburl = {https://dblp.org/rec/conf/edbt/TrainaTSF00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/NardelliPW00,
author = {Enrico Nardelli and
Guido Proietti and
Peter Widmayer},
editor = {Mike Paterson},
title = {Maintaining a Minimum Spanning Tree Under Transient Node Failures},
booktitle = {Algorithms - {ESA} 2000, 8th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1879},
pages = {346--355},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45253-2\_32},
doi = {10.1007/3-540-45253-2\_32},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/NardelliPW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpads/ChenJS00,
author = {Yuh{-}Shyan Chen and
Tong{-}Ying Juang and
Ying{-}Ying Shen},
title = {Multi-Node Broadcasting in an Arrangement Graph Using Multiple Spanning
Trees},
booktitle = {Seventh International Conference on Parallel and Distributed Systems,
{ICPADS} 2000, Iwate, Japan, July 4-7, 2000},
pages = {213--220},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/ICPADS.2000.857701},
doi = {10.1109/ICPADS.2000.857701},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icpads/ChenJS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rsctc/Chikalov00,
author = {Igor Chikalov},
editor = {Wojciech Ziarko and
Y. Y. Yao},
title = {On Algorithm for Constructing of Decision Trees with Minimal Number
of Nodes},
booktitle = {Rough Sets and Current Trends in Computing, Second International Conference,
{RSCTC} 2000 Banff, Canada, October 16-19, 2000, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2005},
pages = {139--143},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45554-X\_16},
doi = {10.1007/3-540-45554-X\_16},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/rsctc/Chikalov00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GuhaK99,
author = {Sudipto Guha and
Samir Khuller},
title = {Improved Methods for Approximating Node Weighted Steiner Trees and
Connected Dominating Sets},
journal = {Inf. Comput.},
volume = {150},
number = {1},
pages = {57--74},
year = {1999},
url = {https://doi.org/10.1006/inco.1998.2754},
doi = {10.1006/INCO.1998.2754},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GuhaK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KrumkeMNRRSW99,
author = {Sven Oliver Krumke and
Madhav V. Marathe and
Hartmut Noltemeier and
R. Ravi and
S. S. Ravi and
Ravi Sundaram and
Hans{-}Christoph Wirth},
title = {Improving Minimum Cost Spanning Trees by Upgrading Nodes},
journal = {J. Algorithms},
volume = {33},
number = {1},
pages = {92--111},
year = {1999},
url = {https://doi.org/10.1006/jagm.1999.1021},
doi = {10.1006/JAGM.1999.1021},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KrumkeMNRRSW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DrmotaG99,
author = {Michael Drmota and
Bernhard Gittenberger},
title = {The distribution of nodes of given degree in random trees},
journal = {J. Graph Theory},
volume = {31},
number = {3},
pages = {227--253},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199907)31:3\<227::AID-JGT6\>3.0.CO;2-6},
doi = {10.1002/(SICI)1097-0118(199907)31:3\<227::AID-JGT6\>3.0.CO;2-6},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DrmotaG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsa/Schneeweiss99,
author = {Winfrid G. Schneeweiss},
title = {Fault trees for clusters tolerating failure or disconnectedness of
a single node},
journal = {J. Syst. Archit.},
volume = {45},
number = {11},
pages = {887--895},
year = {1999},
url = {https://doi.org/10.1016/S1383-7621(98)00027-7},
doi = {10.1016/S1383-7621(98)00027-7},
timestamp = {Tue, 19 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsa/Schneeweiss99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/paapp/AntonoiuS99,
author = {Gheorghe Antonoiu and
Pradip K. Srimani},
title = {Self-stabilizing Protocol for Mutual Exclusion among Neighboring Nodes
in a Tree Structured Distributed System},
journal = {Parallel Algorithms Appl.},
volume = {14},
number = {1},
pages = {1--18},
year = {1999},
url = {https://doi.org/10.1080/10637199808947375},
doi = {10.1080/10637199808947375},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/paapp/AntonoiuS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BassinoBP99,
author = {Fr{\'{e}}d{\'{e}}rique Bassino and
Marie{-}Pierre B{\'{e}}al and
Dominique Perrin},
title = {Enumerative Sequences of Leaves and Nodes in Rational Trees},
journal = {Theor. Comput. Sci.},
volume = {221},
number = {1-2},
pages = {41--60},
year = {1999},
url = {https://doi.org/10.1016/S0304-3975(99)00026-2},
doi = {10.1016/S0304-3975(99)00026-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BassinoBP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KrumkeNMRRSW99,
author = {Sven Oliver Krumke and
Hartmut Noltemeier and
Madhav V. Marathe and
R. Ravi and
S. S. Ravi and
Ravi Sundaram and
Hans{-}Christoph Wirth},
title = {Improving Spanning Trees by Upgrading Nodes},
journal = {Theor. Comput. Sci.},
volume = {221},
number = {1-2},
pages = {139--155},
year = {1999},
url = {https://doi.org/10.1016/S0304-3975(99)00030-4},
doi = {10.1016/S0304-3975(99)00030-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KrumkeNMRRSW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/PrcovicN99,
author = {Nicolas Prcovic and
Bertrand Neveu},
editor = {Joxan Jaffar},
title = {Ensuring a Relevant Visiting Order of the Leaf Nodes during a Tree
Search},
booktitle = {Principles and Practice of Constraint Programming - CP'99, 5th International
Conference, Alexandria, Virginia, USA, October 11-14, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1713},
pages = {361--374},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/978-3-540-48085-3\_26},
doi = {10.1007/978-3-540-48085-3\_26},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/cp/PrcovicN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/AntonoiuS99,
author = {Gheorghe Antonoiu and
Pradip K. Srimani},
editor = {Patrick Amestoy and
Philippe Berger and
Michel J. Dayd{\'{e}} and
Iain S. Duff and
Val{\'{e}}rie Frayss{\'{e}} and
Luc Giraud and
Daniel Ruiz},
title = {Mutual Exclusion Between Neighboring Nodes in an Arbitrary System
Graph Tree That Stabilizes Using Read/Write Atomicity},
booktitle = {Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference,
Toulouse, France, August 31 - September 3, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1685},
pages = {823--830},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48311-X\_116},
doi = {10.1007/3-540-48311-X\_116},
timestamp = {Tue, 04 Jun 2019 14:36:07 +0200},
biburl = {https://dblp.org/rec/conf/europar/AntonoiuS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/EngevallGV98,
author = {Stefan Engevall and
Maud G{\"{o}}the{-}Lundgren and
Peter V{\"{a}}rbrand},
title = {A strong lower bound for the Node Weighted Steiner Tree Problem},
journal = {Networks},
volume = {31},
number = {1},
pages = {11--17},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1097-0037(199801)31:1\<11::AID-NET2\>3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0037(199801)31:1\<11::AID-NET2\>3.0.CO;2-N},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/EngevallGV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Kemp98,
author = {Rainer Kemp},
title = {On the joint distribution of the nodes in uniform multidimensional
binary trees},
journal = {Random Struct. Algorithms},
volume = {13},
number = {3-4},
pages = {261--283},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1098-2418(199810/12)13:3/4\<261::AID-RSA5\>3.0.CO;2-T},
doi = {10.1002/(SICI)1098-2418(199810/12)13:3/4\<261::AID-RSA5\>3.0.CO;2-T},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Kemp98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ACMse/WhaleyCED98,
author = {Tom Whaley and
Anurag Chandra and
Noah Egorin and
Wayne M. Dym{\`{a}}cek},
title = {Parallel searches for hereditary node properties in binary trees},
booktitle = {Proceedings of the 36th Annual {ACM} Southeast Regional Conference,
April 1-3, 1998, Marietta, GA, {USA}},
pages = {280--282},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/275295.275371},
doi = {10.1145/275295.275371},
timestamp = {Fri, 12 Mar 2021 15:27:48 +0100},
biburl = {https://dblp.org/rec/conf/ACMse/WhaleyCED98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/PengHHKT98,
author = {Sheng{-}Lung Peng and
Chin{-}Wen Ho and
Tsan{-}sheng Hsu and
Ming{-}Tat Ko and
Chuan Yi Tang},
editor = {Wen{-}Lian Hsu and
Ming{-}Yang Kao},
title = {A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy
of a Tree},
booktitle = {Computing and Combinatorics, 4th Annual International Conference,
{COCOON} '98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1449},
pages = {279--288},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-68535-9\_32},
doi = {10.1007/3-540-68535-9\_32},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/PengHHKT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/AntonoiuS98,
author = {Gheorghe Antonoiu and
Pradip K. Srimani},
editor = {David J. Pritchard and
Jeff Reeve},
title = {Mutual Exclusion Between Neighboring Nodes in a Tree That Stabilizes
Using Read/Write Atomicity},
booktitle = {Euro-Par '98 Parallel Processing, 4th International Euro-Par Conference,
Southampton, UK, September 1-4, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1470},
pages = {545--553},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0057900},
doi = {10.1007/BFB0057900},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/europar/AntonoiuS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GuhaK98,
author = {Sudipto Guha and
Samir Khuller},
editor = {Vikraman Arvind and
Ramaswamy Ramanujam},
title = {Improved Methods for Approximating Node Weighted Steiner Trees and
Connected Dominating Sets},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
18th Conference, Chennai, India, December 17-19, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1530},
pages = {54--65},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/978-3-540-49382-2\_6},
doi = {10.1007/978-3-540-49382-2\_6},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/GuhaK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Kemp98,
author = {Rainer Kemp},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {On the Expected Number of Nodes at Level k in 0-balanced Trees},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {566--576},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028591},
doi = {10.1007/BFB0028591},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Kemp98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/vldb/GarciaLL98,
author = {Yv{\'{a}}n J. Garc{\'{\i}}a and
Mario Alberto L{\'{o}}pez and
Scott T. Leutenegger},
editor = {Ashish Gupta and
Oded Shmueli and
Jennifer Widom},
title = {On Optimal Node Splitting for R-trees},
booktitle = {VLDB'98, Proceedings of 24rd International Conference on Very Large
Data Bases, August 24-27, 1998, New York City, New York, {USA}},
pages = {334--344},
publisher = {Morgan Kaufmann},
year = {1998},
url = {http://www.vldb.org/conf/1998/p334.pdf},
timestamp = {Wed, 06 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/vldb/GarciaLL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TaylorHS97,
author = {Steve Taylor and
Nabil I. Hachem and
Stanley M. Selkow},
title = {The Average Height of a Node in the {BANG} Abstract Directory Tree},
journal = {Inf. Process. Lett.},
volume = {61},
number = {1},
pages = {55--61},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(96)00187-1},
doi = {10.1016/S0020-0190(96)00187-1},
timestamp = {Tue, 27 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/TaylorHS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/vldb/EvangelidisS97,
author = {Georgios Evangelidis and
David B. Lomet and
Betty Salzberg},
title = {The hB-Pi-Tree: {A} Multi-Attribute Index Supporting Concurrency,
Recovery and Node Consolidation},
journal = {{VLDB} J.},
volume = {6},
number = {1},
pages = {1--25},
year = {1997},
url = {https://doi.org/10.1007/s007780050030},
doi = {10.1007/S007780050030},
timestamp = {Sun, 15 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/vldb/EvangelidisS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/BloemE97,
author = {Roderick Bloem and
Joost Engelfriet},
editor = {Jan Mycielski and
Grzegorz Rozenberg and
Arto Salomaa},
title = {Monadic Second Order Logic and Node Relations on Graphs and Trees},
booktitle = {Structures in Logic and Computer Science, {A} Selection of Essays
in Honor of Andrzej Ehrenfeucht},
series = {Lecture Notes in Computer Science},
volume = {1261},
pages = {144--161},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63246-8\_9},
doi = {10.1007/3-540-63246-8\_9},
timestamp = {Sat, 30 May 2020 20:05:53 +0200},
biburl = {https://dblp.org/rec/conf/birthday/BloemE97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/PengHHKT97,
author = {Sheng{-}Lung Peng and
Chin{-}Wen Ho and
Tsan{-}sheng Hsu and
Ming{-}Tat Ko and
Chuan Yi Tang},
editor = {Tao Jiang and
D. T. Lee},
title = {Edge and Node Searching Problems on Trees},
booktitle = {Computing and Combinatorics, Third Annual International Conference,
{COCOON} '97, Shanghai, China, August 20-22, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1276},
pages = {284--293},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0045095},
doi = {10.1007/BFB0045095},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/PengHHKT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/Xue97,
author = {Guoliang Xue},
editor = {Tao Jiang and
D. T. Lee},
title = {A Branch-and-Bound Algorithm for Computing Node Weighted Steiner Minimum
Trees},
booktitle = {Computing and Combinatorics, Third Annual International Conference,
{COCOON} '97, Shanghai, China, August 20-22, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1276},
pages = {383--392},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0045105},
doi = {10.1007/BFB0045105},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/Xue97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KrumkeMNRRSW97,
author = {Sven Oliver Krumke and
Madhav V. Marathe and
Hartmut Noltemeier and
R. Ravi and
S. S. Ravi and
Ravi Sundaram and
Hans{-}Christoph Wirth},
editor = {Pierpaolo Degano and
Roberto Gorrieri and
Alberto Marchetti{-}Spaccamela},
title = {Improving Spanning Trees by Upgrading Nodes},
booktitle = {Automata, Languages and Programming, 24th International Colloquium,
ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1256},
pages = {281--291},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63165-8\_185},
doi = {10.1007/3-540-63165-8\_185},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KrumkeMNRRSW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ideas/ChenB97,
author = {Yangjun Chen and
Wolfgang Benn},
title = {Multidatabase Query Optimization: Tree Balance and Node Allocation},
booktitle = {Proceedings of the International Database Engineering and Applications
Symposium, {IDEAS} 1997, Concordia University, Montreal, Canada, August
25-27, 1997},
pages = {63--72},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/IDEAS.1997.625660},
doi = {10.1109/IDEAS.1997.625660},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ideas/ChenB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/interspeech/DuchateauDC97,
author = {Jacques Duchateau and
Kris Demuynck and
Dirk Van Compernolle},
editor = {George Kokkinakis and
Nikos Fakotakis and
Evangelos Dermatas},
title = {A novel node splitting criterion in decision tree construction for
semi-continuous HMMs},
booktitle = {Fifth European Conference on Speech Communication and Technology,
{EUROSPEECH} 1997, Rhodes, Greece, September 22-25, 1997},
pages = {1183--1186},
publisher = {{ISCA}},
year = {1997},
url = {https://doi.org/10.21437/Eurospeech.1997-19},
doi = {10.21437/EUROSPEECH.1997-19},
timestamp = {Sun, 02 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/interspeech/DuchateauDC97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ssd/AngT97,
author = {Chuan{-}Heng Ang and
T. C. Tan},
editor = {Michel Scholl and
Agn{\`{e}}s Voisard},
title = {New Linear Node Splitting Algorithm for R-trees},
booktitle = {Advances in Spatial Databases, 5th International Symposium, SSD'97,
Berlin, Germany, July 15-18, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1262},
pages = {339--349},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63238-7\_38},
doi = {10.1007/3-540-63238-7\_38},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/ssd/AngT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Underwood96,
author = {Alice Underwood},
title = {A modified Melzak procedure for computing node-weighted Steiner trees},
journal = {Networks},
volume = {27},
number = {1},
pages = {73--79},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0037(199601)27:1\<73::AID-NET6\>3.0.CO;2-B},
doi = {10.1002/(SICI)1097-0037(199601)27:1\<73::AID-NET6\>3.0.CO;2-B},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Underwood96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/prl/BrownPP96,
author = {Donald E. Brown and
Clarence Louis Pittard and
Han Park},
title = {Classification trees with optimal multivariate decision nodes},
journal = {Pattern Recognit. Lett.},
volume = {17},
number = {7},
pages = {699--703},
year = {1996},
url = {https://doi.org/10.1016/0167-8655(96)00033-5},
doi = {10.1016/0167-8655(96)00033-5},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/prl/BrownPP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KestenP96,
author = {Harry Kesten and
Boris G. Pittel},
title = {A local limit theorem for the number of nodes, the height, and the
number of final leaves in a critical branching process tree},
journal = {Random Struct. Algorithms},
volume = {8},
number = {4},
pages = {243--299},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1098-2418(199607)8:4\<243::AID-RSA1\>3.0.CO;2-Y},
doi = {10.1002/(SICI)1098-2418(199607)8:4\<243::AID-RSA1\>3.0.CO;2-Y},
timestamp = {Fri, 26 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KestenP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/vlsi/ChopraT96,
author = {Sunil Chopra and
Kalyan T. Talluri},
title = {Minimum-Cost Node-Disjoint Steiner Trees in Series-Parallel Networks},
journal = {{VLSI} Design},
volume = {4},
number = {1},
pages = {53--57},
year = {1996},
url = {https://doi.org/10.1155/1996/43738},
doi = {10.1155/1996/43738},
timestamp = {Mon, 07 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/vlsi/ChopraT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/edbt/MuthKW96,
author = {Peter Muth and
Achim Kraiss and
Gerhard Weikum},
editor = {Peter M. G. Apers and
Mokrane Bouzeghoub and
Georges Gardarin},
title = {LoT: Dynamic Declustering of TSB-Tree Nodes for Parallel Access to
Temporal Data},
booktitle = {Advances in Database Technology - EDBT'96, 5th International Conference
on Extending Database Technology, Avignon, France, March 25-29, 1996,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1057},
pages = {553--572},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/BFb0014178},
doi = {10.1007/BFB0014178},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/edbt/MuthKW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Mahmoud95,
author = {Hosam M. Mahmoud},
title = {The Joint Distribution of the Three Types of Nodes in Uniform Binary
Trees},
journal = {Algorithmica},
volume = {13},
number = {3},
pages = {313--323},
year = {1995},
url = {https://doi.org/10.1007/BF01190510},
doi = {10.1007/BF01190510},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Mahmoud95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/KimL95,
author = {Changwook Kim and
Dong Hoon Lee},
title = {Node Replacement Graph Languages Squeezed with Chains, Trees, and
Forests},
journal = {Inf. Comput.},
volume = {117},
number = {1},
pages = {63--77},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1029},
doi = {10.1006/INCO.1995.1029},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/KimL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcm/HararyK95,
author = {Frank Harary and
Mohammed Khurrum},
title = {One node fault tolerance for caterpillars and starlike trees},
journal = {Int. J. Comput. Math.},
volume = {56},
number = {3-4},
pages = {135--143},
year = {1995},
url = {https://doi.org/10.1080/00207169508804394},
doi = {10.1080/00207169508804394},
timestamp = {Wed, 12 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcm/HararyK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KleinR95,
author = {Philip N. Klein and
R. Ravi},
title = {A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner
Trees},
journal = {J. Algorithms},
volume = {19},
number = {1},
pages = {104--115},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1029},
doi = {10.1006/JAGM.1995.1029},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KleinR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/MargotPL95,
author = {Fran{\c{c}}ois Margot and
Alain Prodon and
Thomas M. Liebling},
title = {Optimal node disjoint paths on partial 2-trees: {A} linear algorithm
and polyhedral results},
journal = {Math. Methods Oper. Res.},
volume = {41},
number = {3},
pages = {325--346},
year = {1995},
url = {https://doi.org/10.1007/BF01432363},
doi = {10.1007/BF01432363},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/MargotPL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Benczur95,
author = {Andr{\'{a}}s A. Bencz{\'{u}}r},
title = {Counterexamples for Directed and Node Capacitated Cut-Trees},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {505--510},
year = {1995},
url = {https://doi.org/10.1137/S0097539792236730},
doi = {10.1137/S0097539792236730},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Benczur95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/Brodley95,
author = {Carla E. Brodley},
editor = {Armand Prieditis and
Stuart Russell},
title = {Automatic Selection of Split Criterion during Tree Growing Based on
Node Location},
booktitle = {Machine Learning, Proceedings of the Twelfth International Conference
on Machine Learning, Tahoe City, California, USA, July 9-12, 1995},
pages = {73--80},
publisher = {Morgan Kaufmann},
year = {1995},
url = {https://doi.org/10.1016/b978-1-55860-377-6.50018-9},
doi = {10.1016/B978-1-55860-377-6.50018-9},
timestamp = {Wed, 20 Apr 2022 13:29:53 +0200},
biburl = {https://dblp.org/rec/conf/icml/Brodley95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/vldb/EvangelidisLS95,
author = {Georgios Evangelidis and
David B. Lomet and
Betty Salzberg},
editor = {Umeshwar Dayal and
Peter M. D. Gray and
Shojiro Nishio},
title = {The hBP-tree: {A} Modified hB-tree Supporting Concurrency, Recovery
and Node Consolidation},
booktitle = {VLDB'95, Proceedings of 21th International Conference on Very Large
Data Bases, September 11-15, 1995, Zurich, Switzerland},
pages = {551--561},
publisher = {Morgan Kaufmann},
year = {1995},
url = {http://www.vldb.org/conf/1995/P551.PDF},
timestamp = {Sun, 15 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/vldb/EvangelidisLS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KenyonK94,
author = {Claire Kenyon and
Valerie King},
title = {On Boolean Decision Trees with Faulty Nodes},
journal = {Random Struct. Algorithms},
volume = {5},
number = {3},
pages = {453--464},
year = {1994},
url = {https://doi.org/10.1002/rsa.3240050306},
doi = {10.1002/RSA.3240050306},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KenyonK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comcom/LiK93,
author = {Jie Li and
Hisao Kameda},
title = {Effects of node processing time on optimal load balancing in tree
hierarchy network configurations},
journal = {Comput. Commun.},
volume = {16},
number = {12},
pages = {781--793},
year = {1993},
url = {https://doi.org/10.1016/0140-3664(93)90055-W},
doi = {10.1016/0140-3664(93)90055-W},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comcom/LiK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcs/RavindranSG93,
author = {K. Ravindran and
Gurdip Singh and
P. Gupta},
title = {Reconfiguration of Spanning Trees in Networks in the Presence of Node
Failures},
booktitle = {Proceedings of the 13th International Conference on Distributed Computing
Systems, Pittsburgh, Pennsylvania, USA, May 25-28, 1993},
pages = {219--226},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/ICDCS.1993.287705},
doi = {10.1109/ICDCS.1993.287705},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdcs/RavindranSG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/KleinR93a,
author = {Philip N. Klein and
R. Ravi},
editor = {Giovanni Rinaldi and
Laurence A. Wolsey},
title = {A nearly best-possible approximation algorithm for node-weighted Steiner
trees},
booktitle = {Proceedings of the 3rd Integer Programming and Combinatorial Optimization
Conference, Erice, Italy, April 29 - May 1, 1993},
pages = {323--332},
publisher = {{CIACO}},
year = {1993},
timestamp = {Mon, 31 Aug 2015 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/KleinR93a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Prodon92,
author = {Alain Prodon},
title = {Steiner trees with n terminals among n + 1 nodes},
journal = {Oper. Res. Lett.},
volume = {11},
number = {3},
pages = {125--133},
year = {1992},
url = {https://doi.org/10.1016/0167-6377(92)90075-E},
doi = {10.1016/0167-6377(92)90075-E},
timestamp = {Thu, 23 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Prodon92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MahmoudS92,
author = {Hosam M. Mahmoud and
Robert T. Smythe},
title = {Asymptitic Hoint Normality of Outdegrees of Nodes in Random Recursive
Trees},
journal = {Random Struct. Algorithms},
volume = {3},
number = {3},
pages = {255--266},
year = {1992},
url = {https://doi.org/10.1002/rsa.3240030305},
doi = {10.1002/RSA.3240030305},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/MahmoudS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Prodinger92,
author = {Helmut Prodinger},
title = {External Internal Nodes in Digital Search Trees via Mellin Transforms},
journal = {{SIAM} J. Comput.},
volume = {21},
number = {6},
pages = {1180--1183},
year = {1992},
url = {https://doi.org/10.1137/0221069},
doi = {10.1137/0221069},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Prodinger92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icassp/SullivanB92,
author = {Gary J. Sullivan and
Richard L. Baker},
title = {Rate-distortion optimization for tree-structured source coding with
multi-way node decisions},
booktitle = {1992 {IEEE} International Conference on Acoustics, Speech, and Signal
Processing, {ICASSP} '92, San Francisco, California, USA, March 23-26,
1992},
pages = {393--396},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/ICASSP.1992.226193},
doi = {10.1109/ICASSP.1992.226193},
timestamp = {Mon, 09 Aug 2021 14:54:02 +0200},
biburl = {https://dblp.org/rec/conf/icassp/SullivanB92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/KenyonK92,
author = {Claire Kenyon and
Valerie King},
editor = {Danny Dolev and
Zvi Galil and
Michael Rodeh},
title = {On Boolean Decision Trees with Faulty Nodes},
booktitle = {Theory of Computing and Systems, ISTCS'92, Israel Symposium, Haifa,
Israel, May 1992},
series = {Lecture Notes in Computer Science},
volume = {601},
pages = {24--31},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/BFb0035163},
doi = {10.1007/BFB0035163},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/istcs/KenyonK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CuntoY92,
author = {Walter Cunto and
Vicente Yriarte},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {GKD-Trees: Binary Trees that Combine Multi-dimensional Data Handling,
Node Size and Fringe Reorganization},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {192--211},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_17},
doi = {10.1007/3-540-55706-7\_17},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/CuntoY92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/VaishnaviK91,
author = {Vijay K. Vaishnavi and
Timothy D. Korson},
title = {Height-Analysis of \emph{k}-Dimensional Leaf and Node Height-Balanced
Trees: {A} New Approach},
journal = {{BIT}},
volume = {31},
number = {1},
pages = {36--49},
year = {1991},
url = {https://doi.org/10.1007/BF01952781},
doi = {10.1007/BF01952781},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/VaishnaviK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Taylor91,
author = {Herbert Taylor},
title = {A distinct distance set of 9 nodes in a tree of diameter 36},
journal = {Discret. Math.},
volume = {93},
number = {2-3},
pages = {167--168},
year = {1991},
url = {https://doi.org/10.1016/0012-365X(91)90252-W},
doi = {10.1016/0012-365X(91)90252-W},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Taylor91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Mata-Montero91,
author = {Erick Mata{-}Montero},
title = {Resilience of partial \emph{k}-tree networks with edge and node failures},
journal = {Networks},
volume = {21},
number = {3},
pages = {321--344},
year = {1991},
url = {https://doi.org/10.1002/net.3230210305},
doi = {10.1002/NET.3230210305},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Mata-Montero91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Kemp90,
author = {R. Kemp},
title = {On the number of deepest nodes in ordered trees},
journal = {Discret. Math.},
volume = {81},
number = {3},
pages = {247--258},
year = {1990},
url = {https://doi.org/10.1016/0012-365X(90)90064-O},
doi = {10.1016/0012-365X(90)90064-O},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Kemp90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/spe/Walker90,
author = {John Q. Walker II},
title = {A Node-positioning Algorithm for General Trees},
journal = {Softw. Pract. Exp.},
volume = {20},
number = {7},
pages = {685--705},
year = {1990},
url = {https://doi.org/10.1002/spe.4380200705},
doi = {10.1002/SPE.4380200705},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/spe/Walker90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/PramanikK90,
author = {Sakti Pramanik and
Myoung{-}Ho Kim},
title = {Parallel Processing of Large Node B-Trees},
journal = {{IEEE} Trans. Computers},
volume = {39},
number = {9},
pages = {1208--1212},
year = {1990},
url = {https://doi.org/10.1109/12.57061},
doi = {10.1109/12.57061},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/PramanikK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icde/OhsawaS90,
author = {Yutaka Ohsawa and
Masao Sakauchi},
title = {A New Tree Type Data Structure with Homogeneous Nodes Suitable for
a Very Large Spatial Database},
booktitle = {Proceedings of the Sixth International Conference on Data Engineering,
February 5-9, 1990, Los Angeles, California, {USA}},
pages = {296--303},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/ICDE.1990.113481},
doi = {10.1109/ICDE.1990.113481},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icde/OhsawaS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Schaffer89,
author = {Alejandro A. Sch{\"{a}}ffer},
title = {Optimal Node Ranking of Trees in Linear Time},
journal = {Inf. Process. Lett.},
volume = {33},
number = {2},
pages = {91--96},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90161-0},
doi = {10.1016/0020-0190(89)90161-0},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Schaffer89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IyerRV88,
author = {Ananth V. Iyer and
H. Donald Ratliff and
Gopalakrishnan Vijayan},
title = {Optimal Node Ranking of Trees},
journal = {Inf. Process. Lett.},
volume = {28},
number = {5},
pages = {225--229},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90194-9},
doi = {10.1016/0020-0190(88)90194-9},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/IyerRV88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/MeirM88,
author = {Amram Meir and
John W. Moon},
title = {On maximal independent sets of nodes in trees},
journal = {J. Graph Theory},
volume = {12},
number = {2},
pages = {265--283},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120217},
doi = {10.1002/JGT.3190120217},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/MeirM88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcs/Lien88,
author = {Yao{-}Nan Lien},
title = {A New Node-Join-Tree Distributed Algorithm for Minimum Weight Spanning
Trees},
booktitle = {Proceedings of the 8th International Conference on Distributed Computing
Systems, San Jose, California, USA, June 13-17, 1988},
pages = {334--340},
publisher = {{IEEE} Computer Society},
year = {1988},
url = {https://doi.org/10.1109/DCS.1988.12534},
doi = {10.1109/DCS.1988.12534},
timestamp = {Wed, 16 Oct 2019 14:14:50 +0200},
biburl = {https://dblp.org/rec/conf/icdcs/Lien88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/KleinW87,
author = {Rolf Klein and
Derick Wood},
title = {The Node Visit Cost of Brother Trees},
journal = {Inf. Comput.},
volume = {75},
number = {2},
pages = {107--129},
year = {1987},
url = {https://doi.org/10.1016/0890-5401(87)90053-8},
doi = {10.1016/0890-5401(87)90053-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/KleinW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Segev87,
author = {Arie Segev},
title = {The node-weighted steiner tree problem},
journal = {Networks},
volume = {17},
number = {1},
pages = {1--17},
year = {1987},
url = {https://doi.org/10.1002/net.3230170102},
doi = {10.1002/NET.3230170102},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Segev87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Brinck86,
author = {Keith Brinck},
title = {Computing Parent Nodes in Threaded Binary Trees},
journal = {{BIT}},
volume = {26},
number = {4},
pages = {401--409},
year = {1986},
url = {https://doi.org/10.1007/BF01935047},
doi = {10.1007/BF01935047},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Brinck86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scjapan/MasuzawaHTW86,
author = {Toshimitsu Masuzawa and
Kenichi Hagihara and
Nobuki Tokura and
Koichi Wada},
title = {Optimal-Time Algorithm for the k-Node-Connectivity Augmentation Problem
for Ternary Trees},
journal = {Syst. Comput. Jpn.},
volume = {17},
number = {3},
pages = {56--65},
year = {1986},
url = {https://doi.org/10.1002/scj.4690170307},
doi = {10.1002/SCJ.4690170307},
timestamp = {Mon, 22 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scjapan/MasuzawaHTW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigcse/Khuri86,
author = {Sami Khuri},
editor = {Joyce Currie Little and
Lillian N. Cassel},
title = {Counting nodes in binary trees},
booktitle = {Proceedings of the 17th {SIGCSE} Technical Symposium on Computer Science
Education, {SIGCSE} 1986, Cincinnati, Ohio, USA, February 6-7, 1986},
pages = {182--185},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/5600.5646},
doi = {10.1145/5600.5646},
timestamp = {Tue, 23 Mar 2021 12:04:03 +0100},
biburl = {https://dblp.org/rec/conf/sigcse/Khuri86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KleinW86,
author = {Rolf Klein and
Derick Wood},
editor = {Gottfried Tinhofer and
Gunther Schmidt},
title = {The Node Visit Cost of Brother Trees},
booktitle = {Graphtheoretic Concepts in Computer Science, International Workshop,
{WG} '86, Bernried, Germany, June 17-19, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {246},
pages = {106--117},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-17218-1\_53},
doi = {10.1007/3-540-17218-1\_53},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KleinW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eik/Budach85,
author = {Lothar Budach},
title = {A Lower Bound for the Number of Nodes in a Decision Tree},
journal = {J. Inf. Process. Cybern.},
volume = {21},
number = {4/5},
pages = {221--228},
year = {1985},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eik/Budach85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Prodinger84,
author = {Helmut Prodinger},
title = {On the altitude of specified nodes in random trees},
journal = {J. Graph Theory},
volume = {8},
number = {4},
pages = {481--485},
year = {1984},
url = {https://doi.org/10.1002/jgt.3190080405},
doi = {10.1002/JGT.3190080405},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Prodinger84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pami/Lu84,
author = {S. Y. Lu},
title = {A Tree-Matching Algorithm Based on Node Splitting and Merging},
journal = {{IEEE} Trans. Pattern Anal. Mach. Intell.},
volume = {6},
number = {2},
pages = {249--256},
year = {1984},
url = {https://doi.org/10.1109/TPAMI.1984.4767511},
doi = {10.1109/TPAMI.1984.4767511},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pami/Lu84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/Ballard83,
author = {Bruce W. Ballard},
title = {The *-Minimax Search Procedure for Trees Containing Chance Nodes},
journal = {Artif. Intell.},
volume = {21},
number = {3},
pages = {327--350},
year = {1983},
url = {https://doi.org/10.1016/S0004-3702(83)80015-0},
doi = {10.1016/S0004-3702(83)80015-0},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/Ballard83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Jamison83,
author = {Robert E. Jamison},
title = {On the average number of nodes in a subtree of a tree},
journal = {J. Comb. Theory, Ser. {B}},
volume = {35},
number = {3},
pages = {207--223},
year = {1983},
url = {https://doi.org/10.1016/0095-8956(83)90049-7},
doi = {10.1016/0095-8956(83)90049-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Jamison83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcs/Kemp83,
author = {R. Kemp},
editor = {Armin B. Cremers and
Hans{-}Peter Kriegel},
title = {The expected number of nodes and leaves at level k in ordered trees},
booktitle = {Theoretical Computer Science, 6th GI-Conference, Dortmund, Germany,
January 5-7, 1983, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {145},
pages = {153--163},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/BFb0009641},
doi = {10.1007/BFB0009641},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/tcs/Kemp83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toplas/Hansen81,
author = {Wilfred J. Hansen},
title = {A Cost Model for the Internal Organization of B+-Tree Nodes},
journal = {{ACM} Trans. Program. Lang. Syst.},
volume = {3},
number = {4},
pages = {508--532},
year = {1981},
timestamp = {Wed, 26 Nov 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toplas/Hansen81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcs/OttmannRSW79,
author = {Thomas Ottmann and
Arnold L. Rosenberg and
Hans{-}Werner Six and
Derick Wood},
editor = {Klaus Weihrauch},
title = {Node-Visit Optimal 1-2 Brother Trees},
booktitle = {Theoretical Computer Science, 4th GI-Conference, Aachen, Germany,
March 26-28, 1979, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {67},
pages = {213--221},
publisher = {Springer},
year = {1979},
url = {https://doi.org/10.1007/3-540-09118-1\_23},
doi = {10.1007/3-540-09118-1\_23},
timestamp = {Fri, 17 Jul 2020 16:12:47 +0200},
biburl = {https://dblp.org/rec/conf/tcs/OttmannRSW79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/Newborn77,
author = {Monroe M. Newborn},
title = {The Efficiency of the Alpha-Beta Search on Trees with Branch-Dependent
Terminal Node Scores},
journal = {Artif. Intell.},
volume = {8},
number = {2},
pages = {137--153},
year = {1977},
url = {https://doi.org/10.1016/0004-3702(77)90017-0},
doi = {10.1016/0004-3702(77)90017-0},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/Newborn77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigplan/Dailey12,
author = {W. H. Dailey},
title = {On generating binary decision trees with minimum nodes},
journal = {{ACM} {SIGPLAN} Notices},
volume = {10},
number = {12},
pages = {14--21},
year = {1975},
url = {https://doi.org/10.1145/987686.987688},
doi = {10.1145/987686.987688},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigplan/Dailey12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-05-08 02:01 CEST from data curated 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:
