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

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

Войдите или зарегистрируйтесь
Лаборатория 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 со ссылкой на анонимный источник.

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

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

Maintenance of a minimum spanning forest in a dynamic planar graph

@techreport{EppItaTam-TR-90,
title = {{Maintenance of a minimum spanning forest in a dynamic planar
graph}},
author = {David Eppstein and Giuseppe F. Italiano and Roberto Tamassia
and Robert E. Tarjan and Jeffery R. Westbrook and Moti Yung},
address = {35 Olden St., Princeton, NJ, 08544-2087, USA},
institution = {Princeton Univ., Dept. of Computer Science},
number = {243-90},
year = {1990}}

@inproceedings{EppItaTam-SODA-90,
title = {{Maintenance of a minimum spanning forest in a dynamic planar
graph}},
author = {David Eppstein and Giuseppe F. Italiano and Roberto Tamassia
and Robert E. Tarjan and Jeffery R. Westbrook and Moti Yung},
booktitle = {Proc. 1st Symp. Discrete Algorithms},
publisher = {ACM and SIAM},
pages = {1--11},
month = {January},
year = {1990}}

@article{EppItaTam-Algs-92,
title = {{Maintenance of a minimum spanning forest in a dynamic planar
graph}},
author = {David Eppstein and Giuseppe F. Italiano and Roberto Tamassia
and Robert E. Tarjan and Jeffery R. Westbrook and Moti Yung},
journal = {J. Algorithms},
volume = {13},
number = {1},
pages = {33--54},
month = {March},
year = {1992},
note = {Special issue for 1st SODA},
review = {MR-93a:68027}}

@article{MR-93a:68027,
reviews = {EppItaTam-Algs-92},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Maintenance of a minimum spanning forest in a dynamic planar
graph}},
author = {Mirko K{\v{r}}iv{\'a}nek},
number = {93a:68027},
year = {1993}}

@article{EppItaTam-Algs-93,
title = {{Maintenance of a minimum spanning forest in a dynamic planar
graph}},
author = {David Eppstein and Giuseppe F. Italiano and Roberto Tamassia
and Robert E. Tarjan and Jeffery R. Westbrook and Moti Yung},
journal = {J. Algorithms},
volume = {15},
pages = {173},
year = {1993},
note = {Corrigendum},
review = {MR-94b:68039}}

@article{MR-94b:68039,
reviews = {EppItaTam-Algs-93},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Maintenance of a minimum spanning forest in a dynamic planar
graph}},
number = {94b:68039},
year = {1994},
text = {The merge operation defined on page 44 is incompletely defined.
The merge operation requires that the vertices $u$ and $v$ to be merged
belong to different trees. Otherwise the merging can produce a cycle.}}

Mesh generation and optimal triangulation

@incollection{BerEpp-CEG-92,
title = {{Mesh generation and optimal triangulation}},
author = {Marshall Wayne Bern and David Eppstein},
booktitle = {Computing in Euclidean Geometry},
editor = {Ding-Zhu Du and Frank Kwang-Ming Hwang},
series = {Lecture Notes Series on Computing},
publisher = {World Scientific},
pages = {23--90},
year = {1992},
number = {1}}

@techreport{BerEpp-TR-92,
title = {{Mesh generation and optimal triangulation}},
author = {Marshall Wayne Bern and David Eppstein},
address = {3333 Coyote Hill Rd., Palo Alto, CA, 94304, USA},
institution = {Xerox Palo Alto Research Center},
number = {CSL-92-1},
year = {1992}}

