Return to Faculty List

Faculty

Jose A. Rodriguez

Professor of Computer Science

B.A., Rutgers UniversityM.S., New York UniversityPh.D., Stevens Institute of Technology

Description

Professor Rodriguez joined the Department of Technology, Innovation and Computer Science in 1991. Prior to that, he worked for several years as an actuarial analyst and software developer in the insurance industry.

Specialties

Computer Networks, Graph Theory, Combinatorics, Graph Algorithms, Operating Systems, Object Oriented Design

Publications

  • Co-author, “A new technique for the characterization of graphs with a maximum number of spanning trees,” published in Discrete Mathematics (Special Issue on Algebraic and Topological Methods in Graph Theory)
  • Co-author, “Reliability of networks with delay constraints,” published in Congressus Numerantium
  • Co-author, “A new proof of the Fisher-Ryan bound for the number of cliques if a graph,” published in Congressus Numerantium
  • Co-author, “Bounds on the maximum number of edge-disjoint Steiner trees of a graph,” published in Congressus Numerantium
  • Co-author, “On the conjecture that amount all graphs on n nodes and e edges, one with a maximum number of spanning trees must be almost-regular,” published in Congressus Numerantium
  • Co-author, “Chromatic polynomials with least coefficients,” published in Discrete Mathematics (Special Issue on Chromatic Polynomials and Related Topics)
  • Co-author, “(K, j)-Domination and (K, j)-Reliability,” published in Networks
    Co-author, “A sharp upper bound for the number of spanning trees of a graph,” published in Congressus Numerantium
  • Co-author, “Generalized Edge-Toughness,” published in the Proceedings of the Eighteenth International Conference of the Chilean Computer Science Society (IEEE sponsored)
  • Co-author, “Graphs with maximum number of spanning trees and optimally reliable graphs,” published in Combinatorial Optimization: Theory and Practice
  • Author, “Reconstructing graphs from their odd-vertex subsets,” published in Congressus Numerantium
  • Co-author, “Graphs with most number of three-point induced connected subgraphs,” published in Discrete Applied Mathematics
  • Co-author, “A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability,” published in Discrete Mathematics