Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Widmayer, P."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reconstructing visibility graphs with simple robots
D. Bilò
,
Y. Disser
,
M. Mihalák
,
S. Suri
,
E. Vicari
,
P. Widmayer
Theoretical Computer Science
444
, 2012, pp. 52-59
Computing all the best swap edges distributively
P. Flocchini
,
L. Pagli
,
G. Prencipe
,
N. Santoro
,
P. Widmayer
Journal Parallel Distributed Computing
68
(7), 2008, pp. 976-983
Truthful mechanisms for generalized utilitarian problems
G. Melideo
,
P. Penna
,
G. Proietti
,
R. Wattenhofer
,
P. Widmayer
Proceedings of the 18th World Computer Congress and TC1 3rd International Conference on Theoretical Computer Science - Exploring New Frontiers of Theoretical Informatics, IFIP TCS'2004 (Toulouse, France, August 22-27, 2004)
, 2004, pp. 167-180
Inapproximability results for guarding polygons and terrains
S. Eidenbenz
,
C. Stamm
,
P. Widmayer
Algorithmica
31
(1), 2001, pp. 79-113
Relaxed balance using standard rotations
K.S. Larsen
,
E. Soisalon-Soininen
,
P. Widmayer
Algorithmica
31
(4), 2001, pp. 501-512
On the analysis of grid structures for spatial objects of non-zero size
Th. Rottke
,
H.-W. Six
,
P. Widmayer
Lecture Notes in Computer Science
314
, 1988, pp. 94-105
Time- and space-optimal contour computation for a set of rectangles
P. Widmayer
,
D. Wood
Information Processing Letters
24
(5), 1987, March, pp. 335-338
On some distance problems in fixed orientations
P. Widmayer
,
Y.F. Wu
,
C.K. Wong
SIAM Journal on Computing
16
(4), 1987, August, pp. 728-746
On approximation algorithms for Steiner's problem in graphs
P. Widmayer
Lecture Notes in Computer Science
246
, 1987, pp. 17-28
Pre-analysis locking
G. Lausen
,
E. Soisalon-Soininen
,
P. Widmayer
Information and Control
70
(2/3), 1986, pp. 193-215
A faster approximation algorithm for the Steiner problem in graphs
Y.F. Wu
,
P. Widmayer
,
C.K. Wong
Acta Informatica
23
(2), 1986, pp. 223-229
An optimal algorithm for the maximum alignment of terminals
P. Widmayer
,
C.K. Wong
Information Processing Letters
20
(2), 1985, February, pp. 75-82
Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles
Y.F. Wu
,
P. Widmayer
,
M.D.F. Schlag
,
C.K. Wong
Technical Report (RC 11039 Computer Sc), 1985, January
Rectilinear shortest paths and minimum spanning trees with rectilinear barriers
Y.F. Wu
,
P. Widmayer
,
M.D.F. Schlag
,
C.K. Wong
Applied Computer Science
, 1985, pp. 409-420