Katarína Cechlárová

Orcid: 0000-0002-9641-1351

According to our database1, Katarína Cechlárová authored at least 58 papers between 1990 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Parameterized complexity of candidate nomination for elections based on positional scoring rules.
Auton. Agents Multi Agent Syst., December, 2024

2023
Hardness of candidate nomination.
Auton. Agents Multi Agent Syst., October, 2023

A quest for a fair schedule: The International Young Physicists' Tournament.
J. Sched., February, 2023

2022
Selecting PhD Students and Projects with Limited Funding.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021
Stochastic modelling and simulation of a kidney transplant waiting list.
Central Eur. J. Oper. Res., 2021

2020
A quest for a fair schedule: The Young Physicists' Tournament.
CoRR, 2020

2019
Selected open problems in Matching Under Preferences.
Bull. EATCS, 2019

Chore division on a graph.
Auton. Agents Multi Agent Syst., 2019

On the Problem of Assigning PhD Grants.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018
Pareto optimal matchings of students to courses in the presence of prerequisites.
Discret. Optim., 2018

Correction to: A Connection Between Sports and Matroids: How Many Teams Can We Beat?
Algorithmica, 2018

A Connection Between Sports and Matroids: How Many Teams Can We Beat?
Algorithmica, 2018

2017
Pareto optimal matchings with lower quotas.
Math. Soc. Sci., 2017

Fair Division of a Graph.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Possible and Necessary Allocations Under Serial Dictatorship with Incomplete Preference Lists.
Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

2016
Stable Partition Problem.
Encyclopedia of Algorithms, 2016

Stable matchings of teachers to schools.
Theor. Comput. Sci., 2016

Pareto Optimal Matchings in Many-to-Many Markets with Ties.
Theory Comput. Syst., 2016

Refining the complexity of the sports elimination problem.
Discret. Appl. Math., 2016

House-swapping with divorcing and engaged pairs.
Discret. Appl. Math., 2016

2015
Modelling practical placement of trainee teachers to schools.
Central Eur. J. Oper. Res., 2015

2014
Assigning evaluators to research grant applications: the case of Slovak Research and Development Agency.
Scientometrics, 2014

Pareto optimality in many-to-many matching problems.
Discret. Optim., 2014

2013
On the existence of equitable cake divisions.
Inf. Sci., 2013

2012
On the computability of equitable divisions.
Discret. Optim., 2012

The kidney exchange problem: How hard is it to find a donor?
Ann. Oper. Res., 2012

2011
Optimization of an SMD placement machine and flows in parametric networks.
Kybernetika, 2011

An efficient implementation of the equilibrium algorithm for housing markets with duplicate houses.
Inf. Process. Lett., 2011

Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

2010
Rotations in the stable b-matching problem.
Theor. Comput. Sci., 2010

Housing Markets Through Graphs.
Algorithmica, 2010

Computing the Deficiency of Housing Markets with Duplicate Houses.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

2009
On the Complexity of the Shapley-Scarf Economy with Several Types of Goods.
Kybernetika, 2009

2008
Stable Partition Problem.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Pareto optimality in the kidney exchange problem.
Kybernetika, 2008

The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems.
Int. J. Game Theory, 2008

On the stable b-matching problem in multigraphs.
Discret. Appl. Math., 2008

2007
Inapproximability of the kidney exchange problem.
Inf. Process. Lett., 2007

2005
On a generalization of the stable roommates problem.
ACM Trans. Algorithms, 2005

The exchange-stable marriage problem.
Discret. Appl. Math., 2005

Eigenvectors of interval matrices over max-plus algebra.
Discret. Appl. Math., 2005

Pareto Optimality in House Allocation Problems.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004
Stability Of Partitions Under <i>WB</i>-Preferences And <i>BW</i>-Preferences.
Int. J. Inf. Technol. Decis. Mak., 2004

Stable partitions with W -preferences.
Discret. Appl. Math., 2004

The stable crews problem.
Discret. Appl. Math., 2004

2003
Soluble approximation of linear systems in max-plus algebra.
Kybernetika, 2003

Computational complexity of stable partitions with B-preferences.
Int. J. Game Theory, 2003

Powers of matrices over distributive lattices--a review.
Fuzzy Sets Syst., 2003

2002
On the complexity of exchange-stable roommates.
Discret. Appl. Math., 2002

2001
Efficiency and Stability in a Discrete Model of Country Formation.
J. Glob. Optim., 2001

Stability in coalition formation games.
Int. J. Game Theory, 2001

Persistency in combinatorial optimization problems on matroids.
Discret. Appl. Math., 2001

1998
Persistency in the assignment and transportation problems.
Math. Methods Oper. Res., 1998

1996
Linear independence in bottleneck algebras.
Fuzzy Sets Syst., 1996

1995
Unique solvability of max-min fuzzy equations and strong regularity of matrices over fuzzy algebra.
Fuzzy Sets Syst., 1995

Trapezoidal Matrices and the Bottleneck Assignment Problem.
Discret. Appl. Math., 1995

1991
The uniquely solvable bipartite matching problem.
Oper. Res. Lett., 1991

1990
On the monge property of matrices.
Discret. Math., 1990


  Loading...