| |
(2000-454) | M. Klazar : Kaleidoskop teorie cisel (1.kapitola) PostScript |
(2000-455) | J. Nesetril : A rigid graph for every set PostScript |
(2000-456) | J. Nesetril, X. Zhu : On sparse graphs with given colorings and homomorphisms PostScript |
(2000-457) | J. Nesetril, X. Zhu : Construction of sparse graphs with prescribed circular colorings PostScript |
(2000-458) | J. Nesetril : The coloring poset and its on-line universality PostScript |
(2000-459) | J. Matousek : Lower bound on the minus-domination number PostScript |
(2000-460) | J. Matousek : On the chromatic number of Kneser hypergraphs PostScript |
(2000-461) | J. Matousek : On directional convexity PostScript |
(2000-462) | J. Nesetril, A. V. Kostochka : Colouring relatives of intervals on the plane, II: intervals and rays in two directions PostScript |
(2000-463) | J. Nesetril, E. Sopena : On the oriented game chromatic number PostScript |
(2000-464) | J. Nesetril : Art of proving and conjecturing PostScript |
(2000-465) | J. Diaz, J. Nesetril, M. Serna : H-colorings of large degree graphs PostScript |
(2000-466) | J. Nesetril, E. Milkova, H. Nesetrilova : Otakar Boruvka on minimum spanning tree problem PostScript |
(2000-467) | P. Hlineny : An addition to art galleries with interior walls PostScript |
(2000-468) | M. Klazar : Kaleidoskop teorie cisel (2.kapitola) PostScript |
(2000-469) | M. Klazar : Kaleidoskop teorie cisel (3.kapitola) PostScript |
(2000-470) | J. Gimbel, J. Nesetril : Partitions of graphs into cographs |
(2000-471) | J. Matousek : Incidence problems (Lecture text for Spring School on Combinatorics 2000) PostScript |
(2000-472) | J. Nesetril : Combinatorics of mappings (Lecture text for Spring School on Combinatorics 2000) scanned PDF |
(2000-473) | B. Codenotti : Intersection between linear algebra and combinatorics (Lecture text for Spring School on Combinatorics 2000) PostScript |
(2000-474) | C. Groepl : Approximation algorithms, the primal dual method, and randomized rounding (Lecture text for Spring School on Combinatorics 2000) PostScript |
(2000-475) | P. Hlineny : Discharging technique in practice (Lecture text for Spring School on Combinatorics 2000) PostScript |
(2000-476) | M. Loebl : Cycles in graphs and digraphs (Lecture text for Spring School on Combinatorics 2000) PostScript |
(2000-477) | M. Loebl : On the inclusion-exclusion principle (Lecture text for Spring School on Combinatorics 2000) PostScript |
(2000-478) | J. Matousek, J. Vondrak : Probabilistic method (Lecture text for Spring School on Combinatorics 2000) scanned PDF |
(2000-479) | J. Fiala, J. Kratochvil : Partial covers of graphs PostScript |
(2000-480) | J. Fiala : The NP-completeness of the edge precoloring extension problem on bipartitePartial graphs PostScript |
(2000-481) | P. Kolman : Short disjoint paths on hypercubic graphs PostScript |
(2000-482) | M. Loebl, M. Kiwi : Largest planar matching in random bipartite graphs PostScript |
(2000-483) | M. Klazar : Kaleidoskop teorie cisel (4.kapitola) PostScript |
(2000-484) | D. Kral, J. Kratochvil, A. Proskurowski, H.-J. Voss : Coloring mixed hypertrees PostScript |
(2000-485) | M. DeVos, J. Nesetril, A. Raspaud : Antisymmetric Flows and Edge-connectivity PostScript |
(2000-486) | I. Barany, J. Matousek : Integer Points in Rotating Convex Bodies PostScript |
(2000-487) | M. Klazar : Kaleidoskop teorie cisel (5. kapitola) PostScript |
(2000-488) | A. S. Benight, P. Pancoska, R. Owczarzy, P. M. Vallone, J. Nesetril, P. V. Riccelli : Calculating Sequence Dependent Melting Stability of Duplex DNA Oligomers and Multiplex Sequence Analysis by Graphs |
(2000-489) | D. Zeps : Kuratowski Theorem from below PostScript |
(2000-490) | J. Nesetril, S. Shelah : On the Order of Countable Graphs PostScript |
(2000-491) | J. Nesetril : On Universality of Set Systems PostScript |
(2000-492) | J. Maxova, J. Nesetril : On Covers of Graphs PostScript |
(2000-493) | J. Gimbel : |
(2000-494) | M. Molloy, B. Reed : Colouring Graphs when the Number of Colours is Nearly the Maximum Degree PostScript |
(2000-495) | H. Nyklova, ed. : Midsummer Combinatorial Workshop VII PostScript |
(2000-496) | J. Sawada : Generating Bracelets in Constant Amortized Time PostScript |
(2000-497) | J. Sawada : A Fast Algorithm for Generating Non-Isomorphic Chord Diagrams PostScript |
(2000-498) | H. Nyklova : Almost Empty Polygons PostScript |
(2000-499) | R. L. Graham, J. Nesetril : Ramsey Theory and Paul Erdos (recent results from a historical perspective) PostScript |
(2000-500) | reserved |
(2000-501) | M. Erne, A. Pultr, M. Sichler : Closure Frames and Web Spaces PostScript |
(2000-502) | J. Ellis, F. Ruskey, J. Sawada, J. Simpson : Euclidean Strings PostScript |
(2000-503) | P. Kolman, C. Scheideler : Simple On-line Algorithms for the Maximum Disjoint Paths Problem PostScript |
(2000-504) | G. Karolyi, P. Valtr : Point Configurations in d-space without Large Subsets in Convex Position PostScript |
(2000-505) | P. Valtr : Davenport-Schinzel Trees PostScript |
(2000-506) | M. Loebl : On the Dimer Problem and Ising Problem in Finite 3-dimensional Lattices PostScript |
(2000-507) | M. Loebl : On the Dimer Problem and Ising Problem in Finite 3-dimensional Lattices PostScript |
(2000-508) | J. Fiala, J. Kratochvil, A. Proskurowski: Distance Constrained Labeling of Precolored Trees PostScript |