|
| (99-414) |
L. Epstein, J. Sgall:
Approximation schemes for scheduling on uniformly related and identical parallel machines
PostScript
|
| (99-415) |
J. Nesetril, C Tardif:
Density
PostScript
|
| (99-416) |
A. Galluccio, P. Hell, J. Nesetril:
The complexity of H-coloring of bounded degree graphs
PostScript
|
| (99-417) |
W. Hochstattler, J. Nesetril:
A note on maxflow-mincut and homomorphic equivalence in matroids
PostScript
|
| (99-418) |
J. Nesetril, E. Sopena:
On four coloring problems
PostScript
|
| (99-419) |
J. Fiala, T. Kloks, J. Kratochvil:
Fixed-parameter complexity of $\lambda$-labelings
PostScript
|
| (99-420) |
M. Klazar :
Barany and Larman's Combinatorial approach to the Circle Problem.
PostScript
|
| (99-421) |
J. Matousek :
Piercing and Selection Theorems in Convexity.
PostScript
|
| (99-422) |
J. Nesetril, A. Raspaud :
Duality, Nowhere-Zero Flows, Colorings and Cycle Covers.
PostScript
|
| (99-423) |
J. Kratochvil :
Choosability and List Colorings.
PostScript
|
| (99-424) |
R. Niedermeier, H. Fernau :
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover.
PostScript
|
| (99-425) |
J. Matousek :
On the Linear and Hereditary Discrepacies.
PostScript
|
| (99-426) |
H. J. Promel :
The Innaproximability of the MaxClique and the SetCover Problem.
PostScript
|
| (99-427) |
J.Fiala (ed.) :
ESA 99.
|
| (99-428) |
P. A. Dreyer, C. Malon, J.Nesetril :
Universal H-colorabla graphs without a given configuration.
PostScript
|
| (99-429) |
J. Nesetril, C. Tardif :
Density via Duality.
PostScript
|
| (99-430) |
J. Fiala (ed.):
Graph Drawing 99.
|
| (99-431) |
J. Vondrak (ed.) :
Sixth Prague midsummer combinatorial workshop.
PostScript
|
| (99-432) |
J. Maxova, J. Nesetril :
On oriented path double covers.
PostScript
|
| (99-433) |
J. Nesetril, A. Pultr :
A note on homomorphism independent families.
PostScript
|
| (99-434) |
A. Pultr :
Fuzzy frames.
PostScript
|
| (99-435) |
J. Nesetril :
Aspects of structural combinatorics.
PostScript
|
| (99-436) |
D. Fon-Der-Flaass, A. Kostochka, J. Nesetril, A. Raspaud, E. Sopena :
Nilpotent families of endomorphisms and nice graphs.
PostScript
|
/| (99-437) |
/J. Nesetril :
/ Art of drawing.
/PostScript
/ |
/
/
/
/
/
/
/
/
/
/
/
/
/
/
/
/| (99-438) |
/D. Zeps :
/ Using combinatorial maps in graph-topological computations.
/PostScript
/ |
/
/
/
/
/
/
/
/
/
/
/
/
/
/
/
/
/| (99-439) |
/J. Nesetril, M. Rosenfeld :
/ Embedding graphs in Euclidean spaces, an exploration guided by Paul Erdos.
/PostScript
/ |
/
/
/
/
/
/
/
/
/
/
/
/
/
/
/
/
/
/| (99-440) |
/M. Loebl, M. Matamala :
/ Some remarks on cycles in graphs and digraphs.
/PostScript
/ |
/
/
/
/
/
/
/
/
/
/
/
/
/
/
/
/
/
/| (99-441) |
/M. Loebl:
/ On the dimer problem in 3-dimensional lattices.
/PostScript
/ |
/
/
/
/
/
| (99-442) |
A. Galluccio, M. Loebl, J. Vondrak:
A new algorithm for the Ising problem.
PostScript
|
| (99-443) |
A. Galluccio, M. Loebl, J. Vondrak:
A new algorithm for the MAX-CUT problem.
PostScript
|
| (99-444) |
J. Nesetril, J. Kratochvil, V. Janota :
DIMATIA 1997-1999.
PostScript
|
| (99-445) |
I. Barany, J. Matousek :
Simultaneous partitions of measures by k-fans.
PostScript
|
| (99-446) |
J. Matousek :
On approximate geometric k-clustering.
PostScript
|
| (99-447) |
O. Pangrac :
Genus of 2-isomorphic graphs.
PostScript
|
| (99-448) |
M. Klazar :
Furedi-Hajnal conjecture implies Stanley-Wilf conjecture.
PostScript
|
| (99-449) |
J. Nesetril, M. Rosenfeld :
I. Schur, C.E. Shannon an Ramsey Numbers, a short story
PostScript
|
| (99-450) |
P. Dell Ohno, M. Caramia :
A Lower Bound on the Chromatic Number of Mycielski Graphs
PostScript
|
| (99-451) |
M. Klazar :
Kombinatoricke pocitani
PostScript
|
| (99-452) |
R. Cada, J. Maxova, ed. :
Graph Theory Day 2
PostScript
|
|