On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich

Source URL: www.cs.rpi.edu

• Combinatorial optimization
• Graph theory
• NP-complete problems
• Network theory
• Edsger W. Dijkstra
• Steiner tree problem
• Simplex
• Matching
• Bipartite graph
• Graph
• Shortest path problem
• A* search algorithm

Anarchy, Stability, and Utopia: Creating Better Matchings Elliot Anshelevich Sanmay Das Yonatan Naamad

Source URL: www.cs.rpi.edu

• Graph theory
• Mathematics
• Matching
• Bipartite graph
• Stable marriage problem
• HopcroftKarp algorithm
• Blossom algorithm

From the Office of the American Secretary Elliot F. Gerson American Secretary The Rhodes Trust 8229 Boone Boulevard, Suite 240

Source URL: s3.amazonaws.com

• School districts in New York
• Honor societies

Coverage and Active Localization for Monitoring Invasive Fish with an Autonomous Boat Pratap Tokekar, Elliot Branson, Joshua Vander Hook, Volkan Isler Abstract—Carp is a highly invasive, bottom-feeding fish which pollu

Source URL: rsn.cs.umn.edu

Strategic Network Formation through an Intermediary∗ Elliot Anshelevich and Onkar Bhardwaj and Koushik Kar Rensselaer Polytechnic Institute 110 8th Street, Troy NY 12180 , , koushik@ecse

Source URL: www.cs.rpi.edu

• Game theory
• Price of anarchy

On the Social Welfare of Mechanisms for Repeated Batch Matching∗ Elliot Anshelevich Meenal Chhabra and Sanmay Das Matthew Gerrior

Source URL: www.cs.rpi.edu

• Game theory
• Mechanism design
• Combinatorial optimization
• Matching
• Stable marriage problem
• Welfare economics
• Cardinal utility
• Strategyproofness

Deformable Volumes in Path Planning Applications Elliot Anshelevich Scott Owens Florent Lamiraux Lydia E. Kavraki Department of Computer Science, Rice University Houston, TXAbstract This paper addresses the proble

Source URL: www.cs.rpi.edu

• Mechanics
• Solid mechanics
• Physics
• Deformation
• Elasticity
• Continuum mechanics
• Classical mechanics
• Plasticity
• Elastic energy
• Motion planning
• Work
• Soft tissue

Grant Elliot Carmichael 1825 Woodward Ave. SE Grand Rapids, MIMblog.thinkxd.com

Source URL: blog.thinkxd.com

ON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS PATRICK BENNETT, ANDRZEJ DUDEK, ELLIOT LAFORGE March 15, 2016 Abstract. Let C ⊆ [r]m be a code such that any two words of C have Hamming distance at least

Source URL: homepages.wmich.edu

Elliot Gold’s Electronic TeleSpan The authoritative source for teleconferencing news and analysis for more than a quarter-century

Source URL: mobileday.com