default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames Haralambides
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c8]Dimitrios Charalampidis, James Haralambides:
A multilevel, multidimensional undergraduate course and lab experience on embedded multimedia systems. SIGCSE 2012: 631-636
2000 – 2009
- 2007
- [c7]James Haralambides, Dimitrios Charalampidis:
A progressive de-skewing technique for document image analysis. Visual Information Processing 2007: 657504 - 2005
- [c6]James Haralambides:
Multi-Level Graph Bisection and Cocktail Matching. CSC 2005: 122-128 - 2000
- [j7]Dinesh Bhatia
, James Haralambides:
Bounds, designs and layouts for multi-terminal FPIC architectures. Integr. 28(2): 141-156 (2000) - [j6]Dinesh Bhatia, James Haralambides:
Resource requirements and layouts for field programmable interconnection chips. IEEE Trans. Very Large Scale Integr. Syst. 8(3): 346-355 (2000)
1990 – 1999
- 1997
- [j5]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
- [j4]James Haralambides, Spyros Tragoudas:
Bipartitioning into Overlapping Sets. Int. J. Found. Comput. Sci. 6(1): 67-88 (1995) - [c5]Dinesh Bhatia, James Haralambides:
Resource requirements for field programmable interconnection chips. VLSI Design 1995: 376-380 - 1994
- [j3]James Haralambides, Spyros Tragoudas:
The Problem of Partitioning with Duplications and its Applications. Int. J. Artif. Intell. Tools 3(3): 395-406 (1994) - 1993
- [j2]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
- [j1]James Haralambides, Fillia Makedon, Burkhard Monien:
Bandwidth Minimization: An Approximation Algorithm for Caterpillars. Math. Syst. Theory 24(3): 169-177 (1991) - [c4]James Haralambides, Fillia Makedon:
Iterative compaction: an improved approach to graph and circuit bisection. EURO-DAC 1991: 523-527 - [c3]James Haralambides, Fillia Makedon:
Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees. ICCI 1991: 66-77 - 1990
- [c2]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 - [c1]James Haralambides, Fillia Makedon, Burkhard Monien:
Approximation algorithms for the bandwidth minimization problem for caterpillar graphs. SPDP 1990: 301-307
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
