Výsledky vyhledávání

From Matching with Diversity Constraints to Matching with Regional Quotas

Autor: Aziz, H., ZHAOHONG SUN, Gaspers, S., Walsh, T.

Publikováno v: Scopus-Elsevier

In the past few years, several new matching models have been proposed and studied that take into account complex distributional constraints. Relevant lines of work include (1) school choice with diversity constraints where students have (possibly ove

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ca6f9f0c6187b3ad1e8a83d2fa98c28

Zobrazit plný text záznamu

Cluster Editing with Vertex Splitting

Autor: Abu-Khzam, FN, Egan, J, Gaspers, S, Shaw, A, Shaw, P

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______363::5908a231c579eec5c827f7e3bcecb115
https://hdl.handle.net/10453/127087

Zobrazit plný text záznamu

Stable Matching with Uncertain Pairwise Preferences

Autor: Aziz, H., Biró, P., Fleiner, T., Gaspers, S., de Haan, R., Mattei, N., Rastegari, B., Das, S., Durfee, E., Larson, K., Winikoff, M.

Publikováno v: AAMAS '17: proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems : May, 8-12, 2017, São Paulo, Brazil, 1, 344-352

We study a two-sided matching problem where the agents have independent pairwise preferences on their possible partners and these preferences may be uncertain. In this case, the certainly preferred part of an agent's preferences may admit a cycle and

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::733f9e53014836f94d18b696dc6ff135
https://dare.uva.nl/personal/pure/en/publications/stable-matching-with-uncertain-pairwise-preferences(2b4ac0b2-3470-4008-8fb7-a4ddbe337cdc).html

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Backdoors into heterogeneous classes of SAT and CSP

Autor: Gaspers, S., Misra, N., Ordyniak, S., Szeider, S., Zivny, S.

Publikováno v: Journal of Computer and System Sciences. 85

In this paper we extend the classical notion of strong and weak backdoor sets for SAT and CSP by allowing that different instantiations of the backdoor variables result in instances that belong to different base classes; the union of the base classes

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f96afc27903476d43ca9b127cd40ba1
http://ora.ox.ac.uk/objects/uuid:

Zobrazit plný text záznamu

Computational Aspects of Multi-Winner Approval Voting

Autor: Aziz, H., Gaspers, S., Joachim Gudmundsson, Mackenzie, S., Mattei, N., Walsh, T.

Publikováno v: Scopus-Elsevier

We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show that computi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::67bab4c16e45d246bb3e02999e6de598
http://arxiv.org/abs/1407.3247

Zobrazit plný text záznamu

Conference

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Feedback vertex sets in tournaments

Autor: Gaspers, S., Mnich, M., Berg, de, M., Meyer, U.

Publikováno v: Journal of Graph Theory, 72(1), 72-89. Wiley-Liss Inc.
Algorithms-ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I, 267-277
STARTPAGE=267;ENDPAGE=277;TITLE=Algorithms-ESA 2010
Algorithms-ESA 2010 (18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings), 1, 267-277
Algorithms – ESA 2010 ISBN: 9783642157745
ESA (1)

We study combinatorial and algorithmic questions around minimal feedback vertex sets in tournament graphs. On the combinatorial side, we derive strong upper and lower bounds on the maximum number of minimal feedback vertex sets in an n-vertex tournam

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3bc213581a3aec0d16ac4f030c0826cf
https://research.tue.nl/nl/publications/cbaf1be2-82b1-4c9e-bd82-f68940ff122b

Zobrazit plný text záznamu

On feedback vertex sets in tournaments

Autor: Gaspers, S., Mnich, M.

A tournament T is an orientation of a complete graph, and a feedback vertex set of T is a subset of vertices intersecting every directed cycle of T. We prove that every tournament on n vertices has at most 1:6740n minimal feedback vertex sets and som

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::7ee75de8ff681a91742d63b0578643d1
https://research.tue.nl/nl/publications/7c23b589-49d9-441f-bbc1-0df1fd320619

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání