Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKrzysztof Sornat
Person information
- affiliation: IDSIA (Dalle Molle Institute for Artificial Intelligence), Lugano, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i14]Piotr Faliszewski, Martin Lackner, Krzysztof Sornat, Stanislaw Szufa:
An Experimental Comparison of Multiwinner Voting Rules on Approval Elections. CoRR abs/2401.11870 (2024)- 2023
- [c18]Piotr Faliszewski
, Martin Lackner, Krzysztof Sornat, Stanislaw Szufa:
An Experimental Comparison of Multiwinner Voting Rules on Approval Elections. IJCAI 2023: 2675-2683 - [c17]Piotr Faliszewski, Andrzej Kaczmarczyk, Krzysztof Sornat, Stanislaw Szufa, Tomasz Was:
Diversity, Agreement, and Polarization in Elections. IJCAI 2023: 2684-2692 - [i13]Piotr Faliszewski, Andrzej Kaczmarczyk, Krzysztof Sornat, Stanislaw Szufa, Tomasz Was:
Diversity, Agreement, and Polarization in Elections. CoRR abs/2305.09780 (2023) - 2022
- [c16]Piotr Faliszewski, Krzysztof Sornat, Stanislaw Szufa:
The Complexity of Subelection Isomorphism Problems. AAAI 2022: 4991-4998 - [c15]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon:
Preserving Consistency for Liquid Knapsack Voting. EUMAS 2022: 221-238 - [c14]Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu:
Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules. IJCAI 2022: 482-488 - [c13]Stanislaw Szufa, Piotr Faliszewski, Lukasz Janeczko, Martin Lackner, Arkadii Slinko, Krzysztof Sornat, Nimrod Talmon:
How to Sample Approval Elections? IJCAI 2022: 496-502 - [i12]Stanislaw Szufa, Piotr Faliszewski, Lukasz Janeczko, Martin Lackner, Arkadii Slinko, Krzysztof Sornat, Nimrod Talmon:
How to Sample Approval Elections? CoRR abs/2207.01140 (2022) - [i11]Matthias Köppe, Martin Koutecký, Krzysztof Sornat, Nimrod Talmon:
Fine-Grained Liquid Democracy for Cumulative Ballots. CoRR abs/2208.14441 (2022) - [i10]Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jaroslaw Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely:
An O(loglog n)-Approximation for Submodular Facility Location. CoRR abs/2211.05474 (2022) - [i9]Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu:
Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules. CoRR abs/2212.14173 (2022) - 2021
- [j4]Piotr Faliszewski, Pasin Manurangsi, Krzysztof Sornat:
Approximation and hardness of Shift-Bribery. Artif. Intell. 298: 103520 (2021) - [j3]Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat:
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. Theory Comput. Syst. 65(6): 985-1008 (2021) - [j2]Georgios Amanatidis, Peter Fulla, Evangelos Markakis, Krzysztof Sornat:
Inequity aversion pricing over social networks: Approximation algorithms and hardness results. Theor. Comput. Sci. 871: 62-78 (2021) - [c12]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon:
Preserving Consistency for Liquid Knapsack Voting. AAMAS 2021: 1542-1544 - [c11]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi:
Participatory Budgeting with Project Groups. IJCAI 2021: 276-282 - [c10]Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu:
Fine-Grained Complexity and Algorithms for the Schulze Voting Method. EC 2021: 841-859 - [i8]Krzysztof Sornat, Virginia Vassilevska Williams, Yinzhan Xu:
Fine-Grained Complexity and Algorithms for the Schulze Voting Method. CoRR abs/2103.03959 (2021) - 2020
- [c9]Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Krzysztof Sornat:
Tight Approximation for Proportional Approval Voting. IJCAI 2020: 276-282 - [c8]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon:
Participatory Budgeting with Project Interactions. IJCAI 2020: 386-392 - [i7]Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi:
Participatory Budgeting with Project Groups. CoRR abs/2012.05213 (2020)
2010 – 2019
- 2019
- [c7]Piotr Faliszewski, Pasin Manurangsi, Krzysztof Sornat:
Approximation and Hardness of Shift-Bribery. AAAI 2019: 1901-1908 - [c6]Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat:
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. WAOA 2019: 138-153 - [i6]Piotr Faliszewski, Pasin Manurangsi, Krzysztof Sornat:
Approximation and Hardness of Shift-Bribery. CoRR abs/1908.10562 (2019) - 2018
- [j1]Marek Cygan, Lukasz Kowalik, Arkadiusz Socala, Krzysztof Sornat:
Approximation and Parameterized Complexity of Minimax Approval Voting. J. Artif. Intell. Res. 63: 495-513 (2018) - [c5]Jaroslaw Byrka, Piotr Skowron, Krzysztof Sornat:
Proportional Approval Voting, Harmonic k-median, and Negative Association. ICALP 2018: 26:1-26:14 - [c4]Jaroslaw Byrka, Krzysztof Sornat, Joachim Spoerhase:
Constant-factor approximation for ordered k-median. STOC 2018: 620-631 - 2017
- [c3]Marek Cygan, Lukasz Kowalik, Arkadiusz Socala, Krzysztof Sornat:
Approximation and Parameterized Complexity of Minimax Approval Voting. AAAI 2017: 459-465 - [i5]Jaroslaw Byrka, Piotr Skowron, Krzysztof Sornat:
Proportional Approval Voting, Harmonic k-median, and Negative Association. CoRR abs/1704.02183 (2017) - [i4]Jaroslaw Byrka, Krzysztof Sornat, Joachim Spoerhase:
Constant-Factor Approximation for Ordered k-Median. CoRR abs/1711.01972 (2017) - 2016
- [c2]Georgios Amanatidis, Evangelos Markakis, Krzysztof Sornat:
Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results. MFCS 2016: 9:1-9:13 - [i3]Georgios Amanatidis, Evangelos Markakis, Krzysztof Sornat:
Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results. CoRR abs/1606.06664 (2016) - [i2]Marek Cygan, Lukasz Kowalik, Arkadiusz Socala, Krzysztof Sornat:
Approximation and Parameterized Complexity of Minimax Approval Voting. CoRR abs/1607.07906 (2016) - 2014
- [c1]Jaroslaw Byrka, Krzysztof Sornat:
PTAS for Minimax Approval Voting. WINE 2014: 203-217 - [i1]Jaroslaw Byrka, Krzysztof Sornat:
PTAS for Minimax Approval Voting. CoRR abs/1407.7216 (2014)
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-02-06 23:49 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:
