default search action
Katarína Cechlárová
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j48]Ildikó Schlotter, Katarína Cechlárová, Diana Trellová:
Parameterized complexity of candidate nomination for elections based on positional scoring rules. Auton. Agents Multi Agent Syst. 38(2): 28 (2024) - 2023
- [j47]Katarína Cechlárová, Julien Lesca, Diana Trellová, Martina Hancová
, Jozef Hanc:
Hardness of candidate nomination. Auton. Agents Multi Agent Syst. 37(2): 37 (2023) - [j46]Katarína Cechlárová
A quest for a fair schedule: The International Young Physicists' Tournament. J. Sched. 26(1): 3-18 (2023) - 2022
- [c9]Jatin Jindal, Jérôme Lang, Katarína Cechlárová, Julien Lesca:
Selecting PhD Students and Projects with Limited Funding. AAMAS 2022: 687-695 - 2021
- [j45]Katarína Cechlárová
Stochastic modelling and simulation of a kidney transplant waiting list. Central Eur. J. Oper. Res. 29(3): 909-931 (2021) - 2020
- [i6]Katarína Cechlárová, Ágnes Cseh, Zsuzsanna Jankó, Marián Kires, Lukás Mino:
A quest for a fair schedule: The Young Physicists' Tournament. CoRR abs/2006.02184 (2020)
2010 – 2019
- 2019
- [j44]Sylvain Bouveret
Chore division on a graph. Auton. Agents Multi Agent Syst. 33(5): 540-563 (2019) - [j43]Katarína Cechlárová, Ágnes Cseh, David F. Manlove:
Selected open problems in Matching Under Preferences. Bull. EATCS 128 (2019) - [c8]Katarína Cechlárová
On the Problem of Assigning PhD Grants. IJCAI 2019: 130-136 - 2018
- [j42]Ildikó Schlotter
A Connection Between Sports and Matroids: How Many Teams Can We Beat? Algorithmica 80(1): 258-278 (2018) - [j41]Ildikó Schlotter
Correction to: A Connection Between Sports and Matroids: How Many Teams Can We Beat? Algorithmica 80(11): 3428-3430 (2018) - [j40]Katarína Cechlárová
Pareto optimal matchings of students to courses in the presence of prerequisites. Discret. Optim. 29: 174-195 (2018) - [i5]Sylvain Bouveret, Katarína Cechlárová, Julien Lesca:
Chore division on a graph. CoRR abs/1812.01856 (2018) - 2017
- [j39]Katarína Cechlárová
Pareto optimal matchings with lower quotas. Math. Soc. Sci. 88: 3-10 (2017) - [c7]Katarína Cechlárová
Possible and Necessary Allocations Under Serial Dictatorship with Incomplete Preference Lists. ADT 2017: 300-314 - [c6]Sylvain Bouveret, Katarína Cechlárová
Fair Division of a Graph. IJCAI 2017: 135-141 - [i4]Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, Dominik Peters:
Fair Division of a Graph. CoRR abs/1705.10239 (2017) - 2016
- [j38]Katarína Cechlárová
Refining the complexity of the sports elimination problem. Discret. Appl. Math. 199: 172-186 (2016) - [j37]Katarína Cechlárová
House-swapping with divorcing and engaged pairs. Discret. Appl. Math. 206: 1-8 (2016) - [j36]Katarína Cechlárová
Pareto Optimal Matchings in Many-to-Many Markets with Ties. Theory Comput. Syst. 59(4): 700-721 (2016) - [j35]Katarína Cechlárová
Stable matchings of teachers to schools. Theor. Comput. Sci. 653: 15-25 (2016) - [r2]Katarína Cechlárová:
Stable Partition Problem. Encyclopedia of Algorithms 2016: 2075-2078 - [i3]Katarína Cechlárová, Bettina Klaus, David F. Manlove:
Pareto optimal matchings of students to courses in the presence of prerequisites. CoRR abs/1603.00858 (2016) - 2015
- [j34]Katarína Cechlárová
Modelling practical placement of trainee teachers to schools. Central Eur. J. Oper. Res. 23(3): 547-562 (2015) - [c5]Katarína Cechlárová
Pareto Optimal Matchings in Many-to-Many Markets with Ties. SAGT 2015: 27-39 - [i2]Katarína Cechlárová, Tamás Fleiner, David F. Manlove, Iain McBride:
Stable matchings of teachers to schools. CoRR abs/1501.05547 (2015) - [i1]Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Ioannis Mourtos, Eva Oceláková, Baharak Rastegari:
Pareto Optimal Matchings in Many-to-Many Markets with Ties. CoRR abs/1507.02866 (2015) - 2014
- [j33]Katarína Cechlárová
Pareto optimality in many-to-many matching problems. Discret. Optim. 14: 160-169 (2014) - [j32]Katarína Cechlárová
Assigning evaluators to research grant applications: the case of Slovak Research and Development Agency. Scientometrics 99(2): 495-506 (2014) - 2013
- [j31]Katarína Cechlárová
On the existence of equitable cake divisions. Inf. Sci. 228: 239-245 (2013) - 2012
- [j30]Katarína Cechlárová
The kidney exchange problem: How hard is it to find a donor? Ann. Oper. Res. 193(1): 255-271 (2012) - [j29]Katarína Cechlárová
On the computability of equitable divisions. Discret. Optim. 9(4): 249-257 (2012) - 2011
- [j28]Katarína Cechlárová
An efficient implementation of the equilibrium algorithm for housing markets with duplicate houses. Inf. Process. Lett. 111(13): 667-670 (2011) - [j27]Katarína Cechlárová, Tamás Fleiner:
Optimization of an SMD placement machine and flows in parametric networks. Kybernetika 47(5): 722-731 (2011) - [c4]Katarína Cechlárová
Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses. WG 2011: 95-106 - 2010
- [j26]Katarína Cechlárová
Housing Markets Through Graphs. Algorithmica 58(1): 19-33 (2010) - [j25]Viera Borbel'ová, Katarína Cechlárová
Rotations in the stable b-matching problem. Theor. Comput. Sci. 411(16-18): 1750-1762 (2010) - [c3]Katarína Cechlárová
Computing the Deficiency of Housing Markets with Duplicate Houses. IPEC 2010: 72-83
2000 – 2009
- 2009
- [j24]Katarína Cechlárová:
On the Complexity of the Shapley-Scarf Economy with Several Types of Goods. Kybernetika 45(5): 689-700 (2009) - 2008
- [j23]Viera Borbel'ová, Katarína Cechlárová
On the stable b-matching problem in multigraphs. Discret. Appl. Math. 156(5): 673-684 (2008) - [j22]Péter Biró, Katarína Cechlárová
The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems. Int. J. Game Theory 36(3-4): 333-352 (2008) - [j21]Viera Borbel'ová, Katarína Cechlárová:
Pareto optimality in the kidney exchange problem. Kybernetika 44(3): 373-384 (2008) - [r1]Katarína Cechlárová:
Stable Partition Problem. Encyclopedia of Algorithms 2008 - 2007
- [j20]Péter Biró, Katarína Cechlárová
Inapproximability of the kidney exchange problem. Inf. Process. Lett. 101(5): 199-202 (2007) - 2005
- [j19]Katarína Cechlárová
Eigenvectors of interval matrices over max-plus algebra. Discret. Appl. Math. 150(1-3): 2-15 (2005) - [j18]Katarína Cechlárová
The exchange-stable marriage problem. Discret. Appl. Math. 152(1-3): 109-122 (2005) - [j17]Katarína Cechlárová
On a generalization of the stable roommates problem. ACM Trans. Algorithms 1(1): 143-156 (2005) - [c2]David J. Abraham, Katarína Cechlárová
Pareto Optimality in House Allocation Problems. ISAAC 2005: 1163-1175 - 2004
- [j16]Katarína Cechlárová
Stable partitions with W -preferences. Discret. Appl. Math. 138(3): 333-347 (2004) - [j15]Katarína Cechlárová
The stable crews problem. Discret. Appl. Math. 140(1-3): 1-17 (2004) - [j14]Katarína Cechlárová, Jana Hajduková:
Stability Of Partitions Under WB-Preferences And BW-Preferences. Int. J. Inf. Technol. Decis. Mak. 3(4): 605-618 (2004) - [c1]David J. Abraham, Katarína Cechlárová
Pareto Optimality in House Allocation Problems. ISAAC 2004: 3-15 - 2003
- [j13]Katarína Cechlárová
Powers of matrices over distributive lattices--a review. Fuzzy Sets Syst. 138(3): 627-641 (2003) - [j12]Katarína Cechlárová
Computational complexity of stable partitions with B-preferences. Int. J. Game Theory 31(3): 353-364 (2003) - [j11]Katarína Cechlárová, Raymond A. Cuninghame-Green:
Soluble approximation of linear systems in max-plus algebra. Kybernetika 39(2): 137-141 (2003) - 2002
- [j10]Katarína Cechlárová:
On the complexity of exchange-stable roommates. Discret. Appl. Math. 116(3): 279-287 (2002) - 2001
- [j9]Katarína Cechlárová
Persistency in combinatorial optimization problems on matroids. Discret. Appl. Math. 110(2-3): 121-132 (2001) - [j8]Katarína Cechlárová
Stability in coalition formation games. Int. J. Game Theory 29(4): 487-494 (2001) - [j7]Katarína Cechlárová
Efficiency and Stability in a Discrete Model of Country Formation. J. Glob. Optim. 20(3-4): 239-256 (2001)
1990 – 1999
- 1998
- [j6]Katarína Cechlárová
Persistency in the assignment and transportation problems. Math. Methods Oper. Res. 47(2): 243-254 (1998) - 1996
- [j5]Katarína Cechlárová
Linear independence in bottleneck algebras. Fuzzy Sets Syst. 77(3): 337-348 (1996) - 1995
- [j4]Katarína Cechlárová
Trapezoidal Matrices and the Bottleneck Assignment Problem. Discret. Appl. Math. 58(2): 111-116 (1995) - [j3]Katarína Cechlárová
Unique solvability of max-min fuzzy equations and strong regularity of matrices over fuzzy algebra. Fuzzy Sets Syst. 75(2): 165-177 (1995) - 1991
- [j2]Katarína Cechlárová
The uniquely solvable bipartite matching problem. Oper. Res. Lett. 10(4): 221-224 (1991) - 1990
- [j1]Katarína Cechlárová
On the monge property of matrices. Discret. Math. 81(2): 123-128 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: