Deutsch German

George Mertzios

Contact

Brief Curriculum Vitae

Research Interests
  • Algorithmic Graph Theory
  • Efficient Algorithms and Applications
  • Complexity Theory
  • Game Theory
Awards in International Competitions in Mathematics
  • June 20, 1998: Athens, Balkan Mathematical Olympiad. First Award (Gold Medal).
  • November 1, 1998: Bulgarian National Mathematical Competition "Chernorizets Hrabar", organized by the Union of Bulgarian Mathematicians in Sofia. Distinguish Diploma.
  • April 23, 1999: Mediterranean Mathematics Competition, Peter O' Halloran Memorial. Certificate of Merit.
Publications

Conference Publications
  • K. Ioannidou, G.B. Mertzios, and S.D. Nikolopoulos. The Longest Path Problem is Polynomial on Interval Graphs. In Proceedings of the 34st International Symposium on Mathematical Foundations of Computer Science (MFCS), Novy Smokovec, High Tatras, Slovakia, August 2009, pp. 403-414.
  • G.B. Mertzios, I. Sau, and S. Zaks. A New Intersection Model and Improved Algorithms for Tolerance Graphs. In Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Montpellier, France, June 2009, pp. 285-295.
  • G.B. Mertzios and W. Unger. An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs. In Proceedings of the 19th International Workshop on Combinatorial Algorithms (IWOCA), Nagoya, Japan, September 2008, pp. 197-211.
  • G.B. Mertzios and W. Unger. The friendship problem on graphs. In Proceedings of the 1st International Conference on Relations, Orders and Graphs: Interaction with Computer Science (ROGICS), Mahdia, Tunisia, May 2008, pp. 152-158.
  • D.A. Karras and G. Mertzios. Discretization schemes and numerical approximations of PDE impainting models and a comparative evaluation on novel real world MRI reconstruction applications, Proceedings of the International Workshop on Imaging Systems and Techniques (IEEE IST 2004), pp. 153-158, Stresa, Italy, 14 May 2004.
  • G.C. Giakos, N. Patnekar, S. Sumrain, L. Fraiwan, V. Kumar and G.B. Mertzios. A novel multipath dispersion reduction technique based on controlled-polarization optical wireless link set-up, 2003 IEEE Instrumentation and Measurement Technology Conference (IMTC), Vail, CO, USA, 20-22 May 2003.
Journal Publications
  • G.B. Mertzios, I. Sau, and S. Zaks. A New Intersection Model and Improved Algorithms for Tolerance Graphs. SIAM Journal on Discrete Mathematics, to appear.
  • G.B. Mertzios and W. Unger. Preemptive Scheduling of Equal-Length Jobs in Polynomial Time. Advances in Combinatorial Algorithms I, Mathematics in Computer Science, Birkhäuser / Springer, to appear.
  • G.B. Mertzios and W. Unger. An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs. Advances in Combinatorial Algorithms I, Mathematics in Computer Science, Birkhäuser / Springer, to appear.
  • G.B. Mertzios. A matrix characterization of interval and proper interval graphs. Applied Mathematics Letters, Vol. 21, No. 4, pages 332-337, 2008.
  • G.B. Mertzios. Solution of parameter-varying linear matrix inequalities in Toeplitz form, Journal of Applied Functional Analysis, vol. 1, pp. 131-152, No. 2, 2006.
  • G.C. Giakos, L. Fraiwan, N. Patnekar, S. Sumrain, G.B. Mertzios and S. Periyathamby. A sensitive optical polarimetric imaging technique for surface defects detection of aircraft turbine engines, Special Joint Issue - IEEE Transactions on Instrumentation and Measurement and IEEE/OSA Journal of Lightwave Technology, vol. 53, No.1, pp. 216-222, 2004.
Diploma Thesis
  • Improved Algorithms for the Constant-Excess Subgraph Problem and Applications, Technische Universität München, December 2004

Teaching Assistance

© Copyright Notice

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.