 | 2005 |
|---|
| 11 |       | James Haralambides:
Multi-Level Graph Bisection and Cocktail Matching.
CSC 2005: 122-128 |
| 2000 |
|---|
| 10 |  | Dinesh Bhatia,
James Haralambides:
Resource requirements and layouts for field programmable interconnection chips.
IEEE Trans. VLSI Syst. 8(3): 346-355 (2000) |
| 9 | | Dinesh Bhatia,
James Haralambides:
Bounds, designs and layouts for multi-terminal FPIC architectures.
Integration 28(2): 141-156 (2000) |
| 1997 |
|---|
| 8 | | 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) |
| 1995 |
|---|
| 7 | | Dinesh Bhatia,
James Haralambides:
Resource requirements for field programmable interconnection chips.
VLSI Design 1995: 376-380 |
| 6 | | James Haralambides,
Spyros Tragoudas:
Bipartitioning into Overlapping Sets.
Int. J. Found. Comput. Sci. 6(1): 67-88 (1995) |
| 1993 |
|---|
| 5 | | 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) |
| 1991 |
|---|
| 4 | | James Haralambides,
Fillia Makedon:
Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees.
ICCI 1991: 66-77 |
| 3 | | James Haralambides,
Fillia Makedon,
Burkhard Monien:
Bandwidth Minimization: An Approximation Algorithm for Caterpillars.
Mathematical Systems Theory 24(3): 169-177 (1991) |
| 1990 |
|---|
| 2 | | 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 |
| 1 | | James Haralambides,
Fillia Makedon,
Burkhard Monien:
Approximation algorithms for the bandwidth minimization problem for caterpillar graphs.
SPDP 1990: 301-307 |
