Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Barequet, Gill"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Polyominoes on twisted cylinders
Gill Barequet
,
Mira Shalah
Proceedings of the 29th Annual ACM Symposium on Computional Geometry, SoCG'2013 (Rio de Janeiro, Brazil, June 17-20, 2013)
, 2013, pp. 339-340
A polyominoes-permutations injection and tree-like convex polyominoes
Gadi Aleksandrowicz
,
Andrei Asinowski
,
Gill Barequet
Journal of Combinatorial Theory Series A
119
(3), 2012, pp. 503-520
Proper
n
-cell polycubes in
n-3
dimensions
Andrei Asinowski
,
Gill Barequet
,
Ronnie Barequet
,
Günter Rote
Lecture Notes in Computer Science
6842
, 2011, pp. 180-191
Formulae and growth rates of high-dimensional polycubes
Ronnie Barequet
,
Gill Barequet
,
Günter Rote
Combinatorica
30
(3), 2010, pp. 257-275
Counting polycubes without the dimensionality curse
Gadi Aleksandrowicz
,
Gill Barequet
Lecture Notes in Computer Science
5092
, 2008, pp. 100-109
Counting polycubes without the dimensionality curse
Gadi Aleksandrowicz
,
Gill Barequet
Lecture Notes in Computer Science
5092
, 2008, pp. 100-109
Straight skeletons of three-dimensional polyhedra
Gill Barequet
,
David Eppstein
,
Michael T. Goodrich
,
Amir Vaxman
Lecture Notes in Computer Science
5193
, 2008, pp. 148-160
The number of guillotine partitions in
d
dimensions
Eyal Ackerman
,
Gill Barequet
,
Ron Y. Pinter
,
Dan Romik
Information Processing Letters
98
(4), 2006, pp. 162-167
On the number of rectangulations of a planar point set
Eyal Ackerman
,
Gill Barequet
,
Ron Y. Pinter
Journal of Combinatorial Theory Series A
113
(6), 2006, pp. 1072-1091
Counting
d
-dimensional polycubes and nonrectangular planar polyominoes
Gadi Aleksandrowicz
,
Gill Barequet
Lecture Notes in Computer Science
4112
, 2006, pp. 418-427
The on-line Heilbronn's triangle problem in
d
dimensions
Gill Barequet
,
Alina Shaikhet
Lecture Notes in Computer Science
4112
, 2006, pp. 408-417
An upper bound on the number of rectangulations of a point set
Eyal Ackerman
,
Gill Barequet
,
Ron Y. Pinter
Lecture Notes in Computer Science
3595
, 2005, pp. 554-559
Optimal bounding cones of vectors in three dimensions
Gill Barequet
,
Gershon Elber
Information Processing Letters
93
(2), 2005, pp. 83-89
Drawing graphs with large vertices and thick edges
Gill Barequet
,
Michael T. Goodrich
,
Chris Riley
Lecture Notes in Computer Science
2748
, 2003, pp. 281-293
The on-line Heilbronn's triangle problem in three and four dimensions
Gill Barequet
Lecture Notes in Computer Science
2387
, 2002, pp. 360-369
Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
Gill Barequet
,
Sariel Har-Peled
Journal of Algorithms
38
(1), 2001, pp. 91-109
\omega
-searchlight obedient graph drawings
Gill Barequet
Lecture Notes in Computer Science
1984
, 2001, pp. 321-327
A lower bound for Heilbronn's triangle problem in
d
dimensions
Gill Barequet
SIAM Journal on Discrete Mathematics
14
(2), 2001, pp. 230-236
A duality between small-face problems in arrangements of lines and Heilbronn-type problems
Gill Barequet
Lecture Notes in Computer Science
1858
, 2000, pp. 44-53
Optimizing constrained offset and scaled polygonal annuli
Gill Barequet
,
Prosenjit Bose
,
Matthew T. Dickerson
Lecture Notes in Computer Science
1663
, 1999, pp. 62-73
2-point site Voronoi diagrams
Gill Barequet
,
Matthew T. Dickerson
,
Robert L. Scot Drysdale
Lecture Notes in Computer Science
1663
, 1999, pp. 219-230
Polygon-containment and translational min-Hausdorff-distance between segment sets are 3sum-hard
Gill Barequet
,
Sariel Har-Peled
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 862-863
Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
Gill Barequet
,
Sariel Har-Peled
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 82-91
A lower bound for Heilbronn's triangle problem in
d
dimensions
Gill Barequet
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 76-81
Offset-polygon annulus placement problems
Gill Barequet
,
Amy J. Briggs
,
Matthew T. Dickerson
,
Michael T. Goodrich
Lecture Notes in Computer Science
1272
, 1997, pp. 378-391
Seiten 1
2
>