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="Hagerup, Torben"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Space-efficient basic graph algorithms
Amr Elmasry
,
Torben Hagerup
,
Frank Kammer
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 288-301
Kernels for edge dominating set: Simpler or smaller
Torben Hagerup
Lecture Notes in Computer Science
7464
, 2012, pp. 491-502
Finding the maximum suffix with fewer comparisons
Gianni Franceschini
,
Torben Hagerup
Lecture Notes in Computer Science
6078
, 2010, pp. 323-334
An even simpler linear-time algorithm for verifying minimum spanning trees
Torben Hagerup
Lecture Notes in Computer Science
5911
, 2010, pp. 178-189
Trimming of graphs, with application to point labeling
Thomas Erlebach
,
Torben Hagerup
,
Klaus Jansen
,
Moritz Minzlaff
,
Alexander Wolff
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 265-276
Online and offline access to short lists
Torben Hagerup
Lecture Notes in Computer Science
4708
, 2007, pp. 691-702
A very practical algorithm for the two-paths problem in 3-connected planar graphs
Torben Hagerup
Lecture Notes in Computer Science
4769
, 2007, pp. 145-150
Simpler computation of single-source shortest paths in linear average time
Torben Hagerup
Theory of Computing Systems
39
(1), 2006, pp. 113-120
Independent set of intersection graphs of convex objects in 2D
Pankaj K. Agarwal
,
Nabil H. Mustafa
Lecture Notes in Computer Science
3111
, 2004, pp. 127-137
Auctions with budget constraints
Nir Andelman
,
Yishay Mansour
Lecture Notes in Computer Science
3111
, 2004, pp. 26-38
Simplified external memory algorithms for planar DAGs
Lars Arge
,
Laura Toma
Lecture Notes in Computer Science
3111
, 2004, pp. 493-503
On geometric structure of global roundings for graphs and range spaces
Tetsuo Asano
,
Naoki Katoh
,
Hisao Tamaki
,
Takeshi Tokuyama
Lecture Notes in Computer Science
3111
, 2004, pp. 455-467
The multi-multiway cut problem
Adi Avidor
,
Michael Langberg
Lecture Notes in Computer Science
3111
, 2004, pp. 273-284
All-norm approximation for scheduling on identical machines
Yossi Azar
,
Shai Taub
Lecture Notes in Computer Science
3111
, 2004, pp. 298-310
Optimally competitive list batching
Wolfgang W. Bein
,
Leah Epstein
,
Lawrence L. Larmore
,
John Noga
Lecture Notes in Computer Science
3111
, 2004, pp. 77-89
Tight approximability results for test set problems in bioinformatics
Piotr Berman
,
Bhaskar DasGupta
,
Ming-Yang Kao
Lecture Notes in Computer Science
3111
, 2004, pp. 39-50
The relative worst order ratio applied to seat reservation
Joan Boyar
,
Paul Medvedev
Lecture Notes in Computer Science
3111
, 2004, pp. 90-101
Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
Gerth Stlting Brodal
,
Rolf Fagerberg
,
Ulrich Meyer
,
Norbert Zeh
Lecture Notes in Computer Science
3111
, 2004, pp. 480-492
Cache-oblivious algorithms and data structures
Gerth Stlting Brodal
Lecture Notes in Computer Science
3111
, 2004, pp. 3-13
Power assignment in radio networks with two power levels
Paz Carmi
,
Matthew J. Katz
Lecture Notes in Computer Science
3111
, 2004, pp. 431-441
Construction of the nearest neighbor embracing graph of a point set
M.Y. Chan
,
Danny Chen
,
Francis Y.L. Chin
,
Cao An Wang
Lecture Notes in Computer Science
3111
, 2004, pp. 150-160
Improvement of Nemhauser-Trotter theorem and its applications in parametrized complexity
Miroslav Chlebík
,
Janka Chlebíková
Lecture Notes in Computer Science
3111
, 2004, pp. 174-186
Subexponential-time framework for optimal embeddings of graphs in integer lattices
Anders Dessmark
,
Andrzej Lingas
,
Eva-Marta Lundell
Lecture Notes in Computer Science
3111
, 2004, pp. 248-259
Collective tree spanners of graphs
Feodor F. Dragan
,
Chenyu Yan
,
Irina Lomonosov
Lecture Notes in Computer Science
3111
, 2004, pp. 64-76
An algorithm for cyclic edge connectivity of cubic graphs
Zdenȇk Dvoȓák
,
Jan Kára
,
Daniel Král'
,
Ondȓej Pangrác
Lecture Notes in Computer Science
3111
, 2004, pp. 236-247
Seiten 1
2
3
4
5
>