Directory

Faculty Placeholder

Elie Feder

Professor

Mathematics & Computer Science

CURRICULUM VITAE

NAME Elie Feder COLLEGE KINGSBOROUGH COMMUNITY COLLEGE
TITLE Professor DEPARTMENT Mathematics and Computer Science
HIGHER EDUCATION
Degrees
Institution Degree and Major Date Conferred
CUNY Graduate Center Ph.D. Mathematics 2003
Queens College MA Mathematics 1999
Queens College BA Mathematics 1997
EXPERIENCE
A. Teaching
Institution Dates Rank Department
Kingsborough Community College 9/13-present Professor Math and CS
Kingsborough Community College 9/09-9/13 Associate Professor Math and CS
Kingsborough Community College 9/04-9/09 Assistant Professor Math and CS
ACADEMIC AND PROFESSIONAL HONORS
  • Science Fellowship, CUNY Graduate Center
  • Thomas A. Budne Award for Excellence in Mathematics
  • Banesh Hoffman Memorial Award for Excellence in Mathematics
  • Alumni Association for Queens College Award
  • Pi Mu Epsilon National Honor Society
  • Magna cum Laude from Queens College
  • 2008 Kingsborough Community College Faculty Achievement Recognition Award
  • 2009 Kingsborough Community College Faculty Achievement Recognition Award
  • 2010 Kingsborough Community College Faculty Achievement Recognition Award
  • 2012 Kingsborough Community College Faculty Achievement Recognition Award
  • CUNY Chancellor's Research Fellowship for 2015-2016
PUBLICATIONS
BOOK:

Algorithmic Problems in the Braid Group, VDM Verlag, ISBN # 3639138988, 2009.

PAPERS:
  1. “Man’s Cards and God’s Dice: A Conceptual Analysis of Probability for the Advanced Student”, The Humanistic Mathematics Network Journal, 27, 2004.
  2. “Towards the Computation of the Convex Hull of a Configuration from its Corresponding Separating Matrix”, joint work with David Garber, The Australasian Journal of Combinatorics, 39 (2007) 273-282.
  3. “A Pragmatic Mathematic: A new skills-for-life mathematics course addressing the NSACS’s revelation of the dismal quantitative literacy of America’s college graduates”, Mathematics Teaching-Research Journal (MTRJ), 2(1), (2007).
  4. “The Applicability of Infinitesimals and the Foundations of the Calculus to the Law of Nullification”, Badad, 20, (2008), 39-56.
  5. “The Synthesis of Mathematical Foundations with Real World Applications in Computer Science Education”, joint work with Igor Balsim, Proceedings of the 2008 International Conference on Frontiers in Education: Computer Science and Computer Engineering, FECS’08, 154-160.
  6. “Introduction of a Dynamic Student Research Program in Applied Mathematics”, joint work with Igor Balsim, Mathematics Teaching-Research Journal (MTRJ), 2 (3), (2008), 14-26.
  7. “The Pervasive Applications of Computer Science in Biomedicine”, joint work with Igor Balsim, Gavriel Yarmish, Ronald A. Eckhardt, Sarwar Jahangir, Journal of Computing Sciences in Colleges, 24(3), (January 2009), 11-18.
  8. “The Maximum of the Maximum Rectilinear Crossing Number for d-regular Graphs of Order n”, joint work with Matthew Alpert and Heiko Harborth – Electronic Journal of Combinatorics, 16(1) #R54, (2009).
  9. “Creating an Industrial-Educational Environment Geared for Biomedical Careers”, joint work with Igor Balsim, and Ayalur Krishnan, Mathematics Teaching-Research Journal (MTRJ), 3(3), (2009), 91-108.
  10. "Symbiotic Synthesis of the Biological-Mathematics Research Environment and Computer Science Education”, joint work with Igor Balsim, Ronald Eckhardt, Sarwar Jahangir and Ayalur Krishnan, Journal of Computing Sciences in Colleges, 25(2), (December 2009), 107-114.
  11. “The Orchard Crossing Number of an Abstract Graph”, joint work with David Garber, Congressus Numerantium, 197, (2009), 3-19.
  12. “The Maximum Rectilinear Crossing Number of the n-Dimensional Cube Graph, Qn”, joint work with Heiko Harborth, Matthew Alpert, and Sender Klein, Congressus Numerantium, 195, (2009), 147-158.
  13. “The Analysis of an Efficient Algorithm based on Game Theory Applied to the Detection of Medical Errors”, joint work with Igor Balsim, Journal of Mathematical Sciences: Advances and Applications, 4(1), (2010), 61-72.
  14. "Online Communities in the Era of the Information Revolution”, joint work with Igor Balsim and Sarwar Jahangir, Journal of Computing Sciences in Colleges, 25(5), (May 2010), 188-195.
  15. “Optimizing Radiology Peer Review: A Mathematical Model for Selecting Future Cases Based on Prior Errors”, joint work with Yun Robert Sheu, Igor Balsim, Victor Levin, Andrew G. Bleicher, and Barton F. Branstetter IV, Journal of the American College of Radiology. 7(6) (June 2010), 431-438.
  16. “The Maximum Rectilinear Crossing Number of the Petersen Graph”, joint work with Heiko Harborth, Steven Herzberg and Sheldon Klein, Congressus Numerantium, 206, (2010), 31-40.
  17. “On the Orchard Crossing Number of the Complete Bipartite Graphs Kn,n”, joint work with David Garber, Electronic Journal of Combinatorics, 18(1) #P201, (2011).
  18. “The Maximum Rectilinear Crossing Number of the Wheel Graph”, Congressus Numerantium, 210, (2011), 21-32.
  19. “The Maximum Rectilinear Crossing Number of the Generalized Wheel Graphs”, joint work with Matthew Alpert and Yehuda Isseroff, Congressus Numerantium, 209, (2011), 33-46.
  20. “The Minimum of the Maximum Rectilinear Crossing Numbers of Small Cubic Graphs”, joint work with Matthew Alpert, Jens Bode and Heiko Harborth, Congressus Numerantium, 214, (2012), 187-197.
  21. "Extremal Values of the Maximum Rectilinear Crossing Numbers of 2-regular Graphs", joint work with Jens-P. Bode and Heiko Harborth, Bulletin of the Institute of Combinatorics and its Applications, 69(2013), 95-100.
  22. “On the Minimum of the Maximum Rectilinear Crossing Numbers of Regular Graphs”, joint work with Sammy Bald, Jens-P. Bode, and Heiko Harborth, Congressus Numerantium, 216, (2013), 181-190.
  23. "On the Orchard crossing number of prisms, ladders, and other related graphs", joint work with David Garber, The Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC), 91 (2014),215-232.
  24. “Extremal values of the maximum rectilinear crossing number of cycles with diagonals”, joint work with Jens-P. Bode, Heiko Harborth, David Horowitz, and Tamar Lichter, Congressus Numerantum 220 (2014), 33-48.
  25. “Extremal Values of the Maximum Rectilinear Crossing Number of (p,q)-Graphs”, joint work with Jens-P. Bode, Heiko Harborth, David Horowitz and Tamar Lichter, Congressus Numerantium 223 (2015), 139-149.
  26. “Maximum Rectilinear Crossing Numbers for Game Board Graphs”, joint work with Heiko Harborth, and Tamar Lichter, Congressus Numerantium, 226, (2016), 87-102.
  27. “Maximum Rectilinear Crossing Numbers of Polyomino Graphs”, joint work with Heiko Harborth and Tamar Lichter, Congressus Numerantium, 229, (2017), 29-53.
  28. “Maximum Rectilinear Crossing Numbers of Polyiamond Graphs”, joint work with Heiko Harborth and Tamar Lichter, Congressus Numerantium, 230, (2018), 5-14.
  29. “Numbers of Crossings for Cycle Graphs”, joint work with Alewyn Burger and Heiko Harborth, Geombinatorics 28, (2019), 158-170.
  30. “Maximum Rectilinear Crossing Numbers of Polyhex Graphs”, joint work with Heiko Harborth, Congressus Numerantium, 232, (2019), 221-231.
TALKS:
  1. “The Orchard Crossing Number and its Applications”, joint work with David Garber, talk given at Expert Workshop of Geometric Combinatorics at CRI (Caesarea Edmond Benjamin de Rothschild Foundation Institute for Interdisciplinary Applications of Computer Science) in Haifa, Israel, Nov. 21, 2007.
  2. “An Algorithm for Efficient Detection of Medical Errors”, joint work with Igor Balsim, talk given at Third Annual Conference on Computer Human Error (CHE 2007) in New York, New York, Dec. 21, 2007.
  3. “The Maximum of the Maximum Rectilinear Crossing Number for d-regular Graphs of Order n”, joint work with Matthew Alpert and Heiko Harborth, talk given at the 39th Southeastern International Conference on Combinatorics, Graph Theory and Computing (2008) in Boca Raton, Florida, March 4, 2008.
  4. “George Polya as Forerunner to the Prime Computing Program”, joint work with Igor Balsim, talk given at 2008 New York State Mathematics Association of Two-Year Colleges (NYSATYC) Annual Conference in Suffern, New York, on April 6, 2008.
  5. “The Pervasive Applications of Computer Science in Biomedicine”, joint work with Igor Balsim, Gavriel Yarmish, Ronald A. Eckhardt, Sarwar Jahangir, talk given at CCSCE 2008, the Eastern Conference of the Consortium for Computing Sciences in Colleges on October 11, 2008.
  6. “The Orchard Crossing Number of Complete Bipartite Graphs”, joint work with David Garber, talk given at the 40th Southeastern International Conference on Combinatorics, Graph Theory and Computing in Boca Raton, Florida, March 4, 2009.
  7. “The Maximum Rectilinear Crossing Number of the n-Dimensional Cube Graph, Qn”, joint work with Matthew Alpert, Heiko Harborth and Sheldon Klein, talk given at the 40th Southeastern International Conference on Combinatorics, Graph Theory and Computing in Boca Raton, Florida, March 4, 2009.
  8. "Symbiotic Synthesis of the Biological-Mathematics Research Environment and Computer Science Education”, joint work with Igor Balsim, Ronald A. Eckhardt, Sarwar Jahangir and Ayalur Krishnan, talk given at the Twenty-Third Annual Consortium for Computing Sciences in Colleges (CCSC), Southeastern Conference, November 13,
  9. “The Maximum Rectilinear Crossing Number of the Petersen and Prism Graphs”, joint work with Heiko Harborth, Steven Herzberg and Sheldon Klein, talk given at the 41st Southeastern International Conference on Combinatorics, Graph Theory and Computing in Boca Raton, Florida, March 10, 2010.
  10. "Online Communities in the Era of the Information Revolution”, joint work with Igor Balsim and Sarwar Jahangir, talk given at the Sixteenth Consortium for Computing Sciences in Colleges (CCSC), Central Plains Conference, April 9, 2010.
  11. “The Maximum Rectilinear Crossing Number of the Wheel Graph”, talk given at the 42nd Southeastern International Conference on Combinatorics, Graph Theory and Computing in Boca Raton, Florida, March 8, 2011.
  12. “The Maximum Rectilinear Crossing Number of the Generalized Wheel Graphs”, joint work with Matthew Alpert and Yehuda Isseroff, talk given at the 42nd Southeastern International Conference on Combinatorics, Graph Theory and Computing in Boca Raton, Florida, March 8, 2011.
  13. “The Minimum of the Maximum Rectilinear Crossing Number of Small d-regular Graphs of Order n”, joint work with Matthew Alpert, Sammy Bald, Jens-P. Bode and Heiko Harborth, talk given at the 43rd Southeastern International Conference on Combinatorics, Graph Theory and Computing in Boca Raton, Florida, March 6,
  14. "Extremal Values of the Maximum Rectilinear Crossing Number of Cycles with Diagonals", joint work with Jens-P. Bode, Heiko Harborth, David Horowitz and Tamar Lichter, talk given at the 45rd Southeastern International Conference on Combinatorics, Graph Theory and Computing in Boca Raton, Florida, March 5, 2014.
  15. "Extremal Values of the Maximum Rectilinear Crossing Numbers of Graphs in C7,k", joint work with Jens-P. Bode, Heiko Harborth, David Horowitz and Tamar Lichter, talk given at the 45rd Southeastern International Conference on Combinatorics, Graph Theory and Computing in Boca Raton, Florida, March 5, 2014.
  16. “Extremal Values of the Maximum Rectilinear Crossing Number of (p,q)-Graphs”, joint work with Jens-P. Bode, Heiko Harborth, David Horowitz and Tamar Lichter, talk given at the 46th Southeastern International Conference on Combinatorics, Graph Theory and Computing in Boca Raton, Florida, March 2, 2015.
  17. “Maximum Rectilinear Crossing Numbers for Game Board Graphs”, joint work with Heiko Harborth and Tamar Lichter, talk given at the 47th Southeastern International Conference on Combinatorics, Graph Theory and Computing in Boca Raton, Florida, March 9, 2016.
  18. “Maximum Rectilinear Crossing Numbers of Polyomino Graphs”, joint work with Heiko Harborth and Tamar Lichter, talk given at the 48th Southeastern International Conference on Combinatorics, Graph Theory and Computing in Boca Raton, Florida, March 7, 2017.
  19. “Maximum Rectilinear Crossing Numbers of Polyiamond Graphs”, joint work with Heiko Harborth and Tamar Lichter, talk given at the 49th Southeastern International Conference on Combinatorics, Graph Theory and Computing in Boca Raton, Florida, March 5, 2018.
  20. “Maximum Rectilinear Crossing Numbers of Polyhex Graphs”, joint work with Heiko Harborth, talk given at the 50th Southeastern International Conference on Combinatorics, Graph Theory and Computing in Boca Raton, Florida, March 6, 2019.