No. 1, No. 50, No. 100, No. 150, No. 200, No. 250, No. 300, No. 350, No. 400, No. 450, No. 500, No. 550, No. 600, No. 650, No. 700, No. 750, No. 800
| |
| (86-1) |
J. Nesetril, V. Rodl :
Complexity of diagrams.
12 pages Published in Order 3 (1987), 321-330. Corrigendum: Order 10 (1993), p. 393. |
| (86-2) |
P. Sgall :
From expression through meaning to intension.
6 pages |
| (86-3) |
I. Kriz :
A hypergraph-less construction of highly chromatic graphs without short cycles.
4 pages Published in Combinatorica 9, 2 (1989), 227-229. |
| (86-4) |
M. Loebl, S. Poljak :
On matroids induced by packing subgraphs.
23 pages Published in J. Comb. Theory B 44, 3 (1988), 338-354. |
| (86-5) |
K. Zimmermann :
One optimization problem with max-min operations.
30 pages |
| (86-6) |
R. Svarc :
Some combinatorial results about the operators with jumping nonlinearities.
50 pages |
| (86-7) |
J. Matousek :
Few colored cuts or cycles in edge colored graphs.
13 pages Published in Comm. Math. Univ. Carolinae 29 (1988), 227-232. |
| (86-8) |
E. Hajicova :
Machine translation research in Czechoslovakia.
19 pages |
| (86-9) |
J. Nesetril, P. Pudlak :
A note on Boolean dimension of posets.
7 pages Published in Irregularities of partitions (Fertod, 1986). Algorithms Combin.: Study Res. Texts, 8, Springer, Berlin-New York, 1989, 137-140. |
| (86-10) |
L. Kucera :
Greedy coloring is a bad probabilistic algorithm.
7 pages |
| (86-11) |
S. Poljak, M. Chrobak :
On common edges in optimal solutions to travelling salesman and other optimization problems.
14 pages Published in Discrete Appl. Math. 20 (1988), 101-111. |
| (86-12) |
R. Svarc :
The operators with jumping nonlinearities and combinatorics.
41 pages |
| (86-13) |
R. Thomas :
A counterexample to Wagner's conjecture for infinite graphs.
7 pages Published in Math. Proc. Camb. Philos. Soc. 103 (1988), 55-57. |
| (86-14) |
P. Sgall, J. Panevova :
Dependency syntax, its problems and advantages.
23 pages |
| (86-15) |
J. Kratochvil, D. Zeps :
On the minimum number of hamiltonian cycles in triangulations.
8 pages Published in J. Graph Theory 12 (1988), 191-194. |
| (86-16) |
J. Nesetril :
For graphs there are only four types of hereditary Ramsey classes.
11 pages Published in J. Comb. Theory B 46, 2 (1989), 127-132. |
| (86-17) |
S. Poljak, Zs. Tuza :
Maximum bipartite subgraphs of Kneser graphs.
14 pages |
| (86-18) |
J. Nesetril, R. Thomas :
Well quasiorderings, long games and a combinatorial study of undecidability.
13 pages Published in Contemporary Math. 65 (Logic and Combinatorics), Am. Math. Soc. (1987), 281-293. |
| (86-19) |
M. Loebl, J. Matousek :
On undecidability of the weakened Kruskal theorem.
6 pages Published in Contemporary Math. 65 (Logic and Combinatorics), Am. Math. Soc. (1987), 275-279. |
| (86-20) |
M. Loebl, S. Poljak :
Remark on restricted and strongly unimodular matrices and a class between them.
8 pages |
| (86-21) |
E. Hajicova :
Focussing -- a meeting point of linguistics and artificial intelligence.
17 pages |
| (86-22) |
P. Hell, J. Nesetril :
On the complexity of H-coloring.
24 pages Published in J. Comb. Theory B 48 (1990), 92-110. |
| |
| (87-23) |
S. Poljak, Zs. Tuza :
On the maximum number of qualitatively independent partitions.
12 pages Published in J. Comb. Theory A 51 (1989), 111-116. |
| (87-24) |
I. Kriz :
Large independent sets in shift-invariant graphs. Solution of the Bergelson's problem.
19 pages Published in Graphs and Combin. 3 (1987), 145-158. |
| (87-25) |
I. Kriz, R. Thomas :
The Menger-like property of the tree-width of infinite graphs and related compactness results.
15 pages Published in J. Comb. Theory B 52 (1991), 86-91. |
| (87-26) |
O. Zyka :
Nowhere-zero 30-flow on bidirected graphs.
11 pages scanned PDF |
| (87-27) |
R. Svarc :
Two examples of the operators with jumping nonlinearities.
20 pages |
| (87-28) |
J. Ulehla :
On environments which force mice to behave regularly.
11 pages |
| (87-29) |
V. Pus :
A remark on distances in products of graphs.
9 pages |
| (87-30) |
I. Kriz, A. Pultr :
Peculiar behavior of connected locales.
23 pages Published in Cahiers de Top. et Geom. Diff. Cat. 30 (1989), 25-43. |
| (87-31) |
A. S. Fraenkel, M. Loebl, J. Nesetril :
Epidemiography II: Games with dozing yet winning player.
16 pages Published in J. Comb. Theory A 49, 1 (1988), 129-144. |
| (87-32) |
Selected problems from 15th Winter School.
22 pages |
| (87-33) |
M. Krivanek :
The complexity of ultrametric partitions on graphs.
8 pages |
| (87-34) |
L. Grygarova :
The implicit function theorem for a convex function.
16 pages |
| (87-35) |
P. Hell, D. Kirkpatrick, J. Kratochvil and I. Kriz :
On restricted two-factors.
27 pages Published in SIAM J. Discr. Math. 1 (1988), 472-485. |
| (87-36) |
L. Kucera :
Canonical labeling of regular graphs in linear average time.
20 pages |
| (87-37) |
M. Loebl, J. Matousek :
Hercules and Hidden Hydra Helper.
17 pages Published in Comm. Math. Univ. Carolinae 32, 4 (1992), 731-741. |
| (87-38) |
S. Poljak, V. Rodl, J. Spencer :
Tournament ranking with expected profit in polynomial time.
8 pages SIAM J. on Discr. Math. 1 (1988), 372-376 |
| (87-39) |
I. Kriz, J. Nesetril :
Chromatic number of the Hasse diagrams, eyebrows and dimension.
9 pages Published in Order 8 (1991), 41-48. |
| (87-40) |
G. Gambosi, J. Nesetril, M. Talamo :
Posets, Boolean representations and quick path searching.
20 pages Published in Automata, languages and programming (Karlsruhe 1987), 404-424, Lecture Notes in Comput. Sci., 267, Springer, Berlin-New York, 1987. |
| (87-41) |
I. Kriz, R. Thomas :
Clique-sums, tree-decompositions and compactness.
13 pages Published in Discr. Math. 81 (1990), 177-185. |
| (87-42) |
S. Poljak :
Transformations on graphs and convexity.
9 pages |
| (87-43) |
J. Panevova :
Marked and unmarked, primary and secondary items in linguistic description.
22 pages |
| (87-44) |
J. Kratochvil, J. Matousek, J. Maly :
On perfect codes in a random graph.
13 pages Published in Proc. Random Graphs '87, Wiley 1990, 141-149. |
| (87-45) |
P. Erdos, J. Nesetril, V. Rodl :
On Pisier type problems and results (Combinatorial applications to number theory).
32 pages Published in Mathematics of Ramsey theory, Algorithms. Combin., 5, Springer, Berlin, 1990, 214-231. |
| (87-46) |
R. Svarc :
Linear complementarity problem and extremal hyperplanes.
18 pages |
| (87-47) |
J. Ulehla :
A theory of words and the Peano arithmetics.
6 pages |
| (87-48) |
S. Poljak, D. Turzik :
Subgradients of convex functions and periodical behaviour of cellular automata.
17 pages |
| (87-49) |
J. Nesetril, V. Rodl :
Partite construction and Ramsey set systems.
17 pages Published in Graph Theory and Combinatorics (Cambridge, 1988). Discr. Math. 75 (1989), 327-334. |
| (87-50) |
M. Loebl, S. Poljak :
Efficient subgraph packing.
35 pages Published in J. Comb. Theory B 59 (1993), 106-121. |
| (87-51) |
R. Thomas :
A Menger-like property of tree width. The finite case.
19 pages Published in J. Comb. Theory B 48 (1990), 67-76. |
| (87-52) |
S. Poljak, D. Turzik :
Maximum bipartite subgraphs of circulant graphs.
11 pages |
| (87-53) |
J. Nesetril, V. Rodl :
Partite construction and Ramsey space systems.
27 pages Published in Mathematics of Ramsey theory, Algorithms Combin., 5, Springer, Berlin, 1990, 98-112. |
| (87-54) |
M. Loebl :
Hercules and Hydra.
14 pages |
| (87-55) |
Annual report 1986/1987.
24 pages |
| (87-56) |
C. D. Godsil, R. Nowakowski, J. Nesetril :
The chromatic connectivity of graphs.
4 pages Published in Graphs Combin. 4, 3 (1988), 229-223. |
| (87-57) |
M. Loebl, S. Poljak :
Bipartite packing.
9 pages Published in Finite and Infinite Sets (Proc. 7th Hung. Colloquium on Combinatorics, Eger 1987), Coll. Math. Soc. J. Bolyai 52 (1988), North-Holland, Amsterdam, 375-384. |
| (87-58) |
I. Kriz, R. Thomas :
Quantitative infinite Ramsey theory. Preliminary report.
27 pages Published in see no. 88-72. |
| (87-59) |
J. Matousek :
Approximate halfplanar range counting.
13 pages Published in SIAM J. Comput. 20, 2 (1991), 222-227 (revised as \sl Approximate levels in line arrangements). |
| (87-60) |
J. Nesetril :
On a problem of Pisier.
6 pages |
| (87-61) |
J. Nesetril, V. Rodl :
Ramsey theory for set structures.
79 pages |
| (87-62) |
J. Palata :
One important tool in optimization.
13 pages |
| (87-63) |
J. Rohn :
Solving systems of linear interval equations.
18 pages Published in Reliability in Computing (R. E. Moore, ed.), Academic Press, New York 1988, 171-182. |
| (87-64) |
P. Materna, E. Hajicova, P. Sgall :
Redundant answers and topic/focus articulation.
19 pages |
| (87-65) |
J. Kratochvil :
Perfect codes in general graphs.
9 pages Published in Coll. Math. Soc. J .Bolyai, 52, Proceedings 7th Hungarian Colloquium on Combinatorics, Eger 1987, 357-364. |
| (87-66) |
S. Poljak :
On maximum rank of a power of a matrix of a given pattern.
10 pages Published in Proceedings Amer. Math. Soc. 106 (1989), 1135-1144. |
| (87-67) |
M. Loebl, J. Nesetril :
Linearity and unprovability of the set union problem strategies.
11 pages Published in Proc. 20th Annual ACM Symposium on the Theory of Computing (STOC), 1988 (extended abstract). |
| (87-68) |
A. Pultr :
Coproducts of diametric frames
14 pages Published in Seminarberichte aus dem Fachbereich Mathematik (FernUniversit at Hagen) 29 (1988), 81-95 pages |
| (87-69) |
R. Thomas :
Well-quasiordering infinite graphs with forbidden finite planar minor.
73 pages Published in Trans. Amer. Math. Soc. 312 (1989), 279-313. |
| (87-70) |
J. Kratochvil, M. Krivanek :
On the computational complexity of codes in graphs.
12 pages Published in Proc. MFCS Karlovy Vary 1988, Lect. Notes in Comp. Sci. 324, Springer, Berlin 1988, pp. 396-404. |
| (87-71) |
S. Poljak :
Maximum rank of powers of matrix of a given pattern.
25 pages |
| |
| (88-72) |
I. Kriz :
Ordinal types in Ramsey theory and well-partial-ordering theory.
61 pages Published in Mathematics of Ramsey theory, Algorithms. Combin., 5, Springer, Berlin, 1990, 214-231 (extended version, combined with KAM Series no. 87-58). |
| (88-73) |
D. Volny :
Counterexamples to the central limit problem for stationary dependent random variables.
10 pages |
| (88-74) |
J. Matousek, J. Nesetril, R. Thomas :
On polynomial-time decidability of induced minor-closed classes.
10 pages Published in Comm. Math. Univ. Carolinae 29, 4 (1988), 703-710. |
| (88-75) |
J. Kratochvil, J. Nesetril :
Planar subgraphs of topological layouts.
23 pages |
| (88-76) |
J. Ulehla :
The description of the behaviour of the finite automaton in the Abelian group with two pebbles.
16 pages |
| (88-77) |
J. Rohn :
A short proof of finiteness of Murty's complementary pivot algorithm.
3 pages Published in Mathematical Programming 46 (1990), 255-256. |
| (88-78) |
J. Ulehla :
Over the 28-August-87's draft of detecting regularities in computations by Oded Maler.
3 pages |
| (88-79) |
J. Rohn :
Nearness of matrices to singularity.
4 pages |
| (88-80) |
B. Gruber :
Reduced cells based on extremal principles (On a certain classification of Buerger cells).
26 pages |
| (88-81) |
S. Poljak, M. Schegel :
Computing Jordan canonical form of a matrix from its pattern.
12 pages |
| (88-82) |
P. Hell, J. Nesetril :
Universality of directed graphs of a given height.
10 pages Published in Arch. Math. (Brno) 25 (1989), 47-54. |
| (88-83) |
J. Kratochvil :
String graphs I: The number of critical nonstring graphs is infinite.
17 pages Published in J. Comb. Theory B 52 (1991), 53-66. |
| (88-84) |
O. Zyka :
Bipartite density for 3-regular graphs with large girth.
6 pages |
| (88-85) |
V. Pus :
Chromatic number of product of graphs.
8 pages |
| (88-86) |
J. Kratochvil :
String graphs II: Recognizing string graphs is NP-hard.
16 pages Published in J. Comb. Theory B 52 (1991), 67-78. |
| (88-87) |
M. Loebl, S. Poljak :
On line balancing strongly unimodular matrices.
10 pages |
| (88-88) |
J. Kratochvil, S. Poljak :
Compatible two-factors.
25 pages Published in Discrete Appl. Math. 36 (1992), 253-266. |
| (88-89) |
A. Pultr :
Diameters in locales: How bad they can be.
16 pages Published in Comm. Math. Univ. Carolinae 29, 4 (1988), 731-742. |
| (88-90) |
J. Rohn :
An asymptotic result for linear interval systems.
5 pages Published in BIT 29 (1989), 372-374. |
| (88-91) |
J. Rohn :
A two-sequence method for linear interval equations.
5 pages Published in Computing 41 (1989), 137-140. |
| (88-92) |
R. Thomas :
The tree-width compactness theorem for hypergraphs.
24 pages |
| (88-93) |
J. Ulehla :
Languages of moves.
4 pages |
| (88-94) |
P. Hell, J. Nesetril :
Images of rigid digraphs.
10 pages Published in Europ. J. Combin. 12, 1 (1991), 33-42. |
| (88-95) |
J. Nesetril, G. Sabidussi :
Minimal graphs without bilateral symmetry: The case of induced length 4.
53 pages Published in Graphs Combin. 8, 4 (1992), 343-359. |
| (88-96) |
J. Matousek, R. Thomas :
Algorithms finding tree-decompositions of graphs.
26 pages Published in J. Algorithms 12, 1 (1991), 1-22. |
| (88-97) |
B. Mohar, S. Poljak :
Eigenvalues and the max-cut problem.
18 pages |
| (88-98) |
A. Pultr, W. Tholen :
Localic enrichments of categories.
19 pages |
| (88-99) |
I. Kriz :
Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture.
12 pages Published in Annals of Math. 130 (1989), 215-226. |
| (88-100) |
I. Kriz :
Proving a witness lemma in better-quasiordering theory: The method of ``extensions''.
18 pages Published in Math. Proc. Camb. Philos. Soc. 106 (1989), 253-262. |
| (88-101) |
J. Ulehla :
The twisted and the divisible mappings between the sets of all formal languages over given alphabets.
7 pages |
| (88-102) |
The Annual Report.
26 pages |
| (88-103) |
F. Mraz :
On local extremum of a quadratic function subject to linear constraints.
11 pages |
| (88-104) |
M. Krivanek, M. Loebl :
On the computational complexity of distance and median problems on partitions.
11 pages |
| (88-105) |
B. Banaschewski, A. Pultr :
Tarski's fixpoint lemma and combinatorial games.
20 pages Published in Order 7 (1991), 375-386. |
| (88-106) |
M. Loebl :
On gadgets.
8 pages |
| (88-107) |
J. Kratochvil :
Perfect codes and two-graphs.
11 pages Published in Comm. Math. Univ. Carolinae 30 (1989), 755-760. |
| (88-108) |
B. Banaschewski, A. Pultr :
Cauchy points of metric locales.
28 pages Published in Canad. J. Math. 41, 5 (1989), 830-854. |
| (88-109) |
J. Ulehla :
The MAD project.
4 pages |
| (88-110) |
J. Nesetril :
Ramsey theory.
88 pages Published in Handbook of Combinatorics (ed. R. L. Graham, M. Grotschel, L. Lovasz), North-Holland, 1995, 1125-1213. |
| (88-111) |
J. Ulehla :
Does this algorithm break the Kucera-Micali code?.
3 pages |
| (88-112) |
J. Ulehla :
The moments of the distance of a randomly permutated random restricted Kucera-Micali graph from restricted Kucera-Micali graphs.
6 pages |
| (88-113) |
G. Brightwell, J. Nesetril :
Reorientation of covering graphs.
5 pages Published in Combinatorics of ordered sets (Oberwolfach, 1988). Discr. Math. 88 (1991), 129-132. |
| (88-114) |
E. Hajicova, J. Panevova, P. Sgall :
Recent results of automation projects in Prague.
12 pages |
| (88-115) |
P. Alles, S. Poljak :
Long induced paths and cycles in Kneser graphs.
7 pages |
| (88-116) |
S. Poljak :
On generic dimension of controllable subspace.
9 pages |
| (88-117) |
S. Poljak, J. Rohn :
Radius of nonsingularity.
11 pages Published in Mathematics of Control, Signals, and Systems 6 (1993), 1-9 (under the title \sl Checking Robust Nonsingularity is NP-Hard). |
| (88-118) |
D. Matula, L. Kucera :
An Expose-and-Merge algorithm and the chromatic number of a random graph.
8 pages |
| (88-119) |
L. Kucera :
Graphs with small chromatic numbers are easy to color.
5 pages |
| (88-120) |
J. Panevova, P. Sgall :
On the notion of Interlingua.
15 pages |
| (88-121) |
I. Kriz, R. Thomas :
On well-quasiordering finite structures with labels.
13 pages Published in Graphs and Combin. 6 (1990), 41-49. |
| |
| (89-122) |
M. Loebl, J. Nesetril :
Postorder hierarchy for path compressions and set union.
7 pages Published in Machines, languages and complexity (Proc. IMYCS, Smolenice, 1988), Lecture Notes in Comput. Sci., 381, Springer, Berlin, 1989, 146-151. |
| (89-123) |
A. Pultr, J. Ulehla :
Notes on characterization of paracompact frames.
10 pages Published in Comm. Math. Univ. Carolinae 30, 2 (1989), 377-384. |
| (89-124) |
J. Rohn :
An existence theorem for systems of linear equations.
5 pages Published in Linear and Multilinear Algebra 29 (1991), 141-144. |
| (89-125) |
J. Rohn :
Real eigenvalues of an interval matrix with rank one radius.
4 pages Published in Zeitschrift fur Angewandte Mathematik und Mechanik 70 (1990), T562-T563. |
| (89-126) |
J. Ulehla :
On embeddings of free quantals into Babelian quantals.
5 pages |
| (89-127) |
V. Pus :
Representation of semigroups by products of simple graphs.
15 pages |
| (89-128) |
KAM Series Abstracts 1-71: 1986 (fall) and 1987.
14 pages |
| (89-129) |
J. Rohn :
Nonsingularity under data rounding.
9 pages Published in Linear Algebra and Its Applications 139 (1990), 171-174. |
| (89-130) |
V. Pus :
On multiplicative bases in commutative semigroups.
26 pages |
| (89-131) |
T. Ibaraki, S. Poljak :
Weak three-linking in Eulerian digraphs.
21 pages |
| (89-132) |
M. Loebl :
Generalised postorder path compression systems.
18 pages |
| (89-133) |
K. Murota, S. Poljak :
Note on a graph-theoretic criterion for structural output controllability.
9 pages |
| (89-134) |
M. Loebl, J. Nesetril :
Linearity and unprovability of set union problem strategies I. Linearity of on-line postorder.
15 pages Published in SIAM J. Alg. |
| (89-135) |
P. D. Seymour, R. Thomas :
Graph searching and a minimax theorem for tree-width.
15 pages Published in J. Comb. Theory B 58 (1993), 22-33. |
| (89-136) |
KAM Series abstracts 72-110.
10 pages |
| (89-137) |
M. Kano, S. Poljak :
Graphs with Balas-Uhry property.
11 pages |
| (89-138) |
M. Loebl :
Gadget classification.
13 pages Published in Graphs and Combin. 9 (1993), 57-62. |
| (89-139) |
M. Loebl, S. Poljak :
Subgraph packing -- a survey.
20 pages Published in Topics in Combinatorics and Graph Theory, Physica-Verlag, Heidelberg 1990. |
| (89-140) |
B. Banaschewski, A. Pultr :
Samuel compactification and completion of uniform frames.
27 pages Published in Math. Proc. Camb. Philos. Soc. 108 (1990), 63-78. |
| (89-141) |
J. Rohn :
Linear interval equations: Enclosing and nonsingularity.
16 pages |
| (89-142) |
Y. C. Sok, K. Zimmermann :
Optimal choice of parameters in machine-time scheduling problems with penalized earliness in starting and lateness in completing the operations.
15 pages |
| (89-143) |
J. Kratochvil, J. Matousek :
Intersection graphs of segments.
45 pages Published in J. Comb. Theory B 68 (1994), 317-339. |
| (89-144) |
S. Poljak :
Coloring digraphs by iterated antichains.
5 pages |
| (89-145) |
M. Knor :
Note on linear arboricity.
16 pages |
| (89-146) |
S. Poljak, D. Turzik :
Max-cut in circular graphs.
20 pages |
| (89-147) |
D. Bienstock, N. Robertson, R. Thomas, P. D. Seymour :
Quickly excluding a forest.
9 pages |
| (89-148) |
A. Pultr :
On Sabidussi-Fawcett subdirect representation.
23 pages Published in Discr. Math. 109 (1992), 239-253. |
| (89-149) |
A. Frieze, L. Kucera :
Parallel coloring of random graphs.
8 pages |
| (89-150) |
A. Pultr :
Notes on an extension of the structure of frame.
11 pages Published in Discr. Math. 108 (1992), 107-114. |
| (89-151) |
M. Krivanek :
The use of graphs of elliptical influence in visual hierarchical clustering.
10 pages |
| (89-152) |
Annual Report 88/89.
29 pages |
| (89-153) |
M. Loebl, J. Nesetril :
An unprovable Ramsey-type theorem.
10 pages Published in Proceedings Amer. Math. Soc. 116, 3 (1992), 819-824. |
| (89-154) |
P. D. Seymour, R. Thomas :
Excluding infinite trees.
36 pages Published in Trans. Amer. Math. Soc. 335 (1993), 597-630. |
| (89-155) |
R. Adamec, M. Klazar, P. Valtr :
Forbidden words.
14 pages Published in Discrete Math. 108 (1992), 219-229. |
| (89-156) |
F. Mraz :
On the set of nonnegative solutions of linear interval equations.
12 pages |
| (89-157) |
P. Savicky :
Boolean functions with the maximal Hamming distance from the linear functions.
20 pages |
| (89-158) |
N. Robertson, P. D. Seymour, R. Thomas :
Quickly excluding a planar graph.
18 pages Published in J. Comb. Theory B 62 (1994), 323-348. |
| (89-159) |
A. Ambrosetti, M. Calahorrano, F. Dobarro :
Global branching for discontinuous problems.
10 pages |
| |
| (90-160) |
N. Alon, P. D. Seymour, R. Thomas :
A separator theorem for non-planar graphs.
9 pages Published inJ. Amer. Math. Soc. 3 (1990), 801-808. |
| (90-161) |
B. Banaschewski, A. Pultr :
Cauchy points of uniform and nearness locales.
21 pages To appear in Quaestiones Mathematicae. |
| (90-162) |
J. Kratochvil, P. Savicky, Zs. Tuza :
One more occurence of variables makes satisfiability jump from trivial to NP-complete.
10 pages Published in SIAM J. Comput. 22 (1993), 203-210. |
| (90-163) |
S. Poljak :
Neural network analysis via linear programming and convexity.
22 pages |
| (90-164) |
J. Kratochvil, J. Nesetril :
Independent set and maximal clique problems in intersection-defined classes of graphs.
11 pages Published in Comm. Math. Univ. Carolinae 31, 1 (1990), 85-93. |
| (90-165) |
S. Poljak, T. Nishizeki :
$K$-connectivity and decomposition of graphs into forests.
11 pages |
| (90-166) |
Annual Report (with Prachatice meeting appendix).
25 pages |
| (90-167) |
P. Bugata :
On algorithmic solvability of Trakhtenbrot-Zykov problem.
20 pages scanned PDF |
| (90-168) |
D. Zeps :
The triconnectivity considered dynamically.
9 pages |
| (90-169) |
V. Nydl :
Finite undirected graphs which are not reconstructible from their large cardinality subgraphs.
8 pages |
| (90-170) |
S. Poljak :
Minimum spectral radius of a weighted graph.
12 pages |
| (90-171) |
Ch. Delorme, S. Poljak :
Laplacian eigenvalues and the maximum cut problem.
14 pages |
| (90-172) |
S. Poljak :
On controllability Kronecker indices of structured systems.
10 pages |
| (90-173) |
M. Deza, M. Laurent, S. Poljak :
The cut cone III: On the role of triangle facets.
25 pages |
| (90-174) |
J. Matousek :
Approximations and optimal geometric divide-and-conquer.
9 pages Published in J. Comp. and System Sci. 50,2 (1995), 203-208 (invited paper). |
| (90-175) |
J. Matousek :
Efficient partition trees.
10 pages Published in Discr. Comput. Geom. 8 (1992), 315-334 (invited paper). |
| (90-176) |
J. Matousek :
Cutting hyperplane arrangements.
19 pages Published in Discr. Comput. Geom. 6, 5 (1991), 385-406 (invited paper). |
| (90-177) |
S. Janson, J. Kratochvil :
Proportional graphs.
13 pages Published in Random Struct. Alg. 2 (1991), 209-224. |
| (90-178) |
J. Matousek :
A simple proof of weak zone theorem.
3 pages |
| (90-179) |
P. Savicky :
Bent function and random Boolean formulae.
30 pages |
| (90-180) |
O. Zyka :
.. and some more descriptions of matroids.
6 pages |
| (90-181) |
P. Valtr :
Convex independent sets and 7-holes in restricted planar point sets.
12 pages Published in Discr. Comput. Geom. 7 (1992), 135-152. |
| (90-182) |
J. Matousek :
Randomized optimal algorithm for slope selection.
5 pages Published in Inf. Processing Letters 39 (1991), 183-187. |
| (90-183) |
P. Valtr :
Sets in $R^d$ with no large empty convex subsets.
7 pages Published in Discr. Math. 108 (1992), 115-124. |
| (90-184) |
J. Matousek :
Computing dominances in $E^n$.
2 pages Published in Inf. Processing Letters 38, 5 (1991), 277-278. |
| (90-185) |
M. Loebl :
Greedy compression systems.
12 pages |
| (90-186) |
M. Loebl :
Postorder strategy for tree compressions (Extended abstract).
12 pages |
| (90-187) |
M. Loebl :
Postorder strategy for tree compressions.
40 pages |
| (90-188) |
P. Savicky :
On the bent Boolean functions which are symmetric.
10 pages |
| (90-189) |
M. Krivanek :
Connected admissible hierarchical clustering.
8 pages scanned PDF |
| (90-190) |
M. Krivanek :
Single linkage vs. complete linkage.
14 pages scanned PDF |
| (90-191) |
J. Matousek :
Epsilon-nets and computational geometry.
14 pages Published in Algorithms and Combinatorics, vol. 10: New Trends in Discrete and Computational Geometry (J. Pach ed.), Springer 1993, 69-89. |
| (90-192) |
M. Loebl, J. Nesetril :
Unprovability of set union problem strategies.
64 pages |
| (90-193) |
J. Matousek :
Reporting points in halfspaces.
11 pages Published in Comput. Geom.: Theor. Appl. 2, 3 (1992), 169-186. |
| (90-194) |
W. Imrich, J. Nesetril :
Simple tournaments and sharply transitive graphs.
9 pages Published in Discr. Math. 108 (1992), 159-165. |
| |
| (91-195) |
B. Banaschewski, A. Pultr :
Booleanization as reflection.
46 pages |
| (91-196) |
P. Hell, J. Nesetril :
The core of a graph.
14 pages Published in Algebraic graph theory (Leibnitz, 1989). Discr. Math. 109 (1992), 117-126. |
| (91-197) |
M. Loebl, J. Nesetril :
Fast and slow growing (A combinatorial study of unprovability).
42 pages Published in Surveys in combinatorics, 1991 (Guildford, 1991), London Math. Soc. Lecture Note Ser., 166, Cambridge Univ. Press, Cambridge, 1991, pp. 119-160. |
| (91-198) |
J. Matousek, E. Welzl, L. Wernisch :
Discrepancy and $\varepsilon$-approximations for bounded VC-dimension.
10 pages Published in Combinatorica 13 (1993), 455-466. |
| (91-199) |
P. K. Agarwal, J. Matousek, S. Suri :
Farthest neighbors, maximum spanning trees and related problems in higher dimensions.
10 pages Published in Comput. Geom.: Theor. Appl. 1, 4 (1992), 189-201. |
| (91-200) |
B. Gruber :
Topological approach to the Niggli lattice characters.
33 pages |
| (91-201) |
T. Hirata, J. Matousek, X.-H. Tan, T. Tokuyama :
Complexity of projected images of convex subdivisions.
8 pages Published inComput. Geom.: Theor. Appl. 4, 6 (1994), 293-308. |
| (91-202) |
J. Matousek :
Linear optimization queries.
10 pages Published in J. Algorithms 14 (1993), 432-448. New version (with O. Schwarzkopf): Proc. 8th ACM Symp. Comp. Geom. (1992), 16-25. |
| (91-203) |
J. Matousek :
Computing the center of planar point sets.
8 pages Published in Computational Geometry: papers from the DIMACS special year (J. E. Goodman, R. Pollack, W. Steiger eds.), AMS-ACM DIMACS Series, Am. Math. Soc. 1991, 221-230. |
| (91-204) |
J. Kratochvil :
Regular codes in regular graphs are difficult.
14 pages Published in Discr. Math. 133 (1994), 191-205. |
| (91-205) |
S. Janson, J. Kratochvil :
Threshold functions for classes of intersection graphs.
37 pages Published in Discr. Math. 108 (1992), 307-326. |
| (91-206) |
B. Banaschewski, A. Pultr :
Universal categories of uniform and metric locales.
18 pages To appear in Algebra Universalis. |
| (91-207) |
L. Kucera :
Constant depth probabilistic approximation of thresholds.
8 pages |
| (91-208) |
M. R. Fellows, J. Kratochvil, M. Middendorf, F. Pfeiffer :
The complexity of induced minors and related problems.
19 pages Published in Algorithmica 13 (1995), 266-282. |
| (91-209) |
B. Chazelle, J. Matousek :
Derandomizing an output-sensitive convex hull algorithm in three dimensions.
5 pages Published in Comput. Geom.: Theor. Appl. 5,1 (1995), 27-32. |
| (91-210) |
M. Klazar :
A general upper bound in Extremal theory of sequences.
8 pages Published in Comm. Math. Univ. Carolinae 33 (1992), 737-747. |
| (91-211) |
M. Klazar :
A linear upper bound in the extremal theory of sequences.
8 pages Published in J. Comb. Theory A 68 (1994), 454-464. |
| (91-212) |
M. Klazar :
On the equation $x^2-y^3 = \pm 3^3k$.
5 pages |
| (91-213) |
N. Alon, I. Kriz, J. Nesetril :
How to color shift hypergraphs.
11 pages Published in Studia Sci. Math. Hung. 30 (1995), 1-11. |
| (91-214) |
M. Zeman :
WQO, antichains and somewhere continuous embeddings of transfinite sequences.
8 pages |
| (91-215) |
J. Matousek :
Range searching with efficient hierarchical cuttings.
20 pages Published in Discr. Comput. Geom. 10, 2 (1993), 794-806. |
| (91-216) |
J. Matousek, V. Rodl :
On Ramsey sets in spheres.
12 pages Published in J. Comb. Theory A 70, 1 (1995), 30-44. |
| (91-217) |
A. Galluccio, M. Loebl :
Path cycles of prescribed parity in planar digraphs.
29 pages |
| (91-218) |
J. Kratochvil :
Precoloring extension with fixed color bound.
13 pages Published in Acta Math. Univ. Comen. 62 (1993), 139-153. |
| (91-219) |
P. K. Agarwal, J. Matousek :
Dynamic halfspace range reporting and its applications.
22 pages Published inAlgorithmica 13 (1995), 325-345. |
| |
| (92-220) |
J. Kratochvil, J. Nesetril, O. Zyka :
On the computational complexity of Seidel's switching.
7 pages Published in Combinatorics, Graphs and Complexity (M. Fiedler and J. Nesetril eds.), Proc. Fourth Czechoslovakian Symposium on Combinatorics, Prachatice 1990, Ann. Discrete Math. 51, North-Holland, Amsterdam, 1992, 161-166. |
| (92-221) |
J. Nesetril :
On ordered graphs and graph orderings.
6 pages Published in Discrete Appl. Math. 51 (1994), 113-116. |
| (92-222) |
P. Valtr :
On the minimum number of empty polygons in planar point sets.
8 pages Published in Studia Sci. Math. Hung. 30 (1995), 155-163. |
| (92-223) |
J. Nesetril, V. Rodl :
On Ramsey graphs without bipartite subgraphs.
9 pages Published in Discr. Math. 101 (1992), 223-229. |
| (92-224) |
H.-D. O. F. Gronau, J. Nesetril :
On 2-$(v,4,\lambda)$ designs without pair intersections.
8 pages Published in Ars Combinatoria 39 (1995), 161-166. |
| (92-225) |
J. Rohn :
On the common argument behind the finite pivoting rules by Bland and Murty.
4 pages |
| (95-226) |
A. S. Fraenkel, M. Loebl :
Complexity of circuit intersection in graphs.
19 pages To appear in Discr. Math. |
| (92-227) |
M. Klazar, P. Valtr :
Linear sequences.
17 pages Published in Combinatorica 14 (1994), 463-476. |
| (92-228) |
B. Banaschewski, A. Pultr :
Variants of openness.
16 pages Published in Applied Categorical Structures 2 (1994), 331-350. |
| (92-229) |
P. Valtr :
Unit squares intersecting all secants of a square.
8 pages Published in Discr. Comput. Geom. 11 (1994), 235-239. |
| (92-230) |
P. K. Agarwal, J. Matousek :
On range searching with semialgebraic sets.
22 pages Published in Discr. Comput. Geom. 11 (1994), 393-418. |
| (92-231) |
J. Matousek, O. Schwarzkopf :
A deterministic algorithm for the three-dimensional diameter problem.
11 pages Published in Proc. 25th ACM Symposium on Theory of Computing (1993), 478-484. |
| (92-232) |
P. Gvozdjak, J. Nesetril :
High girth and extendability.
9 pages To appear in Discr. Math. |
| |
| (93-233) |
J. Nesetril :
Graph homomorphisms and their structure.
6 pages Published in Graph Theory, Combinatorics and Algorithms (ed. Y. Alavi, A. Schwenk), J. Wiley \& sons (1995), pp. 825-832. |
| (93-234) |
P. Erdos, Zs. Tuza, P. Valtr :
Ramsey-remainder.
19 pages To appear in Europ. J. Combin. (1996). |
| (93-235) |
M. Klazar :
Two results on a partial ordering of finite sequences.
9 pages Published in Comm. Math. Univ. Carolinae 34 (1993), 697-705. |
| (93-236) |
F. Mraz :
On supremum of the solution function in LP's with interval coefficients.
18 pages |
| (93-237) |
P. Hell, J. Nesetril, X. Zhu :
Complexity of tree homomorphisms.
30 pages |
| (93-238) |
J. Rohn :
Cheap and tight bounds: The recent result by E. Hansen can be made more efficient.
4 pages Published in Interval Computations 4(1993), 13-21. |
| (93-239) |
F. Mraz :
The algorithm for solving interval linear programs and comparison with similar approaches.
11 pages |
| (93-240) |
M. Klazar :
On well quasiordering of finite languages.
8 pages To appear in Discr. Math. |
| (93-241) |
J. Nesetril, V. Rodl :
More on complexity of diagrams.
19 pages |
| (93-242) |
P. Valtr :
On mutually avoiding sets.
6 pages To appear in The Mathematics of Paul Erdos (ed. R. L. Graham, J. Nesetril). |
| (93-243) |
P. Hell, J. Nesetril, X. Zhu :
Duality and polynomial testing of tree homomorphisms.
20 pages To appear in Trans. Amer. Math. Soc. |
| (93-244) |
P. Hell, J. Nesetril, X. Zhu :
Duality of graph homomorphisms .
13 pages To appear in Proc. of the Hung. Comb. Coll. 1994. |
| (93-245) |
J. Matousek :
On enclosing $k$ points by a circle.
6 pages Published in Inf. Processing Letters 53 (1995), 217-221. |
| (93-246) |
M. de Berg, J. Matousek, O. Schwarzkopf :
Piecewise linear paths among convex obstacles.
23 pages Published inDiscr. Comput. Geom. 14 (1995), 9-29. |
| (93-247) |
J. Matousek :
On Lipschitz mapping onto a square.
6 pages |
| (93-248) |
B. Aronov, J. Matousek :
On stabbing triangles by lines in 3-space.
4 pages Published inComm. Math. Univ. Carolinae 36, 1 (1995), 109-113. |
| (93-249) |
P. Greenberg, M. Loebl :
Strong connectivity on polyhedral complexes.
16 pages Published in J. Algebraical Combinatorics 5 (1996), 117-125. French version in: Seminaire de theorie spectrale et geometrie, Chambery-Grenoble 1993. |
| (93-250) |
P. Erdos, M. Loebl, I. Ruzsa, V. T. Sos :
Discrepancy of trees.
13 pages Published in Studia Sci. Math. Hung. 30 (1994). |
| (93-251) |
M. Klazar :
Extremal functions for sequences.
10 pages Published in Discrete Math. 150 (1996), 195-203. |
| (93-253) |
J. Nesetril, P. Valtr :
A Ramsey-type theorem in the plane.
9 pages Published in Combinatorics, Probability and Computing 3 (1994), 127-135. |
| (93-254) |
Prague Midsummer Combinatorial Workshop.
24 pages |
| (93-255) |
J. Gimbel :
A note on sources and sinks in comparability graphs.
7 pages |
| (93-256) |
M. Klazar :
On a proof of Ramsey theorem and of Erdos-Rado theorem for pairs.
5 pages |
| (93-257) |
J. Matousek :
On geometric optimization with few violated constraints.
19 pages Published in Discr. Comput. Geom. 14 (1995), 364-384 (invited paper). |
| (93-258) |
H. Bronnimann, B. Chazelle, J. Matousek :
Product range spaces, sensitive sampling and derandomization.
27 pages Published in Proc. 34th IEEE Symp. on Foundations of Computer Science (1993), 400-409. |
| (93-259) |
J. Matousek :
Derandomization in computational geometry.
28 pages To appear in J. Algorithms. |
| |
| (94-260) |
A. A. Ageev, A. V. Kostochka, Z. Szigeti :
A characterization of Seymour graphs.
9 pages |
| (94-261) |
J. Matousek, J. Spencer :
Discrepancy in arithmetic progressions.
12 pages |
| (94-262) |
J. Matousek :
Tight upper bounds for the discrepancy of halfspaces.
9 pages Published in Discr. Comput. Geom. (L. Fejes Toth Festschrift) 13 (1995), 593-601. |
| (94-263) |
P. Valtr :
Probability that $n$ random points are in convex position.
7 pages Published in Discr. Comput. Geom. 13 (1995), 637-643. |
| (94-264) |
H. Edelsbrunner, P. Valtr, E. Welzl :
Cutting dense point sets in half.
24 pages Published in Proc. Tenth Ann. Symp. on Comp. Geom., Stony Brook, ACM Press (1994), 203-210. Also to appear in Discr. Comput. Geom. |
| (94-265) |
B. Banaschewski, A. Pultr :
Booleanization.
15 pages To appear in Cahiers de Top. et Geom. Diff. Cat. |
| (94-266) |
B. Banaschewski, A. Pultr :
On Cauchy homomorphisms of nearness frames.
14 pages To appear in Math. Nachrichten. |
| (94-267) |
P. Savicky :
Improved Boolean formulas for the Ramsey graphs.
10 pages |
| (94-268) |
J. Matousek :
Note on the colored Tverberg theorem.
5 pages Published in J. Comb. Theory B 66 (1996), 146-151. |
| (94-269) |
M. Klazar :
On numbers of Davenport-Schinzel sequences.
12 pages |
| (94-270) |
P. Savicky :
Complexity and probability of some Boolean formulas.
10 pages |
| (94-271) |
A. Pultr, J. Sichler :
Extremal prime filters and universality of some categories.
10 pages To appear in Quaestiones Mathematicae. |
| (94-272) |
J. Matousek :
Topological Methods in Combinatorics and Geometry.
35 pages |
| ( 94-272c ) |
J. Matousek :
Topologicke metody v kombinatorice a geometrii.
30 pages |
| (94-273) |
J. Matousek :
On discrepancy bounds via dual shatter function.
9 pages |
| (94-274) |
D. Zeps :
Graphs with rotation in permutation technique.
8 pages |
| |
| (95-275) |
M. Klazar :
On abab-free and abba-free set partitions.
16 pages Published in Europ. J. Combin. 17 (1996), 53-68. |
| (95-276) |
A. Pultr, A. Tozzi :
Completion and coproducts of nearness frames.
10 pages To appear in Proc. (Festschrift) of G. Brummer's conference. |
| (95-277) |
J. Matousek :
A Helly-type theorem for unions of convex sets.
10 pages To appear in Discr. Comput. Geom. |
| (95-278) |
J. Kratochvil, A. Proskurowski, J. A. Telle :
Complexity of graph coloring problems.
13 pages |
| (95-279) |
A. V. Kostochka, J. Kratochvil :
Covering and coloring polygon-circle graphs.
6 pages |
| (95-280) |
J. Kratochvil, A. Sebo :
Coloring precolored perfect graphs.
7 pages |
| (95-281) |
J. Kratochvil, P. D. Manuel, M. Miller :
Generalized domination in chordal graphs.
9 pages Published in Nordic J. Comput. 2 (1995), 41-50. |
| (95-282) |
B. Banaschewski, A. Pultr :
On the completion of nearness frames: Solving some open problems.
12 pages |
| (95-283) |
B. Banaschewski, A. Pultr :
Pointfree metrization theorems.
10 pages |
| (95-284) |
T. Kaiser :
Transversals of $d$-intervals.
11 pages To appear in Discr. Comput. Geom. |
| (95-285) |
P. Hlineny :
Contact graphs of curves.
42 pages To appear in J. Comb. Theory B (part) and Discrete Appl. Math. (part). |
| (95-286) |
J. Nesetril, X. Zhu :
Path homomorphisms.
22 pages To appear in Proc. Cambridge Math. Soc. |
| (95-287) |
A. Pultr, J. Sichler :
Endomorphisms of complete Heyting algebras.
12 pages To appear in Semigroup Forum. |
| (95-288) |
M. Klazar :
Twelve countings with rooted plane trees.
15 pages To appear in Europ. J. Combin. |
| (95-289) |
J. Matousek :
Kombinatoricka a vypocetni geometrie.
49 pages |
| (95-290) |
Problems presented at (Midsummer) Prague Combinatorial Workshop.
27 pages |
| (95-291) |
J. Nesetril, A. Raspaud, E. Sopena :
Colorings and girth of oriented planar graphs.
14 pages To appear in Discr. Math. |
| (95-292) |
J. Matousek, P. Plechac :
On functional separately convex hulls.
32 pages |
| (95-293) |
G. Kalai, J. Matousek :
Guarding galleries where every point sees a large area.
15 pages |
| (95-294) |
J. Nesetril, J. Vaananen :
Combinatorics and quantifiers.
14 pages |
| (95-295) |
R. L. Graham, J. Nesetril :
Ramsey theory in the work of Paul Erdos.
18 pages To appear in Mathematics of Paul Erdos, Springer, 1996. |
| (95-296) |
J. Nesetril :
Ramsey theory.
73 pages Published in Handbook of Combinatorics (R.L. Graham, M. Grotschel, L. Lovasz eds.), 1995. |
| (95-297) |
M. Loebl :
On bases of circuit lattices.
16 pages |
| (95-298) |
W. Hochstattler, J. Nesetril :
Linear programming duality and morphisms.
16 pages To appear in J. Algebraic Combinatorics. |
| (95-299) |
J. Matousek, J. Nesetril :
Kapitoly z diskretni matematiky.
218 pages |
| (95-300) |
M. Klazar :
Combinatorial aspects of Davenport-Schinzel sequences.
16 pages To appear in Discrete Math. |
| (95-301) |
J. Matousek :
On embedding expanders into $\ell_p$-spaces.
9 pages |
| (95-302) |
P. Valtr :
Lines, line-point incidences and crossing families in dense sets.
25 pages To appear in Combinatorica. |
| (95-303) |
P. Valtr :
The probability that $n$ random points in a triangle are in convex position.
7 pages To appear in Combinatorica. |
| (95-304) |
P. Valtr :
Catalan numbers via random planar point sets.
3 pages |
| (95-305) |
P. Valtr :
Guarding galleries where no point sees a small area.
20 pages |
| (95-306) |
J. Matousek, P. Valtr :
The complexity of the lower envelope of segments with $h$ endpoints.
5 pages |
| (95-307) |
J. Kratochvil, A. Proskurowski, J. A. Telle :
Covering regular graphs.
12 pages |
| (95-308) |
M. M. France, J. Nesetril :
Fragments of a dialogue.
8 pages |
| (95-309) |
M. Klazar (ed.) :
1995 Prague Midsummer Combinatorial Workshop.
64 pages |
| |
| (96-310) |
J. Matousek :
Improved upper bounds for approximation by zonotopes.
21 pages |
| (96-311) |
J. Nesetril, P. Valtr :
A Ramsey property of order types.
25 pages |
| (96-312) |
P. Hlineny :
$K_{4,4}-e$ has no finite planar cover.
12 pages |
| (96-313) |
P. Erdos, J. Nesetril, V. Rodl :
A remark on Pisier type theorems.
7 pages |
| (96-314) |
J. Matousek, P. Valtr :
On visibility and covering by convex sets.
41 pages |
| (96-315) |
B. Korte, J. Nesetril :
Vojtech Jarnik's work in combinatorial optimization.
24 pages |
| (96-316) |
J. Nesetril, E. Sopena, L. Vignal :
$T$-preserving homomorphisms of oriented graphs.
13 pages |
| (96-317) |
I. Havel, J. Nesetril (eds.) :
Miroslav Fiedler -- 70 let.
38 pages |
| (96-318) |
T. Kaiser (ed.) :
10 years of KAM Series.
29 pages |
| (96-319) |
I. Barany, P. Valtr :
A positive fraction Erdos-Szekeres theorem.
8 pages |
| (96-320) |
P. Erdos, J. Nesetril, V. Rodl :
On colorings and independent sets (Pisier type theorems).
26 pages |
| (96-321) |
A. V. Kostochka, J. Nesetril :
Coloring relatives of intervals on the plane I: Chromatic number versus girth.
12 pages, PostScript |
| (96-322) |
J. Nesetril, X. Zhu :
On bounded treewidth duality of graphs.
16 pages, PostScript |
| (96-323) |
M. Loebl ed. :
Third annual DONET meeting.
27 pages, PostScript Source |
| (96-324) |
M. Klazar :
Counting bad bracketings.
15 pages, PostScript Source |
| (96-325) |
H. Herrlich, A. Pultr :
Nearness, subfinitness and sequential regularity.
18 pages, PostScript Source |
| (96-326) |
M. Klazar, V. Novak :
A set partition identity via trees.
10 pages, PostScript Source |
| (96-327) |
D. Zeps :
Graphs as rotations.
11 pages, PostScript Source |
| (96-328) |
J. Matousek :
On constants for cuttings in the plane.
28 pages |
| (96-329) |
J. Nesetril :
Moderni diskretni matematika (in czech).
9 pages |
| (96-330) |
J. Naceradsky, J. Nesetril :
About a picture on a poster.
8 pages |
| (96-331) |
M. Klazar :
Kombinatoricke pocitani (in czech).
63 pages, PostScript Source |
| (96-332) |
I. Fabrici, S. Jendrol :
Subgraphs with restricted degrees of their vertices in planar graphs.
7 pages |
| (96-333) |
M. Hornak, S. Jendrol :
On a conjecture by Plummer and Toft.
11 pages |
| (96-334) |
W. Hochstattler, J. Nesetril :
Linear programming duality and morphisms.
36 pages, PostScript |
| (96-335) |
M. Klazar :
On trees and noncrossing partitions.
12 pages, PostScript Source |
| (96-336) |
O.V. Borodin, A.V. Kostochka, J. Nesetril, A. Raspaud :
On the minimum average degree and the oriented chromatic number of graphs.
16 pages |
| (96-337) |
F. Mraz :
On infimum of optimal objective function values in interval linear programming.
16 pages, PostScript Source |
| |
| (97-338) |
J. Nesetril :
A few remarks on the history of MST-problem.
9 pages |
| (97-339) |
Martin Klazar ed. :
Fourth Prague combinatorial workshop.
56 pages, PostScript Source |
| (97-340) |
A. Tharwat, K. Zimmermann :
Some optimization problems on solubility sets of separable max-min equations and inequalities.
18 pages, PostScript Source |
| (97-341) |
J. Matousek :
An $L_p$ version of the Beck-Fiala conjecture.
12 pages, PostScript Source |
| (97-342) |
J. Kratochvil, P. Mihok, G. Semanisin :
Graphs maximal with respect to hom-properties.
15 pages, PostScript Source |
| (97-343) |
J. Kratochvil, J. Nesetril, M. Rosenfeld :
Graph designs, Hadamard matrices and geometric configurations.
25 pages, PostScript Source |
| (97-344) |
J. Kratochvil, P. Mihok :
Hom-properties are uniquely factorizable into irreducible factors.
11 pages, PostScript Source |
| (97-345) |
J. Kratochvil, Zs. Tuza, M. Voigt :
Brooks type theorems for choosability with separation.
9 pages, PostScript Source |
| (97-346) |
M. Klazar ed. :
Third annual DONET meeting.
76 pages, PostScript Source |
| (97-347) |
P. Hlineny, J. Kratochvil :
Computational complexity of the Krausz dimension of graphs.
17 pages, PostScript Source |
| (97-348) |
P. Valtr :
On geometric graphs with no $k$ pairwise parallel edges.
12 pages, PostScript Source |
| (97-349) |
P. Valtr :
On the density of subgraphs in a graph with bounded independence number.
14 pages, PostScript Source |
| (97-350) |
reserved
, |
| (97-351) |
DIMATIA-DIMACS conference:
The futre of discrete mathematics; Stirin, May 19-25, 1997.
36 pages, PostScript Source |
| (97-352) |
B. Gruber :
Classification of lattices.
40 pages |
| (97-353) |
A. Pultr, J. Sichler :
Finite commucative monoids of open maps.
16 pages, PostScript Source |
| (97-354) |
J. Kratochvil, J.A. Telle :
Complexity of colored graph covers II. When 2-SAT helps.
15 pages, PostScript Source |
| (97-355) |
G. Karolyi, J. Pach, G. Toth, P. Valtr :
Ramsey-type results for geometric graphs II.
17 pages, PostScript Source |
| (97-356) |
M. Klazar :
Note on the maximum size of a Sidon set.
5 pages, PostScript Source |
| (97-357) |
O.V. Borodin, A.V. Kostochka, J. Nesetril, A. Raspaud, E. Sopena :
On universal graphs for planar oriented graphs of a given girth.
15 pages, PostScript Source |
| (97-358) |
H. de Fraysseix, P. Ossona de Mendez :
A short proof of a Gauss problem.
9 pages, PostScript Source |
| (97-359) |
T. Plewe, A. Pultr, A. Tozzi :
Regular monomorphisms of Hausdorff frames.
25 pages, PostScript Source |
| (97-360) |
A. Gallucio, M. Loebl :
A Theory Of Pfaffian Orientations I: Perfect matchings and permanents.
20 pages, PostScript Source |
| (97-361) |
A Theory Of Pfaffian Orientations II: $T$-joins, Edge-Cuts, And A Duality of Enumeration.
20 pages, PostScript Source |
| (97-362) |
J. Fiala, ed. :
Spring School in Combinatorics (Borova Lada, April 1997).
43 pages, PostScript Source |
| (97-363) |
P. Pancoska, V. Janota, J. Nesetril, T.A. Keiderling :
Novel Matrix Descriptor for Spectroscopic Determination of the Connectivity of Secondary Structure Segments in Proteins. Analysis of General Properties Using Graph Theory.
58 pages |
| (97-364) |
D. Zeps :
The use of combinatorial maps in graph-topological computations
8 pages |
| (97-365) |
D. Zeps :
Graphs with rotations: Partial maps
12 pages |
| (97-366) | J. Nesetril:
Moderni dskretni matematika II. ( in czech )
18 pages |
| (97-367) | J. Nesetril :
Structure of graph homomorphisms I.
11 pages, PostScript |
| (97-368) | J. Nesetril, D. Turzik :
Solving and approximating combinatorial optimization problems ( toward MAX CUT and TSP )
16 pages, PostScript |
| (97-369) | J. Otta :
The Dimension of Unicyclic Posets
18 pages, PostScript |
| (97-370) | J. Otta
: The Amalgamation of Diagrams and the Dimension
25 pages, PostScript |
| (97-371) | P. Pancoska, V. Janota, J. Nesetril :
Spectra, graphs and proteins. Towards understanding of protein folding
22 pages |
| (97-372) | R. Babilon ed. :
Graphs'97, Problems
24 pages |
| |
| (98-373) | J. Kratochvil, Zs. Tuza
: Rankings of directed graphs
13 pages, PostScript |
| (98-374) | J. Kratochvil, P. Manuel, M. Miller, A. Proskurowski
: Disjoint and fold domination in graphs
18 pages, PostScript |
| (98-375) | J. Kratochvil, I. Schiermeyer
: On the Computational Complexity of (O,P)-partiton problems
7 pages, PostScript |
| (98-376) | J. Nesetril, A. Raspaud
: Colored Homomorphisms of Colored Mixed Graphs
7 pages, PostScript |
| (98-377) | M. M. Haldorsson, J. Kratochvil, J.A. Telle
: Independent sets with domination constraints
12 pages, PostScript |
| (98-378) | J. Matousek
: On the discrepancy for boxes and polytopes
12 pages, PostScript |
| (98-379) | J. Matousek
: The exponent of discrepancy is at least 1.0669
5 pages, PostScript |
| (98-380) | A. V. Kostochka, J. Nesetril
: Properties of the Descartes' construction of triangle free graphs with high chromatic number
7 pages, PostScript |
| (98-381) | J. Nesetril
: Structure of the graph homomorphisms II.
16 pages, PostScript |
| (98-382) | P. Fischer, J. Matousek
: A lower bound for families of Natarjan dimension d
10 pages, PostScript |
| (98-383) | P. E. Haxell, M. Loebl
: On defect sets in bipartite graphs
16 pages, PostScript |
| (98-384) | K. Kuperberg, W. Kuperberg, J. Matousek, P. Valtr
: Almost-tiling the plane by ellipses
11 pages, 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
19 pages, PostScript |
| (98-386) | J. Fiala ed.
: Fifth Prague Combinatorial Workshop
55 pages, PostScript |
| (98-387) | H. de Fraysseix, P. Ossona de Mendez
: Stretchability of Jordan Arc Contact Systems
8 pages, PostScript |
| (98-388) | J. Jezek, P. Markovic, M. Maroti, Z McKenzie
: Equations of tournaments are not finitely based
8 pages, PostScript |
| (98-389) | P. Spickova
: Homomorphism duality for rooted oriented graphs
15 pages, PostScript |
| (98-390) | T. Kloks, D. Kratsch, H. Muller
: Bandwidth of chain graphs
6 pages, PostScript |
| (98-391) | T. Kloks, D. Kratsch, H. Muller
: Finding and counting small graphs efficiently
14 pages, PostScript |
| (98-392) | R. Niedermeier, J. Alber
: On Multi-dimensional Hilbert indexings
18 pages, PostScript |
| (98-393) | R. Niedermeier, K. Lange
: Data Independence of Read, Write and Control Structures in Pram Computing
36 pages, PostScript |
| (98-394) | T. Kloks, J, Kratochvil, D. Kratsch, H. Muller
: On vertex ranking, pathwidth and path cover number of (q,q-4)-graphs
12 pages, PostScript |
| (98-395) | B. Banaschiewski, A. Pultr
: Adjointness Aspects of the Down-Set Functor
18 pages, PostScript |
| (98-396) | J. Matousek
: On the signed domination in graphs
6 pages, PostScript |
| (98-397) | A. Galluccio, P. Hell, J. Nesetril
: The complexity of H-colouring of bounded degree graphs
9 pages, PostScript |
| (98-398) |
A. Pultr, J. Sichler :
A Priestley view on spatialization of frames
10 pages |
| (98-399) | H. Broersma, T. Kloks, D, Kratsch, H. Muller
: A generalization of AT-free graphs and a generic algorithm for solving triangulation problems
21 pages, PostScript |
| (98-400) |
Fifth Czech-Slovak Intrenational Symposium on Combinatorics, Graph Theory, Algorithms and Applications ( Abstracts )
111 pages |
| (98-400a) |
Fifth Czech-Slovak Intrenational Symposium on Combinatorics, Graph Theory, Algorithms and Applications ( Program )
76 pages |
| (98-401) | R. Niedermeier, P. Rossmanith
: New Upper Bounds for MaxSat
23 pages, PostScript |
| (98-402) | H. Broersma, A. Huck, T. Kloks, O. Koppius, D, Kratsch, H. Muller, H. Tuinstra
: Degree-preserving forests
25 pages, PostScript |
| (98-403) | R. Niedermeier:
Some Prospects for Efficient Fixed Parameter Algorithm
29 pages, PostScript |
| (98-404) | T. Kloks, R. Tan:
Bandwidth of graphs with few P4s
8 pages, PostScript |
| (98-405) | J. Nesetril, A. Raspaud:
Antiszmmetric Flows and Strong Colourings of Oriented Graphs
20 pages, PostScript |
| (98-406) | A. Kostochka, J. Nesetril, P. Smolikova:
Coloring and homomorphisms of degenerate and bounded degree graphs
19 pages, PostScript |
| (98-407) | J. Nesetril, C. Tardif:
Duality theorems for Finite Structures (characterising gaps and good characterisations)
22 pages, PostScript |
| (98-408) | P. Hlineny:
A Note on Possible extensions of Negami's Conjecture
9 pages, PostScript |
| (98-409) | D. Zeps:
Free Minor Closed Classes and the Kuratowski theorem
10 pages, PostScript |
| (98-410) | S. Seiden, J. Sgall, G. Woeginger:
Semi-online scheduling with decreasing job sizes
15 pages, PostScript |
| (98-410) | S. Seiden, J. Sgall, G. Woeginger:
Semi-online scheduling with decreasing job sizes
15 pages, PostScript |
| (98-411) | R. Niedermeier, P. Rossmanith:
Upper bounds for vertex cover further improved
38 pages, PostScript |
| (98-412) | A. Pultr, A. Tozzi:
A note on reconstruction of a space from the open set lattice
8 pages, PostScript |
| (98-413) | P. Hlineny ed.:
From Erdos to algorithm, Applications of the "Probabilistic method"
38 pages |
| |
| (99-414) | L. Epstein, J. Sgall:
Approximation schemes for scheduling on uniformly related and identical parallel machines
19 pages, PostScript |
| (99-415) | J. Nesetril, C Tardif:
Density
12 pages, PostScript |
| (99-416) | A. Galluccio, P. Hell, J. Nesetril:
The complexity of H-coloring of bounded degree graphs
10 pages, PostScript |
| (99-417) | W. Hochstattler, J. Nesetril:
A note on maxflow-mincut and homomorphic equivalence in matroids
5 pages, PostScript |
| (99-418) | J. Nesetril, E. Sopena:
On four coloring problems
48 pages, PostScript |
| (99-419) | J. Fiala, T. Kloks, J. Kratochvil:
Fixed-parameter complexity of $\lambda$-labelings
16 pages, PostScript |
| (99-420) | M. Klazar :
Barany and Larman's Combinatorial approach to the Circle Problem.
12 pages, PostScript |
| (99-421) |
J. Matousek :
Piercing and Selection Theorems in Convexity.
30 pages, PostScript |
| (99-422) |
J. Nesetril, A. Raspaud :
Duality, Nowhere-Zero Flows, Colorings and Cycle Covers.
49 pages, PostScript |
| (99-423) |
J. Kratochvil :
Choosability and List Colorings.
20 pages, PostScript |
| (99-424) | R. Niedermeier, H. Fernau :
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover.
46 pages, PostScript |
| (99-425) |
J. Matousek :
On the Linear and Hereditary Discrepacies.
5 pages, PostScript |
| (99-426) |
H. J. Promel :
The Innaproximability of the MaxClique and the SetCover Problem.
2 pages, PostScript |
| (99-427) |
J.Fiala (ed.) :
ESA 99.
? pages |
| (99-428) |
P. A. Dreyer, C. Malon, J.Nesetril :
Universal H-colorabla graphs without a given configuration.
10 pages, PostScript |
| (99-429) |
J. Nesetril, C. Tardif :
Density via Duality.
8 pages, PostScript |
| (99-430) |
J. Fiala (ed.):
Graph Drawing 99.
? pages |
| (99-431) |
J. Vondrak (ed.) :
Sixth Prague midsummer combinatorial workshop.
20 pages, PostScript |
| (99-432) |
J. Maxova, J. Nesetril :
On oriented path double covers.
11 pages, PostScript |
| (99-433) |
J. Nesetril, A. Pultr :
A note on homomorphism independent families.
8 pages, PostScript |
| (99-434) |
A. Pultr :
Fuzzy frames.
33 pages, PostScript |
| (99-435) |
J. Nesetril :
Aspects of structural combinatorics.
47 pages, PostScript |
| (99-436) |
D. Fon-Der-Flaass, A. Kostochka, J. Nesetril, A. Raspaud, E. Sopena :
Nilpotent families of endomorphisms and nice graphs.
7 pages, PostScript |
| (99-437) |
/J. Nesetril :
/ Art of drawing.
/ 12 pages, /PostScript / |
| (99-438) |
/D. Zeps :
/ Using combinatorial maps in graph-topological computations.
/ 11 pages, /PostScript / |
| (99-439) |
/J. Nesetril, M. Rosenfeld :
/ Embedding graphs in Euclidean spaces, an exploration guided by Paul Erdos.
/ 11 pages, /PostScript / |
| (99-440) |
/M. Loebl, M. Matamala :
/ Some remarks on cycles in graphs and digraphs.
/ 8 pages, /PostScript / |
| (99-441) |
/M. Loebl:
/ On the dimer problem in 3-dimensional lattices.
/ 17 pages, /PostScript / |
| (99-442) |
A. Galluccio, M. Loebl, J. Vondrak:
A new algorithm for the Ising problem.
4 pages, PostScript |
| (99-443) |
A. Galluccio, M. Loebl, J. Vondrak:
A new algorithm for the MAX-CUT problem.
20 pages, PostScript |
| (99-444) |
J. Nesetril, J. Kratochvil, V. Janota :
DIMATIA 1997-1999.
23 pages, PostScript |
| (99-445) |
I. Barany, J. Matousek :
Simultaneous partitions of measures by k-fans.
20 pages, PostScript |
| (99-446) |
J. Matousek :
On approximate geometric k-clustering.
27 pages, PostScript |
| (99-447) |
O. Pangrac :
Genus of 2-isomorphic graphs.
23 pages, PostScript |
| (99-448) |
M. Klazar :
Furedi-Hajnal conjecture implies Stanley-Wilf conjecture.
6 pages, PostScript |
| (99-449) |
J. Nesetril, M. Rosenfeld :
I. Schur, C.E. Shannon an Ramsey Numbers, a short story
10 pages, PostScript |
| (99-450) |
P. Dell Ohno, M. Caramia :
A Lower Bound on the Chromatic Number of Mycielski Graphs
11 pages, PostScript |
| (99-451) |
M. Klazar :
Kombinatoricke pocitani
59 pages, PostScript |
| (99-452) |
R. Cada, J. Maxova, ed. :
Graph Theory Day 2
15 pages, PostScript |
| |
| (2000-454) |
M. Klazar :
Kaleidoskop teorie cisel (1.kapitola)
24 pages, PostScript |
| (2000-455) |
J. Nesetril :
A rigid graph for every set
3 pages, PostScript |
| (2000-456) |
J. Nesetril, X. Zhu :
On sparse graphs with given colorings and homomorphisms
13 pages, PostScript |
| (2000-457) |
J. Nesetril, X. Zhu :
Construction of sparse graphs with prescribed circular colorings
18 pages, PostScript |
| (2000-458) |
J. Nesetril :
The coloring poset and its on-line universality
16 pages, PostScript |
| (2000-459) |
J. Matousek :
Lower bound on the minus-domination number
9 pages, PostScript |
| (2000-460) |
J. Matousek :
On the chromatic number of Kneser hypergraphs
6 pages, PostScript |
| (2000-461) |
J. Matousek :
On directional convexity
18 pages, PostScript |
| (2000-462) |
J. Nesetril, A. V. Kostochka :
Colouring relatives of intervals on the plane, II: intervals and rays in two directions
6 pages, PostScript |
| (2000-463) |
J. Nesetril, E. Sopena :
On the oriented game chromatic number
12 pages, PostScript |
| (2000-464) |
J. Nesetril :
Art of proving and conjecturing
9 pages, PostScript |
| (2000-465) |
J. Diaz, J. Nesetril, M. Serna :
H-colorings of large degree graphs
8 pages, PostScript |
| (2000-466) |
J. Nesetril, E. Milkova, H. Nesetrilova :
Otakar Boruvka on minimum spanning tree problem
46 pages, PostScript |
| (2000-467) |
P. Hlineny :
An addition to art galleries with interior walls
6 pages, PostScript |
| (2000-468) |
M. Klazar :
Kaleidoskop teorie cisel (2.kapitola)
50 pages, PostScript |
| (2000-469) |
M. Klazar :
Kaleidoskop teorie cisel (3.kapitola)
55 pages, PostScript |
| (2000-470) |
J. Gimbel, J. Nesetril :
Partitions of graphs into cographs
pages |
| (2000-471) |
J. Matousek :
Incidence problems (Lecture text for Spring School on Combinatorics 2000)
17 pages, PostScript |
| (2000-472) |
J. Nesetril :
Combinatorics of mappings (Lecture text for Spring School on Combinatorics 2000)
72 pages, scanned PDF |
| (2000-473) |
B. Codenotti :
Intersection between linear algebra and combinatorics (Lecture text for Spring School on Combinatorics 2000)
9 pages, PostScript |
| (2000-474) |
C. Groepl :
Approximation algorithms, the primal dual method, and randomized rounding (Lecture text for Spring School on Combinatorics 2000)
5 pages, PostScript |
| (2000-475) |
P. Hlineny :
Discharging technique in practice (Lecture text for Spring School on Combinatorics 2000)
7 pages, PostScript |
| (2000-476) |
M. Loebl :
Cycles in graphs and digraphs (Lecture text for Spring School on Combinatorics 2000)
7 pages, PostScript |
| (2000-477) |
M. Loebl :
On the inclusion-exclusion principle (Lecture text for Spring School on Combinatorics 2000)
46 pages, PostScript |
| (2000-478) |
J. Matousek, J. Vondrak :
Probabilistic method (Lecture text for Spring School on Combinatorics 2000)
34 pages, scanned PDF |
| (2000-479) |
J. Fiala, J. Kratochvil :
Partial covers of graphs
17 pages, PostScript |
| (2000-480) |
J. Fiala :
The NP-completeness of the edge precoloring extension problem on bipartitePartial graphs
5 pages, PostScript |
| (2000-481) |
P. Kolman :
Short disjoint paths on hypercubic graphs
22 pages, PostScript |
| (2000-482) |
M. Loebl, M. Kiwi :
Largest planar matching in random bipartite graphs
21 pages, PostScript |
| (2000-483) |
M. Klazar :
Kaleidoskop teorie cisel (4.kapitola)
62 pages, PostScript |
| (2000-484) |
D. Kral, J. Kratochvil, A. Proskurowski, H.-J. Voss :
Coloring mixed hypertrees
62 pages, PostScript |
| (2000-485) |
M. DeVos, J. Nesetril, A. Raspaud :
Antisymmetric Flows and Edge-connectivity
8 pages, PostScript |
| (2000-486) |
I. Barany, J. Matousek :
Integer Points in Rotating Convex Bodies
34 pages, PostScript |
| (2000-487) |
M. Klazar :
Kaleidoskop teorie cisel (5. kapitola)
8 pages, 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
8 pages, |
| (2000-489) |
D. Zeps :
Kuratowski Theorem from below
7 pages, PostScript |
| (2000-490) |
J. Nesetril, S. Shelah :
On the Order of Countable Graphs
23 pages, PostScript |
| (2000-491) |
J. Nesetril :
On Universality of Set Systems
22 pages, PostScript |
| (2000-492) |
J. Maxova, J. Nesetril :
On Covers of Graphs
10 pages, PostScript |
| (2000-493) | J. Gimbel : Various Remarks on the Subchromatic Number of a Graph , |
| (2000-494) | M. Molloy, B. Reed : Colouring Graphs when the Number of Colours is Nearly the Maximum Degree 22 pages, PostScript |
| (2000-495) |
H. Nyklova, ed. :
Midsummer Combinatorial Workshop VII
37 pages, PostScript |
| (2000-496) |
J. Sawada :
Generating Bracelets in Constant Amortized Time
15 pages, PostScript |
| (2000-497) |
J. Sawada :
A Fast Algorithm for Generating Non-Isomorphic Chord Diagrams
23 pages, PostScript |
| (2000-498) |
H. Nyklova :
Almost Empty Polygons
16 pages, PostScript |
| (2000-499) |
R. L. Graham, J. Nesetril :
Ramsey Theory and Paul Erdos (recent results from a historical perspective)
8 pages, PostScript |
| (2000-500) | reserved |
| (2000-501) |
M. Erne, A. Pultr, M. Sichler :
Closure Frames and Web Spaces
21 pages, PostScript |
| (2000-502) |
J. Ellis, F. Ruskey, J. Sawada, J. Simpson :
Euclidean Strings
19 pages, PostScript |
| (2000-503) |
P. Kolman, C. Scheideler :
Simple On-line Algorithms for the Maximum Disjoint Paths Problem
36 pages, PostScript |
| (2000-504) |
G. Karolyi, P. Valtr :
Point Configurations in d-space without Large Subsets in Convex Position
8 pages, PostScript |
| (2000-505) |
P. Valtr :
Davenport-Schinzel Trees
37 pages, PostScript |
| (2000-506) |
M. Loebl :
On the Dimer Problem and Ising Problem in Finite 3-dimensional Lattices
23 pages, PostScript |
| (2000-507) |
M. Loebl :
On the Dimer Problem and Ising Problem in Finite 3-dimensional Lattices
8 pages, PostScript |
| (2000-508) |
J. Fiala, J. Kratochvil, A. Proskurowski:
Distance Constrained Labeling of Precolored Trees
8 pages, PostScript |
| |
| (2001-509) |
M. Caramia, J. Fiala :
New Lower Bound on the Weighted Chromatic Number of a Graph
pages, PostScript |
| (2001-510) |
T. H. Marshall :
On P-universal Graphs
38 pages, PostScript |
| (2001-511) |
D. Kral, J. Maxova, P. Podbrdsky, R. Samal :
On Bermond, Germa and Heydemann's Conjecture
23 pages, PostScript |
| (2001-512) |
D. Kral, J. Maxova, P. Podbrdsky, R. Samal :
On Hamiltonian Cycles in Strong Products of Graphs
15 pages, PostScript |
| (2001-513) |
B. Codenotti :
Graph Theory, Small Worlds, and the WEB (Lecture text for Spring
School on Combinatorics 2001)
13 pages, PostScript |
| (2001-514) |
J. Alber, R. Niedermeier :
Improved Tree Decomposition Based Algorithms for Parametrized Planar Dominating Set (Lecture text for Spring School on Combinatorics 2001)
7 pages, PostScript |
| (2001-515) |
J. Matousek :
Combinatorial Excursions to High-Dimensional Convex Geometry (Lecture text for Spring School on Combinatorics 2001)
65 pages, PostScript |
| (2001-516) |
L. Kucera :
Probability and Computation (Lecture text for Spring School on Combinatorics 2001)
38 pages, PostScript |
| (2001-517) |
J. Jirasek :
Arc Reversal in Nonhamiltonian Circulant Oriented Graphs
9 pages, PostScript |
| (2001-518) |
M. Loebl, J. Vondrak :
A Theory of Frustrated Degeneracy
21 pages, PostScript |
| (2001-519) |
J. Sawada, C.R. Miers, F. Ruskey :
Generating Lyndon Brackets: a Basis for the n-th Homogenous Component of the Free Lie Algebra
8 pages, PostScript |
| (2001-520) |
T. H. Marshall :
Relation categories and graph homomorphisms
19 pages, PostScript |
| (2001-521) |
P. Hell, J. Nesetril :
Counting List Homomorphisms and Graphs with Bounded Degree
11 pages, PostScript |
| (2001-522) |
J. Kara, D. Kral, ed. :
Graph Theory Day IV
31 pages, PostScript |
| (2001-523) |
J. Nesetril, P. Ossona de Mendez :
Colorings and Homomorphisms of Minor Closed Graphs
17 pages, PostScript |
| (2001-524) |
M. Popule :
A Note on Gauss Codes
17 pages, PostScript |
| (2001-525) |
J. Matousek, J. Vondrak :
The Probabilistic Method (Lecture Notes)
63 pages, PostScript |
| (2001-526) |
R.N. Ball, A. Pultr :
Forbidden Forests in Priestley Spaces
16 pages, PostScript |
| (2001-527) |
P. Kolman, C. Scheideler :
Improved Bounds for the Unsplittable Flow Problem
41 pages, PostScript |
| (2001-528) |
J. Nesetril, N.C. Wormald :
The acyclic edge chromatic number of a random d-regular graph is d+1
7 pages, PostScript |
| (2001-529) |
T.H. Marshall, R. Nasraser, and J. Nesetril:
Homomorphism Bounded Classes of Graphs.
12 pages, PostScript |
| (2001-530) |
J. Fiala, and R. Skrekovski:
List Distance Labelings of Graphs.
16 pages, PostScript |
| (2001-531) |
A. Tyszka:
A Stronger Form of the Theorem Constructing a Rigid Binary Relation on Any Set.
7 pages, PostScript |
| (2001-532) |
T. Madaras, and R. Skrekovski:
Heavy Paths, Light Stars, and Big Melons.
29 pages, PostScript |
| (2001-533) |
C. Benzaken, S. Gravier, and R. Skrekovski:
Hajos' Theorem for List Colorings of Hypergraphs.
7 pages, PostScript |
| (2001-534) |
T. Erlebach, and J. Fiala:
Independence and Coloring Problems on Intersection Graphs of Disks.
28 pages, PostScript |
| (2001-535) |
D. Kral', J. Kratochvil, and H.-J. Voss:
Mixed Hypercacti.
32 pages, PostScript |
| (2001-536) |
J. Nesetril, and C. Tardif:
On Maximal Finite Antichains in the Homomorphism Order of Directed Graphs.
8 pages, PostScript |
| (2001-537) |
J. Nesetril:
Art of Graph Drawing and Art.
22 pages, PostScript |
| (2001-538) |
J. Nesetril, and C. Tardif:
A Dualistic Approach to Bounding the Chromatic Number of a Graph.
9 pages, PostScript |
| (2001-539) |
O. Pangrac, ed.:
Graph Theory Day V.
pages, PostScript |
| (2001-540) |
D. Kral':
On Feasible Sets of Mixed Hypergraphs.
pages, PostScript |
| (2001-541) |
J. Nemecek, and M. Klazar:
A Bijection Between Nonnegative Words and Sparse $abba$-free Partitions.
6 pages, PostScript |
| (2001-542) |
A. Pultr, and A. Tozzi:
Local Directedness and Some Categories of Domains.
12 pages, PostScript |
| (2001-543) |
D. Zeps:
On Free Minor Closed Classes of Graphs Outside Planarity.
11 pages, PostScript |
| (2001-544) |
D. Kral', and R. Skrekovski:
A Theorem about the Channel Assignment Problem.
17 pages, PostScript |
| |
| (2002-545) |
D. Kral':
On Maximum Face--Constrained Coloring of Plane Graphs of Girth at least 5.
9 pages, PostScript |
| (2002-546) |
M. Loebl, J. Nesetril, and B. Reed:
A Note on Random Homomorphism from Arbitrary Graphs to $Z$.
11 pages, PostScript |
| (2002-547) |
D. Kral' :
A Counter--Example to Voloshin's Hypergraph Co--perfectness Conjecture.
13 pages, PostScript |
| (2002-548) |
Z. Dvorak, J. Kara, D. Kral', and O. Pangrac:
On Pattern Coloring of Cycle Systems.
24 pages, PostScript |
| (2002-549) |
D. Kral', J. Kratochvil, A. Proskurowski, and H.-J. Voss:
Mixed Hypertrees.
25 pages, PostScript |
| (2002-550) |
M. Mares:
Two Linear Time Algorithms for MST on Minor Closed Graph Classes.
7 pages, PostScript |
| (2002-551) |
R. Samal:
Antisymmetric Flows and Strong Oriented Coloring of Planar Graphs.
8 pages, PostScript |
| (2002-552) |
T. Erlebach, and J. Fiala:
On-line Coloring of Geometric Intersection Graphs.
19 pages, PostScript |
| (2002-553) |
E. Specker:
Postmoderni matematika: Rozlouceni s rajem? Logika aneb umeni programovani.
33 pages, PostScript |
| (2002-554) |
S. Garoufalidis, and M. Loebl:
Random Walks and the Colored Jones Function.
21 pages, PostScript |
| (2002-555) |
B. Eckmann:
Vzpominky na Heinze Hopfa (Proslov predneseny 4.12.2001 u prilezitosti Hopfovy prednasky).
19 pages, PostScript |
| (2002-556) |
J. Fiala, K. Jansen, V.B. Le, and E. Seidel:
Graph Subcolorings: Complexity and Algorithms.
25 pages, PostScript |
| (2002-557) |
J. Fiala, P. Heggernes, P. Kristiansen, and J.A. Telle:
Generalized H-coloring and H-covering of Trees.
21 pages, PostScript |
| (2002-558) |
P. Potocnik and R. Skrekovski:
Nowhere-zero 3-flows in Cayley graphs of Abelian groups.
11 pages, PostScript |
| (2002-559) |
D. Kral' and H.-J. Voss:
Edge--Disjoint Odd Cycles in Planar Graphs.
17 pages, PostScript |
| (2002-560) |
J. Diaz, J. Nesetril, M. Serna, D. M. Thilikos:
H-colorings of Large Degree Graphs.
10 pages, PostScript |
| (2002-561) |
P. Smolikova, ed.:
Eight Midsummer Combinatorial Workshop.
43 pages, PostScript |
| (2002-562) |
J. Kara and D. Kral':
Optimal Free Binary Decision Diagrams for Computation of $EAR_n$.
16 pages, PostScript |
| (2002-563) |
D. Kral', V. Majerech, J. Sgall, T. Tichy, and G. Woeginger:
It is tough to be a plumber.
18 pages, PostScript |
| (2002-564) |
J. Matousek, ed.:
Workshop on Discrete Metric Spaces and their Algorithmic Applications.
22 pages, PostScript |
| (2002-565) |
J. J. Montellano-Ballesteros, R. Strausz:
A characterization of cocircuit graphs of uniform oriented matroids.
23 pages, PostScript |
| (2002-566) |
J. Bracho, R. Strausz:
Separoids and characterization of linear uniform oriented matroids.
17 pages, PostScript |
| (2002-567) |
M. DeVos, J. Nesetril, and A. Raspaud:
On flow and tension-continuous maps.
48 pages, PostScript |
| (2002-568) |
H. Broersma, F.V. Fomin, J. Nesetril, and G.J. Woeginger:
More about subcolorings.
22 pages, PostScript |
| (2002-569) |
D. Kral':
An Exact Algorithm for the Channel Assignment Problem.
16 pages, PostScript |
| (2002-570) |
A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman:
Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.
26 pages, PostScript |
| (2002-571) |
B. Banaschewski, A. Pultr:
A constructive view of complete regularity.
7 pages, PostScript |
| (2002-572) |
D. Kral', T. Madaras, and R. Skrekovski:
Cyclic, Diagonal and Facial Colorings.
24 pages, PostScript |
| (2002-573) |
J. Fiala, J. Kratochvil, and A. Proskurowski:
Systems of sets and their representatives.
23 pages, PostScript |
| (2002-574) |
E. Bampis, M. Caramia, J. Fiala, A.V. Fishkin, and A. Iovanella:
Scheduling of independent dedicated multiprocessor tasks.
15 pages, PostScript |
| (2002-575) |
A. Pultr and W. Tholen:
Free Quillen Factorization Systems.
19 pages, PostScript |
| (2002-576) |
M. Klazar:
Extremal problems for ordered (hyper)graphs: applications of Davenport--Schinzel sequences.
22 pages, PostScript |
| (2002-577) |
V. Franek:
Low-discrepancy Lattice Sets and QMC Integration.
31 pages, PostScript |
| (2002-578) |
J. Fiala, A.V. Fishkin, F.V. Fomin:
On-line and off-line distance constrained labeling of disk graphs.
25 pages, PostScript |
| (2002-579) |
D. Kral', R. Skrekovski:
Borodin's Conjecture on Diagonal Coloring is False.
4 pages, |
| (2002-580) |
A. Pultr, A. Tozzi:
A monad for domains and other categories.
14 pages, PostScript |
| (2002-581) |
A. Pultr, A. Tozzi:
Continuous DCPOs as complete information systems.
11 pages, PostScript |
| (2002-582) |
M. Nehez:
The Compactness Lower Bound of Shortest-path Interval Routing on $n .n$ Tori with Random Faulty Links.
19 pages, PostScript |
| (2002-583) |
J. Alber, J. Fiala:
Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs.
22 pages, PostScript |
| (2002-584) |
R. Samal:
Flows and Colorings of Graphs.
11 pages, PostScript |
| (2002-585) |
J. Nesetril, P. Ossona de Mendez:
Folding.
14 pages, PostScript |
| (2002-586) |
Z. Dvorak, D. Kral', and R. Skrekovski:
Coloring Face Hypergraphs on Surfaces.
22 pages, PostScript |
| (2002-587) |
Z. Dvorak, J. Kara, D, Kral', and O. Pangrac:
Feasible Sets of Pattern Hypergraphs.
25 pages, PostScript |
| (2002-588) |
M. Klazar:
Kaleidoskop teorie cisel (7. kapitola).
72 pages, PostScript |
| (2002-589) |
T. Madaras, R. Skrekovski, and H.-J. Voss:
The 7-cycle $C_7$ is light in the family of planar graphs with minimum degree 5.
11 pages, PostScript |
| (2002-590) |
V. Jungic, J. Licht, M. Mahdian, J. Nesetril, and R. Radoicic:
Rainbow Arithmetic Progressions and Anti-Ramsey Results.
29 pages, PostScript |
| (2002-591) |
B. Banaschewski and A. Pultr:
A General View of Approximation.
32 pages, PostScript |
| (2002-592) |
J. Nesetril and P. Ossona de Mendez:
Cuts and Bounds.
18 pages, PostScript |
| (2002-593) |
T. Feder, P. Hell, S. Klein, and R. Motwani:
List Partitions.
44 pages, PostScript |
| (2002-594) |
P. Kolman:
A Note on the Greedy Algorithm for the Unsplittable Flow Problem.
8 pages, PostScript |
| (2002-595) |
J. Fiala and D. Paulusma:
The computational complexity of the role assignment problem.
19 pages, PostScript |
| (2002-596) |
M. Loebl:
On Ground State Incongruence in Spin Glasses.
9 pages, PostScript |
| (2002-597) |
D. Piguetova:
A canonical Ramsey-type theorem for finite subsets of {\bf N}.
13 pages, PostScript |
| (2002-598) |
A. Por and P. Valtr:
On the partitioned version of the Erdos--Szekeres theorem.
17 pages, PostScript |
| (2002-599) |
P. Valtr:
A sufficient condition for the existence of large empty convex polygons.
16 pages, PostScript |
| |
| (2003-600) |
P. Hell and J.J. Montellano:
Polychromatic Cliques.
6 pages, PostScript |
| (2003-601) |
Z. Furedi, A.V. Kostochka, M. Stiebitz, R. Skrekovski, and D. B. West:
Nordhaus--Gaddum-type theorems for decompositions into many parts.
22 pages, PostScript |
| (2003-602) |
V. Jungic, D. Kral', and R. Skrekovski:
Colorings of Plane Graphs with no Rainbow Faces.
17 pages, PostScript |
| (2003-603) |
Z. Dvorak, J. Kara, D. Kral', and O. Pangrac:
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs.
24 pages, PostScript |
| (2003-604) |
M. Loebl:
A Discrete Non-Pfaffian Approach to the Ising Problem.
15 pages, PostScript |
| (2003-605) |
B. Banaschewski and A. Pultr:
On weak lattice and frame homomorphisms.
17 pages, PostScript |
| (2003-606) |
J. Hubicka and J. Nesetril:
On Homogeneous Graphs and Posets.
19 pages, PostScript |
| (2003-607) |
J. Matousek:
Bounded VC-dimension implies a fractional Helly theorem.
6 pages, PostScript |
| (2003-608) |
J. Han Kim, J. Matousek, and V.H. Vu:
Discrepancy after adding a single set.
3 pages, PostScript |
| (2003-609) |
I. Barany and J. Matousek:
The randomized integer convex hull.
29 pages, PostScript |
| (2003-610) |
J. Matousek and M. Stojakovic:
On Restricted Min-Wise Independence of Permutations.
16 pages, PostScript |
| (2003-611) |
J. Matousek:
A lower bound on the size of Lipschitz subsets in dimension 3.
5 pages, PostScript |
| (2003-612) |
A. Holmsen and J. Matousek:
No Helly theorem for stabbing translates by lines in $R^3$.
8 pages, PostScript |
| (2003-613) |
J. Matousek:
The number of unique-sink orientations of the hypercube.
9 pages, PostScript |
| (2003-614) |
D. Kral':
Coloring Powers of Chordal Graphs.
15 pages, PostScript |
| (2003-615) |
P. Kolman and J. Matousek:
Crossing number, pair-crossing number, and expansion.
18 pages, PostScript |
| (2003-616) |
R.N. Ball, A. Pultr, and J. Sichler:
Priestley configurations and Heyting varieties.
19 pages, PostScript |
| (2003-617) |
J. Fiala (ed.):
Oficiál Kombinatorického semináre.
27 pages, PostScript |
| (2003-618) |
M. Loebl, J. Matousek, and O. Pangrac:
Triangles in random graphs.
5 pages, PostScript |
| (2003-619) |
T. Luczak, J. Nesetril:
On projective graphs.
6 pages, PostScript |
| (2003-620) |
J. Hubicka, J. Nesetril:
Universal Partial Order Represented by Means of Trees \\ and Other Simple Graphs.
19 pages, PostScript |
| (2003-621) |
J. Hubicka, J. Nesetril:
Finite Paths are Universal.
26 pages, PostScript |
| (2003-622) |
J. Fiala, J. Maxova:
Cantor-type theorem for locally constrained graph homomorphisms.
9 pages, PostScript |
| (2003-623) |
J. Cerny, Z. Dvorak, V. Jelinek, and P. Podbrdsky:
Generalization of the polygon-crossing problem.
15 pages, PostScript |
| (2003-624) |
M. Bodirsky and J. Nesetril:
Constraint Satisfaction with Countable Homogeneous Templates.
17 pages, PostScript |
| (2003-625) |
M. Balek and J. Nesetril:
Measuring of Aesthetic Invariant of Images.
11 pages, PostScript |
| (2003-626) |
D. Kral':
Locally satisfiable formulas.
25 pages, PostScript |
| (2003-627) |
J. Cerny, Z. Dvorak, V. Jelinek, J. Kara:
Noncrossing Hamiltonian Paths in Geometric Graphs.
17 pages, PostScript |
| (2003-628) |
B. Bresar, S. Klavzar, and R. Skrekovski:
On cube-free median graphs.
12 pages, PostScript |
| (2003-629) |
J. Kratochvil:
Complexity of hypergraph coloring and Seidel's switching.
15 pages, PostScript |
| (2003-630) |
H. Broersma, F. V. Fomin, J. Kratochvil, and G. J. Woeginger:
Planar graph coloring avoiding monochromatic subgraphs: trees and paths make things difficult.
28 pages, PostScript |
| (2003-631) |
S. Gravier and R. Skrekovski:
Coloring the clique hypergraph of graphs without forbidden structure.
17 pages, PostScript |
| (2003-632) |
V. Jungic and R. Radoicic:
Rainbow Arithmetic Progressions.
10 pages, PostScript |
| (2003-633) |
D. Kral' and L. Stacho:
Closure for the Property of Having a Hamiltonian Prism.
14 pages, PostScript |
| (2003-634) |
M. Stiebitz and R. Skrekovski :
A Map Colour Theorem for the Union of Graphs.
23 pages, PostScript |
| (2003-635) |
J. Matousek and P. Skovron :
Three views of LP-type optimization problems.
18 pages, PostScript |
| (2003-636) |
T. Kaiser and D. Kral' and R. Skrekovski :
A Revival of the Girth Conjecture.
17 pages, PostScript |
| (2003-637) |
D. Kral':
Extending partial 5-colorings and 6-colorings in planar graphs.
14 pages, PostScript |
| (2003-638) |
M. Janata:
Matroids Induced by Packing Subgraphs.
26 pages, PostScript |
| (2003-639) |
M. Janata:
About a new class of matroid-inducing packing families.
10 pages, PostScript |
| (2003-640) |
T. Luczak and J. Nesetril :
A probabilistic approach to the dychotomy problem.
11 pages, PostScript |
| (2003-641) |
D. Kral' and J. Sgall :
Coloring graphs from lists with bounded size of their union.
12 pages, PostScript |
| (2003-642) |
J. Nesetril and O. Serra:
The Erdos-Turan Property for a Class of Bases.
12 pages, PostScript |
| (2003-643) |
J. Nesetril:
Ramsey Classes and Homogeneous Structures.
24 pages, PostScript |
| (2003-644) |
W. Hochstaettler and J. Nesetril:
Antisymmetric Flows in Matroids.
11 pages, PostScript |
| (2003-645) |
D. Kral':
Mixed Hypergraphs and Other Coloring Problems.
29 pages, PostScript |
| (2003-646) |
T. Madaras and R. Skrekovski :
Lightness, heaviness and gravity.
20 pages, PostScript |
| (2003-647) |
J. Fiala, D. Kral' and R. Skrekovski :
A Brooks-type Theorem for the Generalized List $T$-Coloring.
31 pages, PostScript |
| (2003-648) |
D. Kral':
Group coloring is $\Pi_2^P$-complete.
25 pages, PostScript |
| (2003-649) |
J. Cerny :
Geometric graphs with no three disjoint edges.
25 pages, PostScript |
| (2003-650) |
R. N. Ball, A. Pultr and J. Sichler:
Configurations in Coproducts of~Priestley~Spaces.
11 pages, PostScript |
| (2003-651) |
J. Nesetril, A. Pultr and C. Tardif :
Gaps and dualities in Heyting categories.
14 pages, PostScript |
| (2003-652) |
T. H. Marshall:
Antisymmetric flows on planar graphs.
12 pages, PostScript |
| (2003-653) |
B. Gartner, F. Tschirschnitz, J. Solymosi, P. Valtr and E. Welzl :
One line and n points .
24 pages, PostScript |
| |
| (2004-654) |
D. Kral' and R. Skrekovski :
The Last Excluded Case of Dirac's Map-Color Theorem for Choosability.
45 pages, PostScript |
| (2004-655) |
J. Fiala and V. B. Le:
The Subchromatic Index of Graphs.
21 pages, PostScript |
| (2004-656) |
J. Nesetril and P. Ossona de Mendez:
Tree depth, subgraph coloring and homomorphism bounds.
22 pages, PostScript |
| (2004-657) |
M. Blaser, B. Manthey and J. Sgall :
An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality.
11 pages, PostScript |
| (2004-658) |
M. Chrobak, W. Jawor, J. Sgall and
T. Tichy
:
Improved Online Algorithms for
Buffer Management in QoS Switches.
29 pages, PostScript |
| (2004-659) |
M. Chrobak, W. Jawor, J. Sgall and T. Tichy :
Online Scheduling of Equal-Length Jobs:
Randomization and Restarts Help.
22 pages, PostScript |
| (2004-660) |
Z. Dvorak and V. Jelinek :
On the Complexity of the G-Reconstruction Problem.
17 pages, PostScript |
| (2004-661) |
Z. Dvorak, D. Kral' and O. Pangrac:
Locally consistent constraint satisfaction problems.
23 pages, PostScript |
| (2004-662) |
A. Bagchi, A. Chaudhary, P. Kolman and J. Sgall:
A Simple Combinatorial Proof of Duality of Multiroute Flows and Cuts.
9 pages, PostScript |
| (2004-663) |
Z. Dvorak :
Two-factors in Oriented Graphs with Forbidden Transitions.
14 pages, PostScript |
| (2004-664) |
V. Jungic, J. Nesetril and R. Radoicic :
Rainbow Ramsey Theory.
16 pages, PostScript |
| (2004-665) |
A. Bagchi, A. Chaudhary and P. Kolman :
Short Length Menger's Theorem and Reliable Optical Routing.
22 pages, PostScript |
| (2004-666) |
J. Nesetril and Y. Nigussie :
Minimal Universal and Dense Minor Closed Classes.
22 pages, PostScript |
| (2004-667) |
R. Naserasr and Y. Nigussie :
On the new reformulation of Hadwiger's conjecture.
9 pages, PostScript |
| (2004-668) |
B. Banaschewski, E. Giuli and A. Pultr:
Epimorphisms of Uniform Frames.
5 pages, PostScript |
| (2004-669) |
Z. Dvorak :
Eulerian tours in graphs with forbidden transitions and bounded degree.
12 pages, PostScript |
| (2004-670) |
G. Toth and P. Valtr:
The Erdos-Szekeres theorem: upper bounds and related results.
14 pages, PostScript |
| (2004-671) |
P. Valtr:
Open caps and cups in planar point sets .
15 pages, PostScript |
| (2004-672) |
J. Nesetril, J. Solymosi and P. Valtr:
A Ramsey property of planar graphs.
11 pages, PostScript |
| (2004-673) |
K. J. Swanepoel and Pavel Valtr:
The unit distance problem on spheres.
10 pages, PostScript |
| (2004-674) |
I. Barany and P. Valtr:
Planar point sets with a small number of empty convex polygons.
26 pages, PostScript |
| (2004-675) |
J. Hubicka and J. Nesetril :
Finite Presentation of Homogeneous Graphs, Posets and Ramsey Classes.
27 pages, PostScript |
| (2004-676) |
D. Kral' and O. Pangrac:
An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems.
19 pages, PostScript |
| (2004-677) |
J. Nesetril :
Metric Spaces are Ramsey.
13 pages, PostScript |
| (2004-678) |
R. N. Ball, A. Pultr and J. Sichler:
Combinatorial trees in Priestley spaces.
20 pages, PostScript |
| (2004-679) |
D. Kral':
Polynomial-size binary decision diagrams for the Exactly half-d-hyperclique problem reading each input bit twice.
22 pages, PostScript |
| (2004-680) |
B. Grunbaum, T. Kaiser, D. Kral' and M. Rosenfeld:
Equipartite polytopes and graphs.
33 pages, PostScript |
| (2004-681) |
V. Jungic:
On Brown's Conjecture on Accessible Sets.
5 pages, PostScript |
| (2004-682) |
M. Balek, ed.:
X. Midsummer Combinatorial Workshop.
74 pages, PostScript |
| (2004-683) |
Z. Dvorak, R. Skrekovski and T. Valla:
Four Gravity Results.
18 pages, PostScript |
| (2004-684) |
M. Janata and J. Szabo :
Generalized star packing problems I..
25 pages, PostScript |
| (2004-685) |
T. Feder, P. Hell, D. Kral' and J. Sgall :
Two Algorithms for General List Matrix Partitions.
14 pages, PostScript |
| (2004-686) |
M. Mares, ed.:
IX. Midsummer Combinatorial Workshop.
62 pages, PostScript |
| (2004-687) |
M. Chrobak, P. Kolman and J. Sgall :
The Greedy Algorithm for the Minimum Common String Partition Problem.
22 pages, PostScript |
| (2004-688) |
G. J. Woeginger and J. Sgall :
On the Complexity of Cake Cutting.
19 pages, PostScript |
| (2004-689) |
D. Kral' and L. Stacho :
Hamiltonian threshold for strong products of graphs.
17 pages, PostScript |
| (2004-690) |
A. Goldstein, P. Kolman and J. Zheng :
Minimum Common String Partition Problem: Hardness and Approximations.
19 pages, PostScript |
| (2004-691) |
T. Kaiser, D. Kral', R. Skrekovski and X. Zhu :
The circular chromatic index of graphs of high girth .
19 pages, PostScript |
| (2004-692) |
E. Ondrackova, T. Valla (eds.):
Spring School on Combinatorics 2004 Abstracts of Talks.
39 pages, PostScript |
| (2004-693) |
Z. Dvorak, V. Jelinek, D. Kral', J. Kyncl and M. Saks
Three Optimal Algorithms for Balls of Three Colors.
22 pages, PostScript |
| (2004-694) |
J. Kyncl, J. Pach and G. Toth:
Long Alternating Paths in Bicolored Point Sets.
11 pages, PostScript |
| (2004-695) |
J. Sima and J. Sgall :
On the Non-Learnability of a Single Spiking Neuron.
13 pages, PostScript |
| (2004-696) |
P. Kolman :
Linear Time Approximation Algorithm for Sorting by Reversals with Bounded Number of Duplicates.
12 pages, PostScript |
| (2004-697) |
J. Fiala, P. A. Golovach and J. Kratochvil:
Elegant distance constrained labelings of trees.
13 pages, PostScript |
| (2004-698) |
J. J. Montellano-Ballesteros, A. Por and R. Strausz:
Tverberg-type theorems for separoids.
15 pages, PostScript |
| (2004-699) |
D. Zeps:
Free Planar Graphs on Torus: examining triconnected graphs for unbounded augmentability.
8 pages, PostScript |
| (2004-700) |
T. Kaiser and R. Skrekovski :
Cycles intersecting edge-cuts of prescribed sizes.
19 pages, PostScript |
| (2004-701) |
R. Babilon, V. Jelinek, D. Kral' and P. Valtr :
Labelings of graphs with fixed and variable edge-weights.
31 pages, PostScript |
| (2004-702) |
D. Kral':
Channel assignment problem with variable weights.
20 pages, PostScript |
| (2004-703) |
R. N. Ball, A. Pultr and J. Sichler:
The Mysterious 2-Crown.
15 pages, PostScript |
| (2004-704) |
M. Balek and J. Nesetril:
Towards Mathematical Aesthetics.
18 pages, PostScript |
| (2004-705) |
J. Nesetril and R. Strausz:
Universality of Separoids.
21 pages, PostScript |
| (2004-706) |
P. Nejedly:
Choosability of Graphs with Infinite Sets of Forbidden Differences.
14 pages, PostScript |
| (2004-707) |
W. Krauth and M. Loebl:
Jamming and geometric representation of graphs.
17 pages, PostScript |
| (2004-708) |
M. Janata, M. Loebl and J. Szabo:
The Edmonds-Gallai Decomposition for the k-Piece Packing
Problem.
27 pages, PostScript |
| (2004-709) |
R. A. Brualdi, M. Loebl and O. Pangrac:
Perfect Matching Preservers.
18 pages, PostScript |
| (2004-710) |
M. Balek and R. Samal (eds.):
Abstracts of KAM-DIMATIA Series Year 2002.
20 pages, PostScript |
| (2004-711) |
M. Balek and R. Samal (eds.):
Abstracts of KAM-DIMATIA Series Year 2003 .
18 pages, PostScript |
| (2004-712) |
R. Samal and J. Nesetril:
Tension continuous maps - their structure and application.
38 pages, PostScript |
| (2004-713) |
J. Kara, A. Por and D. R. Wood:
On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane.
11 pages, PostScript |
| (2004-714) |
J. Nesetril and C. Tardif:
Short answers to exponentially long questions: Extremal aspects of homomorphism duality.
12 pages, PostScript |
| (2004-715) |
D. R. Wood:
Drawing a Graph in a Hypercube.
10 pages, PostScript |
| (2004-716) |
D. R. Wood:
Vertex Partitions of Chordal Graphs.
5 pages, PostScript |
| (2004-717) |
J. Nesetril and Y. Nigussie :
Density of Universal classes in G/K_4.
12 pages, PostScript |
| (2004-718) |
Z. Dvorak and R. Skrekovski :
A Theorem About a Contractible and Light Edge.
12 pages, PostScript |
| (2004-719) |
M. Balek and R. Samal (eds.):
Abstracts of KAM-DIMATIA Series Year 2004 .
23 pages, PostScript |
| |
| (2005-720) |
D. Kral', R. Skrekovski, and M. Tancer :
Construction of large graphs with no optimal surjective L(2,1)-labelings.
12 pages, PostScript (198 kB) |
| (2005-721) |
J. Fox, V. Jungic, and R. Radoicic:
Sub-Ramsey numbers for Arithmetic Progressions and Schur Triples.
19 pages, PostScript (243 kB) |
| (2005-722) |
D. Kral', J. Sgall, and T. Tichy :
Randomized Strategies for the Plurality Problem.
16 pages, PostScript (187 kB) |
| (2005-723) |
J. Fiala, P. Golovach, and J. Kratochvil:
Distance constrained labelings of graphs of bounded treewidth .
21 pages, PostScript (336 kB) |
| (2005-724) |
M. Bodirsky and D. Kral':
Locally Consistent Constraint Satisfaction Problems with Binary Constraints.
16 pages, PostScript (216 kB) |
| (2005-725) |
M. Hladik:
Separation properties of two convex polyhedral sets with RHS-parameters.
29 pages, PostScript (347 kB) |
| (2005-726) |
D. Kral', L. Tong, and X. Zhu:
Upper Hamiltonian Numbers and Hamiltonian Spectra of Graphs.
14 pages, PostScript (190 kB) |
| (2005-727) |
Z. Dvorak, D. Kral', P. Nejedly, and R. Skrekovski:
Coloring squares of planar graphs with no short cycles.
40 pages, PostScript (391 kB) |
| (2005-728) |
M. Bodirsky and J. Nesetril:
Constraint Satisfaction with Countable Homogeneous Templates.
22 pages, PostScript (305 kB) |
| (2005-729) |
J. Nesetril and I. Svejdarova :
Diameters of duals are linear.
17 pages, PostScript (218 kB) |
| (2005-730) |
D. Piguet and M. Stein:
The Loebl Conjecture for trees of small diameter.
5 pages, PostScript (133 kB) |
| (2005-731) |
M. Ghebleh, D. Kral', S. Norine, and R. Thomas:
The circular chromatic index of flower snarks.
9 pages, PostScript (181 kB) |
| (2005-732) |
J. Nesetril and P. Ossona de Mendez:
The Grad of a Graph and Classes with Bounded Expansion.
7 pages, PostScript (143 kB) |
| (2005-733) |
Z. Dvorak, ed.:
XI. Midsummer Combinatorial Workshop.
84 pages, PostScript (10405 kB) |
| (2005-734) |
Z. Dvorak, R. Skrekovski, and M. Tancer :
List-Colouring Squares of Sparse Subcubic Graphs.
35 pages, PostScript (385 kB) |
| (2005-735) |
R. N. Ball, A. Pultr, and P. Vojtechovsky:
Colored Graphs without Colorful Cycles.
19 pages, PostScript (211 kB) |
| (2005-736) |
J. Kara, J. Kratochvil, and D. R. Wood:
On the Complexity of the Balanced Vertex Ordering Problem.
12 pages, PostScript (402 kB) |
| (2005-737) |
J. Fiala and J. Kratochvil:
On the computational complexity of the L_{(2,1)}-labeling problem for regular graphs.
12 pages, PostScript (251 kB) |
| (2005-738) |
J. Fiala, J. Kratochvil, and A. Por:
On the computational complexity of partial covers of Theta graphs.
16 pages, PostScript (215 kB) |
| (2005-739) |
J. Nesetril and P. Ossona de Mendez:
Grad and Classes with Bounded Expansion I. Decompositions.
21 pages, PostScript (260 kB) |
| (2005-740) |
J. Nesetril and P. Ossona de Mendez:
Grad and Classes with Bounded Expansion II. Algorithmic Aspects.
20 pages, PostScript (257 kB) |
| (2005-741) |
J. Nesetril and P. Ossona de Mendez:
Grad and Classes with Bounded Expansion III. Restricted Dualities.
14 pages, PostScript (202 kB) |
| (2005-742) |
J. Nesetril:
Strom jako matematicka struktura -- i v umeni.
9 pages, PDF (2518 kB) |
| (2005-743) |
M. Bodirsky and J. Kara:
The Complexity of Equality Constraint Languages.
11 pages, PostScript (182 kB) |
| (2005-744) |
R. Naserasr, Y. Nigussie and R. Skrekovski:
Homomorphisms of triangle-free graphs without a K_5-minor.
31 pages, PostScript (303 kB) |
| (2005-745) |
E. Ondrackova and T. Valla (eds.):
Spring School on Combinatorics 2005.
59 pages, PDF (3702 kB) |
| (2005-746) |
J. Cerny:
A simple proof for open cups and caps.
12 pages, PostScript (169 kB) |
| (2005-747) |
J. Kara, ed.:
Workshop on Graph Classes, Width Parameters and Optimization 2005.
26 pages, PostScript (817 kB) |
| (2005-748) |
T. Kaiser, D. Kral', and L. Stacho :
Tough spiders.
21 pages, PostScript (279 kB) |
| (2005-749) |
M. Balek, D. Hartman, and J. Kara, eds.:
Open Problems for Homonolo 2005.
16 pages, PostScript (156 kB) |
| (2005-750) |
M. Nehez and D. Olejar :
On Dominating Cliques in Random Graphs.
16 pages, PostScript (899 kB) |
| (2005-751) |
D. M. Jackson, I. Moffatt, and A.H. Morales:
On the group-like behaviour of the Le-Murakami-Ohtsuki invariant.
26 pages, PostScript (700 kB) |
| (2005-752) |
P. Ossona de Mendez and P. Rosenstiehl:
Encoding pointed maps by double occurrence words.
12 pages, PostScript (724 kB) |
| (2005-753) |
A. Por and D. R. Wood:
Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets.
22 pages, PostScript (269 kB) |
| (2005-754) |
P. Bella, D. Kral', B. Mohar, and K. Quittnerova:
Labeling planar graphs with a condition at distance two.
59 pages, PostScript (589 kB) |
| (2005-755) |
M. Loebl:
Lecture Notes on Matroids.
15 pages, PostScript (164 kB) |
| (2005-756) |
F. Mraz :
On the Maximal Set of Feasible Coefficients in Interval Linear Systems.
16 pages, PostScript (196 kB) |
| (2005-757) |
L. Clark:
Asymptotic Distribution of the Sum of the Lengths of Ascents or of Descents in Permutations.
7 pages, PostScript (113 kB) |
| (2005-758) |
M. Balek (ed.):
Abstracts of KAM-DIMATIA Series Year 2005.
11 pages, PostScript (230 kB) |
| |
| (2006-759) |
I. Moffatt:
Alternating Links are Non-Trivial.
7 pages, PostScript (282 kB) |
| (2006-760) |
M. Hladik:
Separation of two convex polyhedral sets with parameters in one column of the constraint matrix.
24 pages, PostScript (331 kB) |
| (2006-761) |
M. Hladik:
Separation of two convex polyhedral sets with parameters in one row of the constraint matrix.
22 pages, PostScript (308 kB) |
| (2006-762) |
J. Fiala, D. Paulusma, and J. A. Telle:
Locally constrained graph homomorphisms and equitable partitions.
45 pages, PostScript (482 kB) |
| (2006-763) |
J. Nesetril and P. Ossona de Mendez:
Linear time low tree-width partitions and consequences .
26 pages, PostScript (296 kB) |
| (2006-764) |
J. Foniok, J. Nesetril and C. Tardif:
Generalised Dualities and Finite Maximal Antichains.
12 pages, PostScript (165 kB) |
| (2006-765) |
J. Foniok and J. Nesetril (eds.):
DIMATIA Annual Report 2005 (10 years of DIMATIA).
20 pages, PostScript (124 kB) |
| (2006-766) |
J. Foniok, J. Nesetril and C. Tardif:
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures.
26 pages, PostScript (268 kB) |
| (2006-767) |
M. Loebl and I. Moffatt:
The chromatic polynomial of fatgraphs and its categorification.
33 pages, PostScript (1085 kB) |
| (2006-768) |
R. N. Ball, A. Pultr, and J. Sichler:
More on Configurations in Priestley Spaces.
19 pages, PostScript (360 kB) |
| (2006-769) |
J. Picado and A. Pultr:
Sublocale sets and sublocale lattices.
13 pages, PostScript (283 kB) |
| (2006-770) |
J. Kara (ed.):
Midsummer Combinatorial Workshop 2005 and DIMACS, DIMATIA, Renyi Workshop 2005.
106 pages, PDF (1148 kB) |
| (2006-771) |
I. Moffatt:
Knot Invariants and the Bollobas-Riordan Polynomial.
17 pages, PostScript (500 kB) |
| (2006-772) |
R. Samal:
On XY mappings (Tension-continuous and related types of mappings).
152 pages, PostScript (1782 kB) |
| (2006-773) |
J. Hladky, M. Krcal, and B. Lidicky (eds.):
Spring School on Combinatorics 2006
64 pages, PDF (5882 kB) |
| (2006-774) |
D. Kral and R. Thomas:
Coloring even-faced graphs in the torus and the Klein bottle.
20 pages, PostScript (384 kB) |
| (2006-775) |
G. Kun and J. Nesetril:
Forbidden Lifts (NP and CSP for combinatorists).
23 pages, PostScript (396 kB) |
| (2006-776) |
P. Kolman and T. Walen :
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set.
14 pages, PostScript (347 kB) |
| (2006-777) |
M. Erne, M. Gehrke, and A. Pultr:
Complete Congruences on Topologies and Down-Set Lattices.
28 pages, PostScript (426 kB) |
| (2006-778) |
J. Nesetril:
Homomorphisms of Structures (concepts and highlights).
28 pages, PostScript (414 kB) |
| (2006-779) |
J. R. Griggs and D. Kral' :
Graph Labellings with Variable Weights, a Survey.
26 pages, PostScript (401 kB) |
| (2006-780) |
J. Nesetril and R. Samal:
On tension-continuous mappings.
37 pages, PostScript (492 kB) |
| (2006-781) |
M. DeVos and R. Samal :
High Girth Cubic Graphs Map to the Clebsch Graph.
22 pages, PostScript (484 kB) |
| (2006-782) |
M. Klazar:
Introduction to Number Theory (lecture notes).
91 pages, PostScript (687 kB) |
| (2006-783) |
M. Bodirsky and D. Kral':
Locally Consistent Constraint Satisfaction Problems.
24 pages, PostScript (430 kB) |
| (2006-784) |
R. N. Ball, J. Nesetril and A. Pultr:
Dualities in full homomorphisms.
21 pages, PostScript (358 kB) |
| (2006-785) |
M. Hladik:
Linear interval systems with aspecific dependence structure.
19 pages, PostScript (283 kB) |
| (2006-786) |
D. Kral':
Computing representations of matroids of bounded branch-width.
15 pages, PostScript (295 kB) |
| (2006-787) |
D. Kral', ed.:
International REU 1999--2006:
23 pages, PostScript (450 kB) |
| (2006-788) |
H. Bruhn, J. Cerny, A. Hall and P. Kolman :
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks.
19 pages, PostScript (373 kB) |
| (2006-789) |
Mark H. Siggers:
On the Bounded Degree Restriction of Constraint Satisfaction Problems.
20 pages, PostScript (374 kB) |
| (2006-790) |
R. Erman, S. Jurecic, D. Kral', K. Stopar, and N. Stopar:
Optimal real number graph labelings of asubfamily of Kneser graphs.
19 pages, PostScript (336 kB) |
| (2006-791) |
J. Fiala and J. Soto :
Block transitivity and degree matrices.
20 pages, PostScript (426 kB) |
| (2006-792) |
Z. Dvorak, D. Kral', and J. Teska:
Toughness threshold for the existence of 2-walks in K_4-minor free graphs.
21 pages, PostScript (406 kB) |
| (2006-793) |
P. Hell and J. Nesetril:
On the density of trigraph homomorphisms.
11 pages, PostScript (271 kB) |
| (2006-794) |
D. Kral' and P. Nejedly :
Distance Constrained Labelings of K_4-minor Free Graphs.
26 pages, PostScript (444 kB) |
| (2006-795) |
Z. Dvorak, S. Jendrol', and D. Kral':
Matchings and non-rainbow colorings.
21 pages, PostScript (396 kB) |
| (2006-796) |
M. DeVos, L. Goddyn, B. Mohar, and R. Samal :
A quadratic lower bound for subset sums.
12 pages, PostScript (339 kB) |
| (2006-797) |
T. Muller and J.-S. Sereni:
Identifying codes in (random) geometric networks.
28 pages, PostScript (617 kB) |
| (2006-798) |
B. Luzar, R. Skrekovski, and M. Tancer:
Injective colorings of planar graphs with few colors.
30 pages, PostScript (474 kB) |
| (2006-799) |
J. Matousek and A. Privetivy :
Large Monochromatic Components in Two-colored Grids.
24 pages, PostScript (515 kB) |
| (2006-800) |
D. Kral' and M. Stehlik:
Coloring of triangle-free graphs on the double torus.
19 pages, PostScript (309 kB) |
| (2006-801) |
M. Balek (ed.):
Abstracts of KAM-DIMATIA Series Year 2006.
13 pages, PostScript (226 kB) |
| |
| (2007-802) |
Z. Dvorak, D. Kral', and R. Skrekovski:
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs.
22 pages, PostScript (480 kB) |
| (2007-803) |
M. Nehez:
Properties of Oblivious End-to-End Communication Protocols in Reliability Networks with Hypercubic and Mesh-like Topology.
26 pages, PostScript (350 kB) |
| (2007-804) |
D. Kral', B. Mohar, A. Nakamoto, O. Pangrac, and Y. Suzuki:
Coloring Eulerian triangulations of the Klein bottle.
44 pages, PostScript (558 kB) |
| (2007-805) |
J. Picado, A. Pultr, and A. Tozzi:
Ideals in Heyting semilattices and open homomorphisms .
16 pages, PostScript (344 kB) |
| (2007-806) |
M. Hladik:
Description of symmetric and skew--symmetric solution set.
13 pages, PostScript (328 kB) |
| (2007-807) |
D. Zeps :
Classical and quantum self-reference systems in physics and mathematics .
24 pages, PostScript (293 kB) |
| (2007-808) |
J. Fiala and J. Kratochvil:
Locally injective graph homomorphism: Lists guarantee dichotomy.
15 pages, PostScript (442 kB) |
| (2007-809) |
J. Matousek and P. Skovron:
Removing degeneracy may require unbounded dimension increase.
22 pages, PostScript (552 kB) |
| (2007-810) |
J. Nesetril and P. Ossona de Mendez:
Induced Matchings and Induced Paths in Graphs.
19 pages, PostScript (510 kB) |
| (2007-811) |
E. Ondrackova (ed.):
HOMONOLO 2006.
38 pages, PDF (4822 kB) |
| (2007-812) |
J. Nesetril:
A Surprising Permanence of Old Motivations (a not so rigid story).
40 pages, PDF (744 kB) |
| (2007-813) |
J. Foniok, J. Nesetril, and C. Tardif:
On Finite Maximal Antichains in the Homomorphism Order.
7 pages, PostScript (223 kB) |
| (2007-814) |
J. Nesetril and M. H. Siggers:
A New Combinatorial Approach to the Constraint Satisfaction Problem Dichotomy Classification.
22 pages, PostScript (448 kB) |
| (2007-815) |
M. Hladik:
Multiparametric linear programming: support set and optimal partition invariancy.
20 pages, PostScript (346 kB) |
| (2007-816) |
J. Hladky, D. Kral', J. Sereni and M. Stiebitz:
List colorings with measurable sets.
14 pages, PostScript (383 kB) |
| (2007-817) |
M. Hladik:
Additive and multiplicative tolerance in multiobjective linear programming.
9 pages, PostScript (258 kB) |
| (2007-818) |
D. Kral', E. Macajova, O. Pangrac, A. Raspaud, J. Sereni and M. Skoviera:
Projective, affine, and abelian colorings of cubic graphs.
31 pages, PostScript (522 kB) |
| (2007-819) |
Z. Dvorak and R. Skrekovski:
k-chromatic number of graphs on surfaces.
15 pages, PostScript (332 kB) |
| (2007-820) |
D. Kral', E. Macajova, A. Por and J. Sereni:
Characterization results for Steiner triple systems and their application to edge-colorings of cubic graphs.
41 pages, PDF (303 kB) |
| (2007-821) |
J. Hubicka and J. Nesetril:
A Finite Presentation of the rational Urysohn Space.
16 pages, PostScript (371 kB) |
| (2007-822) |
D. Garijo, J. Nesetril and M. P. Revuelta:
Homomorphisms and Polynomial Invariants of Graphs.
11 pages, PostScript (468 kB) |
| (2007-823) |
J. Nesetril and M. Siggers:
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete.
15 pages, PostScript (382 kB) |
| (2007-824) |
Milan Hladik:
Optimal value range in interval linear programming.
12 pages, PostScript (248 kB) |
| (2007-825) |
J. Hladky, M. Krcal, B. Lidicky (eds.):
Spring School on Combinatorics 2007.
89 pages, PDF (60 MB) |
| (2007-826) |
D. Kral', P. Skoda:
Bounds for the real number graph labellings and application to labellings of the triangular lattice.
17 pages, PostScript (363 kB) |
| (2007-827) |
D. Piguet, M. J. Stein:
An approximate version of the Loebl-Komlos-Sos conjecture.
37 pages, PostScript (735 kB) |
| (2007-828) |
J. Nesetril, T. Valla:
On Ramsey-type Positional Games.
15 pages, PostScript (759 kB) |
| (2007-829) |
S. Gago:
Eigenvalues of scale free graphs.
9 pages, PostScript (2417 kB) |
| (2007-830) |
Milan Hladik:
Solution set of complex linear interval systems of equations.
12 pages, PostScript (375 kB) |
| (2007-831) |
Jan Kara, ed.:
Third Workshop on Graph Classes, Optimization, and Width Parameters.
19 pages, PostScript (3606 kB) |
| (2007-832) |
R. N. Ball, A. Pultr, J. Sichler:
A Priestley Sum of Finite Trees is Acyclic.
16 pages, PostScript (336 kB) |
| (2007-833) |
J. Hladky, D. Kral', and S. Norine:
Rank of divisors on tropical curves.
34 pages, PostScript (475 kB) |
| (2007-834) |
Jan Foniok:
Homomorphisms and Structural Properties of Relational Systems.
34 pages, PDF (650 kB) |
| (2007-835) |
R. N. Ball, J. Nesetril, and A. Pultr:
Finite dualities, in particular in full homomorphisms.
16 pages, PostScript (322 kB) |
| (2007-836) |
K. Kawarabayashi, D. Kral, J. Kyncl, and B. Lidicky:
6-critical graphs on the Klein bottle.
20 pages, PostScript (674 kB) |
| (2007-837) |
J. Fiala, D. Kral', and J. Kratochvil (eds.):
Workshop on Frequency Assignment Problems, Sadek (Trebic), September 23--27, 2007.
25 pages, PostScript (27462 kB) |
| (2007-838) |
S. Gago and D. Schlatter:
Bounded expansion in web graphs.
14 pages, PostScript (336 kB) |
| (2007-839) |
F. Kardos, D. Kral', J. Miskuf, and J. Sereni:
Fullerene graphs have exponentially many perfect matchings.
7 pages, PostScript (283 kB) |
| (2007-840) |
J. Fiala, P. Golovach, and J. Kratochvil:
Distance constrained labelings of trees.
21 pages, PostScript (521 kB) |
| (2007-841) |
J. Fiala and D. Paulusma:
Comparing universal covers in polynomial time.
13 pages, PostScript (369 kB) |
| (2007-842) |
D. Piguet and M. Stein:
The Loebl--Komlos--Sos conjecture for trees of diameter 5 and for certain caterpillars.
15 pages, PostScript (298 kB) |
| (2007-843) |
Tomas Valla (ed.):
Abstracts of KAM-DIMATIA Series \ Year 2007 .
14 pages, PostScript (210 kB) |
| |
| (2008-844) |
D. Kral', O. Pangrac, J. Sereni, and R. Skrekovski:
Long cycles in fullerene graphs.
15 pages, PostScript (352 kB) |
| (2008-845) |
B. Lidicky:
On 3-choosability of plane graphs without 6-, 7- and 8-cycles.
12 pages, PostScript (412 kB) |
| (2008-846) |
D. Kral', P. Nejedly, and R. Samal:
Short Cycle Covers of Cubic Graphs.
21 pages, PostScript (406 kB) |
| (2008-847) |
T. Kaiser, D. Kral', B. Lidicky, and P. Nejedly:
Short Cycle Covers of Graphs with Minimum Degree Three.
32 pages, PostScript (502 kB) |
| (2008-848) |
J. Fiala and P. Golovach:
Complexity of the Packing Coloring Problem of Trees.
16 pages, PostScript (398 kB) |
| (2008-849) |
J. Sereni:
Equitable colourings of graphs with bounded density and given girth.
21 pages, PDF (229 kB) |
| (2008-850) |
J. Foniok and J. Nesetril:
Splitting finite antichains in the homomorphism order.
13 pages, PostScript (309 kB) |
| (2008-851) |
J. Nesetril and Y. Nigussie:
Finite dualities and map-critical graphs on a fixed surface.
19 pages, PostScript (476 kB) |
| (2008-852) |
Z. Dvorak, T. Kaiser, D. Kral', and J. Sereni:
A note on antisymmetric flows in graphs.
8 pages, PDF (172 kB) |
| (2008-853) |
D. Kral', O. Serra, and L. Vena:
A combinatorial proof of the Removal Lemma for Groups.
11 pages, PostScript (318 kB) |
| (2008-854) |
D. Kral', P. Nejedly, and X. Zhu
Choosability of Squares of K_4-minor Free Graphs.
21 pages, PostScript (412 kB) |
| (2008-855) |
J. Matousek, A. Privetivy, and P. Skovron:
How many points can be reconstructed from k projections?.
28 pages, PostScript (889 kB) |
| (2008-856) |
J. Matousek and M. Tancer:
On the gap between representability and collapsibility.
12 pages, PostScript (356 kB) |
| (2008-857) |
V. Franek and J. Matousek:
Computing D-convex hulls in the plane.
19 pages, PostScript (3822 kB) |
| (2008-858) |
J. Matousek:
Removing degeneracy in LP-type problems revisited.
13 pages, PostScript (364 kB) |
| (2008-859) |
J. Matousek:
LC reductions yield isomorphic simplicial complexes.
4 pages, PostScript (216 kB) |
| (2008-860) |
J. Matousek:
On variants of the Johnson--Lindenstrauss lemma.
21 pages, PostScript (412 kB) |
| (2008-861) |
J. Cibulka, J. Hladky, M.A. LaCroix, and D.G. Wagner:
A combinatorial proof of Rayleigh monotonicity for graphs.
16 pages, PDF (400 kB) |
| (2008-862) |
F. Havet, D. Kral', J. Sereni, and R. Skrekovski:
Facial colorings using Hall's Theorem.
32 pages, PDF (465 kB) |
| (2008-863) |
J. Nesetril, P. Ossona de Mendez:
Structural Properties of Sparse Graphs.
56 pages, PDF (691 kB) |
| (2008-864) |
D. Zeps:
Combinatorial map as multiplication of combinatorial knots.
7 pages, PostScript (204 kB) |
| (2008-865) |
J. Nesetril and P. Ossona de Mendez:
First Order Properties on Nowhere Dense Structures.
31 pages, PDF (350 kB) |
| (2008-866) |
D. Kral' and D. B. West:
Chromatic number for a generalization of Cartesian product graphs.
10 pages, PostScript (314 kB) |
| (2008-867) |
D. Kral', J. Sereni, and M. Stiebitz:
A new lower bound on the number of perfect matchings in cubic graphs.
25 pages, PDF (230 kB) |
| (2008-868) |
J. Foniok and C. Tardif:
Adjoint functors and tree duality.
17 pages, PostScript (399 kB) |
| (2008-869) |
T. Marshall:
Homomorphism bounds for oriented planar graphs II.
14 pages, PostScript (296 kB) |
| (2008-870) |
R. Ball, A. Pultr, and J. Sichler:
Tame parts of free summands in coproducts of Priestley spaces.
19 pages, PostScript (400 kB) |
| (2008-871) |
B. Banaschewski and A. Pultr:
Epimorphisms of metric frames.
15 pages, PostScript (328 kB) |
| (2008-872) |
S. Felsner and M. Pergel:
The Complexity of Sorting with Networks of Stacks and Queues.
16 pages, PostScript (404 kB) |
| (2008-873) |
J. Nesetril:
Many facets of dualities.
24 pages, PostScript (341 kB) |
| (2008-874) |
J. Hladky and D. Piguet:
Loebl-Komlos-Sos Conjecture: dense case.
76 pages, PostScript (712 kB) |
| (2008-876) |
P. Gregor and R. Skrekovski:
Long cycles in hypercubes with distant faulty vertices.
20 pages, PostScript (580 kB) |
| (2008-877) |
D. Dimitrov, T. Dvorak, P. Gregor, and R. Skrekovski:
Gray Codes Faulting Matchings.
33 pages, PostScript (1370 kB) |
| (2008-878) |
J. Miskuf, R. Skrekovski, and M. Tancer:
Backbone colorings of graphs with bounded degree.
17 pages, PostScript (383 kB) |
| (2008-879) |
J. Miskuf, R. Skrekovski, and M. Tancer:
Backbone Colorings and Generalized Mycielski's Graphs.
13 pages, PostScript (385 kB) |
| (2008-880) |
Y. Nigussie:
Structural description for Kruskal-Friedman ideals of finite trees.
16 pages, PostScript (366 kB) |
| (2008-881) |
Y. Nigussie:
On well-quasi-ordering lower sets of finite trees, a new proof.
8 pages, PostScript (294 kB) |
| (2008-882) |
J. Fiala, S. Klavzar, and B. Lidicky:
The packing chromatic number of infinite product graphs.
18 pages, PDF (376 kB) |
| (2008-883) |
M. DeVos, L. Goddyn, B. Mohar, and R. Samal:
Cayley sum graphs and eigenvalues of (3,6)-fullerenes.
1 pages, PDF (123 kB) |
| (2008-884) |
J. Matousek and R. Samal:
Induced trees in triangle-free graphs.
11 pages, PostScript (365 kB) |
| (2008-885) |
Z. Dvorak:
Small Graph Classes and Bounded Expansion.
10 pages, PostScript (323 kB) |
| (2008-886) |
D. Kral' and L. Stacho:
Coloring plane graphs with independent crossings.
25 pages, PostScript (369 kB) |
| (2008-887) |
Z. Dvorak, K. Kawarabayashi, and R. Thomas:
Three-coloring triangle-free planar graphs in linear time.
18 pages, PostScript (331 kB) |
| (2008-888) |
P. Kolman and O. Pangrac:
On the Complexity of Paths Avoiding Forbidden Pairs.
12 pages, PostScript (315 kB) |
| (2008-889) |
V. Muller, J. Nesetril, and V. Rodl:
Some recollections on early work with Jan Pelant.
11 pages, PostScript (282 kB) |
| (2008-890) |
E. Lehtonen and J. Nesetril:
Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms.
24 pages, PostScript (486 kB) |
| (2008-891) |
J. Nesetril and O. Serra:
On a conjecture of Erdos and Turan for additive basis.
13 pages, PostScript (366 kB) |
| (2008-892) |
P. Hell and J. Nesetril:
Colouring, Constraint Satisfaction, and Complexity.
59 pages, PDF (591 kB) |
| (2008-893) |
D. Kral', S. Norine, and O. Pangrac:
Markov bases of binary graph models of K_4-minor free graphs.
11 pages, PostScript (327 kB) |
| (2008-894) |
Z. Dvorak, B. Lidicky, and R. Skrekovski:
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable.
12 pages, PostScript (404 kB) |
| (2008-895) |
T. Ebenlendr and J. Sgall:
Semi-Online Preemptive Scheduling: One Algorithm for All Variants.
27 pages, PDF (476 kB) |
| (2008-896) |
T. Ebenlendr and J. Sgall:
A lower bound for scheduling of unit jobs with immediate decision on parallel machines.
13 pages, PostScript (298 kB) |
| (2008-897) |
D. Kral', O. Serra, and L. Vena:
A Removal Lemma for Systems of Linear Equations over Finite Fields.
13 pages, PostScript (354 kB) |
| (2008-898) |
J. Azarija, R. Erman, D. Kral', M. Krnc, and L. Stacho:
Cyclic colorings of plane graphs with independent faces.
15 pages, PostScript (290 kB) |
| (2008-899) |
M. Klazar and M. Loebl (eds.):
Enumeration Workshop, Patejdlova bouda, Spindleruv Mlyn, November 17--23, 2007.
77 pages, PostScript (1063 kB) |
| (2008-900) |
Z. Dvorak, B. Lidicky, and R. Skrekovski:
$3$-choosability of triangle-free planar graphs with constraint on $4$-cycles.
17 pages, PostScript (563 kB) |
| (2008-901) |
Milan Hladik:
Tolerance analysis in linear programming.
22 pages, PostScript (372 kB) |
| (2008-902) |
P. Gregor and R. Skrekovski:
On Generalized Middle Level Problem.
20 pages, PostScript (843 kB) |
| (2008-903) |
D. Kral', E. Macajova, J. Mazak, and J. Sereni:
Circular edge-colorings of cubic graphs with girth six.
13 pages, PostScript (315 kB) |
| (2008-904) |
O. Amini, L. Esperet, and J. van den Heuvel:
A Unified Approach to Distance-Two Colouring of Graphs on Surfaces.
48 pages, PostScript (768 kB) |
| (2008-905) |
L. Esperet, D. Kral', P. Skoda, and R. Skrekovski:
An improved linear bound on the number of perfect matchings in cubic graphs.
33 pages, PostScript (556 kB) |
| (2008-906) |
T. Valla (ed.):
Abstracts of KAM-DIMATIA Series Year 2008.
21 pages, PostScript (282 kB) |
| |
| (2009-907) |
V. Jungic, T. Kaiser, and D. Kral':
A note on edge-colourings avoiding rainbow $K_4$ and monochromatic $K_m$.
10 pages, PostScript (349 kB) |
| (2009-908) |
T. Muller, A. Por, and J. Sereni:
Graphs with four boundary vertices.
21 pages, PostScript (421 kB) |
| (2009-909) |
J. Nesetril, P. Ossona de Mendez, and D. Wood:
Characterisations and Examples of Graph Classes with Bounded Expansion.
45 pages, PDF (590 kB) |
| (2009-910) |
Milan Hladik:
Generalized linear fractional programming under interval uncertainty.
16 pages, PostScript (260 kB) |
| (2009-911) |
J. Bottcher, J. Hladky, and D. Piguet:
The tripartite Ramsey number for trees.
42 pages, PostScript (640 kB) |
| (2009-912) |
B. Banaschewski and A. Pultr:
Pointfree aspects of the $T_D$ axiom of classical topology.
19 pages, PostScript (378 kB) |
| (2009-913) |
J. Maxova, P. Pavlikova, and D. Turzik:
On the complexity of cover-incomparability graphs of posets.
11 pages, PostScript (348 kB) |
| (2009-914) |
M. DeVos, A. Georgakopoulos, B. Mohar, and R. Samal:
An Eberhard-like theorem for pentagons and heptagons.
19 pages, PostScript (5307 kB) |
| (2009-915) |
J. Hladky and D. Kral':
Algebraic proof of Brooks' theorem.
6 pages, PostScript (223 kB) |
| (2009-916) |
Jana Maxova (ed.):
Midsummer Combinatorial Workshop 2008.
101 pages, PostScript (5696 kB) |
| (2009-917) |
Jiri Matousek:
Selected Mathematical and Algorithmic Applications of Linear Algebra.
45 pages, PostScript (1039 kB) |
| (2009-918) |
Yared Nigussie:
Extended Gallai's Theorem.
6 pages, PostScript (235 kB) |
| (2009-919) |
P. Allen, J. Bottcher, and J. Hladky:
Filling the gap between Turan's theorem and Posa's conjecture.
37 pages, PostScript (592 kB) |
| (2009-920) |
Milan Hladik :
Interval valued bimatrix games.
14 pages, PostScript (295 kB) |
| (2009-921) |
J. Foniok, J. Nesetril, A. Pultr, and C. Tardiff:
Dualities and dual pairs in Heyting algebras.
18 pages, PostScript (316 kB) |
| (2009-922) |
J.-S. Sereni and M. Stehlik:
Edge-face colouring of plane graphs with maximum degree nine.
21 pages, PostScript (409 kB) |
| (2009-923) |
J. Hladky and M. Schacht:
Note on bipartite graph tilings.
10 pages, PostScript (335 kB) |
| (2009-924) |
F. Havet, B. Reed, and J.-S. Sereni:
L(p,1)-labelling of graphs.
43 pages, PostScript (592 kB) |
| (2009-925) |
D. Kral', P. Skoda, and J. Volec:
Domination number of cubic graphs with large girth.
15 pages, PostScript (302 kB) |
| (2009-926) |
Louis Esperet:
Dynamic list coloring of bipartite graphs.
6 pages, PostScript (301 kB) |
| (2009-927) |
L. Esperet, J. Gimbel, and A. King:
Covering line graphs with equivalence relations.
13 pages, PostScript (360 kB) |
| (2009-928) |
J. Nesetril and P. Ossona de Mendez:
On Nowhere Dense Graphs.
35 pages, PDF (527 kB) |
| (2009-929) |
Marek Tesar (ed.):
Workshop on Coverings and Colorings 2009.
25 pages, PostScript (12024 kB) |
| (2009-930) |
Milan Hladik:
Support set invariancy for interval bimatrix games.
14 pages, PostScript (275 kB) |
| (2009-931) |
J. Hubicka and J. Nesetril:
On characteristics of homomorphism and embedding universal graphs.
19 pages, PostScript (441 kB) |
| (2009-932) |
J. Volec and Z. Safernova(eds.):
Spring School on Combinatorics 2009.
67 pages, PDF (34 MB) |
| (2009-933) |
Jan Kyncl, Bernard Lidicky, and Tomas Vyskocil:
Irreversible 2-conversion set is NP-complete.
12 pages, PDF (197 kB) |
| (2009-934) |
J. Hladky, D. Kral', and S. Norine:
Counting flags in triangle-free digraphs.
pages, PostScript (636 kB) |
| (2009-935) |
Martin Tancer:
Non-representability of finite projective planes by convex sets.
9 pages, PostScript (379 kB) |
| (2009-936) |
Martin Tancer:
$d$-collapsibility is NP-complete for $d \geq 4$.
33 pages, PostScript (619 kB) |
| (2009-937) |
J.-S. Sereni and M. Stehlik:
On the sextet polynomial of fullerenes.
10 pages, PostScript (380 kB) |
| (2009-938) |
H. Ardal, Z. Dvorak, V. Jungic, and T. Kaiser:
On a Rado Type Problem for Homogeneous Second Order Linear Recurrences.
21 pages, PostScript (403 kB) |
| (2009-939) |
Tomas Valla (ed.):
GRASTA 2009, Workshop on Graph Searching, Theory and Applications.
2 pages, PostScript (36 kB) |
| (2009-940) |
Jan Hubicka, Jaroslav Nesetril:
Homomorphism and embedding universal structures for restricted classes.
30 pages, PostScript (554 kB) |
| (2009-941) |
C. Grosu and J. Hladky:
The extremal function for partial bipartite tilings.
12 pages, PostScript (209 kB) |
| (2009-942) |
M. DeVos, B. Mohar, and Robert Samal:
Unexpected behaviour of crossing sequences.
26 pages, PostScript (1219 kB) |
| (2009-943) |
J. Foniok, K. Fukuda, and L. Klaus:
Combinatorial Characterizations ofK-matrices.
24 pages, PostScript (339 kB) |
| (2009-944) |
T. Kaiser, A. King, and D. Kral':
Fractional total colourings of graphs of high girth.
31 pages, PostScript (459 kB) |
| (2009-945) |
Robert Samal:
Cubical coloring --- fractional covering by cuts.
15 pages, PostScript (199 kB) BibTeX |
| (2009-946) |
Ales Pultr:
Why some fuzzyfications are easier then others.
16 pages, PostScript (386 kB) BibTeX |
| (2009-947) |
J. Picado, and A. Pultr:
Cover quasi-uniformities in frames.
22 pages, PostScript (453 kB) BibTeX |
| (2009-948) |
O. Zajicek, J. Sgall, and T. Ebenlendr:
Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput.
15 pages, PDF (175 kB) BibTeX |
| (2009-949) |
F. Kardos, D. Kral', and J.-S. Sereni:
The last fraction of a fractional conjecture.
13 pages, PostScript (339 kB) BibTeX |
| (2009-950) |
Milan Hladik:
On necessary efficient solutions in interval multiobjective linear programming.
14 pages, PostScript (278 kB) BibTeX |
| (2009-951) |
P. Charbit and J.-S. Sereni:
The Fractional Chromatic Number of Zykov Products of Graphs.
10 pages, PostScript (307 kB) BibTeX |
| (2009-952) |
L. Esperet, F. Kardos, and D. Kral:
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs.
54 pages, PostScript (1051 kB) BibTeX |
| (2009-953) |
Z. Dvorak, D. Kral', and R. Thomas:
Deciding first-order properties for sparse graphs.
39 pages, PostScript (487 kB) BibTeX |
| (2009-954) |
Martin Kupec (ed.):
Abstracts of KAM-DIMATIA Series Year 2009.
15 pages, PostScript (229 kB) BibTeX |
| |
| (2010-955) |
R. J. Kang, J.-S. Sereni, and Matej Stehlik:
Every plane graph of maximum degree 8 has an edge-face 9-colouring.
25 pages, PostScript (449 kB) BibTeX |
| (2010-956) |
P. Kolman, B. Lidicky, and J.-S. Sereni:
On Minimum Fair Odd Cycle Transversal.
19 pages, PostScript (370 kB) BibTeX |
| (2010-957) |
Jan Hubicka and Jaroslav Nesetril:
Some examples of universal and generic partial orders.
33 pages, PostScript (614 kB) BibTeX |
| (2010-958) |
Petr Skoda:
Computability of Width of Submodular Partition Functions.
26 pages, PostScript (401 kB) BibTeX |
| (2010-959) |
Jiri Fink (ed.):
Midsummer Combinatorial Workshop 2009.
134 pages, PostScript (62411 kB) BibTeX |
| (2010-960) |
M. Loebl and H. Teimoori:
Bass' Identity and The Coin Arrangements Lemma.
17 pages, PostScript (452 kB) BibTeX |
| (2010-961) |
Hossein Teimoori Faal:
Determinants, Lyndon Covers and The Coin Arrangements Lemma.
24 pages, PostScript (385 kB) BibTeX |
| (2010-962) |
H. Khodakarami and H. Teimoori:
Khayyam-Pascal Determinantal Arrays, Star of David Rule and Log-Concavity.
13 pages, PDF (213 kB) BibTeX |
| (2010-963) |
M. Hladik, and M. Cerny:
Interval regression by tolerance analysis approach.
22 pages, PostScript (401 kB) BibTeX |
| (2010-964) |
Zuzka Safernova, Jan Volec (eds.):
Spring School on Combinatorics 2010.
49 pages, PostScript (568 kB) BibTeX |
| (2010-965) |
Bernhard Banaschewski and Ales Pultr:
Approximate maps, filter monad, and a representation of localic maps.
19 pages, PostScript (360 kB) BibTeX |
| (2010-966) |
Jiri Fink:
Towards a theory of Ground state uniqueness.
31 pages, PostScript (936 kB) BibTeX |
| (2010-967) |
Richard N. Ball and Ales Pultr:
Quotients and colimits of $\kappa$-quantales.
24 pages, PostScript (434 kB) BibTeX |
| (2010-968) |
Martin Klazar:
ANALYTIC AND COMBINATORIAL NUMBER THEORY I .
97 pages, PostScript (857 kB) BibTeX |
| (2010-969) |
Martin Klazar:
ANALYTIC AND COMBINATORIAL NUMBER THEORY II.
50 pages, PostScript (564 kB) BibTeX |
| (2010-970) |
Jiri Fink:
Doctoral Thesis: Probabilistic Methods in Discrete Applied Mathematics.
110 pages, PDF (1165 kB) BibTeX |
| (2010-971) |
Martin Klazar:
Diophantine equation $ax^n-by^n=c$. I.
39 pages, PostScript (536 kB) BibTeX |
| (2010-972) |
J. Picado and A. Pultr:
On strong inclusions and asymmetric proximities in frames.
22 pages, PostScript (438 kB) BibTeX |
| (2010-973) |
Milan Hladik:
How to determine basis stability in interval linear programming.
16 pages, PostScript (301 kB) BibTeX |
| (2010-974) |
D. Garijo, A. Goodall, and J. Nesetril:
Distinguishing graphs by their left and right homomorphism profiles.
49 pages, PostScript (688 kB) BibTeX |
| (2010-975) |
Z. Dvorak, K. Kawarabayashi, and D. Kral':
Packing six $T$-joins in plane graphs.
32 pages, PostScript (445 kB) BibTeX |
| (2010-976) |
J. Picado and A. Pultr:
Notes on entourages and localic groups.
20 pages, PostScript (346 kB) BibTeX |
| (2010-977) |
Z. Dvorak, D. Kral', and R. Thomas:
Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle.
20 pages, PostScript (373 kB) BibTeX |
| (2010-978) |
Z. Dvorak and B. Mohar:
Spectrally degenerate graphs: Hereditary case.
16 pages, PostScript (365 kB) BibTeX |
| (2010-979) |
F. Kardos, D. Kral', and J. Volec:
Fractional colorings of cubic graphs with large girth.
31 pages, PostScript (506 kB) BibTeX |
| (2010-980) |
Milan Hladik:
Complexity of necessary efficiency in interval LP and MOLP.
8 pages, PostScript (245 kB) BibTeX |
| (2010-981) |
Milan Hladik:
Interval linear programming: A survey.
42 pages, PostScript (468 kB) BibTeX |
| (2010-982) |
D. Kral', O. Serra, and L. Vena:
On the Removal Lemma for linear systems over Abelian groups.
17 pages, PostScript (330 kB) BibTeX |
| (2010-983) |
Milan Hladik:
Enclosures for the solution set of parametric interval linear systems.
25 pages, PostScript (377 kB) BibTeX |
| (2010-984) |
D. Garijo, A. Goodall, and J. Nesetril:
Contractors for flows.
29 pages, PostScript (946 kB) BibTeX |
| (2010-985) |
T. Dvorak, J. Fink, P. Gregor, V. Koubek, and T. Radzik:
Efficient connectivity testing of hypercubic networks with faults.
15 pages, PostScript (386 kB) BibTeX |
| (2010-986) |
T. Dvorak, J. Fink, P. Gregor, V. Koubek:
Gray codes with bounded weights.
28 pages, PostScript (728 kB) BibTeX |
| (2010-987) |
Z. Dvorak, B. Mohar, and R. Samal:
Star chromatic index.
18 pages, PDF (212 kB) BibTeX |
| (2010-988) |
L. Esperet, F. Kardos, A. King, D. Kral', and S. Norine:
Exponentially many perfect matchings in cubic graphs.
27 pages, PostScript (700 kB) BibTeX |
| (2010-989) |
M. Hladik and S. Sitarz:
Maximal and supremal tolerances in multiobjective linear programming.
15 pages, PDF (172 kB) BibTeX |
| (2010-990) |
R. Samal, R. Stolar, T. Valla:
Complexity of the cop & robber guarding game.
18 pages, PostScript (567 kB) BibTeX |
| (2010-991) |
K. Junosza-Szaniawski and P. Rzazewski:
On the number of $2$-packings in a connected graph.
14 pages, PostScript (435 kB) BibTeX |
| (2010-992) |
K. Junosza-Szaniawski and P. Rzazewski:
On the Complexity of Exact Algorithm for $L(2,1)$-labeling of Graphs.
10 pages, PostScript (387 kB) BibTeX |
| (2010-993) |
Martin Kupec (ed.):
Abstracts of KAM-DIMATIA Series Year 2010.
14 pages, PostScript (209 kB) BibTeX |
| |
| (2011-994) |
Zdenek Dvorak:
$3$-choosability of planar graphs with $(\le\!4)$-cycles far apart.
53 pages, PostScript (836 kB) BibTeX |
| (2011-995) |
Martin Tancer (ed.):
Midsummer Combinatorial Workshop 2010.
54 pages, PDF (971 kB) BibTeX |
| (2011-996) |
Z. Dvorak, B. Lidicky, and R. Skrekovski:
Graphs with two crossings are $5$-choosable.
12 pages, PDF (188 kB) BibTeX |
| (2011-997) |
D. Kral', M. Krnc, M. Kupec, B. Luzar, and J. Volec:
Extending fractional precolorings.
18 pages, PostScript (465 kB) BibTeX |
| (2011-998) |
J. Bottcher and J. Foniok:
Ramsey Properties of Permutations.
13 pages, PostScript (327 kB) BibTeX |
| (2011-999) |
H. Hatami, J. Hladky, D. Kral', S. Norine, and A. Razborov:
Non-three-colorable common graphs exist.
12 pages, PostScript (441 kB) BibTeX |
| (2011-1000) |
Z. Dvorak, B. Lidicky, and R. Skrekovski:
Bipartizing fullerenes.
17 pages, PDF (200 kB) BibTeX |
| (2011-1001) |
J. Ekstein, P. Holub, and B. Lidicky:
Packing Chromatic Number of Distance Graphs.
16 pages, PDF (216 kB) BibTeX |
| (2011-1002) |
B. Banaschewski and A. Pultr:
Completion and Samuel compactification of nearness and uniform frames.
19 pages, PostScript (351 kB) BibTeX |
| (2011-1003) |
Tomas Vyskocil (ed.):
37th International Workshop on Graph Theoretic Concepts in Computer Science.
28 pages, PDF (1303 kB) BibTeX |
| (2011-1004) |
Milan Hladik:
Bounds on eigenvalues of complex interval matrices.
16 pages, PostScript (5464 kB) BibTeX |
| (2011-1005) |
Z. Dvorak and D. Kral':
Classes of graphs with small rank decompositions are $\chi$-bounded.
11 pages, PostScript (280 kB) BibTeX |
| (2011-1006) |
D. Kral', L. Mach, and J-S Sereni:
A new lower bound based on Gromov's method of selecting heavily covered points.
16 pages, PostScript (1104 kB) BibTeX |
| (2011-1007) |
T.H.Marshal:
Homomorphism Bounds for Oriented Planar Graphs of Given Minimum Girth.
18 pages, PostScript (319 kB) BibTeX |
| (2011-1008) |
J.Nesetril, P.Ossona de Mendez, and X.Zhu:
Colouring Edges with many Colours in Cycles.
27 pages, PDF (307 kB) BibTeX |
| (2011-1009) |
D. Kral', J-S Sereni, and L. Stacho:
Min-max relations for odd cycles in planar graphs.
21 pages, PostScript (378 kB) BibTeX |
| (2011-1010) |
A. Korman, J-S Sereni, and L. Viennot:
Toward More Localized Local Algorithms: Removing Assumptions Concerning Global Knowledge.
52 pages, PostScript (1337 kB) BibTeX |
| (2011-1011) |
T. Gavenciak, D. Kral', and S. Oum:
Deciding First Order Logic Properties of Matroids.
36 pages, PostScript (473 kB) BibTeX |
| (2011-1012) |
F. Kardos, D. Kral', and J. Volec:
Maximum edge-cuts incubic graphs with large girth and inrandom cubic graphs.
20 pages, PostScript (393 kB) BibTeX |
| (2011-1013) |
P. A. Golovach, B. Lidicky, B. Martin, and D. Paulusma:
Finding vertex-surjective graph homomorphisms.
24 pages, PDF (269 kB) BibTeX |
| (2011-1014) |
Martin Tancer:
$d$-representability of simplicial complexes of fixed dimension.
9 pages, PostScript (414 kB) BibTeX |
| (2011-1015) |
Martin Tancer:
Intersection patterns of convex sets via simplicial complexes, a survey.
29 pages, PostScript (662 kB) BibTeX |
| (2011-1017) |
R. N. Ball and A. Pultr:
Distributivity of the Normal Completion, and its Priestley Representation.
15 pages, PostScript (319 kB) BibTeX |
| (2011-1018) |
Zdenek Dvorak:
Constant-factor approximation of domination number in sparse graphs.
12 pages, PostScript (107 kB) BibTeX |
| |
| (2012-1019) |
Z. Dvorak, B. Lidicky, and B. Mohar:
$5$-choosability of graphs with crossings far apart.
56 pages, PDF (387 kB) BibTeX |
| (2012-1020) |
D. Ferguson, T. Kaiser, and D. Kral':
The fractional chromatic number of triangle-free subcubic graphs.
71 pages, PDF (527 kB) BibTeX |
| (2012-1021) |
Milan Hladik:
Weak and strong solvability of interval linear systems of equations and inequalities.
16 pages, PostScript (357 kB) BibTeX |
| (2012-1022) |
D. Kral' and O. Pikhurko:
Quasirandom permutations are characterized by 4-point densities.
12 pages, PostScript (323 kB) BibTeX |
| (2012-1023) |
J. Heuvel, D. Kral', M. Kupec, J.-S. Sereni, and J. Volec:
Extensions of Fractional Precolorings show Discontinuous Behavior.
48 pages, PostScript (771 kB) BibTeX |
| (2012-1024) |
M. Tancer and D. Tonkonog:
Good covers are algorithmically unrecognizable.
32 pages, PostScript (766 kB) BibTeX |
| (2012-1025) |
J. Cummings, D. Kral', F. Pfender, K. Sperfeld, A. Treglown, and M. Young:
Monochromatic triangles in three-coloured graphs.
27 pages, PostScript (522 kB) BibTeX |