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="Poljak, S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Constructive quasi-Ramsey numbers and tournament ranking
A. Czygrinow
,
S. Poljak
,
V. Rödl
SIAM Journal on Discrete Mathematics
12
(1), 1999, pp. 48-63
Combining semidefinite and polyhedral relaxations for integer programs
C. Helmberg
,
S. Poljak
,
F. Rendl
,
H. Wolkowicz
Lecture Notes in Computer Science
920
, 1995, pp. 124-134
Weak three-linking in Eulerian digraphs
T. Ibaraki
,
S. Poljak
SIAM Journal on Discrete Mathematics
4
(1), 1991, February, pp. 84-98
Graphs with the Balas-Uhry property
M. Kano
,
S. Poljak
Journal of Graph Theory
14
(5), 1990, pp. 623-628
On common edges in optimal solutions to traveling salesman and other optimization problems
M. Chrobak
,
S. Poljak
Discrete Applied Mathematics
20
, 1988, pp. 101-111
On a product dimension of bipartite graphs
S. Poljak
,
D. Rödl
,
A. Pultr
Journal of Graph Theory
7
(4), 1983, pp. 475-486
On the arc-chromatic number of a digraph
S. Poljak
,
V. Rödl
Journal of Combinatorial Theory Series B
31
(2), 1981, October, pp. 190-198