default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrzej Kaczmarczyk 0001
Person information
- affiliation: AGH University, Kraków, Poland
- affiliation (PhD): TU Berlin, Germany
Other persons with the same name
- Andrzej Kaczmarczyk 0002 — Institute of Mathematical Machines, Warsaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk, Grzegorz Lisowski, Piotr Skowron, Stanislaw Szufa:
Strategic Cost Selection in Participatory Budgeting. AAMAS 2024: 2255-2257- [c21]Théo Delemazure, Lukasz Janeczko, Andrzej Kaczmarczyk, Stanislaw Szufa:
Selecting the Most Conflicting Pair of Candidates. IJCAI 2024: 2766-2773 - [c20]Niclas Boehmer, Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk, Grzegorz Lisowski, Grzegorz Pierczynski, Simon Rey, Dariusz Stolicki, Stanislaw Szufa, Tomasz Was:
Guide to Numerical Experiments on Elections in Computational Social Choice. IJCAI 2024: 7962-7970 - [i15]Niclas Boehmer, Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk, Grzegorz Lisowski, Grzegorz Pierczynski, Simon Rey, Dariusz Stolicki, Stanislaw Szufa, Tomasz Was:
Guide to Numerical Experiments on Elections in Computational Social Choice. CoRR abs/2402.11765 (2024) - [i14]Théo Delemazure, Lukasz Janeczko, Andrzej Kaczmarczyk, Stanislaw Szufa:
Selecting the Most Conflicting Pair of Candidates. CoRR abs/2405.05870 (2024) - [i13]Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk, Grzegorz Lisowski, Piotr Skowron, Stanislaw Szufa:
Strategic Cost Selection in Participatory Budgeting. CoRR abs/2407.18092 (2024) - 2023
- [j6]Robert Bredereck
, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse:
Improving Resource Allocations by Sharing in Pairs. J. Artif. Intell. Res. 78: 1069-1109 (2023) - [j5]Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier:
A multivariate complexity analysis of the material consumption scheduling problem. J. Sched. 26(4): 369-382 (2023) - [c19]Niclas Boehmer, Jin-Yi Cai, Piotr Faliszewski, Austen Z. Fan, Lukasz Janeczko, Andrzej Kaczmarczyk, Tomasz Was:
Properties of Position Matrices and Their Elections. AAAI 2023: 5507-5514 - [c18]Bartosz Kusek, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop:
Bribery Can Get Harder in Structured Multiwinner Approval Election. AAMAS 2023: 1725-1733 - [c17]Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. ECAI 2023: 303-310 - [c16]Piotr Faliszewski, Andrzej Kaczmarczyk, Krzysztof Sornat, Stanislaw Szufa, Tomasz Was:
Diversity, Agreement, and Polarization in Elections. IJCAI 2023: 2684-2692 - [c15]Niclas Boehmer, Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk:
Robustness of Participatory Budgeting Outcomes: Complexity and Experiments. SAGT 2023: 161-178 - [i12]Niclas Boehmer, Jin-Yi Cai, Piotr Faliszewski, Austen Z. Fan, Lukasz Janeczko, Andrzej Kaczmarczyk, Tomasz Was:
Properties of Position Matrices and Their Elections. CoRR abs/2303.02538 (2023) - [i11]Niclas Boehmer, Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk:
Robustness of Participatory Budgeting Outcomes: Complexity and Experiments. CoRR abs/2305.08125 (2023) - [i10]Piotr Faliszewski, Andrzej Kaczmarczyk, Krzysztof Sornat, Stanislaw Szufa, Tomasz Was:
Diversity, Agreement, and Polarization in Elections. CoRR abs/2305.09780 (2023) - 2022
- [j4]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
Envy-free allocations respecting social networks. Artif. Intell. 305: 103664 (2022) - [c14]Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse:
On Improving Resource Allocations by Sharing. AAAI 2022: 4875-4883 - [c13]Robert Bredereck, Till Fluschnik, Andrzej Kaczmarczyk:
When Votes Change and Committees Should (Not). IJCAI 2022: 144-150 - 2021
- [b1]Andrzej Kaczmarczyk:
Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments. Technical University of Berlin, Germany, 2021, ISBN 978-3-7983-3215-7, pp. 1-228 - [j3]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
On coalitional manipulation for multiwinner elections: shortlisting. Auton. Agents Multi Agent Syst. 35(2): 38 (2021) - [j2]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness among multiwinner voting rules. Artif. Intell. 290: 103403 (2021) - [c12]Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier:
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. AAAI 2021: 11755-11763 - [c11]Robert Bredereck, Aleksander Figiel, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation Made More Practical. AAMAS 2021: 260-268 - [i9]Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, Rolf Niedermeier:
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem. CoRR abs/2102.13642 (2021) - [i8]Robert Bredereck, Andrzej Kaczmarczyk, Junjie Luo, Rolf Niedermeier, Florian Sachse:
On Improving Resource Allocations by Sharing. CoRR abs/2112.07525 (2021) - 2020
- [c10]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
Parameterized Algorithms for Finding a Collective Set of Items. AAAI 2020: 1838-1845 - [c9]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
Electing Successive Committees: Complexity and Algorithms. AAAI 2020: 1846-1853 - [c8]Robert Bredereck, Piotr Faliszewski, Michal Furdyna, Andrzej Kaczmarczyk, Martin Lackner:
Strategic Campaign Management in Apportionment Elections. IJCAI 2020: 103-109 - [c7]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier:
Line-Up Elections: Parallel Voting with Shared Candidate Pool. SAGT 2020: 275-290 - [i7]Robert Bredereck, Till Fluschnik, Andrzej Kaczmarczyk:
Multistage Committee Election. CoRR abs/2005.02300 (2020) - [i6]Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. CoRR abs/2005.04907 (2020) - [i5]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier:
Line-Up Elections: Parallel Voting with Shared Candidate Pool. CoRR abs/2007.04960 (2020) - [i4]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
Envy-Free Allocations Respecting Social Networks. CoRR abs/2011.11596 (2020)
2010 – 2019
- 2019
- [j1]Andrzej Kaczmarczyk, Piotr Faliszewski:
Algorithms for destructive shift bribery. Auton. Agents Multi Agent Syst. 33(3): 275-297 (2019) - [c6]Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming. EC 2019: 505-523 - [c5]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier:
An Experimental View on Committees Providing Justified Representation. IJCAI 2019: 109-115 - 2018
- [c4]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
Envy-Free Allocations Respecting Social Networks. AAMAS 2018: 283-291 - [i3]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
On Coalitional Manipulation for Multiwinner Elections: Shortlisting. CoRR abs/1806.10460 (2018) - [i2]Andrzej Kaczmarczyk, Piotr Faliszewski:
Algorithms for Destructive Shift Bribery. CoRR abs/1810.01763 (2018) - 2017
- [c3]Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier:
On Coalitional Manipulation for Multiwinner Elections: Shortlisting. IJCAI 2017: 887-893 - [c2]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness Among Multiwinner Voting Rules. SAGT 2017: 80-92 - [i1]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness Among Multiwinner Voting Rules. CoRR abs/1707.01417 (2017) - 2016
- [c1]Andrzej Kaczmarczyk, Piotr Faliszewski:
Algorithms for Destructive Shift Bribery. AAMAS 2016: 305-313
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-10-21 20:29 CEST 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:
