| |
| (98-373) | J. Kratochvil, Zs. Tuza : Rankings of directed graphs PostScript |
| (98-374) | J. Kratochvil, P. Manuel, M. Miller, A. Proskurowski : Disjoint and fold domination in graphs PostScript |
| (98-375) | J. Kratochvil, I. Schiermeyer : On the Computational Complexity of (O,P)-partiton problems PostScript |
| (98-376) | J. Nesetril, A. Raspaud : Colored Homomorphisms of Colored Mixed Graphs PostScript |
| (98-377) | M. M. Haldorsson, J. Kratochvil, J.A. Telle : Independent sets with domination constraints PostScript |
| (98-378) | J. Matousek : On the discrepancy for boxes and polytopes PostScript |
| (98-379) | J. Matousek : The exponent of discrepancy is at least 1.0669 PostScript |
| (98-380) | A. V. Kostochka, J. Nesetril : Properties of the Descartes' construction of triangle free graphs with high chromatic number PostScript |
| (98-381) | J. Nesetril : Structure of the graph homomorphisms II. PostScript |
| (98-382) | P. Fischer, J. Matousek : A lower bound for families of Natarjan dimension d PostScript |
| (98-383) | P. E. Haxell, M. Loebl : On defect sets in bipartite graphs PostScript |
| (98-384) | K. Kuperberg, W. Kuperberg, J. Matousek, P. Valtr : Almost-tiling the plane by ellipses PostScript |
| (98-385) | W. Hochstattler, M. Laurent, M. Loebl : Cycle bases for lattices of matroids with no Fano dual minor and their one-element extension PostScript |
| (98-386) | J. Fiala ed. : Fifth Prague Combinatorial Workshop PostScript |
| (98-387) | H. de Fraysseix, P. Ossona de Mendez : Stretchability of Jordan Arc Contact Systems PostScript |
| (98-388) | J. Jezek, P. Markovic, M. Maroti, Z McKenzie : Equations of tournaments are not finitely based PostScript |
| (98-389) | P. Spickova : Homomorphism duality for rooted oriented graphs PostScript |
| (98-390) | T. Kloks, D. Kratsch, H. Muller : Bandwidth of chain graphs PostScript |
| (98-391) | T. Kloks, D. Kratsch, H. Muller : Finding and counting small graphs efficiently PostScript |
| (98-392) | R. Niedermeier, J. Alber : On Multi-dimensional Hilbert indexings PostScript |
| (98-393) | R. Niedermeier, K. Lange : Data Independence of Read, Write and Control Structures in Pram Computing PostScript |
| (98-394) | T. Kloks, J, Kratochvil, D. Kratsch, H. Muller : On vertex ranking, pathwidth and path cover number of (q,q-4)-graphs PostScript |
| (98-395) | B. Banaschiewski, A. Pultr : Adjointness Aspects of the Down-Set Functor PostScript |
| (98-396) | J. Matousek : On the signed domination in graphs PostScript |
| (98-397) | A. Galluccio, P. Hell, J. Nesetril : The complexity of H-colouring of bounded degree graphs PostScript |
| (98-398) | A. Pultr, J. Sichler : A Priestley view on spatialization of frames |
| (98-399) | H. Broersma, T. Kloks, D, Kratsch, H. Muller : A generalization of AT-free graphs and a generic algorithm for solving triangulation problems PostScript |
| (98-400) | Fifth Czech-Slovak Intrenational Symposium on Combinatorics, Graph Theory, Algorithms and Applications ( Abstracts ) |
| (98-400a) | Fifth Czech-Slovak Intrenational Symposium on Combinatorics, Graph Theory, Algorithms and Applications ( Program ) |
| (98-401) | R. Niedermeier, P. Rossmanith : New Upper Bounds for MaxSat PostScript |
| (98-402) | H. Broersma, A. Huck, T. Kloks, O. Koppius, D, Kratsch, H. Muller, H. Tuinstra : Degree-preserving forests PostScript |
| (98-403) | R. Niedermeier: Some Prospects for Efficient Fixed Parameter Algorithm PostScript |
| (98-404) | T. Kloks, R. Tan: Bandwidth of graphs with few P4s PostScript |
| (98-405) | J. Nesetril, A. Raspaud: Antiszmmetric Flows and Strong Colourings of Oriented Graphs PostScript |
| (98-406) | A. Kostochka, J. Nesetril, P. Smolikova: Coloring and homomorphisms of degenerate and bounded degree graphs PostScript |
| (98-407) | J. Nesetril, C. Tardif: Duality theorems for Finite Structures (characterising gaps and good characterisations) PostScript |
| (98-408) | P. Hlineny: A Note on Possible extensions of Negami's Conjecture PostScript |
| (98-409) | D. Zeps: Free Minor Closed Classes and the Kuratowski theorem PostScript |
| (98-410) | S. Seiden, J. Sgall, G. Woeginger: Semi-online scheduling with decreasing job sizes PostScript |
| (98-410) | S. Seiden, J. Sgall, G. Woeginger: Semi-online scheduling with decreasing job sizes PostScript |
| (98-411) | R. Niedermeier, P. Rossmanith: Upper bounds for vertex cover further improved PostScript |
| (98-412) | A. Pultr, A. Tozzi: A note on reconstruction of a space from the open set lattice PostScript |
| (98-413) | P. Hlineny ed.: From Erdos to algorithm, Applications of the "Probabilistic method" |