#	Pagina
attuale pagina	/open-h2020/projects/195940/index.html

Opendata, web and dolomites

CovDecRND

Cover-decomposition of multiple coverings under conditions involving randomness

Total Cost €

EC-Contrib. €

Partnership

Views

Outcomes and
results

CovDecRND project word cloud

Explore the words cloud of the CovDecRND project. It provides you a very rough idea of what is the project "CovDecRND" about.

colorings davenport discovered cover random 1986 abstract perturbations first coverings notions besides pach papers active published breakthrough initiated geometry theoretical additional decomposability fejes geometric polychromatic area ago families life toth combinatorial practical multiple

Project "CovDecRND" data sheet

The following table provides information about the project.

Coordinator	THE CHANCELLOR MASTERS AND SCHOLARSOF THE UNIVERSITY OF CAMBRIDGE Organization address address: TRINITY LANE THE OLD SCHOOLS city: CAMBRIDGE postcode: CB2 1TN website: www.cam.ac.uk contact info title: n.a. name: n.a. surname: n.a. function: n.a. email: n.a. telephone: n.a. fax: n.a.
Coordinator Country	United Kingdom [UK]
Project website	http://web.cs.elte.hu/
Total cost	195˙454 €
EC max contribution	195˙454 € (100%)
Programme	1. H2020-EU.1.3.2. (Nurturing excellence by means of cross-border and cross-sector mobility)
Code Call	H2020-MSCA-IF-2014
Funding Scheme	MSCA-IF-EF-ST
Starting year	2015
Duration (year-month-day)	from 2015-09-01 to 2017-08-31

Partnership

Take a look of project's partnership.

#	participants	country	role	EC contrib. [€]
1	THE CHANCELLOR MASTERS AND SCHOLARSOF THE UNIVERSITY OF CAMBRIDGE THE CHANCELLOR MASTERS AND SCHOLARSOF THE UNIVERSITY OF CAMBRIDGE Organization address address: TRINITY LANE THE OLD SCHOOLS city: CAMBRIDGE postcode: CB2 1TN website: www.cam.ac.uk contact info title: n.a. name: n.a. surname: n.a. function: n.a. email: n.a. telephone: n.a. fax: n.a.	UK (CAMBRIDGE)	coordinator	195˙454.00

Map

Project objective

Combinatorial geometry is a very active field where most problems have real life applications. The study of multiple coverings was initiated by Davenport and L. Fejes Toth 50 years ago. In 1986 J. Pach published the first papers about decomposability of multiple coverings. It was discovered recently that besides its theoretical interest, this area has important practical applications. Now there is a great activity in this field with several breakthrough results. The goal of this proposal is to study cover-decomposability, polychromatic colorings and related notions for different geometric and abstract families of sets under various additional conditions, especially random perturbations.

Publications

List of publications.
year	authors and title	journal	last update
2017	BalÃ¡zs Keszegh and DÃ¶mÃ¶tÃ¶r PÃ¡lvÃ¶lgyi Proper Coloring of Geometric Hypergraphs published pages: 47:1--47:15, ISSN: , DOI: 10.4230/LIPIcs.SoCG.2017.47	33rd International Symposium on Computational Geometry (SoCG 2017) Leibniz International Proceedin	2019-07-24
2016	DÃ¡niel Gerbner, BalÃ¡zs Keszegh, Cory Palmer, DÃ¶mÃ¶tÃ¶r PÃ¡lvÃ¶lgyi Topological orderings of weighted directed acyclic graphs published pages: 564-568, ISSN: 0020-0190, DOI: 10.1016/j.ipl.2016.04.007	Information Processing Letters 116/9	2019-07-24
2016	JÃ¡nos Pach, DÃ¶mÃ¶tÃ¶r PÃ¡lvÃ¶lgyi Unsplittable coverings in the plane published pages: 433-457, ISSN: 0001-8708, DOI: 10.1016/j.aim.2016.07.011	Advances in Mathematics 302	2019-07-24
2017	DÃ¡niel Gerbner, BalÃ¡zs Keszegh, DÃ¶mÃ¶tÃ¶r PÃ¡lvÃ¶lgyi, GÃ¼nter Rote, GÃ¡bor Wiener Search for the end of a path in the d-dimensional grid and in other graphs published pages: 301-314, ISSN: 1855-3974, DOI:	ARS MATHEMATICA CONTEMPORANEA, [S.l.], v. 12, n. 2, p. 301-314, jan. 2017. ISSN 12	2019-07-24
2017	DÃ¶mÃ¶tÃ¶r PÃ¡lvÃ¶lgyi All or Nothing Caching Games with Bounded Queries published pages: , ISSN: 0219-1989, DOI: 10.1142/s0219198917500232	International Game Theory Review to appear	2019-07-24
2017	Radoslav Fulek, Jan KynÄl, DÃ¶mÃ¶tÃ¶r PÃ¡lvÃ¶lgyi Unified Hananiâ€“Tutte Theorem published pages: 3:1-3:8, ISSN: 1077-8926, DOI:	Electronic Journal of Combinatorics, 24(3):1-8, 2017 24	2019-07-24
2017	ABHISHEK METHUKU, DÃ–MÃ–TÃ–R PÃLVÃ–LGYI Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems published pages: 593-602, ISSN: 0963-5483, DOI: 10.1017/s0963548317000013	Combinatorics, Probability and Computing 26/04	2019-07-24

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "COVDECRND" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "COVDECRND" are provided by the European Opendata Portal: CORDIS opendata.