Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("BAREQUET, Gill")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 15 of 15

  • Page / 1
Export

Selection :

  • and

The on-line Heilbronn's triangle problemBAREQUET, Gill.Discrete mathematics. 2004, Vol 283, Num 1-3, pp 7-14, issn 0012-365X, 8 p.Article

A lower bound for Heilbronn's triangle problem in d dimensionsBAREQUET, Gill.SIAM journal on discrete mathematics (Print). 2001, Vol 14, Num 2, pp 230-236, issn 0895-4801Article

Optimal bounding cones of vectors in three dimensionsBAREQUET, Gill; ELBER, Gershon.Information processing letters. 2005, Vol 93, Num 2, pp 83-89, issn 0020-0190, 7 p.Article

Counting polycubes without the dimensionality curseALEKSANDROWICZ, Gadi; BAREQUET, Gill.Discrete mathematics. 2009, Vol 309, Num 13, pp 4576-4583, issn 0012-365X, 8 p.Article

w-Searchlight obedient graph drawingsBAREQUET, Gill.Lecture notes in computer science. 2001, pp 321-327, issn 0302-9743, isbn 3-540-41554-8Conference Paper

2-Point site Voronoi diagramsBAREQUET, Gill; DICKERSON, Matthew T; DRYSDALE, Robert L et al.Discrete applied mathematics. 2002, Vol 122, Num 1-3, pp 37-54, issn 0166-218XArticle

A bijection between permutations and floorplans, and its applicationsACKERMAN, Eyal; BAREQUET, Gill; PINTER, Ron Y et al.Discrete applied mathematics. 2006, Vol 154, Num 12, pp 1674-1684, issn 0166-218X, 11 p.Article

The on-line Heilbronn's triangle problem in three and four dimensionsBAREQUET, Gill.Lecture notes in computer science. 2002, pp 360-369, issn 0302-9743, isbn 3-540-43996-X, 10 p.Conference Paper

The number of guillotine partitions in d dimensionsACKERMAN, Eyal; BAREQUET, Gill; PINTER, Ron Y et al.Information processing letters. 2006, Vol 98, Num 4, pp 162-167, issn 0020-0190, 6 p.Article

An upper bound on the number of rectangulations of a point setACKERMAN, Eyal; BAREQUET, Gill; PINTER, Ron Y et al.Lecture notes in computer science. 2005, pp 554-559, issn 0302-9743, isbn 3-540-28061-8, 6 p.Conference Paper

Counting d-Dimensional Polycubes and Nonrectangular Planar PolyominoesALEKSANDROWICZ, Gadi; BAREQUET, Gill.Lecture notes in computer science. 2006, pp 418-427, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

The On-Line Heilbronn's Triangle Problem in d DimensionsBAREQUET, Gill; SHAIKHET, Alina.Lecture notes in computer science. 2006, pp 408-417, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

Efficiently approximating the minimum-volume bounding box of a point set in three dimensionsBAREQUET, Gill; HAR-PELED, Sariel.Journal of algorithms (Print). 2001, Vol 38, Num 1, pp 91-109, issn 0196-6774Conference Paper

Algorithms for two-box coveringARKIN, Esther M; BAREQUET, Gill; MITCHELL, Joseph S. B et al.SCG : symposium on computational geometry. 2006, pp 459-467, isbn 1-59593-340-9, 1Vol, 9 p.Conference Paper

Drawing graphs with large vertices and thick edgesBAREQUET, Gill; GOODRICH, Michael T; RILEY, Chris et al.Lecture notes in computer science. 2003, pp 281-293, issn 0302-9743, isbn 3-540-40545-3, 13 p.Conference Paper

  • Page / 1