default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGabriel Nivasch
Person information
- affiliation: Ariel University, Israel
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Alexander I. Bufetov, Gabriel Nivasch
, Fedor Pakhomov:
Generalized fusible numbers and their ordinals. Ann. Pure Appl. Log. 175(Issue 1, Part A): 103355 (2024)- [j22]Lee-Ad Gottlieb, Eran Kaufman, Aryeh Kontorovich, Gabriel Nivasch, Ofir Pele:
Nested barycentric coordinate system as an explicit feature map for polyhedra approximation and learning tasks. Mach. Learn. 113(10): 7807-7840 (2024) - 2023
- [i20]Lior Shiboli, Gabriel Nivasch:
Ordinals and recursive algorithms. CoRR abs/2311.17210 (2023) - 2022
- [j21]Jeff Erickson, Gabriel Nivasch, Junyan Xu:
Fusible numbers and Peano Arithmetic. Log. Methods Comput. Sci. 18(3) (2022) - [j20]Lee-Ad Gottlieb, Eran Kaufman, Aryeh Kontorovich, Gabriel Nivasch:
Learning Convex Polyhedra With Margin. IEEE Trans. Inf. Theory 68(3): 1976-1984 (2022) - [i19]Alexander I. Bufetov, Gabriel Nivasch, Fedor Pakhomov:
Generalized fusible numbers and their ordinals. CoRR abs/2205.11017 (2022) - 2021
- [j19]Inbar Daum-Sadon, Gabriel Nivasch:
Upper bounds for stabbing simplices by a line. Discret. Appl. Math. 304: 248-259 (2021) - [j18]Sergey Avvakumov, Gabriel Nivasch:
Homotopic curve shortening and the affine curve-shortening flow. J. Comput. Geom. 12(1): 145-177 (2021) - [j17]Oren Friman, Gabriel Nivasch:
Some i-Mark games. Theor. Comput. Sci. 885: 116-124 (2021) - [c9]Lee-Ad Gottlieb, Eran Kaufman, Aryeh Kontorovich, Gabriel Nivasch, Ofir Pele:
Nested Barycentric Coordinate System as an Explicit Feature Map. AISTATS 2021: 766-774 - [c8]Jeff Erickson, Gabriel Nivasch, Junyan Xu:
Fusible numbers and Peano Arithmetic. LICS 2021: 1-13 - 2020
- [j16]David Eppstein, Sariel Har-Peled, Gabriel Nivasch:
Grid Peeling and the Affine Curve-Shortening Flow. Exp. Math. 29(3): 306-316 (2020) - [c7]Sergey Avvakumov, Gabriel Nivasch:
Homotopic Curve Shortening and the Affine Curve-Shortening Flow. SoCG 2020: 12:1-12:15 - [i18]Inbar Daum-Sadon, Gabriel Nivasch:
Upper bounds for stabbing simplices by a line. CoRR abs/2001.00782 (2020) - [i17]Lee-Ad Gottlieb, Eran Kaufman, Aryeh Kontorovich, Gabriel Nivasch, Ofir Pele:
Nested Barycentric Coordinate System as an Explicit Feature Map. CoRR abs/2002.01999 (2020) - [i16]Jeff Erickson, Gabriel Nivasch, Junyan Xu:
Fusible numbers and Peano Arithmetic. CoRR abs/2003.14342 (2020) - [i15]Oren Friman, Gabriel Nivasch:
Some i-Mark games. CoRR abs/2007.00721 (2020)
2010 – 2019
- 2019
- [i14]Sergey Avvakumov, Gabriel Nivasch:
Homotopic curve shortening and the affine curve-shortening flow. CoRR abs/1909.00263 (2019) - 2018
- [c6]David Eppstein, Sariel Har-Peled, Gabriel Nivasch:
Grid peeling and the affine curve-shortening flow. ALENEX 2018: 109-116 - [c5]Lee-Ad Gottlieb, Eran Kaufman, Aryeh Kontorovich, Gabriel Nivasch:
Learning convex polytopes with margin. NeurIPS 2018: 5711-5721 - [i13]Lee-Ad Gottlieb, Eran Kaufman, Aryeh Kontorovich, Gabriel Nivasch:
Learning convex polytopes with margin. CoRR abs/1805.09719 (2018) - 2017
- [j15]Gabriel Nivasch:
On the zone of a circle in an arrangement of lines. Discret. Math. 340(7): 1535-1552 (2017) - [j14]Gabriel Nivasch, Eran Omri:
Rainbow Matchings and Algebras of Sets. Graphs Comb. 33(2): 473-484 (2017) - [j13]Boris Bukh, Po-Shen Loh, Gabriel Nivasch:
Classifying unavoidable Tverberg partitions. J. Comput. Geom. 8(1): 174-205 (2017) - [i12]David Eppstein, Sariel Har-Peled, Gabriel Nivasch:
Grid peeling and the affine curve-shortening flow. CoRR abs/1710.03960 (2017) - 2016
- [i11]Boris Bukh, Gabriel Nivasch:
One-sided epsilon-approximants. CoRR abs/1603.05717 (2016) - [i10]Boris Bukh, Po-Shen Loh, Gabriel Nivasch:
Classifying unavoidable Tverberg partitions. CoRR abs/1611.01078 (2016) - 2015
- [j12]Sathish Govindarajan, Gabriel Nivasch:
A Variant of the Hadwiger-Debrunner (p, q)-Problem in the Plane. Discret. Comput. Geom. 54(3): 637-646 (2015) - [j11]Gabriel Nivasch:
On the zone of a circle in an arrangement of lines. Electron. Notes Discret. Math. 49: 221-231 (2015) - [j10]Gabriel Nivasch, Eran Omri:
Rainbow matchings and algebras of sets. Electron. Notes Discret. Math. 49: 251-257 (2015) - [i9]Gabriel Nivasch:
On the zone of a circle in an arrangement of lines. CoRR abs/1503.03462 (2015) - 2014
- [j9]Gabriel Nivasch, János Pach, Gábor Tardos:
The visible perimeter of an arrangement of disks. Comput. Geom. 47(1): 42-51 (2014) - [i8]Sathish Govindarajan, Gabriel Nivasch:
A variant of the Hadwiger-Debrunner (p, q)-problem in the plane. CoRR abs/1409.1194 (2014) - 2013
- [j8]Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib:
The number of distinct distances from a vertex of a convex polygon. J. Comput. Geom. 4(1): 1-12 (2013) - 2012
- [j7]Boris Bukh, Gabriel Nivasch:
Upper bounds for centerlines. J. Comput. Geom. 3(1): 20-30 (2012) - [c4]Gabriel Nivasch, János Pach, Gábor Tardos:
The Visible Perimeter of an Arrangement of Disks. GD 2012: 364-375 - [i7]Gabriel Nivasch, János Pach, Gábor Tardos:
The visible perimeter of an arrangement of disks. CoRR abs/1206.1422 (2012) - [i6]Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib:
The number of distinct distances from a vertex of a convex polygon. CoRR abs/1207.1266 (2012) - 2011
- [i5]Boris Bukh, Gabriel Nivasch:
Upper bounds for centerlines. CoRR abs/1107.3421 (2011) - 2010
- [j6]Boris Bukh, Jirí Matousek, Gabriel Nivasch:
Stabbing Simplices by Points and Flats. Discret. Comput. Geom. 43(2): 321-338 (2010) - [j5]Gabriel Nivasch:
Improved bounds and new techniques for Davenport-Schinzel sequences and their generalizations. J. ACM 57(3): 17:1-17:44 (2010)
2000 – 2009
- 2009
- [b1]Gabriel Nivasch:
Weak epsilon-nets, Davenport-Schinzel sequences, and related problems. Tel Aviv University, Israel, 2009 - [j4]Gabriel Nivasch, Micha Sharir:
Eppstein's bound on intersecting triangles revisited. J. Comb. Theory A 116(2): 494-497 (2009) - [c3]Boris Bukh, Jirí Matousek, Gabriel Nivasch:
Lower bounds for weak epsilon-nets and stair-convexity. SCG 2009: 1-10 - [c2]Gabriel Nivasch:
Improved bounds and new techniques for Davenport-Schinzel sequences and their generalizations. SODA 2009: 1-10 - 2008
- [j3]Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky:
Weak ε-nets and interval chains. J. ACM 55(6): 28:1-28:32 (2008) - [c1]Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky:
Weak ε-nets and interval chains. SODA 2008: 1194-1203 - [i4]Gabriel Nivasch, Micha Sharir:
Eppstein's bound on intersecting triangles revisited. CoRR abs/0804.4415 (2008) - [i3]Boris Bukh, Jirí Matousek, Gabriel Nivasch:
Stabbing simplices by points and flats. CoRR abs/0804.4464 (2008) - [i2]Gabriel Nivasch:
Improved bounds and new techniques for Davenport-Schinzel sequences and their generalizations. CoRR abs/0807.0484 (2008) - [i1]Boris Bukh, Jirí Matousek, Gabriel Nivasch:
Lower bounds for weak epsilon-nets and stair-convexity. CoRR abs/0812.5039 (2008) - 2006
- [j2]Gabriel Nivasch:
The Sprague-Grundy function of the game Euclid. Discret. Math. 306(21): 2798-2800 (2006) - 2004
- [j1]Gabriel Nivasch:
Cycle detection using a stack. Inf. Process. Lett. 90(3): 135-140 (2004)
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-12-10 20:51 CET 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:
