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) 2102304 

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

Refereed Papers (in publication order)

1.      Erdem, O. and C.F. Bazlamaçcı, “MIPS extension for a TCAM based parallel architecture for fast IP lookup”, Proc. of the 24th Int. Symp. on Computer and Information Sciences (ISCIS'09), Güzelyurt (Turkish Republic of Northern Cyprus), 310-315, IEEE (2009).

2.      Kahraman, E., T.İpek, B.İyidir, C.F. Bazlamaçcı and S.Bilgen, “Bileşen tabanlı yazılım ürün hattı geliştirmeye yönelik alan mühendisliği çalışmaları”, Proc. of the 4th Nat. Symp. on Software Engineering (UYMS’09), İstanbul (Turkey), 283-288, EMO (2009). (in Turkish)

3.      Erdem, O. and C.F. Bazlamaçcı, “MIPS extension for a TCAM based parallel architecture for fast IP lookup”, Proc. of the 24th Int. Symp. on Computer and Information Sciences (ISCIS'09), 310-315, IEEE (2009).

4.      Cinel, S. and C.F. Bazlamaçcı, “A distributed heuristic algorithm for the rectilinear Steiner minimal tree problem” IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 27/11, 2083-2087 (2008).

5.      Bazlamaçcı, C.F. and F. Say, “Minimum concave cost multicommodity network design,” Telecommunication Systems, 36/4, 181-203 (2007).

6.      Bayramoğlu, N.Y. and C.F. Bazlamaçcı, “Recursive shortest spanning tree algorithms for image segmentation”, Proc. of the IEEE Int. Conference on "Computer as a Tool" (EUROCON 2005), Belgrade (Serbia and Montenegro), 979-982, IEEE Press (2005).

7.      Çelik, C. and C.F. Bazlamaçcı, “Performance analysis of reliable multicast protocols”, Proc. of the 20th Int. Symp. on Computer and Information Sciences (ISCIS'05), İstanbul (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).

8.      Öztürk, E.A. and C.F. Bazlamaçcı, “Fairness in differentiated services architecture”, Proc. of the 17th Int. Symp. on Computer and Information Sciences (ISCIS XVII), ed. I. Çiçekli, et. al., Florida (USA), 264-268, CRC Press (2003).

9.      Bazlamaçcı, C.F. and B. Karadeniz, “Lower bounds for the minimum span frequency assignment problem in cellular networks”, Proc. of the Electrical Electronics and Computer Engineering Symposium (ELECO'02), Bursa (Turkey), Electronics Volume: 252-256 TMMOB, Uludağ University, Istanbul Technical University, Tübitak (2002). (in Turkish)

10.  Önem (Ertem), D. and C.F. Bazlamaçcı, “Minimum weight directed spanning tree problem with degree, hop and capacity constraints”, Proc. of the 16th Int. Symp. on Computer and Information Sciences (ISCIS XVI), ed. S. Kuru, et. al., Antalya (Turkey), 429-436, Işık Üniversitesi,  2001.

11.  Bazlamaçcı, C.F. and K.S. Hindi, “Minimum-weight spanning tree algorithms: a survey and empirical study”, Computers & Operations Research, 28/8, 767-785 (2001).

12.  Bazlamaçcı, C.F. and K.S. Hindi, “An empirical study of minimum-weight spanning tree algorithms, classical and modern,” Proc. of the 14th Int. Symp. on Computer and Information Sciences (ISCIS XIV), ed. M. Türksever, et. al., Kuşadası (Turkey), 370-380, Ege Üniversitesi,  1999.

13.  Bazlamaçcı, C.F., “Strategical information warfare and national information security”, Proc. of the 8th Electrical Electronics and Computer Engineering Symposium, Gaziantep (Turkey), Vol. I, 1-4, Gaziantep University, EMO, Tübitak (1999). (in Turkish)

14.  Bazlamaçcı, C.F. and K.S. Hindi, “A branch and bound algorithm for the capacitated minimal spanning tree problem using a directed-flow formulation,” Proc. of the 2nd Symp. on Computer Networks (BAS'97), ed. S. Bilgen and A. Özgit, Ankara (Turkey), 31-40, Middle East Technical University (1997).

15.  Bazlamaçcı, C.F. and K.S. Hindi, “Verifying minimum spanning trees in linear time,” Proc. of the Annual Symp. on Operations Research (SOR'96), ed. U. Zimmerman et. al., Braunschweig (Germany), 139-144, Springer-Verlag, Heidelberg (1997).

16.  Bazlamaçcı, C.F. and K.S. Hindi, “Enhanced adjacent extreme point search and Tabu search for the minimum, concave-cost uncapacitated transshipment problem”, Journal of the Operational Research Society, 47/9, 1150-1165 (1996).

17.  Bazlamaçcı, C.F. and K.S. Hindi, “A tabu search algorithm for concave cost transshipment problems,” Proc. of the 3rd IFIP WG-7.6 Working Conference on Optimization-based Computer-aided Modeling and Design, ed. J. Dolezal and J. Fidler, Prague (Czech Rep.) 94-101, Academy of Sciences of the Czech Rep. (1995).

18.  Güran, H., and C.F. Bazlamaçcı, “Performance of parallel FFT on a transputer based mesh architecture,” Proc. of the 7th Int. Symp. on Computer and Information Sciences (ISCIS VII), ed. E. Gelenbe, et. al., Antalya (Turkey), 503-506, Universite Rene Descartes (1992).

19.  Ünal, E., Bazlamaçcı, C.F., and Güran, H., “Investigation of transputer performance using transform coding of images and FFT methods”, Proc. of the Electrical Electronics and Computer Engineering Conference (BİLKON’91, Ankara (Turkey), 270-274, Bilkent University (1991). (in Turkish).

Other Publications and Presentations

1.      Bazlamaçcı, C.F. (editor) and Ş. Demir, Proc. of the 1st Symposium on Electrical Electronics and Computer Engineering Education, Middle East Technical University, EMO, Tübitak, Ankara (2003).

2.      Bazlamaçcı, C.F. and K.S. Hindi, “Disaggregate local search for minimum concave-cost multi-commodity network design,” Proc. of the Annual Symp. on Operations Research (SOR'97), Jena (Germany), Abstract Volume p.46 (1997).

3.      Bazlamaçcı, C.F. and K.S. Hindi, “A branch and bound algorithm for the capacitated minimal spanning tree problem using a directed formulation,” Proc. of the 16th International Symposium on Mathematical Programming (ISMP'97), Lausanne (Switzerland), Abstract Volume p.43 (1997).

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

  • BIL256 Data Communications


Graduate


Top of the Page

Graduate Students

Current (in alphabetical order)

 

  • Oguzhan Erdem (PhD)
  • Fatih Say (PhD)
  • Coskun Celik (PhD)
  • Göksu, A.
  • Keleş, Ç.
  • Kılınç, İ.Ö.
  • Özkaner, A.
  • Sağ, E.
  • Sulubulut, K.
  • Sü, M.

 

Previous (in graduation order)

 

 

Top of the Page

Invitation to Research Students

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

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

 

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

  • a strong interest in HW/SW, 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