SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Computational Geometry: Theory and Applications

Volumn 16, Issue 4, 2000, Pages 211-221

Lower bounds on the number of crossing-free subgraphs of KN

(3) Garcìa, Alfredo a Noy, Marc b Tejel, Javier a

a UNIVERSITY OF ZARAGOZA (Spain)

b UNIVERSITAT POLITÈCNICA DE CATALUNYA (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003588530 PISSN: 09257721 EISSN: None Source Type: Journal
DOI: 10.1016/S0925-7721(00)00010-9 Document Type: Article

Times cited : (96)

References (17)

1
- 0002003776
- Crossing-free subgraphs
- M. Ajtai, V. Chvátal, M.M. Newborn, E. Szemerédi, Crossing-free subgraphs, Ann. Discrete Math. 12 (1982) 9-12.
- (1982) Ann. Discrete Math. , vol.12 , pp. 9-12
- Ajtai, M.¹ Chvátal, V.² Newborn, M.M.³ Szemerédi, E.⁴

2
- 0013522779
- n
- n, Ars Combin. 7 (1979) 7-18.
- (1979) Ars Combin. , vol.7 , pp. 7-18
- Akl, S.¹

3
- 0016114863
- Asymptotic methods in enumeration
- E.A. Bender, Asymptotic methods in enumeration, SIAM Rev. 16 (1974) 485-515.
- (1974) SIAM Rev. , vol.16 , pp. 485-515
- Bender, E.A.¹

4
- 38248998549
- Cordes, arbres et permutations
- S. Dulucq, J.G. Penaud, Cordes, arbres et permutations, Discrete Math. 117 (1993) 89-105.
- (1993) Discrete Math. , vol.117 , pp. 89-105
- Dulucq, S.¹ Penaud, J.G.²

5
- 21844483565
- The order of points on the second convex hull of a simple polygon
- A. García, J. Tejel, The order of points on the second convex hull of a simple polygon, Discrete Comput. Geom. 14 (1995) 185-205.
- (1995) Discrete Comput. Geom. , vol.14 , pp. 185-205
- García, A.¹ Tejel, J.²

6
- 0032147754
- A lower bound for the number of polygonizations of N points in the plane
- A. García, J. Tejel, A lower bound for the number of polygonizations of N points in the plane, Ars Combin. 49 (1998) 3-19.
- (1998) Ars Combin. , vol.49 , pp. 3-19
- García, A.¹ Tejel, J.²

7
- 0000391389
- A lower bound for the optimal crossing-free Hamiltonian cycle problem
- R.B. Hayward, A lower bound for the optimal crossing-free Hamiltonian cycle problem, Discrete Comput. Geom. 2 (1987) 327-343.
- (1987) Discrete Comput. Geom. , vol.2 , pp. 327-343
- Hayward, R.B.¹

8
- 0039471840
- Counting triangulations of almost-convex polygons
- F. Hurtado, M. Noy, Counting triangulations of almost-convex polygons, Ars Combin. 45 (1997) 169-179.
- (1997) Ars Combin. , vol.45 , pp. 169-179
- Hurtado, F.¹ Noy, M.²

9
- 0004427087
- The art of computer programming
- Addison-Wesley, Reading, MA
- D.E. Knuth, The Art of Computer Programming, Volume 1, Fundamental Algorithms, Addison-Wesley, Reading, MA, 1973.
- (1973) Fundamental Algorithms , vol.1
- Knuth, D.E.¹

10
- 0001114129
- Relations between cross ratios hypersurfaces and a combinatorial formula for partitions of a polygon, for permanent preponderance and for non-associative products
- T. Motzkin, Relations between cross ratios hypersurfaces and a combinatorial formula for partitions of a polygon, for permanent preponderance and for non-associative products, Bull. AMS 54 (1948) 352-360.
- (1948) Bull. AMS , vol.54 , pp. 352-360
- Motzkin, T.¹

11
- 0013553411
- n
- n, J. Combin. Theory Ser. B 29 (1980) 13-26.
- (1980) J. Combin. Theory Ser. B , vol.29 , pp. 13-26
- Newborn, M.¹ Moser, W.O.J.²

12
- 0004730218
- Enumeration of non-crossing trees
- M. Noy, Enumeration of non-crossing trees, Discrete Math. 180 (1998) 301-313.
- (1998) Discrete Math. , vol.180 , pp. 301-313
- Noy, M.¹

13
- 22444456350
- On the number of triangulations of planar point sets
- R. Seidel, On the number of triangulations of planar point sets, Combinatorica 18 (1998) 297-299.
- (1998) Combinatorica , vol.18 , pp. 297-299
- Seidel, R.¹

14
- 0004076237
- Ph.D. Thesis, Princeton University
- W.D. Smith, Studies in computational geometry motivated by mesh generation, Ph.D. Thesis, Princeton University, 1989.
- (1989) Studies in Computational Geometry Motivated by Mesh Generation
- Smith, W.D.¹

15
- 0004156748
- Cambridge University Press, Cambridge
- J.H. van Lint, R.M. Wilson, A Course in Combinatorics, Cambridge University Press, Cambridge, 1992.
- (1992) A Course in Combinatorics
- Van Lint, J.H.¹ Wilson, R.M.²

16
- 0002212968
- Encoding a triangulation as a permutation of its point set
- M. Denny, C. Sohler, Encoding a triangulation as a permutation of its point set, in: Proc. of 9th Canadian Conf. on Comput. Geometry, 1997, pp. 39-43.
- (1997) Proc. of 9th Canadian Conf. on Comput. Geometry , pp. 39-43
- Denny, M.¹ Sohler, C.²

17
- 0346920869
- On two lower bound constructions
- A. Dumitrescu, On two lower bound constructions, in: Proc. of 11th Canadian Conf. on Comput. Geometry, 1999, pp. 111-114.
- (1999) Proc. of 11th Canadian Conf. on Comput. Geometry , pp. 111-114
- Dumitrescu, A.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.