10 citations · 10 across the 4 of their papers we have counts for
6 papers
A quest for a fair schedule: The Young Physicists' Tournament
Katarína Cechlárová, Ágnes Cseh, Zsuzsanna Jankó +2
The Young Physicists Tournament is an established team-oriented scientific competition between high school students from 37 countries on 5 continents. The competition consists of s…
Chore division on a graph
Sylvain Bouveret, Katarína Cechlárová, Julien Lesca
The paper considers fair allocation of indivisible nondisposable items that generate disutility (chores). We assume that these items are placed in the vertices of a graph and each…
Fair Division of a Graph
Sylvain Bouveret, Katarína Cechlárová, Edith Elkind +2
We consider fair allocation of indivisible items under an additional constraint: there is an undirected graph describing the relationship between the items, and each agent's share…
Pareto optimal matchings of students to courses in the presence of prerequisites
Katarina Cechlarova, Bettina Klaus, David F. Manlove
We consider the problem of allocating applicants to courses, where each applicant has a subset of acceptable courses that she ranks in strict order of preference. Each applicant an…
Pareto Optimal Matchings in Many-to-Many Markets with Ties
Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner +5
We consider Pareto-optimal matchings (POMs) in a many-to-many market of applicants and courses where applicants have preferences, which may include ties, over individual courses an…
Stable matchings of teachers to schools
Katarina Cechlarova, Tamas Fleiner, David F. Manlove +1
Several countries successfully use centralized matching schemes for school or higher education assignment, or for entry-level labour markets. In this paper we explore the computati…