James Haralambides

Dimitrios Charalampidis, James Haralambides: A multilevel, multidimensional undergraduate course and lab experience on embedded multimedia systems. SIGCSE 2012: 631-636

James Haralambides: Multi-Level Graph Bisection and Cocktail Matching. CSC 2005: 122-128

Dinesh Bhatia, James Haralambides: Bounds, designs and layouts for multi-terminal FPIC architectures. Integration 28(2): 141-156 (2000)

Dinesh Bhatia, James Haralambides: Resource requirements and layouts for field programmable interconnection chips. IEEE Trans. VLSI Syst. 8(3): 346-355 (2000)

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

James Haralambides, Spyros Tragoudas: Bipartitioning into Overlapping Sets. Int. J. Found. Comput. Sci. 6(1): 67-88 (1995)

Dinesh Bhatia, James Haralambides: Resource requirements for field programmable interconnection chips. VLSI Design 1995: 376-380

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

James Haralambides, Fillia Makedon, Burkhard Monien: Bandwidth Minimization: An Approximation Algorithm for Caterpillars. Mathematical Systems Theory 24(3): 169-177 (1991)

James Haralambides, Fillia Makedon: Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees. ICCI 1991: 66-77

Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger: Drawing Graphs in the Plane with High Resolution. FOCS 1990: 86-95

James Haralambides, Fillia Makedon, Burkhard Monien: Approximation algorithms for the bandwidth minimization problem for caterpillar graphs. SPDP 1990: 301-307