Welcome to Hairong's Home Page

	Welcome to My Home Page
	Hairong Zhao
	Department of Mathematics, Computer Science & Statistics
	Purdue University Calumet
	2200 169^th Street, Hammond, IN 46323
	E-mail: hairong@calumet.purdue.edu
	Office: CLO 364 Phone: 219-989-3181

tree

Teaching

Research Interest

Publications

Education

Links

Teaching

Fall 2010: Please access the courses via WebCT

CS 410 Automat & Computability TR11:00am-12:20pm Potter 334

CS 590-1 Object Oriented Analysis, Design and Programming TR5:00pm-6:20pm, Gyte115

MA 205 Discrete Mathematics for Computer Technology TR12:30pm-1:50pm, Gyte119

Courses I taught before tree

Design and Analysis of Algorithms, Approximation Algorithms, Sequencing and Scheduling, Combinatorial Optimization, Computational Complexity, Computational Geometry, Real-time Scheduling, Operating Systems.

Back to Top

Publications

My Dissertation

Algorithms and Complexity Analyses for Some Combinatorial Optimization Problems.

Journal Papers

	B. Fu, H. Huo and H. Zhao
	Makespan Minimization with Machine Availability Constraints, Discrete Mathematics, Algorithms and Applications, 1(2), 141-151, 2009.
	B. Fu, Y. Huo and H. Zhao,
	Exponential Inapproximability and FPTAS for Scheduling with Availability Constraints, Theoretical Computer Science, 410: 2663-2674, 2009.
	Y. Huo, H. Li and H. Zhao
	Minimizing Total Completion Time in Two-machine Flowshops with Exact Delays. Computers & Operations Research, 36(6): 2018-2030, 2009.
	Leung, J. Y-T. and H. Zhao
	Scheduling Problems in Master-Slave Model. Annals of Operations Research, 159: 215-231, 2008..
	Leung, J. Y-T. H. Li and H. Zhao
	Scheduling Two-Machine Flow Shops with Exact Delay. International Journal of Foundations of Computer Science, Vol. 18, No. 2, pp. 341-360, 2007.
	H. Li and H. Zhao
	Scheduling Coupled-Tasks on a Single Machine. International Journal of Information Technology and Intelligent Computing, Vol. 2, No. 2, 2007.
	J. Y-T.Leung and H. Zhao
	Minimizing Total Completion Time in Master-Slave Systems. IEEE Transactions on Computers, 55(8):985-999, 2006. (PDF)

	Y. Huo, J.Y-T.Leung and H. Zhao
	Complexity of Two Dual Criteria Scheduling Problems. Operations Research Letters, 35 (2007), 211-220.(PDF)
	Y. Huo, J, Y-T. Leung and H. Zhao
	Bi-criteria Scheduling Problems: Number of Tardy Jobs and Maximum Weighted Tardiness. European Journal of Operational Research, 177:116-134, 2007.(PDF)
	J. Y-T. Leung, and H. Zhao
	Minimizing Mean Flowtime and Makespan on Master-Slave Systems. Journal of Parallel and Distributed Computing, 65:843-856, 2005. (PDF)
	A. Czumaj and H. Zhao
	Fault-Tolerant Geometric Spanners. Discrete and Computational Geometry, Vol. 32, pages 207-230, 2004. ( PDF) A preliminary version appeared in Proceedings of the 19th ACM Symposium on Computational Geometry (SoCG'03), pages 1 - 10, San Diego, CA, June 8 - 10, 2003.

Conference Papers

	B. Fu, H. Huo and H. Zhao
	Makespan Minimization with Machine Availability Constraints. Proceedings of COCOA, pages 430-437, 2009.
	Y. Huo, H. Li and H. Zhao
	Minimizing total completion time in two-machine flow shops with exact delays. Proceedings of COCOA, pages 427 - 437, 2008.

	H. Li and H. Zhao
	Scheduling Coupled-Tasks on a Single Machine. Proceedings of IEEE Symposium on Computational Intelligence in Scheduling (CISched), pages 137-142, 2007
	A. Berger, A. Czumaj, M. Grigni and H. Zhao.
	Approximate Minimum 2-Connected Subgraphs in Weighted Planar Graphs. In Proceedings of the 13th Annual European Symposium on Algorithms (ESA'05), pages 472 - 483, Mallorca, Spain, October 3 - 6, 2005. Volume 3669 of Lecture Notes in Computer Science edited by G. S. Brodal and S. Leonardi, Springer-Verlag, 2005. ( PDF)

	J. Y-T. Leung and H. Zhao
	Scheduling Algorithms for Master-slave Systems. Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory & Applications (MISTA 2005), pages 501-513, 2005. PDF
	J. Y-T. Leung and H. Zhao
	Minimizing Mean Flowtime on Master-Slave Machines. Proceedings of the 2004 International Conference on Parallel and Distributed Processing Techniques and Applications, Vol. II, pp. 939-945, Las Vegas, Nevada, 2004. ( PDF)
	A. Czumaj, M. Grigni, P. A. Sissokho, and H. Zhao
	Approximation Schemes for Minimum 2-edge-connected and Biconnected Subgraphs in Planar Graphs. Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04), New Orleans, LA, January 11 - 13, 2004. SIAM, Philadelphia, PA, 2004.( PDF )
	A. Czumaj and H. Zhao
	Fault-Tolerant Geometric Spanners. Proceedings of the 19th ACM Symposium on Computational Geometry (SoCG'03), pages 1 - 10, San Diego, CA, June 8 - 10, 2003. (PDF ) Journal version of the paper appeared in Discrete and Computational Geometry, Vol. 32, pages 207-230, 2004.
	A. Czumaj, A. Lingas, and H. Zhao
	Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP'02), pages 973-984, Malaga, Spain, July 8 - 13, 2002. (PDF)

Technical Reports

	J.Y-T. Leung, and H. Zhao
	Real-Time Scheduling Analysis. Technical Report NJIT/WOW 01/C/AW/NJIT Amendment 1 , October, 2003.

Invited Talks, presentations

	Makespan Minimization with Machine Availability Constraints, COCOA, Huangshan, China, June, 2009.
	Minimizing Total Completion Time in Two-Machine Flowshops with Exact Delays, INFORMS Annual Meeting, Washington DC, Nov. 2008.
	Minimizing Total Completion Time in Two-Machine Flowshops with Exact Delays, Aug. COCOA, New Foundland, CA, 2008.
	Minimizing Makespan in Two-Machine Flowshops with Exact Delays, INFORMS Annual Meeting, Nov. 2006.
	Scheduling Algorithms for Master-slave Systems, MISTA, Aug. 2005.
	Minimizing Total Completion Time in Master-slave Scheduling Systems, Graduate Student Seminar, New Jersey Institute of Technology, Nov. 2004.
	Minimizing Mean Flowtime and Makespan on Master-Slave Systems, INFORMS Annual Meeting, Oct. 2004.
	Fault tolerant Spanners and Their Applications, DIMACS/CS Seminar: Theoretical Computer Science.
	Approximation Schemes for Minimum 2-Edge-Connected and Biconnected Subgraphs in Planar Graphs, the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 2004.

	Complexity and Heuristics of Some Master-slave Scheduling Problems, Graduate Student Seminar, New Jersey Institute of Technology, Dec. 2003.

	Fault-Tolerant Geometric Spanners, DIMACS Workshop on Computational Geometry, Nov. 2002

Back to Top

Education

09/2000--05/2005	Department of Computer Science, New Jersey Institute of Technology, U.S., Ph.D. of Computer Science
09/1994--04/1997	National Key Lab of Switching Technology and Telecommunication Network, Beijing University of Posts and Telecommunications(BUPT), Beijing, P.R.China, Master of Engineering
09/1990--07/1994	Department of Computer Science and Engineering, Taiyuan University of Technology, P.R.China, Bachelor of Computer Engineering

Back to Top

Some Useful Links

Homepages of Researchs in Computer Theory

Computational Geometry

On-line books, lecture notes

Graph Theory, Third Edition, Reinhard Diestel

Computational Geometry Course Materials

Journal of Scheduling, John Wiley & Sons, Inc.

Course notes of scheduling , by Yuval Rabani

Scheduling Algorithms, a survey paper by Karger, Stein, and Wein

Complexity results for scheduling problems, by Brucker and Knust.

Interesting things about China

China's Scenery Pictures

Chinese History

Learning Chinese

Back to Top

Comments and Suggestions

mail Please send me mail if you have any comments and suggestions.

Back to Top

A. Berger, M. Grigni and H. Zhao. A Well-Connected Separator for Planar Graphs. Submitted to Journal of Graph Algorithms and Applications. A. Czumaj, W. Rytter, X. Wang and H. Zhao A Linear-Time Algorithm for 3-Path Coloring of 2-Regular Digraphs.