Теория Задачи Инструменты Социум Интересно

Личный Кабинет

Войдите или зарегистрируйтесь
Лаборатория LMatrix
Лаборатория Lmatrix занимается оптимизацией транспортных задач. Сюда можно отнести задачи поиска кратчайшего пути в ориентированных графах, применимые как к масштабам города и страны, классическую задачу обхода (коммивояжера), задачи оптимизации доставки грузов, задачи трехмерной упаковки.
Новости проекта

31.05.2013 - Универсиада. Маршрут по России и Татарстану. Официально и математически.

Огонь Универсиады приближается к финишу в Казани, но прежде пройдет по 43 городам республики Татарстан. Все об маршрутах огня в нашем анонсе.

Тематические статьи

26.07.2013 - Монитор в автомобиле будет дублировать экран смартфона

Водители смогут увидеть точную копию экрана своего смартфона на мониторе бортовой системы автомобиля. О сотрудничестве в этом направлении договорились разработчик ПО для удаленного управления устройствами RealVNC и производитель процессоров Texas Instruments.

29.03.2013 - Facebook на днях анонсирует собственный смартфон на Android

На следующей неделе Facebook собирается представить собственный смартфон с кастомизированной версией Android, утверждают источники. Ранее глава компании Марк Цукерберг опровергал слухи о выпуске собственного смартфона.

29.03.2013 - Основатель Facebook М.Цукерберг создает политическую организацию

Основатель социальной сети Facebook Марк Цукерберг создает политическую организацию, которая займется такими вопросами, как реформа образования, иммиграция и научные исследования, передает Associated Press со ссылкой на анонимный источник.

Дэвид Эппштейн. Публикации. Часть T-Z

22 апреля 2011 года в 06:45   Просмотров: 4438

Tangent spheres and triangle centers

@misc{math.MG/9909152,
title = {{Tangent spheres and triangle centers}},
author = {David Eppstein},
eprint = {math.MG/9909152},
howpublished = {arXiv.org e-Print archive},
month = {September},
year = {1999}}

@article{Epp-AMM-01,
title = {{Tangent spheres and triangle centers}},
author = {David Eppstein},
eprint = {math.MG/9909152},
journal = {American Mathematical Monthly},
publisher = {Amer. Math. Soc.},
volume = {108},
number = {1},
pages = {63--66},
month = {January},
year = {2001}}

Ten algorithms for Egyptian fractions

@article{Epp-MER-95,
title = {{Ten algorithms for Egyptian fractions}},
author = {David Eppstein},
journal = {Mathematica in Education and Research},
volume = {4},
number = {2},
pages = {5--15},
year = {1995}}

Testing bipartiteness of geometric intersection graphs

@misc{cs.CG/0307023,
title = {{Testing bipartiteness of geometric intersection graphs}},
author = {David Eppstein},
eprint = {cs.CG/0307023},
howpublished = {ACM Computing Research Repository},
month = {July},
year = {2003}}

@inproceedings{Epp-SODA-04-bgig,
title = {{Testing bipartiteness of geometric intersection graphs}},
author = {David Eppstein},
eprint = {cs.CG/0307023},
booktitle = {Proc. 15th Symp. Discrete Algorithms},
publisher = {ACM and SIAM},
pages = {853--861},
month = {January},
year = {2004}}

The centroid of points with approximate weights

