In Memoriam: Ingo Wegener (English)
- New search for: Doerr, B.
- New search for: Neumann, F.
- New search for: Doerr, B.
- New search for: Neumann, F.
In:
ALGORITHMICA -NEW YORK-
;
58
, 3
;
541-542
;
2010
-
ISSN:
- Article (Journal) / Print
-
Title:In Memoriam: Ingo Wegener
-
Contributors:Doerr, B. ( author ) / Neumann, F. ( author )
-
Published in:ALGORITHMICA -NEW YORK- ; 58, 3 ; 541-542
-
Publisher:
- New search for: SPRINGER VERLAG KG
-
Publication date:2010-01-01
-
Size:2 pages
-
ISSN:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 511.8
- Further information on Dewey Decimal Classification
-
Classification:
DDC: 511.8 -
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents – Volume 58, Issue 3
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 541
-
In Memoriam: Ingo WegenerDoerr, Benjamin / Neumann, Frank et al. | 2009
- 543
-
Algorithmic Aspects of Proportional Symbol MapsCabello, Sergio / Haverkort, Herman / Kreveld, Marc / Speckmann, Bettina et al. | 2009
- 566
-
On the Fastest Vickrey AlgorithmGrigorieva, Elena / Herings, P. Jean-Jacques / Müller, Rudolf / Vermeulen, Dries et al. | 2009
- 591
-
Approximate Boyer-Moore String Matching for Small AlphabetsSalmela, Leena / Tarhio, Jorma / Kalsi, Petri et al. | 2009
- 610
-
Multi-Color Pebble Motion on GraphsGoraly, Gilad / Hassin, Refael et al. | 2009
- 637
-
A Fully Dynamic Graph Algorithm for Recognizing Interval GraphsIbarra, Louis et al. | 2009
- 679
-
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval GraphsAsdre, Katerina / Nikolopoulos, Stavros D. et al. | 2009
- 711
-
Computing the Greedy Spanner in Near-Quadratic TimeBose, Prosenjit / Carmi, Paz / Farshi, Mohammad / Maheshwari, Anil / Smid, Michiel et al. | 2009
- 730
-
Analysis of the Expected Number of Bit Comparisons Required by QuickselectFill, James Allen / Nakama, Takéhiko et al. | 2009
- 770
-
Fast 3-coloring Triangle-Free Planar GraphsKowalik, Lukasz et al. | 2009
- 790
-
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut DecompositionsDorn, Frederic / Penninkx, Eelko / Bodlaender, Hans L. / Fomin, Fedor V. et al. | 2009