|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 7 occurrences of 5 keywords
|
|
|
|
|
Results
Found 9 publication records. Showing 9 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jan Remy, Reto Spöhel, Andreas Weißl |
On Euclidean vehicle routing with allocation.  |
Comput. Geom.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Remy, Angelika Steger |
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Computational geometry, Approximation schemes, Steiner tree problem |
| 1 | Jan Remy, Angelika Steger |
A quasi-polynomial time approximation scheme for minimum weight triangulation. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, Minimum weight triangulation |
| 1 | Jan Remy, Alexander Souza, Angelika Steger |
On an Online Spanning Tree Problem in Randomly Weighted Graphs. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Remy, Reto Spöhel, Andreas Weißl |
On Euclidean Vehicle Routing with Allocation. |
WADS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Canzar, Jan Remy |
Shape Distributions and Protein Similarity. |
German Conference on Bioinformatics |
2006 |
DBLP BibTeX RDF |
|
| 1 | Jan Remy, Angelika Steger |
A quasi-polynomial time approximation scheme for minimum weight triangulation. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithms, minimum weight triangulation |
| 1 | Jan Remy, Angelika Steger |
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Remy |
Resource constrained scheduling on multiple machines. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #9 of 9 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")