@incollection{BerEpp-CEG-95,
title = {{Mesh generation and optimal triangulation}},
author = {Marshall Wayne Bern and David Eppstein},
booktitle = {Computing in Euclidean Geometry},
editor = {Ding-Zhu Du and Frank Kwang-Ming Hwang},
series = {Lecture Notes Series on Computing},
publisher = {World Scientific},
pages = {47--123},
year = {1995},
url = {http://www.ics.uci.edu/~eppstein/pubs/BerEpp-CEG-95.pdf},
number = {4},
edition = {second}}

Minimum dilation stars

@misc{cs.CG/0412025,
title = {{Minimum dilation stars}},
author = {David Eppstein and Kevin A. Wortman},
eprint = {cs.CG/0412025},
howpublished = {ACM Computing Research Repository},
month = {December},
year = {2004}}

@inproceedings{EppWor-SCG-05,
title = {{Minimum dilation stars}},
author = {David Eppstein and Kevin A. Wortman},
eprint = {cs.CG/0412025},
booktitle = {Proc. 21st Symp. Computational Geometry},
publisher = {ACM},
pages = {321--326},
month = {June},
year = {2005}}

Minimum range balanced cuts via dynamic subset sums

@techreport{Epp-TR-95-10,
title = {{Minimum range balanced cuts via dynamic subset sums}},
author = {David Eppstein},
address = {Irvine, CA, 92697-3425, USA},
institution = {Univ. of California, Irvine, Dept. of Information and Computer
Science},
number = {95-10},
year = {1995}}

@article{Epp-Algs-97,
title = {{Minimum range balanced cuts via dynamic subset sums}},
author = {David Eppstein},
journal = {J. Algorithms},
volume = {23},
number = {2},
pages = {375--385},
month = {May},
year = {1997},
url = {http://dx.doi.org/10.1006/jagm.1996.0841},
review = {MR-98k:05129}}

@article{MR-98k:05129,
reviews = {Epp-Algs-97},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Minimum range balanced cuts via dynamic subset sums}},
number = {98k:05129},
year = {1998}}

Möbius-invariant natural neighbor interpolation

