Combinatorics & Computational Geometry (This page is NOT up-to-date)

1. An Improved Upper Bound on the Size of Planar Convex-Hulls ,
   Proc. 7th Annual International Computing and Combinatorics Conference (COCOON'01), LNCS 2108, Guilin, China, August 2001, pp. 111-120, (with A. Arslan).
2. Polynomial Families Satisfying a Riemann Hypothesis,
   Congressus Numerantium, to appear (with C. Ryavec).
3. The Isoperimetric Number of d-dimensional k-ary Arrays,
   Int. J. of Foundations of Computer Sci., 10 (3), (1999), pp. 289-300 (with C.M. Azizoglu).
4. Random Walks and Catalan Factorization,
   Congressus Numerantium, 138 (1999), pp. 129-140 (with A. King).
5. Isoperimetric Number of the Cartesian Product of Graphs and Paths,
   Congressus Numerantium, 131 (1998), pp. 135-143, (with C.M. Azizoglu).
6. Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems,
   Int. J. of Foundations of Computer Sci. 9 (4), 1998, pp. 351-375 (with P. Cappello).
7. A Computationally Intractable Problem on Simplicial Complexes,
   Computational Geometry, Theory and Applications, 6 (1996), pp. 85-98 (with T. Gonzalez).
8. Visibility Graphs of Staircase Polygons and the Weak Bruhat Order I: From Visibility Graphs to Maximal Chains,
   Discrete Computational Geometry, Vol. 14 (1995), pp. 331-358 (with J. Abello and K. Kumar).
9. Visibility Graphs of Staircase Polygons and the Weak Bruhat Order II: From Maximal Chains to Polygons,
   Discrete and Computational Geometry, to appear (with J. Abello and K. Kumar).
10. Parallelogram-Law Type Identities,
    Linear Algebra and Its Applications, Vol. 225 (1995), pp. 1-12.
11. A Bijection for Spanning Trees of Complete Multipartite Graphs,
    Congressus Numerantium, Vol. 100 (1994), pp. 225-243, (with J. Remmel).
12. Visibility Graphs of Staircase Polygons with Uniform Step Length,
    Int. J. of Computational Geometry, Vol. 3, No.1 (1993), pp. 27-38 (with J. Abello).
13. A Combinatorial Generalization of a Putnam Problem,
    The American Mathematical Monthly, Vol. 99, No. 3 (1992), pp. 256-258.
14. Skew Symmetric Matrices and the Pfaffian,
    Ars Combinatoria, 29 (1990), pp. 107-116.
15. Monomial Symmetric Functions and the Frobenius Map,
    Journal of Combinatorial Theory, Series A, 54 (1990), pp. 272-295 (with J. Remmel).
16. A Combinatorial Interpretation of the Inverse Kostka Matrix,
    Linear and Multilinear Algebra, 26 (1990), pp. 59-84 (with J. Remmel).
17. Approximating the Diameter of a Set of Points in the Euclidean Space,
    Information Processing Letters, 32 (1989), pp. 205-211 (with B. Kalantari).
18. A Bijective Proof for the Number of Labeled q-trees,
    Ars Combinatoria, 25B (1988), pp. 3-30, (with L.P. Shen).
19. A Combinatorial Proof of the Giambelli Identity for Schur Functions,
    Advances in Mathematics, 70 (1988), pp. 59-86 (with J. Remmel).
20. Bijections for Cayley Trees, Spanning Trees, and Their q-analogues,
    Journal of Combinatorial Theory, Series A, 42, No. 1 (1986), pp. 15-30 (with J. Remmel).
21. Symmetric and Antisymmetric Outer Plethysms of Schur Functions,
    Atomic Data and Nuclear Data Tables, 32 (1985), pp. 157-196 (with J. Remmel).
22. Algorithms for the Character Theory of the Symmetric Group,
    Springer-Verlag Lecture Notes in Computer Science, 204 (1985), pp. 206-224.
23. Murnaghan's Rule and the Irreducible Characters of the Symmetric Group,
    Computer Physics Communications, 31 (1984), pp. 357-362 (with Geraldo M. Costa).
24. Computation of Outer Products of Schur Functions,
    Computer Physics Communications, 28 (1982), pp. 183-187.