James Haralambides

According to our database, James Haralambides authored at least 13 papers between 1990 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2012

A multilevel, multidimensional undergraduate course and lab experience on embedded multimedia systems.

Dimitrios Charalampidis, James Haralambides

Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

2007

A progressive de-skewing technique for document image analysis.

James Haralambides, Dimitrios Charalampidis

Proceedings of the Visual Information Processing XVI, 2007

2005

Multi-Level Graph Bisection and Cocktail Matching.

James Haralambides

Proceedings of The 2005 International Conference on Scientific Computing, 2005

2000

Resource requirements and layouts for field programmable interconnection chips.

Dinesh Bhatia, James Haralambides

IEEE Trans. Very Large Scale Integr. Syst., 2000

Bounds, designs and layouts for multi-terminal FPIC architectures.

Dinesh Bhatia, James Haralambides

Integr., 2000

1997

Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees.

James Haralambides, Fillia Makedon

Theory Comput. Syst., 1997

1995

Bipartitioning into Overlapping Sets.

James Haralambides, Spyros Tragoudas

Int. J. Found. Comput. Sci., 1995

Resource requirements for field programmable interconnection chips.

Dinesh Bhatia, James Haralambides

Proceedings of the 8th International Conference on VLSI Design (VLSI Design 1995), 1995

1994

The Problem of Partitioning with Duplications and its Applications.

James Haralambides, Spyros Tragoudas

Int. J. Artif. Intell. Tools, 1994

1993

Drawing Graphs in the Plane with High Resolution.

Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger

SIAM J. Comput., 1993

1991

Bandwidth Minimization: An Approximation Algorithm for Caterpillars.

James Haralambides, Fillia Makedon, Burkhard Monien

Math. Syst. Theory, 1991

Iterative compaction: an improved approach to graph and circuit bisection.

James Haralambides, Fillia Makedon

Proceedings of the conference on European design automation, 1991

1990

Approximation algorithms for the bandwidth minimization problem for caterpillar graphs.

James Haralambides, Fillia Makedon, Burkhard Monien

Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990