Approximation algorithms for the bandwidth minimization problem for caterpillar graphs. - James Haralambides; Fillia Makedon; Burkhard Monien (SPDP, 1990)

Iterative compaction: an improved approach to graph and circuit bisection. - James Haralambides; Fillia Makedon (EURO-DAC, 1991)

Bandwidth Minimization: An Approximation Algorithm for Caterpillars. - James Haralambides; Fillia Makedon; Burkhard Monien (Math. Syst. Theory, 1991)

Drawing Graphs in the Plane with High Resolution. - Michael Formann; Torben Hagerup; James Haralambides; Michael Kaufmann 001; Frank Thomson Leighton; Antonios Symvonis; Emo Welzl; Gerhard J. Woeginger (SIAM J. Comput., 1993)

The Problem of Partitioning with Duplications and its Applications. - James Haralambides; Spyros Tragoudas (Int. J. Artif. Intell. Tools, 1994)

Resource requirements for field programmable interconnection chips. - Dinesh Bhatia; James Haralambides (VLSI Design, 1995)

Bipartitioning into Overlapping Sets. - James Haralambides; Spyros Tragoudas (Int. J. Found. Comput. Sci., 1995)

Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees. - James Haralambides; Fillia Makedon (Theory Comput. Syst., 1997)

Bounds, designs and layouts for multi-terminal FPIC architectures. - Dinesh Bhatia; James Haralambides (Integr., 2000)

Resource requirements and layouts for field programmable interconnection chips. - Dinesh Bhatia; James Haralambides (IEEE Trans. Very Large Scale Integr. Syst., 2000)

Multi-Level Graph Bisection and Cocktail Matching. - James Haralambides (CSC, 2005)

A progressive de-skewing technique for document image analysis. - James Haralambides; Dimitrios Charalampidis (Visual Information Processing, 2007)

A multilevel, multidimensional undergraduate course and lab experience on embedded multimedia systems. - Dimitrios Charalampidis; James Haralambides (SIGCSE, 2012)