Selected Publications

Papers

• J. Lenchner, "A New Proof of the Sylvester-Gallai Theorem," Geombinatorics, XVIII(4):171-174, 2009.

• L. Berman, B. Grunbaum and J. Lenchner, "Omittable Lines," Ars Mathematica Contemporanea, 2(1) 206-222, 2008.

• D. Bremner, J. Lenchner, B. Liotta, C. Paul, M. Pouget, S. Stolpner and S Wismath, "A Note on alpha-drawable k-trees," Proceedings of the 20th Canadian Conference on Computational Geometry (CCCG), 2008.

• J. Lenchner, "An Improved Bound for the Affine Sylvester Problem," Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG), 57-60, 2007.

• H. Bronnimann, J. Lenchner and J. Pach "Opposite Quadrant Depth in the Plane," Graphs and Combinatorics (23) 145-152, 2007.

• M. Brodie, J. Lai, J. Lenchner, L. Luan, W. Luken, K. Ranganathan, J-M. Tang and M. Vukovic "Support Services: Persuading Employees and Customers to do what is in the Community's Best Interest," Proceedings of Persuasive07, 2007.

• H. Alt, E. Arkin, H. Bronnimann, J. Erickson, S. Fekete, C. Knauer, J, Lenchner, J. Mitchell and K. Whittlesey, "Minimum-cost Coverage of Point Sets by Disks," Proceedings of the 22nd Annual Symposium on Computational Geometry (SCG06), 449-458, 2006.

• A. Beygelzimer, M. Brodie, J. Lenchner, and I. Rish, "Automated Knowledge Elicitation and Flowchart Optimization for Problem Diagnosis," 4th Bayesian Modeling Applications Workshop, UAI (Uncertainty in Artificial Intelligence), 2006.

• J. Lenchner and H. Bronnimann, "On the Number of Euclidean Ordinary Points for Lines in the Plane," Geombinatorics, XVI(1):227-234, 2006.

• H. Bronnimann and J. Lenchner, "Observations and Computations in Sylvester-Gallai Theory," 17th Canadian Conference on Computational Geometry (CCCG), 55-58, 2005.

• J. Lenchner, "Wedges in Euclidean arrangements," In J. Akiyama, M. Kano and X. Tan, editors, Discrete and Computational Geometry: 2004 Japan Conference on Discrete and Computational Geometry, volume 3742 of Lecture Notes in Computer Science, Springer, 2005.

• J. Lenchner, "On the dual and sharpened dual of Sylvester's Theorem in the plane," IBM Research Report, RC23411 (W0409-066), 2004.

Workshop Abstracts (those not completely incorporated into papers)

• R. Das, J. Kephart, J. Lenchner and E. Packer "Internal Surveillance Problems in Data Centers," Fall Workshop on Computational Geometry, Rensselaer Polytechnic Institute, November 2008.

• J. Lenchner, J. Lai, S. Guo and J-M. Tang "Supporting Real-Time Problem Resolution via Just-in-Time Collaboration with Experts," Intelligent User Interfaces, IUI 2008, Workshop on Recommendation and Collaboration, 2008.

• J. Lenchner, "Ordinary Points in Polygons," Fall Workshop on Computational Geometry, IBM T.J. Watson Research Center, November, 2007.

• J. Lenchner, "Faster Dynamic Programming Algorithms for Facility Location," Fall Workshop on Computational Geometry, Smith College, November, 2006.

• J. Lenchner, "Minimum Outer Layer and Zone Complexity," Fall Workshop on Computational Geometry, Smith College, November, 2006.

• H. Bronnimann and J. Lenchner, "Fast alomst-linear sized nets for boxes in the plane," Fall Workshop on Computational Geometry, MIT, November, 2004.

Book Chapter

• T. Cofino, J. Kramer, J. Lenchner, S. Noronha, and J. Vergo, "E-commerce interface design," in The Human-Computer Interactions Handbook: Fudnamentals, Evolving Technologies and Emerging Applications, pp.757-771. Lawrence Erlbaum Associates, 2002.

Thesis

• J. Lenchner, "Sylvester-Gallai Results and Other Contributions to Combinatorial and Computational Geometry," Ph.D. Dissertation. Polytechnic University, Department of Mathematics, Brooklyn, NY, 2008.