default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJayanth Majhi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2002
[j7]Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram:
A decomposition-based approach to layered manufacturing. Comput. Geom. 23(2): 117-151 (2002)- 2000
- [j6]Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi:
Protecting critical facets in layered manufacturing. Comput. Geom. 16(3): 187-210 (2000) - 1999
- [j5]Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta:
On some geometric optimization problems in layered manufacturing. Comput. Geom. 12(3-4): 219-239 (1999) - [j4]Jayanth Majhi, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid, Prosenjit Gupta:
Minimizing support structures and trapped area in two-dimensional layered manufacturing. Comput. Geom. 12(3-4): 241-267 (1999) - [j3]Jayanth Majhi, Prosenjit Gupta, Ravi Janardan:
Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. Comput. Geom. 13(4): 229-252 (1999) - [j2]Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan:
Computing the Width of a Three-Dimensional Point Set: An Experimental Study. ACM J. Exp. Algorithmics 4: 8 (1999) - 1996
- [j1]Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo:
Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining. Comput. Aided Des. 28(8): 577-587 (1996)
Conference and Workshop Papers
- 2001
- [c7]Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram:
A Decomposition-Based Approach to Layered Manufacturing. WADS 2001: 389-400 - 1999
- [c6]Jörg Schwerdt, Michiel H. M. Smid, Ravi Janardan, Eric Johnson, Jayanth Majhi:
Protecting Facets in Layered Manufacturing. FSTTCS 1999: 291-303 - 1998
- [c5]Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Jörg Schwerdt:
Multi-Criteria Geometric Optimization Problems in Layered Manufacturing. SCG 1998: 19-28 - [c4]Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan:
Computing the Width of a Three-Dimensional Point Set: An Experimental Study. WAE 1998: 62-73 - 1997
- [c3]Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta:
On Some Geometric Optimization Problems in Layered Manufacturing. WADS 1997: 136-149 - 1996
- [c2]Jayanth Majhi, Prosenjit Gupta, Ravi Janardan:
Computing a Flattest, Undercut-Free Parting Line for a Convex Polyhedron, with Application to Mold Design. WACG 1996: 109-120 - 1995
- [c1]Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo:
Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-Machining. WADS 1995: 171-182
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-04-24 22:52 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:
