default search action
Piotr Faliszewski
Person information
- affiliation: AGH University of Science and Technology, Krakow, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j52]Piotr Faliszewski, Krzysztof Sornat
, Stanislaw Szufa
The Complexity of Subelection Isomorphism Problems. J. Artif. Intell. Res. 80: 1343-1371 (2024) - [j51]Edith Elkind
The Price of Justified Representation. ACM Trans. Economics and Comput. 12(3): 11:1-11:27 (2024) - [c117]Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk, Grzegorz Lisowski, Piotr Skowron, Stanislaw Szufa:
Strategic Cost Selection in Participatory Budgeting. AAMAS 2024: 2255-2257 - [c116]Manon Revel, Niclas Boehmer, Rachael Colley, Markus Brill, Piotr Faliszewski, Edith Elkind:
Selecting Representative Bodies: An Axiomatic View. AAMAS 2024: 2701-2705 - [c115]Niclas Boehmer, Piotr Faliszewski, Lukasz Janeczko, Dominik Peters, Grzegorz Pierczynski, Simon Schierreich, Piotr Skowron, Stanislaw Szufa:
Evaluation of Project Performance in Participatory Budgeting. IJCAI 2024: 2678-2686 - [c114]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 - [i74]Piotr Faliszewski, Martin Lackner, Krzysztof Sornat, Stanislaw Szufa:
An Experimental Comparison of Multiwinner Voting Rules on Approval Elections. CoRR abs/2401.11870 (2024) - [i73]Niclas Boehmer, Piotr Faliszewski, Sonja Kraiczy:
Properties of the Mallows Model Depending on the Number of Alternatives: A Warning for an Experimentalist. CoRR abs/2401.14562 (2024) - [i72]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) - [i71]Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk, Grzegorz Lisowski, Piotr Skowron, Stanislaw Szufa:
Strategic Cost Selection in Participatory Budgeting. CoRR abs/2407.18092 (2024) - 2023
- [j50]Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon:
Correction to: Opinion diffusion and campaigning on society graphs. J. Log. Comput. 33(3): 706 (2023) - [j49]Edith Elkind, Piotr Faliszewski
Justifying groups in multiwinner approval voting. Theor. Comput. Sci. 969: 114039 (2023) - [c113]Niclas Boehmer, Jin-Yi Cai, Piotr Faliszewski
Properties of Position Matrices and Their Elections. AAAI 2023: 5507-5514 - [c112]Bartosz Kusek, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop:
Bribery Can Get Harder in Structured Multiwinner Approval Election. AAMAS 2023: 1725-1733 - [c111]Niclas Boehmer, Piotr Faliszewski, Sonja Kraiczy:
Properties of the Mallows Model Depending on the Number of Alternatives: A Warning for an Experimentalist. ICML 2023: 2689-2711 - [c110]Piotr Faliszewski
Participatory Budgeting: Data, Tools and Analysis. IJCAI 2023: 2667-2674 - [c109]Piotr Faliszewski
An Experimental Comparison of Multiwinner Voting Rules on Approval Elections. IJCAI 2023: 2675-2683 - [c108]Piotr Faliszewski
Diversity, Agreement, and Polarization in Elections. IJCAI 2023: 2684-2692 - [c107]Lukasz Janeczko, Piotr Faliszewski
Ties in Multiwinner Approval Voting. IJCAI 2023: 2765-2773 - [c106]Niclas Boehmer, Piotr Faliszewski
Robustness of Participatory Budgeting Outcomes: Complexity and Experiments. SAGT 2023: 161-178 - [i70]Niclas Boehmer, Jin-Yi Cai, Piotr Faliszewski, Austen Z. Fan, Lukasz Janeczko
Properties of Position Matrices and Their Elections. CoRR abs/2303.02538 (2023) - [i69]Manon Revel, Niclas Boehmer, Rachael Colley, Markus Brill, Piotr Faliszewski, Edith Elkind:
Selecting Representative Bodies: An Axiomatic View. CoRR abs/2304.02774 (2023) - [i68]Lukasz Janeczko
Ties in Multiwinner Approval Voting. CoRR abs/2305.01769 (2023) - [i67]Niclas Boehmer, Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk:
Robustness of Participatory Budgeting Outcomes: Complexity and Experiments. CoRR abs/2305.08125 (2023) - [i66]Piotr Faliszewski, Andrzej Kaczmarczyk, Krzysztof Sornat, Stanislaw Szufa, Tomasz Was:
Diversity, Agreement, and Polarization in Elections. CoRR abs/2305.09780 (2023) - [i65]Piotr Faliszewski, Jaroslaw Flis, Dominik Peters, Grzegorz Pierczynski, Piotr Skowron, Dariusz Stolicki, Stanislaw Szufa, Nimrod Talmon:
Participatory Budgeting: Data, Tools, and Analysis. CoRR abs/2305.11035 (2023) - [i64]Niclas Boehmer, Piotr Faliszewski, Lukasz Janeczko, Dominik Peters, Grzegorz Pierczynski, Simon Schierreich
Evaluation of Project Performance in Participatory Budgeting. CoRR abs/2312.14723 (2023) - 2022
- [j48]Piotr Faliszewski
The complexity of election problems with group-separable preferences. Auton. Agents Multi Agent Syst. 36(1): 18 (2022) - [j47]Piotr Faliszewski
Opinion diffusion and campaigning on society graphs. J. Log. Comput. 32(6): 1162-1194 (2022) - [c105]Edith Elkind, Piotr Faliszewski
The Price of Justified Representation. AAAI 2022: 4983-4990 - [c104]Piotr Faliszewski
The Complexity of Subelection Isomorphism Problems. AAAI 2022: 4991-4998 - [c103]Lukasz Janeczko, Piotr Faliszewski
The Complexity of Proportionality Degree in Committee Elections. AAAI 2022: 5092-5099 - [c102]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski
A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners. EAAMO 2022: 7:1-7:10 - [c101]Piotr Faliszewski
Robustness of Greedy Approval Rules. EUMAS 2022: 116-133 - [c100]Grzegorz Gawron, Piotr Faliszewski
Using Multiwinner Voting to Search for Movies. EUMAS 2022: 134-151 - [c99]Niclas Boehmer, Piotr Faliszewski
Understanding Distance Measures Among Elections. IJCAI 2022: 102-108 - [c98]Stanislaw Szufa
How to Sample Approval Elections? IJCAI 2022: 496-502 - [c97]Niclas Boehmer, Robert Bredereck, Edith Elkind, Piotr Faliszewski, Stanislaw Szufa:
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning. NeurIPS 2022 - [c96]Edith Elkind, Piotr Faliszewski
Justifying Groups in Multiwinner Approval Voting. SAGT 2022: 472-489 - [e2]Piotr Faliszewski, Viviana Mascardi, Catherine Pelachaud, Matthew E. Taylor:
21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022, Auckland, New Zealand, May 9-13, 2022. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS) 2022, ISBN 978-1-4503-9213-6 [contents] - [i63]Grzegorz Gawron, Piotr Faliszewski:
Using Multiwinner Voting to Search for Movies. CoRR abs/2202.03385 (2022) - [i62]Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa, Tomasz Was:
Understanding Distance Measures Among Elections. CoRR abs/2205.00492 (2022) - [i61]Niclas Boehmer, Robert Bredereck, Edith Elkind, Piotr Faliszewski, Stanislaw Szufa:
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning. CoRR abs/2205.07831 (2022) - [i60]Stanislaw Szufa, Piotr Faliszewski, Lukasz Janeczko
How to Sample Approval Elections? CoRR abs/2207.01140 (2022) - [i59]Lukasz Janeczko
The Complexity of Proportionality Degree in Committee Elections. CoRR abs/2207.03518 (2022) - [i58]Piotr Faliszewski, Grzegorz Gawron, Bartosz Kusek:
Robustness of Greedy Approval Rules. CoRR abs/2208.00750 (2022) - [i57]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier:
A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners. CoRR abs/2208.13760 (2022) - [i56]Bartosz Kusek, Robert Bredereck, Piotr Faliszewski:
Bribery Can Get Harder in Structured Multiwinner Approval Election. CoRR abs/2209.00368 (2022) - 2021
- [j46]Robert Bredereck
Robustness among multiwinner voting rules. Artif. Intell. 290: 103403 (2021) - [j45]Piotr Faliszewski
Approximation and hardness of Shift-Bribery. Artif. Intell. 298: 103520 (2021) - [j44]Robert Bredereck, Piotr Faliszewski
Complexity of Shift Bribery in Committee Elections. ACM Trans. Comput. Theory 13(3): 20:1-20:25 (2021) - [c95]Michal Tomasz Godziszewski, Pawel Batko, Piotr Skowron
An Analysis of Approval-Based Committee Rules for 2D-Euclidean Elections. AAAI 2021: 5448-5455 - [c94]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski
Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments. IJCAI 2021: 52-58 - [c93]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski
Putting a Compass on the Map of Elections. IJCAI 2021: 59-65 - [i55]Piotr Faliszewski, Piotr Skowron, Nimrod Talmon:
Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules. CoRR abs/2104.09130 (2021) - [i54]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa:
Putting a Compass on the Map of Elections. CoRR abs/2105.07815 (2021) - [i53]Stanislaw Szufa, Piotr Faliszewski:
The Complexity of Subelection Isomorphism Problems. CoRR abs/2105.11923 (2021) - [i52]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Justifying Groups in Multiwinner Approval Voting. CoRR abs/2108.12949 (2021) - [i51]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
The Price of Justified Representation. CoRR abs/2112.05994 (2021) - 2020
- [j43]Edith Elkind, Piotr Faliszewski
A characterization of the single-peaked single-crossing domain. Soc. Choice Welf. 54(1): 167-181 (2020) - [j42]Robert Bredereck, Piotr Faliszewski
Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting. Theor. Comput. Sci. 814: 86-105 (2020) - [c92]Robert Bredereck, Piotr Faliszewski
Parameterized Algorithms for Finding a Collective Set of Items. AAAI 2020: 1838-1845 - [c91]Svetlana Obraztsova, Edith Elkind, Piotr Faliszewski
On Swap Convexity of Voting Rules. AAAI 2020: 1910-1917 - [c90]Edith Elkind, Piotr Faliszewski, Sushmita Gupta, Sanjukta Roy:
Algorithms for Swap and Shift Bribery in Structured Elections. AAMAS 2020: 366-374 - [c89]Stanislaw Szufa, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Drawing a Map of Elections in the Space of Statistical Cultures. AAMAS 2020: 1341-1349 - [c88]Piotr Faliszewski
Isomorphic Distances Among Elections. CSR 2020: 64-78 - [c87]Piotr Faliszewski
Multiwinner Rules with Variable Number of Winners. ECAI 2020: 67-74 - [c86]Robert Bredereck, Piotr Faliszewski
Strategic Campaign Management in Apportionment Elections. IJCAI 2020: 103-109 - [c85]Piotr Faliszewski
The Complexity of Election Problems with Group-Separable Preferences. IJCAI 2020: 203-209 - [c84]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski
Line-Up Elections: Parallel Voting with Shared Candidate Pool. SAGT 2020: 275-290 - [i50]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier:
Line-Up Elections: Parallel Voting with Shared Candidate Pool. CoRR abs/2007.04960 (2020) - [i49]Piotr Faliszewski, Rica Gonen, Martin Koutecký, Nimrod Talmon:
Opinion Diffusion and Campaigning on Society Graphs. CoRR abs/2010.00651 (2020) - [i48]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier:
On the Robustness of Winners: Counting Briberies in Elections. CoRR abs/2010.09678 (2020)
2010 – 2019
- 2019
- [j41]Andrzej Kaczmarczyk
Algorithms for destructive shift bribery. Auton. Agents Multi Agent Syst. 33(3): 275-297 (2019) - [j40]Krzysztof Magiera, Piotr Faliszewski
Recognizing Top-Monotonic Preference Profiles in Polynomial Time. J. Artif. Intell. Res. 66: 57-84 (2019) - [j39]Piotr Skowron
Axiomatic characterization of committee scoring rules. J. Econ. Theory 180: 244-273 (2019) - [j38]Piotr Faliszewski
Committee Scoring Rules: Axiomatic Characterization and Hierarchy. ACM Trans. Economics and Comput. 7(1): 3:1-3:39 (2019) - [c83]Piotr Faliszewski, Pasin Manurangsi, Krzysztof Sornat
Approximation and Hardness of Shift-Bribery. AAAI 2019: 1901-1908 - [c82]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanislaw Szufa, Nimrod Talmon:
How Similar Are Two Elections? AAAI 2019: 1909-1916 - [c81]Nimrod Talmon, Piotr Faliszewski:
A Framework for Approval-Based Budgeting Methods. AAAI 2019: 2181-2188 - [c80]Grzegorz Gawron, Piotr Faliszewski
Robustness of Approval-Based Multiwinner Voting Rules. ADT 2019: 17-31 - [c79]Markus Brill, Piotr Faliszewski, Frank Sommer, Nimrod Talmon:
Approximation Algorithms for BalancedCC Multiwinner Rules. AAMAS 2019: 494-502 - [c78]Piotr Faliszewski, Piotr Skowron, Stanislaw Szufa, Nimrod Talmon:
Proportional Representation in Elections: STV vs PAV. AAMAS 2019: 1946-1948 - [c77]Robert Bredereck, Piotr Faliszewski
An Experimental View on Committees Providing Justified Representation. IJCAI 2019: 109-115 - [c76]Maciej Kocot, Anna Kolonko, Edith Elkind, Piotr Faliszewski
Multigoal Committee Selection. IJCAI 2019: 385-391 - [i47]Edith Elkind, Piotr Faliszewski, Jean-François Laslier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain. CoRR abs/1901.09217 (2019) - [i46]Piotr Faliszewski, Pasin Manurangsi, Krzysztof Sornat:
Approximation and Hardness of Shift-Bribery. CoRR abs/1908.10562 (2019) - 2018
- [j37]Piotr Faliszewski
Achieving fully proportional representation by clustering voters. J. Heuristics 24(5): 725-756 (2018) - [j36]Piotr Faliszewski
Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives. Soc. Choice Welf. 51(3): 513-550 (2018) - [c75]Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner, Piotr Skowron:
Multiwinner Elections With Diversity Constraints. AAAI 2018: 933-940 - [c74]Piotr Faliszewski, Martin Lackner, Dominik Peters, Nimrod Talmon:
Effective Heuristics for Committee Scoring Rules. AAAI 2018: 1023-1030 - [c73]Piotr Faliszewski, Nimrod Talmon:
Between Proportionality and Diversity: Balancing District Sizes under the Chamberlin-Courant Rule. AAMAS 2018: 14-22 - [c72]Piotr Faliszewski, Stanislaw Szufa, Nimrod Talmon:
Optimization-Based Voting Rule Design: The Closer to Utopia the Better. AAMAS 2018: 32-40 - [c71]Haris Aziz
Egalitarian Committee Scoring Rules. IJCAI 2018: 56-62 - [c70]Piotr Faliszewski
Opinion Diffusion and Campaigning on Society Graphs. IJCAI 2018: 219-225 - [i45]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Committee Scoring Rules: Axiomatic Characterization and Hierarchy. CoRR abs/1802.06483 (2018) - [i44]Piotr Faliszewski, Nimrod Talmon:
A Framework for Approval-based Budgeting Methods. CoRR abs/1809.04382 (2018) - [i43]Andrzej Kaczmarczyk, Piotr Faliszewski:
Algorithms for Destructive Shift Bribery. CoRR abs/1810.01763 (2018) - 2017
- [j35]Krzysztof Magiera, Piotr Faliszewski
How hard is control in single-crossing elections? Auton. Agents Multi Agent Syst. 31(3): 606-627 (2017) - [j34]Ildikó Schlotter
Campaign Management Under Approval-Driven Voting Rules. Algorithmica 77(1): 84-115 (2017) - [j33]Piotr Faliszewski
Multiwinner Voting in Genetic Algorithms. IEEE Intell. Syst. 32(1): 40-48 (2017) - [j32]Piotr Skowron
Chamberlin-Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time. J. Artif. Intell. Res. 60: 687-716 (2017) - [j31]Jiehua Chen, Piotr Faliszewski
Elections with Few Voters: Candidate Control Can Be Easy. J. Artif. Intell. Res. 60: 937-1002 (2017) - [j30]Edith Elkind, Piotr Faliszewski
Properties of multiwinner voting rules. Soc. Choice Welf. 48(3): 599-632 (2017) - [c69]Edith Elkind, Piotr Faliszewski, Jean-François Laslier, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
What Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain. AAAI 2017: 494-501 - [c68]Piotr Faliszewski, Piotr Skowron, Nimrod Talmon:
Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules. AAMAS 2017: 6-14 - [c67]Piotr Faliszewski
How to choose a committee based on agents' preferences? BESC 2017: 1-6 - [c66]Jakub Sawicki
Two-Phase Strategy Managing Insensitivity in Global Optimization. EvoApplications (1) 2017: 266-281 - [c65]Haris Aziz
The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality. IJCAI 2017: 84-90 - [c64]Piotr Faliszewski
Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant. IJCAI 2017: 192-198 - [c63]Krzysztof Magiera, Piotr Faliszewski
Recognizing Top-Monotonic Preference Profiles in Polynomial Time. IJCAI 2017: 324-330 - [c62]Piotr Faliszewski
Committee Scoring Rules: A Call to Arms. IJCAI 2017: 5121-5125 - [c61]Robert Bredereck, Piotr Faliszewski
Robustness Among Multiwinner Voting Rules. SAGT 2017: 80-92 - [i42]Haris Aziz, Edith Elkind, Piotr Faliszewski, Martin Lackner, Piotr Skowron:
The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality. CoRR abs/1701.08023 (2017) - [i41]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Robustness Among Multiwinner Voting Rules. CoRR abs/1707.01417 (2017) - [i40]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon:
Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting. CoRR abs/1709.02850 (2017) - [i39]Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner, Piotr Skowron:
Multiwinner Elections with Diversity Constraints. CoRR abs/1711.06527 (2017) - [i38]Piotr Faliszewski, Arkadii Slinko, Nimrod Talmon:
The Complexity of Multiwinner Voting Rules with Variable Number of Winners. CoRR abs/1711.06641 (2017) - [i37]Dorothea Baumeister, Piotr Faliszewski, Annick Laruelle, Toby Walsh:
Voting: Beyond Simple Majorities and Single-Winner Elections (Dagstuhl Seminar 17261). Dagstuhl Reports 7(6): 109-134 (2017) - 2016
- [j29]Piotr Faliszewski, Maciej Smolka
On the Computational Cost and Complexity of Stochastic Inverse Solvers. Comput. Sci. 17(2): 225-264 (2016) - [j28]Piotr Skowron
Finding a collective set of items: From proportional multirepresentation to group recommendation. Artif. Intell. 241: 191-216 (2016) - [j27]Tomasz Miasko, Piotr Faliszewski
The complexity of priced control in elections. Ann. Math. Artif. Intell. 77(3-4): 225-250 (2016) - [j26]Robert Bredereck
Prices matter for the parameterized complexity of shift bribery. Inf. Comput. 251: 140-164 (2016) - [j25]Robert Bredereck, Piotr Faliszewski
Large-Scale Election Campaigns: Combinatorial Shift Bribery. J. Artif. Intell. Res. 55: 603-652 (2016) - [j24]Tomasz Put, Piotr Faliszewski
The Complexity of Voter Control and Shift Bribery Under Parliament Choosing Rules. Trans. Comput. Collect. Intell. 23: 29-50 (2016) - [c60]Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko, Nimrod Talmon:
Multiwinner Analogues of the Plurality Rule: Axiomatic and Algorithmic Perspectives. AAAI 2016: 482-488 - [c59]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. AAAI 2016: 2452-2458 - [c58]Piotr Faliszewski, Arkadii Slinko, Kolja Stahl, Nimrod Talmon:
Achieving Fully Proportional Representation by Clustering Voters. AAMAS 2016: 296-304 - [c57]Andrzej Kaczmarczyk, Piotr Faliszewski:
Algorithms for Destructive Shift Bribery. AAMAS 2016: 305-313 - [c56]Piotr Faliszewski
Multiwinner Voting in Genetic Algorithms for Solving Ill-Posed Global Optimization Problems. EvoApplications (1) 2016: 409-424 - [c55]Piotr Faliszewski, Arkadii M. Slinko, Nimrod Talmon:
Voting-Based Group Formation. IJCAI 2016: 243-249 - [c54]Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Committee Scoring Rules: Axiomatic Classification and Hierarchy. IJCAI 2016: 250-256 - [c53]Piotr Faliszewski, Laurent Gourvès, Jérôme Lang, Julien Lesca, Jérôme Monnot:
How Hard Is It for a Party to Nominate an Election Winner?. IJCAI 2016: 257-263 - [p1]Piotr Faliszewski, Irene Rothe, Jörg Rothe:
Noncooperative Game Theory. Economics and Computation 2016: 41-134 - [e1]Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier:
41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland. LIPIcs 58, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-016-3 [contents] - [r2]Piotr Faliszewski, Rolf Niedermeier:
Parameterization in Computational Social Choice. Encyclopedia of Algorithms 2016: 1516-1520 - [r1]Piotr Faliszewski
Control and Bribery in Voting. Handbook of Computational Social Choice 2016: 146-168 - [i36]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Complexity of Shift Bribery in Committee Elections. CoRR abs/1601.01492 (2016) - [i35]Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko, Nimrod Talmon:
Multiwinner Analogues of Plurality Rule: Axiomatic and Algorithmic Perspectives. CoRR abs/1602.08687 (2016) - [i34]Piotr Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Axiomatic Characterization of Committee Scoring Rules. CoRR abs/1604.01529 (2016) - [i33]Piotr Faliszewski, Jean-François Laslier, Robert Schaefer, Piotr Skowron, Arkadii Slinko, Nimrod Talmon:
Modeling Representation of Minorities Under Multiwinner Voting Rules. CoRR abs/1604.02364 (2016) - 2015
- [j23]Piotr Faliszewski
Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting. Auton. Agents Multi Agent Syst. 29(6): 1091-1124 (2015) - [j22]Piotr Skowron
Achieving fully proportional representation: Approximability results. Artif. Intell. 222: 67-103 (2015) - [j21]Piotr Faliszewski
Weighted Electoral Control. J. Artif. Intell. Res. 52: 507-542 (2015) - [j20]Edith Elkind, Piotr Faliszewski
Distance rationalization of voting rules. Soc. Choice Welf. 45(2): 345-377 (2015) - [j19]Piotr Skowron
The complexity of fully proportional representation for single-crossing electorates. Theor. Comput. Sci. 569: 43-57 (2015) - [j18]Laurent Bulteau
Combinatorial voter control in elections. Theor. Comput. Sci. 589: 99-120 (2015) - [c52]Edith Elkind, Piotr Faliszewski, Martin Lackner, Svetlana Obraztsova:
The Complexity of Recognizing Incomplete Single-Crossing Preferences. AAAI 2015: 865-871 - [c51]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. AAAI 2015: 2045-2051 - [c50]Piotr Krzysztof Skowron, Piotr Faliszewski:
Fully Proportional Representation with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time. AAAI 2015: 2124-2130 - [c49]Piotr Krzysztof Skowron, Piotr Faliszewski, Jérôme Lang:
Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation. AAAI 2015: 2131-2137 - [c48]Robert Bredereck, Piotr Faliszewski
Elections with Few Candidates: Prices, Weights, and Covering Problems. ADT 2015: 414-431 - [c47]Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Large-Scale Election Campaigns: Combinatorial Shift Bribery. AAMAS 2015: 67-75 - [c46]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract). IJCAI 2015: 4178-4182 - [i32]Ildikó Schlotter, Piotr Faliszewski, Edith Elkind:
Campaign Management under Approval-Driven Voting Rules. CoRR abs/1501.00387 (2015) - [i31]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices Matter for the Parameterized Complexity of Shift Bribery. CoRR abs/1502.01253 (2015) - [i30]Edith Elkind, Piotr Faliszewski, Piotr Skowron, Arkadii M. Slinko:
Properties of Multiwinner Voting Rules. CoRR abs/1506.02891 (2015) - 2014
- [j17]Piotr Faliszewski
The complexity of manipulative attacks in nearly single-peaked electorates. Artif. Intell. 207: 69-99 (2014) - [c45]Edith Elkind, Piotr Faliszewski, Piotr Skowron:
A Characterization of the Single-Peaked Single-Crossing Domain. AAAI 2014: 654-660 - [c44]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices Matter for the Parameterized Complexity of Shift Bribery. AAAI 2014: 1398-1404 - [c43]Edith Elkind, Piotr Faliszewski, Piotr Skowron, Arkadii Slinko:
Properties of multiwinner voting rules. AAMAS 2014: 53-60 - [c42]Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend:
Complexity of manipulation, bribery, and campaign management in bucklin and fallback voting. AAMAS 2014: 1357-1358 - [c41]Krzysztof Magiera, Piotr Faliszewski
How Hard is Control in Single-Crossing Elections? ECAI 2014: 579-584 - [c40]Jiehua Chen, Piotr Faliszewski
Combinatorial Voter Control in Elections. MFCS (2) 2014: 153-164 - [c39]Edith Elkind, Piotr Faliszewski
Recognizing 1-Euclidean Preferences: An Alternative Approach. SAGT 2014: 146-157 - [i29]Edith Elkind, Piotr Faliszewski, Arkadii Slinko:
Cloning in Elections: Finding the Possible Winners. CoRR abs/1401.4602 (2014) - [i28]Piotr Skowron, Piotr Faliszewski, Jérôme Lang:
Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation. CoRR abs/1402.3044 (2014) - [i27]Krzysztof Wojtas, Krzysztof Magiera, Tomasz Miasko, Piotr Faliszewski:
Possible Winners in Noisy Elections. CoRR abs/1405.6630 (2014) - [i26]Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Combinatorial Voter Control in Elections. CoRR abs/1406.6859 (2014) - [i25]Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Jiong Guo, Rolf Niedermeier, Gerhard J. Woeginger:
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges. CoRR abs/1407.2143 (2014) - [i24]Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon:
Elections with Few Voters: Candidate Control Can Be Easy. CoRR abs/1411.7812 (2014) - 2013
- [c38]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Weighted electoral control. AAMAS 2013: 367-374 - [c37]Svetlana Obraztsova, Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
On swap-distance geometry of voting rules. AAMAS 2013: 383-390 - [c36]Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Achieving fully proportional representation is easy in practice. AAMAS 2013: 399-406 - [c35]Tomasz Perek, Piotr Faliszewski, Maria Silvia Pini, Francesca Rossi:
The complexity of losing voters. AAMAS 2013: 407-414 - [c34]Piotr Faliszewski
A Richer Understanding of the Complexity of Election Systems. Fundamental Problems in Computing 2013: 375-406 - [c33]Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Fully Proportional Representation as Resource Allocation: Approximability Results. IJCAI 2013: 353-359 - [c32]Piotr Skowron
The Complexity of Fully Proportional Representation for Single-Crossing Electorates. SAGT 2013: 1-12 - [i23]Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Achieving Fully Proportional Representation is Easy in Practice. CoRR abs/1301.6400 (2013) - [i22]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Weighted Electoral Control. CoRR abs/1305.0943 (2013) - [i21]Piotr Krzysztof Skowron, Lan Yu, Piotr Faliszewski, Edith Elkind:
The Complexity of Fully Proportional Representation for Single-Crossing Electorates. CoRR abs/1307.1252 (2013) - [i20]Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend:
Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting. CoRR abs/1307.7322 (2013) - [i19]Piotr Skowron, Piotr Faliszewski:
Approximating the MaxCover Problem with Bounded Frequencies in FPT Time. CoRR abs/1309.4405 (2013) - [i18]Piotr Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Achieving Fully Proportional Representation: Approximability Results. CoRR abs/1312.4026 (2013) - 2012
- [j16]Michael Zuckerman, Piotr Faliszewski
Manipulating the quota in weighted voting games. Artif. Intell. 180-181: 1-19 (2012) - [j15]Edith Elkind, Piotr Faliszewski
Rationalizations of Condorcet-consistent rules via distances of hamming type. Soc. Choice Welf. 39(4): 891-905 (2012) - [c31]Krzysztof Wojtas, Piotr Faliszewski:
Possible Winners in Noisy Elections. AAAI 2012: 1499-1505 - [c30]Dorothea Baumeister, Piotr Faliszewski, Jérôme Lang, Jörg Rothe:
Campaigns for lazy voters: truncated ballots. AAMAS 2012: 577-584 - [c29]Piotr Faliszewski
Weighted Manipulation for Four-Candidate Llull Is Easy. ECAI 2012: 318-323 - [c28]Edith Elkind, Piotr Faliszewski
Clone structures in voters' preferences. EC 2012: 496-513 - [i17]Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko:
Proportional Representation as Resource Allocation: Approximability Results. CoRR abs/1208.1661 (2012) - 2011
- [j14]Piotr Faliszewski
The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. Inf. Comput. 209(2): 89-107 (2011) - [j13]Piotr Faliszewski
Multimode Control Attacks on Elections. J. Artif. Intell. Res. 40: 305-351 (2011) - [j12]Edith Elkind, Piotr Faliszewski
Cloning in Elections: Finding the Possible Winners. J. Artif. Intell. Res. 42: 529-573 (2011) - [c27]Talal Rahwan, Tomasz P. Michalak, Edith Elkind, Piotr Faliszewski, Jacek Sroka, Michael J. Wooldridge, Nicholas R. Jennings:
Constrained Coalition Formation. AAAI 2011: 719-725 - [c26]Ildikó Schlotter, Piotr Faliszewski, Edith Elkind:
Campaign Management under Approval-Driven Voting Rules. AAAI 2011: 726-731 - [c25]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Homogeneity and monotonicity of distance-rationalizable voting rules. AAMAS 2011: 821-828 - [c24]Yoram Bachrach, Edith Elkind, Piotr Faliszewski
Coalitional Voting Manipulation: A Game-Theoretic Perspective. IJCAI 2011: 49-54 - [c23]Piotr Faliszewski
The complexity of manipulative attacks in nearly single-peaked electorates. TARK 2011: 228-237 - [c22]Michael Zuckerman, Piotr Faliszewski
An NTU Cooperative Game Theoretic View of Manipulating Elections. WINE 2011: 363-374 - [i16]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates. CoRR abs/1105.5032 (2011) - [i15]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Clone Structures in Voters' Preferences. CoRR abs/1110.3939 (2011) - 2010
- [j11]Piotr Faliszewski
AI's War on Manipulation: Are We Winning? AI Mag. 31(4): 53-64 (2010) - [j10]Piotr Faliszewski
Using complexity to protect elections. Commun. ACM 53(11): 74-82 (2010) - [j9]Piotr Faliszewski
On the Autoreducibility of Functions. Theory Comput. Syst. 46(2): 222-245 (2010) - [c21]Yoram Bachrach, Nadja Betzler, Piotr Faliszewski:
Probabilistic Possible Winner Determination. AAAI 2010: 697-702 - [c20]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Cloning in Elections. AAAI 2010: 768-773 - [c19]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Good Rationalizations of Voting Rules. AAAI 2010: 774-779 - [c18]Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor:
Manipulation of copeland elections. AAMAS 2010: 367-374 - [c17]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
On the role of distances in defining voting rules. AAMAS 2010: 375-382 - [c16]Edith Elkind, Piotr Faliszewski
Approximation Algorithms for Campaign Management. WINE 2010: 473-482 - [i14]Edith Elkind, Piotr Faliszewski:
Approximation Algorithms for Campaign Management. CoRR abs/1004.0334 (2010) - [i13]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Multimode Control Attacks on Elections. CoRR abs/1007.1800 (2010) - [i12]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Rationalizations of Condorcet-Consistent Rules via Distances of Hamming Type. CoRR abs/1009.0300 (2010)
2000 – 2009
- 2009
- [j8]Piotr Faliszewski
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. J. Artif. Intell. Res. 35: 275-341 (2009) - [j7]Piotr Faliszewski
How Hard Is Bribery in Elections? J. Artif. Intell. Res. 35: 485-532 (2009) - [j6]Piotr Faliszewski
The complexity of power-index comparison. Theor. Comput. Sci. 410(1): 101-107 (2009) - [c15]Piotr Faliszewski, Edith Elkind, Michael J. Wooldridge:
Boolean combinations of weighted voting games. AAMAS (1) 2009: 185-192 - [c14]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
Multimode Control Attacks on Elections. IJCAI 2009: 128-133 - [c13]Edith Elkind, Piotr Faliszewski
Swap Bribery. SAGT 2009: 299-310 - [c12]Edith Elkind, Piotr Faliszewski
On distance rationalizability of some voting rules. TARK 2009: 108-117 - [c11]Piotr Faliszewski
The shield that never was: societies with single-peaked preferences are more open to manipulation and control. TARK 2009: 118-127 - [i11]Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
Swap Bribery. CoRR abs/0905.3885 (2009) - [i10]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control. CoRR abs/0909.3257 (2009) - 2008
- [j5]Piotr Faliszewski
The consequences of eliminating NP solutions. Comput. Sci. Rev. 2(1): 40-54 (2008) - [c10]Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Approximability of Manipulating Elections. AAAI 2008: 44-49 - [c9]Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind:
Manipulating the Quota in Weighted Voting Games. AAAI 2008: 215-220 - [c8]Piotr Faliszewski
Copeland Voting Fully Resists Constructive Control. AAIM 2008: 165-176 - [c7]Piotr Faliszewski
The Complexity of Power-Index Comparison. AAIM 2008: 177-187 - [c6]Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor:
Copeland voting: ties matter. AAMAS (2) 2008: 983-990 - [c5]Piotr Faliszewski:
Nonuniform bribery. AAMAS (3) 2008: 1569-1572 - [i9]Piotr Faliszewski, Lane A. Hemaspaandra:
The Complexity of Power-Index Comparison. CoRR abs/0801.4585 (2008) - [i8]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Llull and Copeland Voting Computationally Resist Bribery and Control. CoRR abs/0809.4484 (2008) - 2007
- [j4]Piotr Faliszewski:
Review of "Complexity Theory and Cryptology: An Introduction to Cryptocomplexity by Jörg Rothe", Springer, 2005, 484 pages. SIGACT News 38(2): 20-22 (2007) - [c4]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Llull and Copeland Voting Broadly Resist Bribery and Control. AAAI 2007: 724-730 - [i7]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
Copeland Voting Fully Resists Constructive Control. CoRR abs/0711.4759 (2007) - [i6]Piotr Faliszewski:
Nonuniform Bribery. CoRR abs/0711.4924 (2007) - 2006
- [j3]Piotr Faliszewski, Lane A. Hemaspaandra
Open questions in the theory of semifeasible computation. SIGACT News 37(1): 47-65 (2006) - [c3]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
The Complexity of Bribery in Elections. AAAI 2006: 641-646 - [c2]Piotr Faliszewski, Lane A. Hemaspaandra:
The Consequences of Eliminating NP Solutions. DCFS 2006: 1-15 - [i5]Piotr Faliszewski, Lane A. Hemaspaandra:
The Consequences of Eliminating NP Solutions. CoRR abs/cs/0606009 (2006) - [i4]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra:
How Hard Is Bribery in Elections? CoRR abs/cs/0608081 (2006) - [i3]Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe:
A Richer Understanding of the Complexity of Election Systems. CoRR abs/cs/0609112 (2006) - 2005
- [j2]Piotr Faliszewski
Advice for semifeasible sets and the complexity-theoretic cost(lessness) of algebraic properties. Int. J. Found. Comput. Sci. 16(5): 913-928 (2005) - [j1]Piotr Faliszewski
Properties of uniformly hard languages. Inf. Process. Lett. 95(1): 329-332 (2005) - [c1]Piotr Faliszewski
Separating the Notions of Self- and Autoreducibility. MFCS 2005: 308-315 - [i2]Piotr Faliszewski, Lane A. Hemaspaandra:
Open Questions in the Theory of Semifeasible Computation. CoRR abs/cs/0506082 (2005) - 2004
- [i1]Piotr Faliszewski:
Exponential time reductions and sparse languages in NEXP. Electron. Colloquium Comput. Complex. TR04 (2004)
Coauthor Index
[j51] [c116] [j49] [i69] [c105] [c97] [c96] [i61] [i52] [i51] [j43] [c91] [c90] [c76] [i47] [j34] [j30] [c69] [c65] [i42] [j20] [j19] [c52] [i32] [i30] [c45] [c43] [c39] [i29] [c37] [c32] [i21] [j16] [j15] [c28] [j12] [c27] [c26] [c25] [c24] [i15] [c20] [c19] [c17] [c16] [i14] [i12] [c15] [c13] [c12] [i11] [c9]
Piotr Skowron 0001
aka: Piotr Krzysztof Skowron
aka: Piotr Krzysztof Skowron
[c117] [c115] [i71] [c110] [i65] [i64] [j46] [c95] [i55] [j43] [j42] [c89] [c88] [j39] [j38] [c82] [c78] [i47] [j36] [c75] [i45] [j32] [j30] [c69] [c68] [c65] [c64] [c61] [i42] [i41] [i40] [i39] [j28] [c60] [c54] [i35] [i34] [i33] [j22] [j19] [c50] [c49] [c48] [i30] [c45] [c43] [i28] [c36] [c33] [c32] [i23] [i21] [i19] [i18] [i17]
Arkadii M. Slinko
aka: Arkadii Slinko
aka: Arkadii Slinko
[j50] [c110] [i65] [j47] [c98] [i60] [j46] [j44] [i55] [j42] [c89] [c88] [c87] [i49] [j38] [c82] [c81] [c79] [c78] [c76] [i47] [j37] [j36] [c74] [c73] [c72] [c71] [c70] [i45] [i44] [j31] [c69] [c68] [c64] [c61] [i41] [i40] [i38] [j25] [c60] [c59] [c58] [c55] [c54] [i36] [i35] [i33] [j18] [c51] [c48] [c47] [c40] [i26] [i24]
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 21:26 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: