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
[1]
Hilfe
Suche: Author="Sack, J{\"o}rg-R{\"u}diger"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Shortest paths in time-dependent FIFO networks
Frank Dehne
,
Masoud T. Omran
,
Jörg-Rüdiger Sack
Algorithmica
62
(1-2), 2012, pp. 416-435
\alpha
-visibility
Mohammad Ghodsi
,
Anil Maheshwari
,
Mostafa Nouri
,
Jörg-Rüdiger Sack
,
Hamid Zarrabi-Zadeh
Lecture Notes in Computer Science
7357
, 2012, pp. 1-12
Piecewise-linear approximations of uncertain functions
Mohammad Ali Abam
,
Mark de Berg
,
Amirali Khosravi
Lecture Notes in Computer Science
6844
, 2011, pp. 1-12
A constant factor approximation algorithm for boxicity of circular arc graphs
Abhijin Adiga
,
Jasine Babu
,
L. Sunil Chandran
Lecture Notes in Computer Science
6844
, 2011, pp. 13-24
On the area requirements of Euclidean minimum spanning trees
Patrizio Angelini
,
Till Bruckdorfer
,
Marco Chiesa
,
Fabrizio Frati
,
Michael Kaufmann
,
Claudio Sqarcella
Lecture Notes in Computer Science
6844
, 2011, pp. 25-36
Multi-target ray searching problems
Spyros Angelopoulos
,
Alejandro López-Ortiz
,
Konstantinos Panagiotou
Lecture Notes in Computer Science
6844
, 2011, pp. 37-48
Convex transversals
Esther M. Arkin
,
Claudia Dieckmann
,
Christian Knauer
,
Joseph S.B. Mitchell
,
Valentin Polishchuk
,
Schlipf
,
Lena
,
Shang Yang
Lecture Notes in Computer Science
6844
, 2011, pp. 49-60
Witness rectangle graphs
Boris Aronov
,
Muriel Dulieu
,
Ferran Hurtado
Lecture Notes in Computer Science
6844
, 2011, pp. 73-85
How to cover a point set with a V-shape of minimum width
Boris Aronov
,
Muriel Dulieu
Lecture Notes in Computer Science
6844
, 2011, pp. 61-72
Faster optimal algorithms for segment minimization with small maximal value
Therese Biedl
,
Stephane Durocher
,
Céline Engelbeen
,
Samuel Fiorini
,
Maxwell Young
Lecture Notes in Computer Science
6844
, 2011, pp. 86-97
Orthogonal cartograms with few corners per face
Therese Biedl
,
Lesvia Elena Ruiz Velázquez
Lecture Notes in Computer Science
6844
, 2011, pp. 98-109
Smoothed analysis of partitioning algorithms for Euclidean functionals
Markus Bläser
,
Bodo Manthey
,
B.V. Raghavendra Rao
Lecture Notes in Computer Science
6844
, 2011, pp. 110-121
Feedback vertex set in mixed graphs
Paul Bonsma
,
Daniel Lokshtanov
Lecture Notes in Computer Science
6844
, 2011, pp. 122-133
Switching to directional antennas with constant increase in radius and hop distance
Prosenjit Bose
,
Paz Carmi
,
Mirela Damian
,
Robin Flatland
,
Matthew J. Katz
,
Anil Maheshwari
Lecture Notes in Computer Science
6844
, 2011, pp. 134-146
Path minima queries in dynamic weighted trees
Gerth Stlting Brodal
,
Pooya Davoodi
,
S. Srinivasa Rao
Lecture Notes in Computer Science
6844
, 2011, pp. 290-301
Frequency capping in online advertising
Niv Buchbinder
,
Moran Feldman
,
Arpita Ghosh
,
Joseph (Seffi) Naor
Lecture Notes in Computer Science
6844
, 2011, pp. 147-158
Adjacency-preserving spatial treemaps
Kevin Buchin
,
David Eppstein
,
Maarten Löffler
,
Martin Nöllenburg
,
Rodrigo I. Silveira
Lecture Notes in Computer Science
6844
, 2011, pp. 159-170
Register loading via linear programming
Gruia Calinescu
,
Minming Li
Lecture Notes in Computer Science
6844
, 2011, pp. 171-182
Connecting a set of circles with minimum sum of radii
Erin Wolf Chambers
,
Sándor P. Fekete
,
Hella-Franziska Hoffmann
,
Dimitri Marinakis
,
Joseph S.B. Mitchell
,
Venkatesh Srinivasan
,
Ulrike Stege
,
Sue Whitesides
Lecture Notes in Computer Science
6844
, 2011, pp. 183-194
Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
Timothy M. Chan
,
Vinayak Pathak
Lecture Notes in Computer Science
6844
, 2011, pp. 195-206
Multicut in trees viewed through the eyes of vertex cover
Jianer Chen
,
Jia-Hao Fan
,
Iyad A. Kanj
,
Yang Liu
,
Fenghui Zhang
Lecture Notes in Computer Science
6844
, 2011, pp. 219-230
New algorithms for 1-D facility location and path equipartition problems
Danny Z. Chen
,
Haitao Wang
Lecture Notes in Computer Science
6844
, 2011, pp. 207-218
Beyond triangulation: Covering polygons with triangles
Tobias Christ
Lecture Notes in Computer Science
6844
, 2011, pp. 231-242
Lossless fault-tolerant data structures with additive overhead
Paul Christiano
,
Erik D. Demaine
,
Shaunak Kishore
Lecture Notes in Computer Science
6844
, 2011, pp. 243-254
Binary identification problems for weighted trees
Ferdinando Cicalese
,
Tobias Jacobs
,
Eduardo Laber
,
Caio Valentim
Lecture Notes in Computer Science
6844
, 2011, pp. 255-266
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>