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
Hilfe
Suche: Author="Pr{\"o}mel, Hans J{\"u}rgen"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Independent Deuber sets in graphs on the natural numbers
David S. Gunderson
,
Imre Leader
,
Hans Jürgen Prömel
,
Vojtȇch Rödl
Journal of Combinatorial Theory Series A
103
(2), 2003, pp. 305-322
For which densities are random triangle-free graphs almost surely bipartite?
Deryk Osthus
,
Hans Jürgen Prömel
,
Anusch Taraz
Combinatorica
23
(1), 2003, pp. 105-150
On random planar graphs, the number of planar graphs and their triangulations
Deryk Osthus
,
Hans Jürgen Prömel
,
Anusch Taraz
Journal of Combinatorial Theory Series B
88
(1), 2003, pp. 119-134
Steiner trees in uniformly quasi-bipartite graphs
Clemens Gröpl
,
Stefan Hougardy
,
Till Nierhoff
,
Hans Jürgen Prömel
Information Processing Letters
83
(4), 2002, pp. 195-200
The Steiner Tree Problem - A Tour through Graphs, Algorithms, and Complexity
Hans Jürgen Prömel
,
Angelika Steger
Advanced Lectures in Mathematics
, 2002, pp. viii, 241
Lower bounds for approximation algorithms for the Steiner tree problem
Clemens Gröpl
,
Stefan Hougardy
,
Till Nierhoff
,
Hans Jürgen Prömel
Lecture Notes in Computer Science
2204
, 2001, pp. 217-228
On the evolution of the worst-case OBDD size
Clemens Gröpl
,
Hans Jürgen Prömel
,
Anand Srivastav
Information Processing Letters
77
(1), 2001, pp. 1-7
Independent arithmetic progressions in clique-free graphs on the natural numbers
David S. Gunderson
,
Imre Leader
,
Hans Jürgen Prömel
,
Vojtȇch Rödl
Journal of Combinatorial Theory Series A
93
(1), 2001, pp. 1-17
Almost all graphs with high girth and suitable density have high chromatic number
Deryk Osthus
,
Hans Jürgen Prömel
,
Anusch Taraz
Journal of Graph Theory
(4), 2001, pp. 220-226
Phase transitions in the evolution of partial orders
Hans Jürgen Prömel
,
Angelika Steger
,
Anusch Taraz
Journal of Combinatorial Theory Series A
94
(2), 2001, pp. 230-275
A new approximation algorithm for the Steiner tree problem with performance ratio 5/3
Hans Jürgen Prömel
,
Angelika Steger
Journal of Algorithms
36
(1), 2000, pp. 89-101
A 1.598 approximation algorithm for the Steiner Problem in graphs
Stefan Hougardy
,
Hans Jürgen Prömel
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 448-453
Non-Ramsey graphs are
c \log n
-universal
Hans Jürgen Prömel
,
Vojtȇch Rödl
Journal of Combinatorial Theory Series A
88
(2), 1999, pp. 379-384
Asymptotic enumeration, global structure and constrained evolution
Hans Jürgen Prömel
,
Angelika Steger
,
Anusch Taraz
misc, 1999, March
Introduction to randomized algorithms
Artur Andrzejak
Lecture Notes in Computer Science
1367
, 1998, pp. 29-39
Size and structure of random ordered binary decision diagrams
Clemens Gröpl
,
Hans Jürgen Prömel
,
Anand Srivastav
Lecture Notes in Computer Science
1373
, 1998, pp. 238-248
Parallel repetition of MIP(2,1) systems
Clemens Gröpl
,
Martin Skutella
Lecture Notes in Computer Science
1367
, 1998, pp. 161-177
Proving the PCP-Theorem
Volker Heun
,
Wolfgang Merkle
,
Ulrich Weigand
Lecture Notes in Computer Science
1367
, 1998, pp. 83-160
Semidefinite programming and its applications to approximation algorithms
Thomas Hofmeister
,
Martin Hühne
Lecture Notes in Computer Science
1367
, 1998, pp. 263-298
Proof checking and non-approximability
Stefan Hougardy
Lecture Notes in Computer Science
1367
, 1998, pp. 63-82
Introduction to the theory of complexity and approximation algorithms
Thomas Jansen
Lecture Notes in Computer Science
1367
, 1998, pp. 5-28
Polynomial time approximation schemes for geometric optimization problems in Euclidean metric spaces
Richard Mayr
,
Annette Schelten
Lecture Notes in Computer Science
1367
, 1998, pp. 313-323
Optimal non-approximability of MaxClique
Martin Mundhenk
,
Anna Slobodová
Lecture Notes in Computer Science
1367
, 1998, pp. 235-248
Deriving non-approximability results by reductions
Claus Rick
,
Hein Röhrig
Lecture Notes in Computer Science
1367
, 1998, pp. 213-233
Bounds for approximating MaxLinEq3-2 and MaxE
k
Sat
Sebastian Seibert
,
Thomas Wilke
Lecture Notes in Computer Science
1367
, 1998, pp. 179-211
Seiten 1
2
>