|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4 occurrences of 4 keywords
|
|
|
|
|
Results
Found 8 publication records. Showing 8 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer |
Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Yann Disser |
Mapping Polygons. |
|
2011 |
RDF |
|
| 1 | Yann Disser, Matús Mihalák, Peter Widmayer |
A polygon is determined by its angles. |
Comput. Geom. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer |
Telling convex from reflex allows to map a polygon. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yann Disser, Matús Mihalák, Peter Widmayer |
Reconstructing a Simple Polygon from Its Angles. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer |
How Simple Robots Benefit from Looking Back. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer |
Reconstructing Visibility Graphs with Simple Robots. |
SIROCCO |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yann Disser, Matthias Müller-Hannemann, Mathias Schnee |
Multi-criteria Shortest Paths in Time-Dependent Train Networks. |
WEA |
2008 |
DBLP DOI BibTeX RDF |
time-dependent graphs, case study, shortest paths, multi-criteria optimization, speed-up techniques |
Displaying result #1 - #8 of 8 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")