The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

James Haralambides: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.022secs, Finished in 0.023secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002