@inproceedings{BerEppGui-ESA-95,
title = {{The centroid of points with approximate weights}},
author = {Marshall Wayne Bern and David Eppstein and Leonidas J. Guibas
and John E. Hershberger and Subhash Suri and Jan Dithmar Wolter},
booktitle = {Proc. 3rd Eur. Symp. Algorithms (ESA 1995)},
number = {979},
editor = {Paul G. Spirakis},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
pages = {460--472},
month = {September},
year = {1995},
url = {http://www.ics.uci.edu/~eppstein/pubs/BerEppGui-ESA-95.ps.gz}}

The crust and the $\beta$-skeleton: combinatorial curve reconstruction

@article{AmeBerEpp-GMIP-98,
title = {{The crust and the $\beta$-skeleton: combinatorial curve reconstruction}},
author = {Annamaria Beatrice Amenta and Marshall Wayne Bern and David Eppstein},
journal = {Graphical Models {\&} Image Processing},
volume = {60/2},
number = {2},
pages = {125--135},
month = {March},
year = {1998},
url = {http://www.cs.utexas.edu/users/amenta/pubs/crust.ps.gz}}

The diameter of nearest neighbor graphs

@techreport{Epp-TR-92-76,
title = {{The diameter of nearest neighbor graphs}},
author = {David Eppstein},
address = {Irvine, CA, 92697-3425, USA},
institution = {Univ. of California, Irvine, Dept. of Information and Computer
Science},
number = {92-76},
year = {1992},
url = {http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-92-76.pdf}}

The distribution of cycle lengths in graphical models for iterative decoding

@techreport{GeEppSmy-TR-99,
title = {{The distribution of cycle lengths in graphical models for iterative
decoding}},
author = {Xianping Ge and David Eppstein and Padhraic Smyth},
eprint = {cs.DM/9907002},
address = {Irvine, CA, 92697-3425, USA},
institution = {Univ. of California, Irvine, Dept. of Information and Computer
Science},
number = {99-10},
year = {1999}}

@misc{cs.DM/9907002,
title = {{The distribution of cycle lengths in graphical models for iterative
decoding}},
author = {Xianping Ge and David Eppstein and Padhraic Smyth},
eprint = {cs.DM/9907002},
howpublished = {ACM Computing Research Repository},
month = {July},
year = {1999}}

@inproceedings{GeEppSmy-ISIT-2000,
title = {{The distribution of cycle lengths in graphical models for iterative
decoding}},
author = {Xianping Ge and David Eppstein and Padhraic Smyth},
eprint = {cs.DM/9907002},
booktitle = {Proc. Int. Symp. Information Theory},
publisher = {IEEE},
month = {June},
year = {2000}}

The distribution of loop lengths in graphical models for turbo decoding

@article{GeEppSmy-IT-01,
title = {{The distribution of loop lengths in graphical models for turbo
decoding}},
author = {Xianping Ge and David Eppstein and Padhraic Smyth},
journal = {IEEE Trans. Information Theory},
publisher = {IEEE},
volume = {47},
number = {6},
pages = {2549--2553},
month = {September},
year = {2001},
review = {MR-2002i:94087}}

@article{MR-2002i:94087,
reviews = {GeEppSmy-IT-01},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{The distribution of loop lengths in graphical models for turbo
decoding}},
number = {2002i:94087},
year = {2002}}

The effect of faults on network expansion

@inproceedings{BagBhaCha-SPAA-04,
title = {{The effect of faults on network expansion}},
author = {Amitabha Bagchi and Ankur Bhargava and Amitabh Chaudhary and
David Eppstein and Christian Scheideler},
eprint = {cs.DC/0404029},
booktitle = {Proc. 16th Symp. Parallelism in Algorithms and Architectures
(SPAA 2004)},
publisher = {ACM},
pages = {286--293},
year = {2004},
url = {http://doi.acm.org/10.1145/1007912.1007960}}

@misc{cs.DC/0404029,
title = {{The effect of faults on network expansion}},
author = {Amitabha Bagchi and Ankur Bhargava and Amitabh Chaudhary and
David Eppstein and Christian Scheideler},
eprint = {cs.DC/0404029},
howpublished = {ACM Computing Research Repository},
month = {April},
year = {2004}}

The expected extremes in a Delaunay triangulation

@article{BerEppYao-IJCGA-91,
title = {{The expected extremes in a Delaunay triangulation}},
author = {Marshall Wayne Bern and David Eppstein and Frances F. Yao},
journal = {Int. J. Computational Geometry {\&} Applications},
volume = {1},
number = {1},
pages = {79--92},
month = {March},
year = {1991},
url = {http://www.ics.uci.edu/~eppstein/pubs/BerEppYao-IJCGA-91.pdf},
review = {MR-92e:68189}}

@article{MR-92e:68189,
reviews = {BerEppYao-IJCGA-91},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{The expected extremes in a Delaunay triangulation}},
author = {Albrecht H{\"u}bler},
number = {92e:68189},
year = {1992}}

@inproceedings{BerEppYao-ICALP-91,
title = {{The expected extremes in a Delaunay triangulation}},
author = {Marshall Wayne Bern and David Eppstein and Frances F. Yao},
booktitle = {Proc. 18th Int. Coll. Automata, Languages, and Programming
(ICALP 1991)},
number = {510},
editor = {Javier Leach Albert and Burkhard Monien and Mario Rodr{\'\i}guez-Artalejo},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
pages = {674--685},
month = {July},
year = {1991}}

The farthest point Delaunay triangulation minimizes angles

@techreport{Epp-TR-90-45,
title = {{The farthest point Delaunay triangulation minimizes angles}},
author = {David Eppstein},
address = {Irvine, CA, 92697-3425, USA},
institution = {Univ. of California, Irvine, Dept. of Information and Computer
Science},
number = {90-45},
year = {1990},
url = {http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-90-45.pdf}}

@article{Epp-CGTA-92,
title = {{The farthest point Delaunay triangulation minimizes angles}},
author = {David Eppstein},
journal = {Computational Geometry Theory {\&} Applications},
volume = {1},
number = {3},
pages = {143--148},
month = {March},
year = {1992},
url = {http://dx.doi.org/10.1016/S0925-7721(98)00031-5},
review = {MR-92j:68119}}

@article{MR-92j:68119,
reviews = {Epp-CGTA-92},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{The farthest point Delaunay triangulation minimizes angles}},
number = {92j:68119},
year = {1992}}

The geometric thickness of low degree graphs

@misc{cs.CG/0312056,
title = {{The geometric thickness of low degree graphs}},
author = {Christian Alexander Duncan and David Eppstein and Stephen G.
Kobourov},
eprint = {cs.CG/0312056},
howpublished = {ACM Computing Research Repository},
month = {December},
year = {2003}}

@inproceedings{DunEppKob-SCG-04,
title = {{The geometric thickness of low degree graphs}},
author = {Christian Alexander Duncan and David Eppstein and Stephen G.
Kobourov},
eprint = {cs.CG/0312056},
booktitle = {Proc. 20th Symp. Computational Geometry},
publisher = {ACM},
pages = {340--346},
year = {2004}}

The lattice dimension of a graph

@misc{cs.DS/0402028,
title = {{The lattice dimension of a graph}},
author = {David Eppstein},
eprint = {cs.DS/0402028},
howpublished = {ACM Computing Research Repository},
month = {February},
year = {2004}}

@article{Epp-EJC-05,
title = {{The lattice dimension of a graph}},
author = {David Eppstein},
eprint = {cs.DS/0402028},
journal = {Eur. J. Combinatorics},
volume = {26},
number = {5},
pages = {585--592},
month = {July},
year = {2005},
url = {http://dx.doi.org/10.1016/j.ejc.2004.05.001}}

The minimum expectation selection problem

@inproceedings{EppLue-RSA-01,
title = {{The minimum expectation selection problem}},
author = {David Eppstein and George S. Lueker},
eprint = {cs.DS/0110011},
booktitle = {10th Int. Conf. Random Structures {\&} Algorithms},
month = {August},
year = {2001}}

@misc{cs.DS/0110011,
title = {{The minimum expectation selection problem}},
author = {David Eppstein and George S. Lueker},
eprint = {cs.DS/0110011},
howpublished = {ACM Computing Research Repository},
month = {October},
year = {2001}}

@article{EppLue-RSA-02,
title = {{The minimum expectation selection problem}},
author = {David Eppstein and George S. Lueker},
eprint = {cs.DS/0110011},
journal = {Random Structures {\&} Algorithms},
volume = {21},
number = {3--4},
pages = {278--292},
year = {2002},
url = {http://dx.doi.org/10.1002/rsa.10061},
review = {MR-2003m:68054}}

@article{MR-2003m:68054,
reviews = {EppLue-RSA-02},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{The minimum expectation selection problem}},
author = {Marc Ulrich Stiller},
number = {2003m:68054},
year = {2003},
text = {The authors discuss the min-min expectation selection problem (and
variations): selecting $k$ out of $n$ given discrete probability distributions,
to minimize the expectation of the minimum value resulting when independent
random variables are drawn from the selected distributions. They show
NP-completeness (with a fully polynomial time approximation scheme),
if the number of distinct values in each distribution is a constant greater
than 2, and NP-hardness to approximate the problem within any constant
approximation factor, if that number is an arbitrary integer. Finally
they show that the related max-min problem (maximize the expectation)
is polynomially solvable for a constant number of values in each distribution.

The article is a very interesting example of demonstrating the interplay
of probability theory and computer science. The reader should be familiar
with the concepts of NP-theory, including the issue of approximation
algorithms for such problems.}}

The skip quadtree: a simple dynamic data structure for multidimensional data

@inproceedings{EppGooSun-SCG-05,
title = {{The skip quadtree: a simple dynamic data structure for multidimensional
data}},
author = {David Eppstein and Michael T. Goodrich and Jonathan Zheng Sun},
eprint = {cs.CG/0507049},
booktitle = {Proc. 21st Symp. Computational Geometry},
publisher = {ACM},
pages = {296--305},
month = {June},
year = {2005}}

@misc{cs.CG/0507049,
title = {{The skip quadtree: a simple dynamic data structure for multidimensional
data}},
author = {David Eppstein and Michael T. Goodrich and Jonathan Zheng Sun},
eprint = {cs.CG/0507049},
howpublished = {ACM Computing Research Repository},
month = {July},
year = {2005}}

The traveling salesman problem for cubic graphs

@inproceedings{Epp-WADS-03,
title = {{The traveling salesman problem for cubic graphs}},
author = {David Eppstein},
eprint = {cs.DS/0302030},
booktitle = {Proc. 8th Worksh. Algorithms and Data Structures (WADS 2003)},
number = {2748},
editor = {Frank K. H. A. Dehne and J{\"o}rg-Rudiger Sack and Michiel Smid},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
pages = {307--318},
year = {2003}}

@misc{cs.DS/0302030,
title = {{The traveling salesman problem for cubic graphs}},
author = {David Eppstein},
eprint = {cs.DS/0302030},
howpublished = {ACM Computing Research Repository},
month = {February},
year = {2003}}

Tiling space and slabs with acute tetrahedra

@misc{cs.CG/0302027,
title = {{Tiling space and slabs with acute tetrahedra}},
author = {David Eppstein and John M. Sullivan and Alper {\"U}ng{\"o}r},
eprint = {cs.CG/0302027},
howpublished = {ACM Computing Research Repository},
month = {February},
year = {2003}}

@article{EppSulUng-CGTA-04,
title = {{Tiling space and slabs with acute tetrahedra}},
author = {David Eppstein and John M. Sullivan and Alper {\"U}ng{\"o}r},
eprint = {cs.CG/0302027},
journal = {Computational Geometry Theory {\&} Applications},
volume = {27},
number = {3},
pages = {237--255},
year = {2004},
url = {http://dx.doi.org/10.1016/j.comgeo.2003.11.003},
review = {MR-2039173}}

@article{MR-2039173,
reviews = {EppSulUng-CGTA-04},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Tiling space and slabs with acute tetrahedra}},
number = {2039173},
year = {2004}}

Tree-weighted neighbors and geometric $k$ smallest spanning trees

@techreport{Epp-TR-92-77,
title = {{Tree-weighted neighbors and geometric $k$ smallest spanning trees}},
author = {David Eppstein},
address = {Irvine, CA, 92697-3425, USA},
institution = {Univ. of California, Irvine, Dept. of Information and Computer
Science},
number = {92-77},
year = {1992},
url = {http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-92-77.pdf}}

@article{Epp-IJCGA-94,
title = {{Tree-weighted neighbors and geometric $k$ smallest spanning trees}},
author = {David Eppstein},
journal = {Int. J. Computational Geometry {\&} Applications},
volume = {4},
number = {2},
pages = {229--238},
month = {June},
year = {1994},
review = {MR-95f:05028}}

@article{MR-95f:05028,
reviews = {Epp-IJCGA-94},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Tree-weighted neighbors and geometric $k$ smallest spanning trees}},
author = {Ding-Zhu Du},
number = {95f:05028},
year = {1995}}

Trees in \TeX

@article{Epp-Tb-85,
title = {{Trees in \TeX}},
author = {David Eppstein},
journal = {TUGboat},
publisher = {{\TeX} Users' Group},
volume = {6},
number = {1},
pages = {31},
year = {1985},
url = {http://www.ics.uci.edu/~eppstein/pubs/p-ttree.tex.Z}}

Triangles and squares

@inproceedings{Epp-COMB-01,
title = {{Triangles and squares}},
author = {David Eppstein},
booktitle = {Proc. Euroconf. Combinatorics, Graph Theory, and Applications},
publisher = {Univ. Aut{\'o}noma de Barcelona, Centre de Recerca Matem{\`a}tica},
editor = {Jaroslav Ne{\v{s}}etril},
pages = {114},
month = {September},
year = {2001}}

Triangulating polygons without large angles

@inproceedings{BerDobEpp-SCG-92,
title = {{Triangulating polygons without large angles}},
author = {Marshall Wayne Bern and David P. Dobkin and David Eppstein},
booktitle = {Proc. 8th Symp. Computational Geometry},
publisher = {ACM},
pages = {222--231},
month = {June},
year = {1992}}

@article{BerDobEpp-IJCGA-95,
title = {{Triangulating polygons without large angles}},
author = {Marshall Wayne Bern and David P. Dobkin and David Eppstein},
journal = {Int. J. Computational Geometry {\&} Applications},
volume = {5},
number = {1--2},
pages = {171--192},
year = {1995},
url = {http://www.ics.uci.edu/~eppstein/pubs/BerDobEpp-IJCGA-95.ps.gz},
month = {March--June},
note = {Special issue for 8th SCG},
review = {MR-96e:68124}}

@article{MR-96e:68124,
reviews = {BerDobEpp-IJCGA-95},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Triangulating polygons without large angles}},
author = {de Figueiredo, Luiz Henrique},
number = {96e:68124},
year = {1996}}

Uninscribable 4-regular polyhedron

@article{EppDil-EGM-03,
title = {{Uninscribable 4-regular polyhedron}},
author = {David Eppstein and Michael B. Dillencourt},
journal = {Electronic Geometry Models},
number = {2003.08.001},
year = {2003},
url = {http://www.eg-models.de/2003.08.001/}}

Ununfoldable polyhedra

@misc{cs.CG/9908003,
title = {{Ununfoldable polyhedra}},
author = {Marshall Wayne Bern and Erik D. Demaine and David Eppstein and
Eric Heng-Shiang Kuo},
eprint = {cs.CG/9908003},
howpublished = {ACM Computing Research Repository},
month = {August},
year = {1999}}

@inproceedings{BerDemEpp-CCCG-99,
title = {{Ununfoldable polyhedra}},
author = {Marshall Wayne Bern and Erik D. Demaine and David Eppstein and
Eric Heng-Shiang Kuo},
eprint = {cs.CG/9908003},
booktitle = {Proc. 11th Canad. Conf. Computational Geometry},
month = {August},
year = {1999},
url = {http://www.cs.ubc.ca/conferences/CCCG/elec_proc/fp38.pdf}}

@techreport{BerDemEpp-TR-99,
title = {{Ununfoldable polyhedra}},
author = {Marshall Wayne Bern and Erik D. Demaine and David Eppstein and
Eric Heng-Shiang Kuo},
eprint = {cs.CG/9908003},
address = {Waterloo, Ontario N2L 3G1, CANADA},
institution = {Univ. of Waterloo, School of Computer Science},
number = {CS-99-04},
month = {August},
year = {1999},
url = {ftp://cs-archive.uwaterloo.ca/cs-archive/CS-99-09/}}

Ununfoldable polyhedra with convex faces

@article{BerDemEpp-CGTA-03,
title = {{Ununfoldable polyhedra with convex faces}},
author = {Marshall Wayne Bern and Erik D. Demaine and David Eppstein and
Eric Heng-Shiang Kuo and Andrea Mantler and Jack Snoeyink},
journal = {Computational Geometry Theory {\&} Applications},
volume = {24},
number = {2},
pages = {51--62},
month = {February},
year = {2003},
url = {http://dx.doi.org/10.1016/S0925-7721(02)00091-3},
review = {MR-2003m:52017}}

@article{MR-2003m:52017,
reviews = {BerDemEpp-CGTA-03},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Ununfoldable polyhedra with convex faces}},
number = {2003m:52017},
year = {2003}}

Ununfoldable polyhedra with triangular faces

@inproceedings{BerDemEpp-WCG-99,
title = {{Ununfoldable polyhedra with triangular faces}},
author = {Marshall Wayne Bern and Erik D. Demaine and David Eppstein and
Eric Heng-Shiang Kuo and Andrea Mantler and Jack Snoeyink},
booktitle = {Proc. 4th CGC Worksh. Computational Geometry},
month = {October},
year = {1999},
url = {http://www.cs.jhu.edu/~cgc/abstracts99/old/eric.uptf.ps}}

Using sparsification for parametric minimum spanning tree problems

@article{FerSluEpp-NJC-96,
title = {{Using sparsification for parametric minimum spanning tree problems}},
author = {David Fern{\'a}ndez-Baca and Giora Slutzki and David Eppstein},
journal = {Nordic J. Computing},
volume = {3},
number = {4},
pages = {352--366},
year = {1996},
url = {http://www.ics.uci.edu/~eppstein/pubs/FerSluEpp-NJC-96.pdf},
month = {Winter},
note = {Special issue for 5th SWAT}}

@inproceedings{FerSluEpp-SWAT-96,
title = {{Using sparsification for parametric minimum spanning tree problems}},
author = {David Fern{\'a}ndez-Baca and Giora Slutzki and David Eppstein},
booktitle = {Proc. 5th Scandinavian Worksh. Algorithm Theory (SWAT 1996)},
number = {1097},
editor = {Rolf G. Karlsson and Andrzej Lingas},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
pages = {149--160},
month = {July},
year = {1996},
url = {http://www.ics.uci.edu/~eppstein/pubs/FerSluEpp-SWAT-96.ps.gz}}

Vertex-unfoldings of simplicial manifolds

@techreport{DemEppEri-TR-01-72,
title = {{Vertex-unfoldings of simplicial manifolds}},
author = {Erik D. Demaine and David Eppstein and Jeffrey Gordon Erickson
and George W. Hart and Joseph O'Rourke},
eprint = {cs.CG/0110054},
organization = {Smith College, Dept. of Computer Science},
number = {072},
year = {2001}}

@misc{cs.CG/0110054,
title = {{Vertex-unfoldings of simplicial manifolds}},
author = {Erik D. Demaine and David Eppstein and Jeffrey Gordon Erickson
and George W. Hart and Joseph O'Rourke},
eprint = {cs.CG/0110054},
howpublished = {ACM Computing Research Repository},
month = {October},
year = {2001}}

@inproceedings{DemEppEri-SCG-02,
title = {{Vertex-unfoldings of simplicial manifolds}},
author = {Erik D. Demaine and David Eppstein and Jeffrey Gordon Erickson
and George W. Hart and Joseph O'Rourke},
eprint = {cs.CG/0110054},
booktitle = {Proc. 18th Symp. Computational Geometry},
publisher = {ACM},
pages = {237--243},
month = {June},
year = {2002}}

@incollection{DemEppEri-WK-03,
title = {{Vertex-unfoldings of simplicial manifolds}},
author = {Erik D. Demaine and David Eppstein and Jeffrey Gordon Erickson
and George W. Hart and Joseph O'Rourke},
eprint = {cs.CG/0110054},
booktitle = {Discrete Geometry: In honor of W. Kuperberg's 60th birthday},
number = {253},
editor = {Andras Bezdek},
series = {Pure and Applied Mathematics},
publisher = {Marcel Dekker},
pages = {215--228},
year = {2003},
review = {MR-2034718}}

@article{MR-2034718,
reviews = {DemEppEri-WK-03},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Vertex-unfoldings of simplicial manifolds}},
number = {2034718},
year = {2004}}

Vertex-unfoldings of simplicial polyhedra

@misc{cs.CG/0107023,
title = {{Vertex-unfoldings of simplicial polyhedra}},
author = {Erik D. Demaine and David Eppstein and Jeffrey Gordon Erickson
and George W. Hart and Joseph O'Rourke},
eprint = {cs.CG/0107023},
howpublished = {ACM Computing Research Repository},
month = {July},
year = {2001}}

@techreport{DemEppEri-TR-01-71,
title = {{Vertex-unfoldings of simplicial polyhedra}},
author = {Erik D. Demaine and David Eppstein and Jeffrey Gordon Erickson
and George W. Hart and Joseph O'Rourke},
eprint = {cs.CG/0107023},
institution = {Smith College, Dept. of Computer Science},
number = {071},
month = {July},
year = {2001}}

Visibility with a moving point of view

@techreport{BerDobEpp-TR-89,
title = {{Visibility with a moving point of view}},
author = {Marshall Wayne Bern and David P. Dobkin and David Eppstein and
Robert L. Grossman},
address = {35 Olden St., Princeton, NJ, 08544-2087, USA},
institution = {Princeton Univ., Dept. of Computer Science},
number = {TR-235-89},
year = {1989}}

@inproceedings{BerDobEpp-SODA-90,
title = {{Visibility with a moving point of view}},
author = {Marshall Wayne Bern and David P. Dobkin and David Eppstein and
Robert L. Grossman},
booktitle = {Proc. 1st Symp. Discrete Algorithms},
publisher = {ACM and SIAM},
pages = {107--118},
month = {January},
year = {1990}}

@article{BerDobEpp-Algo-94,
title = {{Visibility with a moving point of view}},
author = {Marshall Wayne Bern and David P. Dobkin and David Eppstein and
Robert L. Grossman},
journal = {Algorithmica},
volume = {11},
number = {4},
pages = {360--378},
month = {April},
year = {1994},
review = {MR-94j:68307}}

@article{MR-94j:68307,
reviews = {BerDobEpp-Algo-94},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Visibility with a moving point of view}},
number = {94j:68307},
year = {1994}}

Worst-case bounds for subadditive geometric graphs

@techreport{BerEpp-TR-?,
title = {{Worst-case bounds for subadditive geometric graphs}},
author = {Marshall Wayne Bern and David Eppstein},
address = {3333 Coyote Hill Rd., Palo Alto, CA, 94304, USA},
institution = {Xerox Palo Alto Research Center},
note = {This paper was never actually published in this form, but was nevertheless
cited as a Xerox TR by Gao and Steele.}}

@inproceedings{BerEpp-SCG-93,
title = {{Worst-case bounds for subadditive geometric graphs}},
author = {Marshall Wayne Bern and David Eppstein},
booktitle = {Proc. 9th Symp. Computational Geometry},
publisher = {ACM},
pages = {183--188},
month = {May},
year = {1993},
url = {http://www.ics.uci.edu/~eppstein/pubs/BerEpp-SCG-93.pdf}}

Zonohedra and zonotopes

@techreport{Epp-TR-95-53,
title = {{Zonohedra and zonotopes}},
author = {David Eppstein},
address = {Irvine, CA, 92697-3425, USA},
institution = {Univ. of California, Irvine, Dept. of Information and Computer
Science},
number = {95-53},
year = {1995},
url = {http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-95-53.pdf}}

@article{Epp-MER-96,
title = {{Zonohedra and zonotopes}},
author = {David Eppstein},
journal = {Mathematica in Education and Research},
volume = {5},
number = {4},
pages = {15--21},
year = {1996}}

Оставить комментарий

Пожалуйста, введите символы, показанные на рисунке.

Примеры решений задачи коммивояжера (TSP)
design by lmatrix
О проекте | Написать письмо | Ссылки | Литература | Карта сайта