Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Person
Jan Kyncl
This person is no longer with EPFL
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related publications (10)
Please note that this is not a complete list of this person’s publications. It includes only semantically relevant works. For a full list, please refer to Infoscience.
Ramsey numbers of ordered graphs
An ordered graph is a pair G = (G,
ELECTRONIC JOURNAL OF COMBINATORICS2020Simple Realizability of Complete Abstract Topological Graphs Simplified
An abstract topological graph (briefly an AT-graph) is a pair A = (G, X) where G = (V, E) is a graph and X. E2 is a set of pairs of its edges. The AT-graph A is simply realizable if G can be drawn in the plane so that each pair of edges from X crosses exac ...
SPRINGER2020The hamburger theorem
We generalize the ham sandwich theorem to d +1 measures on R-d as follows. Let mu(1), mu(2),..., mu(d+1) be absolutely continuous finite Borel measures on R-d. Let omega(i) = mu(i) (R-d) for i is an element of [d + 1], omega = min{omega(i) : i is an elemen ...
Elsevier Science Bv2018People doing similar research (22)