default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaurabh Sethia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j7]Prosenjit Bose
, Mercè Mora, Carlos Seara, Saurabh Sethia:
On Computing Enclosing Isosceles Triangles and Related Problems. Int. J. Comput. Geom. Appl. 21(1): 25-45 (2011)
2000 – 2009
- 2005
- [j6]Ferran Hurtado, Carlos Seara, Saurabh Sethia:
Red-blue separability problems in 3D. Int. J. Comput. Geom. Appl. 15(2): 167-192 (2005) - [j5]Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia:
Optimal Covering Tours with Turn Costs. SIAM J. Comput. 35(3): 531-566 (2005) - [j4]Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia:
Games on triangulations. Theor. Comput. Sci. 343(1-2): 42-71 (2005) - 2004
- [j3]Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena:
When can you fold a map? Comput. Geom. 29(1): 23-46 (2004) - [j2]Michael A. Bender, Saurabh Sethia, Steven Skiena:
Data structures for maintaining set partitions. Random Struct. Algorithms 25(1): 43-67 (2004) - [c10]Prosenjit Bose, Carlos Seara, Saurabh Sethia:
On computing enclosing isosceles triangles and related problems. CCCG 2004: 120-123 - [c9]Yaroslav Bulatov, Sachin Jambawalikar, Piyush Kumar, Saurabh Sethia:
Hand Recognition Using Geometric Classifiers. ICBA 2004: 753-759 - [c8]René F. Reitsma, Stanislav Trubin, Saurabh Sethia:
Information Space Regionalization Using Adaptive Multiplicatively Weighted Voronoi Diagrams. IV 2004: 290-294 - 2003
- [c7]Ferran Hurtado, Carlos Seara, Saurabh Sethia:
Red-Blue Separability Problems in 3D. ICCSA (3) 2003: 766-775 - [i3]Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia:
Optimal Covering Tours with Turn Costs. CoRR cs.DS/0309014 (2003) - 2002
- [c6]Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia:
Playing with Triangulations. JCDCG 2002: 22-37 - [i2]Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristán, Saurabh Sethia:
On the Reflexivity of Point Sets. CoRR cs.CG/0210003 (2002) - 2001
- [c5]Saurabh Sethia, Martin Held, Joseph S. B. Mitchell:
PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets. ALENEX 2001: 105-116 - [c4]Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia:
Optimal covering tours with turn costs. SODA 2001: 138-147 - [c3]Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristán, Saurabh Sethia:
On the Reflexivity of Point Sets. WADS 2001: 192-204 - [c2]Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena:
When Can You Fold a Map? WADS 2001: 401-413 - 2000
- [c1]Michael A. Bender, Saurabh Sethia, Steven Skiena:
Data Structures for Maintaining Set Partitions. SWAT 2000: 83-96 - [i1]Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena:
When Can You Fold a Map? CoRR cs.CG/0011026 (2000)
1990 – 1999
- 1998
- [j1]Saurabh Sethia, S. Manohar:
Minkowski operators for voxel based sculpting. Comput. Graph. 22(5): 593-600 (1998)
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-10-07 22:16 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:
