Author:
Chen Danny Z.,Misiołek Ewa
Subject
General Computer Science,Theoretical Computer Science
Reference37 articles.
1. M. Abellanas, F. Hurtado, C. Icking, R. Klein, E. Langetepe, L. Ma, B. Palop, V. Sacristan, Smallest color-spanning objects, in: Proceedings of the 9th Annual European Symposium, 2001, pp. 278–289.
2. An optimal parallel algorithm for the minimum circle-cover problem;Atallah;Information Processing Letters,1989
3. An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications;Atallah;Algorithmica,1995
4. Finding level-ancestors in trees;Berkman;Journal of Computer and System Sciences,1994
5. Parallel circle-cover algorithms;Bertossi;Information Processing Letters,1988
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Color-spanning localized query;Theoretical Computer Science;2021-03
2. Color spanning objects: Algorithms and hardness results;Discrete Applied Mathematics;2020-06
3. Localized Query: Color Spanning Variations;Algorithms and Discrete Applied Mathematics;2019
4. Minimum width color spanning annulus;Theoretical Computer Science;2018-05
5. Minimum Width Color Spanning Annulus;Lecture Notes in Computer Science;2016