default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDValeriu Soltan
Person information
- affiliation: George Mason University, Fairfax, VA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[p1]Walter D. Morris Jr., Valeriu Soltan:
The Erdős-Szekeres Problem. Open Problems in Mathematics 2016: 351-375
2000 – 2009
- 2005
- [j12]Valeriu Soltan:
Pairs of Convex Bodies with Centrally Symmetric Intersections of Translates. Discret. Comput. Geom. 33(4): 605-616 (2005) - [j11]Horst Martini, Valeriu Soltan:
Antipodality properties of finite sets in Euclidean space. Discret. Math. 290(2/3): 221-228 (2005) - 2003
- [j10]Valeriu Soltan:
The Characteristic Intersection Property of Line-Free Choquet Simplices in Ed. Discret. Comput. Geom. 29(4): 561-573 (2003)
1990 – 1999
- 1999
- [j9]Valeriu Soltan:
A Characterization of Homothetic Simplices. Discret. Comput. Geom. 22(2): 193-200 (1999) - [j8]Vladimir G. Boltyanski, Horst Martini, Valeriu Soltan:
On Grünbaum's Conjecture about Inner Illumination of Convex Bodies. Discret. Comput. Geom. 22(3): 403-410 (1999) - [j7]Horst Martini, Valeriu Soltan:
Minimum Number of Pieces in a Convex Partition of a Polygonal Domain. Int. J. Comput. Geom. Appl. 9(6): 599-614 (1999) - 1998
- [j6]Horst Martini, Valeriu Soltan:
Minimum Convex Partition of Polygonal Domains by Guillotine Cuts. Discret. Comput. Geom. 19(2): 291-305 (1998) - [j5]Andrzej Lingas, Valeriu Soltan:
Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions. Theory Comput. Syst. 31(5): 507-538 (1998) - 1996
- [c2]Andrzej Lingas, Valeriu Soltan:
Minimum Convex Partition of a Polygon with Holes by Cuts in Given Directions. ISAAC 1996: 315-325 - 1995
- [j4]Valeriu Soltan:
On Antipodal and Adjoint Pairs of Points for Two Convex Bodies. Discret. Comput. Geom. 13: 629-636 (1995) - 1994
- [j3]Mahn Hung Nguyên, Valeriu Soltan:
Lower Bounds for the Numbers of Antipodal Pairs and Strictly Antipodal Pairs of Vertices in a Convex Polytope. Discret. Comput. Geom. 11: 149-162 (1994) - 1993
- [j2]Valeriu Soltan, Alexei Gorpinevich:
Minimum Dissection of a Rectilinear Polygon with Arbitrary Holes into Rectangles. Discret. Comput. Geom. 9: 57-79 (1993) - 1992
- [c1]Valeriu Soltan, Alexei Gorpinevich:
Minimum Dissection of Rectilinear Polygon with Arbitrary Holes into Rectangles. SCG 1992: 296-302 - 1990
- [j1]Valeriu Soltan, Mahn Hung Nguyên:
Some notes about affine diameters of convex figures. Comb. 10(3): 313-317 (1990)
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 23:02 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:
