Author:
Abello J.,Egecioglu O.,Kumar K.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference24 articles.
1. J. Abello, A study of an independence system arising in group choice via the weak Bruhat order, Ph.D. Dissertation, University of California, San Diego, CA, 1985.
2. J. Abello, The weak Bruhat order ofS σ, consistent sets, and Catalan numbers,SIAM Journal of Discrete Mathematics,4 (1991), 1–16.
3. J. Abello and O. Egecioglu, Visibility graphs of staircase polygons with uniform step length,International Journal of Discrete and Computational Geometry,3(1) (1993), 27–37.
4. J. Abello, O. Egecioglu, and K. Kumar, Visibility graphs of staircase polygons and the weak Bruhat order, II: From maximal chains to polygons, Preprint.
5. J. Abello, O. Egecioglu, and K. Kumar, A combinatorial view of visibility graphs of simple polygons,Proceedings of the Fifth International Conference on Computing and Information, Ontario, 1993, pp. 87–92.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献