Cüneyt F. BAZLAMAÇCI 

Asst. Prof. Dr. 

Electrical and Electronics Engineering Department 

Middle East Technical University 

06531 Ankara, Turkey 

Tel: +90 (312) 2102324 

Fax: +90 (312) 2101261 

E-mail: cuneytb@metu.edu.tr 

Office Location: EA-406 

| Short CV | Research Interests| Research Results |
Courses Offered | Graduate Students | Invitation to Research Students | Schedule

 

 

 

Short CV of Cuneyt F. Bazlamacci

Education

  • PhD in Computing, University of Manchester Institute of Science and Technology (UMIST), December 1996.
  • M.Sc. in Electrical and Electronics Engineering, Middle East Technical University, September 1991.
  • B.Sc. in Electrical and Electronics Engineering, Middle East Technical University, July 1988.
  • High School Diploma, Ankara Atatürk Anadolu High School, 1984.

 

Professional Activities

  • Member of the Institute of Electrical and Electronic Engineers (Mem. IEEE)
  • Member of the Operational Research Society (Mem. ORS)

 

Employment

 

Top of the Page

Research Interests

  • Computer Engineering
  • Computer Networks
  • Graph Algorithms and Applications

 

Top of the Page

Research Results

by Cuneyt F. Bazlamacci

For abstracts of these, please click on the paper. Postscript copies of the following are available on request from: cuneytb@metu.edu.tr

