Back to Results
First PageMeta Content
Polyhedron / Octahedron / Eulerian path / Induced path / Matching / Route inspection problem / Line graph / Edge coloring / Graph theory / Planar graphs / NP-complete problems


Computational Balloon Twisting: The Theory of Balloon Polyhedra Erik D. Demaine∗ Martin L. Demaine∗
Add to Reading List

Document Date: 2008-10-29 00:08:28

Open Document

File Size: 2,69 MB

Share Result on Facebook

City

Enschede / Cambridge / /

Company

SIAM Journal / Vertex / YouTube / Artificial Intelligence Laboratory / /

Country

United States / Netherlands / Israel / /

Currency

pence / /

/

Event

Natural Disaster / /

Facility

University of Maine / Balloon HQ / Stony Brook University / /

IndustryTerm

classic polynomial-time solution / quintibloon solutions / polynomial-time algorithm / tribloon solutions / graph algorithms / /

MusicAlbum

April / /

NaturalFeature

Summer/Fall / /

Organization

MIT / Department of Civil Engineering / University of Maine / U. S. Army Soldier Systems Center / Stony Brook University / /

Person

Jeremy Shafer / Dorit Dor / Susan Dawson / Naomi Greenfield / Adam William Turner / Katherine Heinrich / Michael Tarsi / Robert Kronenburg / Erik D. Demaine∗ Martin / Zdzisaw Skupie / Ian Holyer / Mariusz Meszka / Vladimir Tashkinov / Minli Yu / Rolf Eckhardt / Zbigniew Lonc / Alexandr Kostochka / Jiping Liu / Jan Kratochvil / Sara Taksler / Robert Johansson / Asif Karim / Martin L. Demaine∗ Vi Hart / Marcus Rehbein / Jim Morey / /

Position

mathematician / programmer / /

ProvinceOrState

Maine / Massachusetts / /

PublishedMedium

SIAM Journal on Computing / /

Technology

graph algorithms / technology of inflatable composite structures / polynomial-time algorithm / http / /

URL

http /

SocialTag