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="Poljak, Svatopluk"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Solving the max-cut problem using eigenvalues
Svatopluk Poljak
,
Franz Rendl
Discrete Applied Mathematics
62
, 1995, pp. 249-278
Integer linear programs and local search for MAX-CUT
Svatopluk Poljak
SIAM Journal on Computing
24
(4), 1995, August, pp. 822-839
k
-connectivity and decomposition of graphs into forests
Takao Nishizeki
,
Svatopluk Poljak
Discrete Applied Mathematics
55
, 1994, pp. 295-301
Bipartite subgraphs of triangle-free graphs
Svatopluk Poljak
,
Zsolt Tuza
SIAM Journal on Discrete Mathematics
7
(2), 1994, May, pp. 307-313
The cut cone III: On the role of triangle facets
Michel Deza
,
Monique Laurent
,
Svatopluk Poljak
Graphs and Combinatorics
9
, 1993, pp. 135-152
A spectral approach to bandwidth and separator problems in graphs
Christoph Helmberg
,
Bojan Mohar
,
Svatopluk Poljak
,
Franz Rendl
Proceedings of the 3rd International Conference on Integer Programming and Combinatorial Optimization, IPCO'93 (Erice, Sicily, April 29 - May 1, 1993)
, 1993, pp. 183-194
Efficient subgraph packing
Martin Loebl
,
Svatopluk Poljak
Journal of Combinatorial Theory Series B
59
(1), 1993, pp. 106-121
The cut cone III: On the role of triangle facets
Michel Deza
,
Monique Laurent
,
Svatopluk Poljak
Graphs and Combinatorics
8
, 1992, pp. 125-142
Compatible 2-factors
Jan Kratochvil
,
Svatopluk Poljak
Discrete Applied Mathematics
36
, 1992, pp. 253-266
The metric polytope
Monique Laurent
,
Svatopluk Poljak
Proceedings of the 2nd International Conference on Integer Programming and Combinatorial Optimization, IPCO'92 (Pittsburgh, PA, May 25-27, 1992)
, 1992, pp. 274-286
Extendability, dimensions, and diagrams of cyclic orders
Peter Alles
,
Jaroslav Nes̑etȓil
,
Svatopluk Poljak
SIAM Journal on Discrete Mathematics
4
(4), 1991, November, pp. 453-471
Long induced paths and cycles in Kneser graphs
Peter Alles
,
Svatopluk Poljak
Graphs and Combinatorics
5
, 1989, pp. 303-306
On the maximum number of qualitatively independent partitions
Svatopluk Poljak
,
Zsolt Tuza
Journal of Combinatorial Theory Series A
51
, 1989, pp. 111-116
On matroids induced by packing subgraphs
Martin Loebl
,
Svatopluk Poljak
Journal of Combinatorial Theory Series B
44
(3), 1988, June, pp. 338-354
Tournament ranking with expected profit in polynomial time
Svatopluk Poljak
,
Vojtȇch Rödl
,
Joel Spencer
SIAM Journal on Discrete Mathematics
1
, 1988, pp. 372-376
Maximum bipartite subgraphs of Kneser graphs
Svatopluk Poljak
,
Zsolt Tuza
Graphs and Combinatorics
3
, 1987, pp. 191-199
On pre-periods of discrete influence systems
Svatopluk Poljak
,
Daniel Turzík
Discrete Applied Mathematics
13
, 1986, pp. 33-39
On an application of convexity to discrete systems
Svatopluk Poljak
,
Daniel Turzík
Discrete Applied Mathematics
13
, 1986, pp. 27-32
On periodical behaviour in societies with symmetric influences
Svatopluk Poljak
,
Miroslav Sŭra
Combinatorica
3
, 1983, pp. 119-121
Amalgamation of matroids and its applications
Jaroslav Nes̑etȓil
,
Svatopluk Poljak
,
Daniel Turzík
Journal of Combinatorial Theory Series B
31
(1), 1981, August, pp. 9-22
Complexity of representation of graphs by set systems
Svatopluk Poljak
,
Vojtȇch Rödl
,
Daniel Turzík
Discrete Applied Mathematics
3
, 1981, pp. 301-312