Home News About Us Contact Contributors Disclaimer Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Display Documents



ID: 518182.0, MPI für Informatik / Algorithms and Complexity Group
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
Authors:Park, Sang-Min; Lee, Jae-Ha; Chwa, Kyung-Yong
Language:English
Publisher:Springer
Place of Publication:Berlin, Germany
Date of Publication (YYYY-MM-DD):2001
Title of Proceedings:Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-01)
Start Page:456
End Page:468
Title of Series:Lecture Notes in Computer Science
Place of Conference/Meeting:Crete,Greece
Audience:Experts Only
Intended Educational Use:No
Last Change of the Resource (YYYY-MM-DD):2010-03-02
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-76E7DB9F594C39CAC1256AA000216E28-...
URL:http://link.springer.de/link/service/series/0558/p...
ISBN:3-540-42287-0
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.