2 papers
math.CO2005
Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs
Marcos Kiwi, Martin Loebl
We address the following question: When a randomly chosen regular bipartite multi--graph is drawn in the plane in the ``standard way'', what is the distribution of its maximum size…
math.CO2003
Expected length of the longest common subsequence for large alphabets
Marcos Kiwi, Martin Loebl, Jiri Matousek
We consider the length L of the longest common subsequence of two randomly uniformly and independently chosen n character words over a k-ary alphabet. Subadditivity arguments yield…