Refereed Papers and Publications

  1. Cinel, S., and Bazlamacci, C.F., “A distributed heuristic algorithm for the rectilinear Steiner tree problem”, IEEE Transactions on Computer-Aided-Design of Integrated Circuits and Systems, (accepted for publication).
  2. Bazlamaçcı, C.F. and  Say, F. “Minimum concave cost multicommodity network design”, Telecommunication Systems, 36/4  (2007) 181-203.
  3. Bayramoğlu, N.Y. and C.F. Bazlamaçcı, “Recursive shortest spanning tree algorithms for image segmentation”, in Proc. of the IEEE International Conference on "Computer as a Tool" (EUROCON 2005), November 21-24, 2005, Belgrade (Serbia and Montenegro), 979-982, IEEE Press, 2005.
  4. Celik, C., and Bazlamacci, C.F., “Performance analysis of reliable multicast protocols”, in Proc. of the 20th International Symposium on Computer and Information Sciences (ISCIS'05), October 26-28, 2005, Istanbul (Turkey), Advances in Computer Science and Engineering: Reports – Vol. 1: New Trends in Computer Networks, ed. T.Tugcu, et. al., 319-328, Imperial College Press, London, UK, 2005.
  5. Ozturk, E.A. and Bazlamacci, C.F., “Fairness in differentiated services architecture”, in Cicekli, I., et al. (eds.), Proc. of the Int. Symp. on Computer and Information Sciences (ISCIS XVII), Florida (USA), October 28-30, 2002, CRC Press (2003) 264-268.
  6. Bazlamacci, C.F. and Karadeniz B. “Lower bounds for the minimum span frequency assignment problem in cellular networks”, in Proc. of the Electrical Electronics and Computer Engineering Symposium (ELECO'2002), Bursa (Turkey), December 18-22, 2002, TMMOB, Uludag University, Istanbul Technical University, Tubitak (2002) 252-256. (in Turkish)
  7. Onem (Ertem), D. and Bazlamacci, C.F. “Minimum weight directed spanning tree problem with degree, hop and capacity constraints”, in Kuru, S., et al. (eds.), Proc. of the Int. Symp. on Computer and Information Sciences XVI (ISCIS XVI), Antalya (Turkey), November 5-7, 2001, Isik University, Istanbul (2001) 429-436.
  8. Bazlamacci, C.F., and Hindi, K.S., "Minimum-weight spanning tree algorithms: a survey and empirical study", Computers & Operations Research  28/8 (2001) 767-785.
  9. Bazlamacci, C.F., and Hindi, K.S., "An empirical study of minimum-weight spanning tree algorithms, classical and modern", in Turksever, M., et al. (eds.), Proc. of the Int. Symp. on Computer and Information Sciences XIV (ISCIS XIV), Kusadasi (Turkey), October 18-20, 1999, Ege University, Izmir (1999) 370-380.
  10. Bazlamacci, C.F., "Strategical information warfare and national information security", in Proc. of the 8th Electrical Electronics and Computer Engineering Symposium, Gaziantep (Turkey), September 6-12, 1999, Gaziantep University, EMO, TUBITAK (1999) 1-4. (in Turkish)
  11. Bazlamacci, C.F., and Hindi, K.S., "A branch and bound algorithm for the capacitated minimal spanning tree problem using a directed-flow formulation", in Bilgen, S., and Ozgit, A., (eds.), Proceedings of the Second Symposium on Computer Networks BAS'97, Ankara (Turkey), June 12-13, 1997, Middle East Technical University, Ankara (1997) 31-40.
  12. Bazlamacci, C.F., and Hindi, K.S., "Verifying minimum spanning trees in linear time", in Zimmerman, U., et al. (eds.), Operations Research Proceedings 1996, Symposium on Operations Research SOR'96, Braunschweig (Germany), September 3-6, 1996, Springer-Verlag, Heidelberg (1997) 139-144.
  13. Bazlamacci, C.F. and Hindi, K. S. "Enhanced adjacent extreme point search and Tabu search for the minimum, concave-cost uncapacitated transshipment problem", Journal of the Operational Research Society 47/9 (1996) 1150-1165.
  14. Bazlamacci, C.F., and Hindi, K.S., "A tabu search algorithm for concave cost transshipment problems", in Dolezal, J., and Fidler, J., (eds.), Proc. of the 3rd IFIP WG-7.6 Working Conference on Optimization-based Computer-aided Modeling and Design, Prague (Czech Rep.) 1994, Academy of Sciences of the Czech Rep., Prague (1995) 94-101.
  15. Guran, H., and Bazlamacci, C.F., "Performance of parallel FFT on a transputer based mesh architecture", in Gelenbe, E., et al. (eds.), Proc. of the Int. Symp. on Computer and Information Sciences VII (ISCIS VII), Antalya (Turkey), 1992, Universite Rene Descartes, Paris (1992) 503-506.
  16. Unal, E., Bazlamacci, C.F., and Guran, H., "Investigation of transputer performance using transform coding of images and FFT methods", Proceedings of BILKON-91, Bilkent University, Ankara (Turkey) (July 1991) 270-274 (in Turkish).

Other Presentations

  1. Bazlamacci, C.F., and Hindi, K.S., "Disaggregate local search for minimum concave-cost multi-commodity network design", SOR'97 : Annual Symposium on Operations Research, Jena (Germany), September 3-5, 1997. Abstracts Volume p.46.
  2. Bazlamacci, C.F., and Hindi, K.S., "A branch and bound algorithm for the capacitated minimal spanning tree problem using a directed formulation", ISMP'97 : 16th International Symposium on Mathematical Programming, Lausanne (Switzerland), EPFL, August 24-29, 1997. Abstracts Volume p.43.

Theses

  1. Bazlamacci, C.F., Optimised network design: minimum spanning trees and minimum concave-cost problems, PhD Thesis, University of Manchester Institute of Science and Technology, Manchester, England (1996).
  2. Bazlamacci, C.F, A Fast Fourier Transform implementation and performance evaluation on a transputer based parallel computer system, M.Sc. Thesis, Middle East Technical University, Ankara, Turkey (1991).


Top of the Page

Courses Offered

Undergraduate


Graduate


Top of the Page

Graduate Students

Current (in alphabetical order)

 

  • Oguzhan Erdem (PhD)
  • Fatih Say (PhD)
  • Coskun Celik (PhD)

 

Previous (in graduation order)

 

 

Top of the Page

Invitation to Research Students

Under my supervision, the following research topics can be pursued leading to an MSc/PhD degree. Details are available on request from: cuneytb@metu.edu.tr

  1. Computer networks and various network protocols
  2. Parallel optimisation algorithms
  3. Studies on variants of the minimum spanning tree problem (MST)
  4. Parallel and distributed graph algorithms (parallel MST, parallel shortest path, etc.)
  5. Embedded systems
  6. Reconfigurable architectures

 

The candidates who would like to carry on research on the above should have

  • a strong interest in algorithm design, networks, graphs, optimisation and parallel computing, as appropriate,
  • a strong mathematical background,
  • a sound knowledge in one of the high level programming languages.


Top of the Page

Some Upcoming Conferences


Top of the Page

| Middle East Technical University | Department of Electrical and Electronics Engineering