@misc{cs.CG/0207081,
title = {{M{\"o}bius-invariant natural neighbor interpolation}},
author = {Marshall Wayne Bern and David Eppstein},
eprint = {cs.CG/0207081},
howpublished = {ACM Computing Research Repository},
month = {July},
year = {2002}}

@inproceedings{BerEpp-SODA-03,
title = {{M{\"o}bius-invariant natural neighbor interpolation}},
author = {Marshall Wayne Bern and David Eppstein},
eprint = {cs.CG/0207081},
booktitle = {Proc. 14th Symp. Discrete Algorithms},
publisher = {ACM and SIAM},
pages = {128--129},
month = {January},
year = {2003}}

Multivariate regression depth

@misc{cs.CG/9912013,
title = {{Multivariate regression depth}},
author = {Marshall Wayne Bern and David Eppstein},
eprint = {cs.CG/9912013},
howpublished = {ACM Computing Research Repository},
month = {December},
year = {1999}}

@inproceedings{BerEpp-SCG-00,
title = {{Multivariate regression depth}},
author = {Marshall Wayne Bern and David Eppstein},
eprint = {cs.CG/9912013},
booktitle = {Proc. 16th Symp. Computational Geometry},
publisher = {ACM},
pages = {315--321},
month = {June},
year = {2000},
url = {http://www.ics.uci.edu/~eppstein/pubs/BerEpp-SCG-00.pdf}}

@article{BerEpp-DCG-02,
title = {{Multivariate regression depth}},
author = {Marshall Wayne Bern and David Eppstein},
eprint = {cs.CG/9912013},
journal = {Discrete {\&} Computational Geometry},
volume = {28},
number = {1},
pages = {1--17},
month = {July},
year = {2002},
review = {MR-2003c:52035}}

@article{MR-2003c:52035,
reviews = {BerEpp-DCG-02},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Multivariate regression depth}},
number = {2003c:52035},
year = {2003}}

New algorithms for minimum area $k$-gons

@techreport{Epp-TR-91-59,
title = {{New algorithms for minimum area $k$-gons}},
author = {David Eppstein},
address = {Irvine, CA, 92697-3425, USA},
institution = {Univ. of California, Irvine, Dept. of Information and Computer
Science},
number = {91-59},
year = {1991}}

@inproceedings{Epp-SODA-92-kgon,
title = {{New algorithms for minimum area $k$-gons}},
author = {David Eppstein},
booktitle = {Proc. 3rd Symp. Discrete Algorithms},
publisher = {ACM and SIAM},
pages = {83--86},
month = {January},
year = {1992}}

New algorithms for minimum measure simplices and one-dimensional weighted Voronoi diagrams

@techreport{EppEri-TR-92-55,
title = {{New algorithms for minimum measure simplices and one-dimensional
weighted Voronoi diagrams}},
author = {David Eppstein and Jeffrey Gordon Erickson},
address = {Irvine, CA, 92697-3425, USA},
institution = {Univ. of California, Irvine, Dept. of Information and Computer
Science},
number = {92-55},
year = {1992}}

Nonrepetitive paths and cycles in graphs with application to Sudoku

@misc{cs.DS/0507053,
title = {{Nonrepetitive paths and cycles in graphs with application to
Sudoku}},
author = {David Eppstein},
eprint = {cs.DS/0507053},
howpublished = {ACM Computing Research Repository},
month = {July},
year = {2005}}

Offline algorithms for dynamic minimum spanning tree problems

@inproceedings{Epp-WADS-91,
title = {{Offline algorithms for dynamic minimum spanning tree problems}},
author = {David Eppstein},
booktitle = {Proc. 2nd Worksh. Algorithms and Data Structures (WADS 1991)},
number = {519},
editor = {Frank K. H. A. Dehne and J{\"o}rg-Rudiger Sack and Nicola Santoro},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
pages = {392--399},
month = {August},
year = {1991}}

@techreport{Epp-TR-92-04,
title = {{Offline algorithms for dynamic minimum spanning tree problems}},
author = {David Eppstein},
address = {Irvine, CA, 92697-3425, USA},
institution = {Univ. of California, Irvine, Dept. of Information and Computer
Science},
number = {92-04},
year = {1992},
url = {http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-92-04.pdf}}

@article{Epp-Algs-94,
title = {{Offline algorithms for dynamic minimum spanning tree problems}},
author = {David Eppstein},
journal = {J. Algorithms},
volume = {17},
number = {2},
pages = {237--250},
month = {September},
year = {1994},
url = {http://dx.doi.org/10.1006/jagm.1994.1033},
review = {MR-95e:68168}}

@article{MR-95e:68168,
reviews = {Epp-Algs-94},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Offline algorithms for dynamic minimum spanning tree problems}},
number = {95e:68168},
year = {1995}}

On nearest neighbor graphs

@article{EppPatYao-DCG-97,
title = {{On nearest neighbor graphs}},
author = {David Eppstein and Michael S. Paterson and Frances F. Yao},
journal = {Discrete {\&} Computational Geometry},
volume = {17},
number = {3},
pages = {263--282},
month = {April},
year = {1997},
url = {http://www.ics.uci.edu/~eppstein/pubs/EppPatYao-DCG-97.pdf},
review = {MR-98d:05121}}

@article{MR-98d:05121,
reviews = {EppPatYao-DCG-97},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{On nearest neighbor graphs}},
author = {Cecil C. Rousseau},
number = {98d:05121},
year = {1998}}

On reset sequence length

@techreport{Epp-TR-89,
title = {{On reset sequence length}},
author = {David Eppstein},
address = {New York, NY, 10027, USA},
institution = {Columbia Univ., Computer Science Dept.},
number = {CUCS-440-89},
year = {1989}}

On the NP-completeness of cryptarithms

@article{Epp-SN-87,
title = {{On the NP-completeness of cryptarithms}},
author = {David Eppstein},
journal = {SIGACT News},
publisher = {ACM},
volume = {18},
number = {3},
pages = {38--40},
year = {1987},
url = {http://www.ics.uci.edu/~eppstein/pubs/Epp-SN-87.pdf}}

On the number of minimal 1-Steiner trees

@article{AroBerEpp-DCG-94,
title = {{On the number of minimal 1-Steiner trees}},
author = {Boris Aronov and Marshall Wayne Bern and David Eppstein},
journal = {Discrete {\&} Computational Geometry},
volume = {12},
number = {1},
pages = {29--34},
month = {July},
year = {1994},
review = {MR-95c:05043}}

@article{MR-95c:05043,
reviews = {AroBerEpp-DCG-94},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{On the number of minimal 1-Steiner trees}},
author = {Ding-Zhu Du},
number = {95c:05043},
year = {1995}}

On the parity of graph spanning tree numbers

@techreport{Epp-TR-96-14,
title = {{On the parity of graph spanning tree numbers}},
author = {David Eppstein},
address = {Irvine, CA, 92697-3425, USA},
institution = {Univ. of California, Irvine, Dept. of Information and Computer
Science},
number = {96-14},
year = {1996}}

On triangulating three-dimensional polygons

@inproceedings{BarDicEpp-SCG-96,
title = {{On triangulating three-dimensional polygons}},
author = {Gill Barequet and Matthew T. Dickerson and David Eppstein},
booktitle = {Proc. 12th Symp. Computational Geometry},
publisher = {ACM},
pages = {38--47},
month = {May},
year = {1996},
url = {ftp://ftp.cs.technion.ac.il/pub/barequet/papers/3dt-socg96.ps.gz}}

@article{BarDicEpp-CGTA-98,
title = {{On triangulating three-dimensional polygons}},
author = {Gill Barequet and Matthew T. Dickerson and David Eppstein},
journal = {Computational Geometry Theory {\&} Applications},
volume = {10},
number = {3},
pages = {155--170},
month = {June},
year = {1998},
url = {http://dx.doi.org/10.1016/S0925-7721(98)00005-4},
review = {MR-99a:68168}}

@article{MR-99a:68168,
reviews = {BarDicEpp-CGTA-98},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{On triangulating three-dimensional polygons}},
number = {99a:68168},
year = {1999}}

One-dimensional peg solitaire

@misc{math.CO/0006067,
title = {{One-dimensional peg solitaire}},
author = {Cristopher Moore and David Eppstein},
eprint = {math.CO/0006067},
howpublished = {arXiv.org e-Print archive},
month = {June},
year = {2000}}

One-dimensional peg solitaire, and duotaire

@misc{math.CO/0008172,
title = {{One-dimensional peg solitaire, and duotaire}},
author = {Cristopher Moore and David Eppstein},
eprint = {math.CO/0008172},
howpublished = {arXiv.org e-Print archive}}

@techreport{EppMoo-TR-00,
title = {{One-dimensional peg solitaire, and duotaire}},
author = {Cristopher Moore and David Eppstein},
eprint = {math.CO/0008172},
type = {working paper},
address = {1399 Hyde Park Road, Santa Fe, New Mexico 87501, USA},
organization = {Santa Fe Inst.},
number = {00-09-050},
month = {September},
year = {2000},
url = {http://www.santafe.edu/sfi/publications/Abstracts/00-09-050abs.html}}

@incollection{MooEpp-MSRI-02,
title = {{One-dimensional peg solitaire, and duotaire}},
author = {Cristopher Moore and David Eppstein},
eprint = {math.CO/0008172},
booktitle = {More Games of No Chance},
number = {42},
editor = {Richard J. Nowakowski},
series = {MSRI Publications},
publisher = {Cambridge Univ. Press},
pages = {341--350},
year = {2002},
url = {http://www.msri.org/publications/books/Book42/files/moore.pdf}}

Optimal Möbius transformations for information visualization and meshing

@misc{cs.CG/0101006,
title = {{Optimal M{\"o}bius transformations for information visualization
and meshing}},
author = {Marshall Wayne Bern and David Eppstein},
eprint = {cs.CG/0101006},
howpublished = {ACM Computing Research Repository},
month = {January},
year = {2001}}

@inproceedings{BerEpp-WADS-01-omt,
title = {{Optimal M{\"o}bius transformations for information visualization
and meshing}},
author = {Marshall Wayne Bern and David Eppstein},
eprint = {cs.CG/0101006},
booktitle = {Proc. 7th Worksh. Algorithms and Data Structures (WADS 2001)},
number = {2125},
editor = {Frank K. H. A. Dehne and J{\"o}rg-Rudiger Sack and Roberto Tamassia},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
pages = {14--25},
month = {August},
year = {2001}}

Optimal point placement for mesh smoothing

@inproceedings{AmeBerEpp-SODA-97,
title = {{Optimal point placement for mesh smoothing}},
author = {Annamaria Beatrice Amenta and Marshall Wayne Bern and David Eppstein},
eprint = {cs.CG/9809081},
booktitle = {Proc. 8th Symp. Discrete Algorithms},
publisher = {ACM and SIAM},
pages = {528--537},
month = {January},
year = {1997},
url = {http://www.ics.uci.edu/~eppstein/pubs/AmeBerEpp-SODA-97.pdf}}

@misc{cs.CG/9809081,
title = {{Optimal point placement for mesh smoothing}},
author = {Annamaria Beatrice Amenta and Marshall Wayne Bern and David Eppstein},
eprint = {cs.CG/9809081},
howpublished = {ACM Computing Research Repository},
month = {September},
year = {1998}}

@article{AmeBerEpp-Algs-99,
title = {{Optimal point placement for mesh smoothing}},
author = {Annamaria Beatrice Amenta and Marshall Wayne Bern and David Eppstein},
eprint = {cs.CG/9809081},
journal = {J. Algorithms},
volume = {30},
number = {2},
pages = {302--322},
month = {February},
year = {1999},
url = {http://dx.doi.org/10.1006/jagm.1998.0984},
note = {Special issue for 8th SODA},
review = {MR-99m:65028}}

@article{MR-99m:65028,
reviews = {AmeBerEpp-Algs-99},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Optimal point placement for mesh smoothing}},
number = {99m:65028},
year = {1999}}

Optimization over zonotopes and training support vector machines

@misc{cs.CG/0105017,
title = {{Optimization over zonotopes and training support vector machines}},
author = {Marshall Wayne Bern and David Eppstein},
eprint = {cs.CG/0105017},
howpublished = {ACM Computing Research Repository},
month = {May},
year = {2001}}

@inproceedings{BerEpp-WADS-01-svm,
title = {{Optimization over zonotopes and training support vector machines}},
author = {Marshall Wayne Bern and David Eppstein},
eprint = {cs.CG/0105017},
booktitle = {Proc. 7th Worksh. Algorithms and Data Structures (WADS 2001)},
number = {2125},
editor = {Frank K. H. A. Dehne and J{\"o}rg-Rudiger Sack and Roberto Tamassia},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
pages = {111--121},
month = {August},
year = {2001}}

Optimized color gamuts for tiled displays

@misc{cs.CG/0212007,
title = {{Optimized color gamuts for tiled displays}},
author = {Marshall Wayne Bern and David Eppstein},
eprint = {cs.CG/0212007},
howpublished = {ACM Computing Research Repository},
month = {December},
year = {2002}}

@inproceedings{BerEpp-SCG-03,
title = {{Optimized color gamuts for tiled displays}},
author = {Marshall Wayne Bern and David Eppstein},
eprint = {cs.CG/0212007},
booktitle = {Proc. 19th Symp. Computational Geometry},
publisher = {ACM},
pages = {274--281},
month = {June},
year = {2003}}

Parallel algorithmic techniques for combinatorial computation

@article{EppGal-AR-88,
title = {{Parallel algorithmic techniques for combinatorial computation}},
author = {David Eppstein and Zvi Galil},
journal = {Annual Reviews in Computer Science},
publisher = {Annual Reviews},
volume = {3},
pages = {233--283},
year = {1988},
review = {MR-91g:68042}}

@article{MR-91g:68042,
reviews = {EppGal-AR-88},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Parallel algorithmic techniques for combinatorial computation}},
number = {91g:68042},
year = {1991}}

@techreport{EppGal-TR-88,
title = {{Parallel algorithmic techniques for combinatorial computation}},
author = {David Eppstein and Zvi Galil},
address = {New York, NY, 10027, USA},
organization = {Columbia Univ., Computer Science Dept.},
number = {CUCS-326-88},
year = {1988}}

@inproceedings{EppGal-ICALP-89,
title = {{Parallel algorithmic techniques for combinatorial computation}},
author = {David Eppstein and Zvi Galil},
booktitle = {Proc. 16th Int. Coll. Automata, Languages, and Programming
(ICALP 1989)},
number = {372},
editor = {Giorgio Ausiello and Mariangiola Dezani-Ciancaglini and Della
Rocca, Simona Ronchi},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
pages = {304--318},
month = {July},
year = {1989},
note = {Invited talk by Galil.}}

Parallel construction of quadtrees and quality triangulations

@inproceedings{BerEppTen-WADS-93,
title = {{Parallel construction of quadtrees and quality triangulations}},
author = {Marshall Wayne Bern and David Eppstein and Shang-Hua Teng},
booktitle = {Proc. 3rd Worksh. Algorithms and Data Structures (WADS 1993)},
number = {709},
editor = {Frank K. H. A. Dehne and J{\"o}rg-Rudiger Sack and Nicola Santoro
and Sue Whitesides},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
pages = {188--199},
month = {August},
year = {1993},
review = {MR-94j:68291}}

@article{MR-94j:68291,
reviews = {BerEppTen-WADS-93},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Parallel construction of quadtrees and quality triangulations}},
number = {94j:68291},
year = {1994}}

@techreport{BerEppTen-TR-94,
title = {{Parallel construction of quadtrees and quality triangulations}},
author = {Marshall Wayne Bern and David Eppstein and Shang-Hua Teng},
address = {545 Technology Square, Cambridge, MA, 02139, USA},
institution = {Massachusetts Inst. Tech., Lab. for Computer Science},
number = {614},
year = {1994}}

@article{BerEppTen-IJCGA-99,
title = {{Parallel construction of quadtrees and quality triangulations}},
author = {Marshall Wayne Bern and David Eppstein and Shang-Hua Teng},
journal = {Int. J. Computational Geometry {\&} Applications},
volume = {9},
number = {6},
pages = {517--532},
month = {December},
year = {1999}}

Parallel recognition of series parallel graphs

@article{Epp-IC-92,
title = {{Parallel recognition of series parallel graphs}},
author = {David Eppstein},
journal = {Information {\&} Computation},
volume = {98},
number = {1},
pages = {41--55},
month = {May},
year = {1992},
url = {http://www.ics.uci.edu/~eppstein/pubs/Epp-IC-92.pdf},
review = {MR-92m:05180}}

@article{MR-92m:05180,
reviews = {Epp-IC-92},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Parallel recognition of series parallel graphs}},
number = {92m:05180},
year = {1992}}

Parametric and kinetic minimum spanning trees

@inproceedings{AgaEppGui-FOCS-98,
title = {{Parametric and kinetic minimum spanning trees}},
author = {Pankaj Kumar Agarwal and David Eppstein and Leonidas J. Guibas
and Monika Rauch Henzinger},
booktitle = {Proc. 39th Symp. Foundations of Computer Science},
publisher = {IEEE},
pages = {596--605},
month = {November},
year = {1998},
url = {http://www.ics.uci.edu/~eppstein/pubs/AgaEppGui-FOCS-98.pdf}}

Persistence, offline algorithms, and space compaction

@techreport{Epp-TR-91-54,
title = {{Persistence, offline algorithms, and space compaction}},
author = {David Eppstein},
address = {Irvine, CA, 92697-3425, USA},
institution = {Univ. of California, Irvine, Dept. of Information and Computer
Science},
number = {91-54},
year = {1991},
url = {http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-91-54.pdf}}

Phutball endgames are hard

@misc{cs.CC/0008025,
title = {{Phutball endgames are hard}},
author = {Erik D. Demaine and Martin L. Demaine and David Eppstein},
eprint = {cs.CC/0008025},
howpublished = {ACM Computing Research Repository},
month = {August},
year = {2000}}

@incollection{DemDemEpp-MSRI-02,
title = {{Phutball endgames are hard}},
author = {Erik D. Demaine and Martin L. Demaine and David Eppstein},
eprint = {cs.CC/0008025},
booktitle = {More Games of No Chance},
number = {42},
editor = {Richard J. Nowakowski},
series = {MSRI Publications},
publisher = {Cambridge Univ. Press},
pages = {351--360},
year = {2002},
url = {http://www.msri.org/publications/books/Book42/files/dephut.pdf},
review = {MR-2004b:91042}}

@article{MR-2004b:91042,
reviews = {DemDemEpp-MSRI-02},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Phutball endgames are hard}},
number = {2004b:91042},
year = {2004}}

Planar orientations with low out-degree and compaction of adjacency matrices

@article{ChrEpp-TCS-91,
title = {{Planar orientations with low out-degree and compaction of adjacency
matrices}},
author = {Marek Chrobak and David Eppstein},
journal = {Theoretical Computer Science},
volume = {86},
number = {2},
pages = {243--266},
month = {September},
year = {1991},
url = {http://www.ics.uci.edu/~eppstein/pubs/ChrEpp-TCS-91.pdf},
review = {MR-93a:68114}}

@article{MR-93a:68114,
reviews = {ChrEpp-TCS-91},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Planar orientations with low out-degree and compaction of adjacency
matrices}},
author = {G. P. Bhattacharjee},
number = {93a:68114},
year = {1993}}

Polynomial-size non-obtuse triangulation of polygons

@inproceedings{BerEpp-SCG-91,
title = {{Polynomial-size non-obtuse triangulation of polygons}},
author = {Marshall Wayne Bern and David Eppstein},
booktitle = {Proc. 7th Symp. Computational Geometry},
publisher = {ACM},
pages = {342--350},
month = {June},
year = {1991}}

@article{BerEpp-IJCGA-92,
title = {{Polynomial-size non-obtuse triangulation of polygons}},
author = {Marshall Wayne Bern and David Eppstein},
journal = {Int. J. Computational Geometry {\&} Applications},
volume = {2},
number = {3},
pages = {241--255},
month = {September},
year = {1992},
url = {http://www.ics.uci.edu/~eppstein/pubs/BerEpp-IJCGA-92.pdf},
note = {Special issue for 7th SCG},
review = {MR-94e:52016a}}

@article{MR-94e:52016a,
reviews = {BerEpp-IJCGA-92},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Polynomial-size non-obtuse triangulation of polygons}},
author = {Nikolai M. Korneenko},
number = {94e:52016a},
year = {1994}}

@article{BerEpp-IJCGA-92-err,
title = {{Polynomial-size non-obtuse triangulation of polygons}},
author = {Marshall Wayne Bern and David Eppstein},
journal = {Int. J. Computational Geometry {\&} Applications},
volume = {2},
number = {4},
pages = {449--450},
month = {December},
year = {1992},
note = {Errata correcting printers' errors in original journal publication},
review = {MR-94e:52016b}}

@article{MR-94e:52016b,
reviews = {BerEpp-IJCGA-92-err},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Polynomial-size non-obtuse triangulation of polygons}},
author = {Nikolai M. Korneenko},
number = {94e:52016b},
year = {1994}}

Preface to Festschrift for Zvi Galil

@article{ItaEpp-JC-99,
title = {{Preface to Festschrift for Zvi Galil}},
author = {Giuseppe F. Italiano and David Eppstein},
journal = {J. Complexity},
volume = {15},
number = {1},
pages = {1--3},
month = {March},
year = {1999}}

Probabilistic and unambiguous computation are incomparable

@inproceedings{EppHemTis-ICCI-89,
title = {{Probabilistic and unambiguous computation are incomparable}},
author = {David Eppstein and Lane A. Hemachandra and James Tisdall and
B{\"u}lent Yener},
booktitle = {Proc. 1st Int. Conf. Computing {\&} Information},
pages = {65--70},
year = {1989}}

@techreport{EppHemTis-TR-90,
title = {{Probabilistic and unambiguous computation are incomparable}},
author = {David Eppstein and Lane A. Hemachandra and James Tisdall and
B{\"u}lent Yener},
institution = {Univ. of Rochester, Dept. of Computer Science},
number = {335},
year = {1990}}

Provably good mesh generation

@inproceedings{BerEppGil-FOCS-90,
title = {{Provably good mesh generation}},
author = {Marshall Wayne Bern and David Eppstein and John Russell Gilbert},
booktitle = {Proc. 31st Symp. Foundations of Computer Science},
publisher = {IEEE},
volume = {I},
pages = {231--241},
month = {October},
year = {1990},
review = {MR-92k:65132}}

@article{MR-92k:65132,
reviews = {BerEppGil-FOCS-90},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Provably good mesh generation}},
number = {92k:65132},
year = {1992}}

@article{BerEppGil-JCSS-94,
title = {{Provably good mesh generation}},
author = {Marshall Wayne Bern and David Eppstein and John Russell Gilbert},
journal = {J. Computer {\&} Systems Sciences},
volume = {48},
number = {3},
pages = {384--409},
month = {June},
year = {1994},
note = {Special issue for 31st FOCS},
review = {MR-95c:65235}}

@article{MR-95c:65235,
reviews = {BerEppGil-JCSS-94},
journal = {Mathematical Reviews},
publisher = {Amer. Math. Soc.},
title = {{Provably good mesh generation}},
number = {95c:65235},
year = {1995}}

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

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

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