Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNiclas Boehmer
Person information
- affiliation: Harvard University, USA
- affiliation (PhD): TU Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2023
[b1]Niclas Boehmer:
Application-oriented collective decision making: experimental toolbox and dynamic environments. Technical University of Berlin, Germany, 2023
Journal Articles
- 2024
- [j9]Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier:
Equilibria in schelling games: computational hardness and robustness. Auton. Agents Multi Agent Syst. 38(1): 9 (2024) - [j8]Niclas Boehmer, Klaus Heeger, Stanislaw Szufa:
A Map of Diverse Synthetic Stable Matching Instances. J. Artif. Intell. Res. 79: 1113-1166 (2024) - [j7]Niclas Boehmer
, Tomohiro Koana:
The Complexity of Finding Fair Many-to-One Matchings. ACM Trans. Algorithms 20(2): 17 (2024) - 2023
- [j6]Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier:
A refined complexity analysis of fair districting over graphs. Auton. Agents Multi Agent Syst. 37(1): 13 (2023) - [j5]Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo:
Fine-grained view on bribery for group identification. Auton. Agents Multi Agent Syst. 37(1): 21 (2023) - [j4]Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana:
Stable matching with multilayer approval preferences: Approvals can be harder than strict preferences. Games Econ. Behav. 142: 508-526 (2023) - 2022
- [j3]Niclas Boehmer, Klaus Heeger:
A Fine-grained View on Stable Many-to-one Matching Problems with Lower and Upper Quotas. ACM Trans. Economics and Comput. 10(2): 9:1-9:53 (2022) - 2021
- [j2]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier:
Bribery and Control in Stable Marriage. J. Artif. Intell. Res. 71: 993-1048 (2021) - 2020
- [j1]Niclas Boehmer, Manuel Torrilhon:
Entropic quadrature for moment approximations of the Boltzmann-BGK equation. J. Comput. Phys. 401 (2020)
Conference and Workshop Papers
- 2024
- [c34]Niclas Boehmer, Markus Brill, Alfonso Cevallos, Jonas Gehrlein, Luis Sánchez Fernández, Ulrike Schmidt-Kraepelin:
Approval-Based Committee Voting in Practice: A Case Study of (over-)Representation in the Polkadot Blockchain. AAAI 2024: 9519-9527 - [c33]Manon Revel, Niclas Boehmer, Rachael Colley, Markus Brill, Piotr Faliszewski, Edith Elkind:
Selecting Representative Bodies: An Axiomatic View. AAMAS 2024: 2701-2705 - 2023
- [c32]Niclas Boehmer, Martin Bullinger, Anna Maria Kerkmann:
Causes of Stability in Dynamic Coalition Formation. AAAI 2023: 5499-5506 - [c31]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 - [c30]Niclas Boehmer, Robert Bredereck, Dominik Peters:
Rank Aggregation Using Scoring Rules. AAAI 2023: 5515-5523 - [c29]Niclas Boehmer, Klaus Heeger:
Adapting Stable Matchings to Forced and Forbidden Pairs. AAMAS 2023: 985-993 - [c28]Niclas Boehmer, Klaus Heeger, Stanislaw Szufa:
A Map of Diverse Synthetic Stable Roommates Instances. AAMAS 2023: 1003-1011 - [c27]Niclas Boehmer, Nathan Schaar:
Collecting, Classifying, Analyzing, and Using Real-World Ranking Data. AAMAS 2023: 1706-1715 - [c26]Niclas Boehmer, L. Elisa Celis, Lingxiao Huang, Anay Mehrotra, Nisheeth K. Vishnoi:
Subset Selection Based On Multiple Rankings in the Presence of Bias: Effectiveness of Fairness Constraints for Multiwinner Voting Score Functions. ICML 2023: 2641-2688 - [c25]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 - [c24]Niclas Boehmer, Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk:
Robustness of Participatory Budgeting Outcomes: Complexity and Experiments. SAGT 2023: 161-178 - 2022
- [c23]Niclas Boehmer, Robert Bredereck, André Nichterlein:
Combating Collusion Rings Is Hard but Possible. AAAI 2022: 4843-4850 - [c22]Niclas Boehmer, Klaus Heeger, Rolf Niedermeier:
Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets. AAAI 2022: 4851-4858 - [c21]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo:
Multivariate Algorithmics for Eliminating Envy by Donating Goods. AAMAS 2022: 127-135 - [c20]Niclas Boehmer, Markus Brill, Ulrike Schmidt-Kraepelin:
Proportional Representation in Matching Markets: Selecting Multiple Matchings under Dichotomous Preferences. AAMAS 2022: 136-144 - [c19]Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier:
Equilibria in Schelling Games: Computational Hardness and Robustness. AAMAS 2022: 761-769 - [c18]Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier:
A Refined Complexity Analysis of Fair Districting over Graphs. AAMAS 2022: 1548-1550 - [c17]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier:
A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners. EAAMO 2022: 7:1-7:10 - [c16]Niclas Boehmer, Tomohiro Koana:
The Complexity of Finding Fair Many-To-One Matchings. ICALP 2022: 27:1-27:18 - [c15]Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa, Tomasz Was:
Understanding Distance Measures Among Elections. IJCAI 2022: 102-108 - [c14]Niclas Boehmer, Klaus Heeger, Rolf Niedermeier:
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. MFCS 2022: 21:1-21:15 - [c13]Niclas Boehmer, Robert Bredereck, Edith Elkind, Piotr Faliszewski, Stanislaw Szufa:
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning. NeurIPS 2022 - [c12]Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana:
Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences. SAGT 2022: 436-453 - 2021
- [c11]Niclas Boehmer, Rolf Niedermeier:
Broadening the Research Agenda for Computational Social Choice: Multiple Preference Profiles and Multiple Solutions. AAMAS 2021: 1-5 - [c10]Niclas Boehmer, Vincent Froese, Julia Henkel, Yvonne Lasars, Rolf Niedermeier, Malte Renken:
Two Influence Maximization Games on Graphs Made Temporal. IJCAI 2021: 45-51 - [c9]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier:
Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments. IJCAI 2021: 52-58 - [c8]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa:
Putting a Compass on the Map of Elections. IJCAI 2021: 59-65 - 2020
- [c7]Niclas Boehmer, Edith Elkind:
Individual-Based Stability in Hedonic Diversity Games. AAAI 2020: 1822-1829 - [c6]Niclas Boehmer, Edith Elkind:
Stable Roommate Problem With Diversity Preferences. AAMAS 2020: 1780-1782 - [c5]Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo:
Fine-Grained View on Bribery for Group Identification. IJCAI 2020: 67-73 - [c4]Niclas Boehmer, Edith Elkind:
Stable Roommate Problem with Diversity Preferences. IJCAI 2020: 96-102 - [c3]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier:
Bribery and Control in Stable Marriage. SAGT 2020: 163-177 - [c2]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier:
Line-Up Elections: Parallel Voting with Shared Candidate Pool. SAGT 2020: 275-290 - [c1]Niclas Boehmer, Klaus Heeger:
A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas. WINE 2020: 31-44
Informal and Other Publications
- 2024
- [i40]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) - [i39]Davide Grossi, Ulrike Hahn, Michael Mäs, Andreas Nitsche, Jan Behrens, Niclas Boehmer, Markus Brill, Ulle Endriss, Umberto Grandi, Adrian Haret, Jobst Heitzig, Nicolien Janssens, Catholijn M. Jonker, Marijn A. Keijzer, Axel Kistner, Martin Lackner, Alexandra Lieben, Anna Mikhaylovskaya, Pradeep K. Murukannaiah, Carlo Proietti, Manon Revel, Élise Rouméas, Ehud Shapiro, Gogulapati Sreedurga, Björn Swierczek, Nimrod Talmon, Paolo Turrini, Zoi Terzopoulou, Frederik Van De Putte:
Enabling the Digital Democratic Revival: A Research Program for Digital Democracy. CoRR abs/2401.16863 (2024) - [i38]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) - [i37]Niclas Boehmer, Yash Nair, Sanket Shah, Lucas Janson, Aparna Taneja, Milind Tambe:
Evaluating the Effectiveness of Index-Based Treatment Allocation. CoRR abs/2402.11771 (2024) - [i36]Arpan Dasgupta, Niclas Boehmer, Neha Madhiwalla, Aparna Hedge, Bryan Wilder, Milind Tambe, Aparna Taneja:
Preliminary Study of the Impact of AI-Based Interventions on Health and Behavioral Outcomes in Maternal Health Programs. CoRR abs/2407.11973 (2024) - [i35]Niclas Boehmer, Minbiao Han, Haifeng Xu, Milind Tambe:
Escape Sensing Games: Detection-vs-Evasion in Security Applications. CoRR abs/2407.20981 (2024) - 2023
- [i34]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) - [i33]Manon Revel, Niclas Boehmer, Rachael Colley, Markus Brill, Piotr Faliszewski, Edith Elkind:
Selecting Representative Bodies: An Axiomatic View. CoRR abs/2304.02774 (2023) - [i32]Niclas Boehmer, Piotr Faliszewski, Lukasz Janeczko, Andrzej Kaczmarczyk:
Robustness of Participatory Budgeting Outcomes: Complexity and Experiments. CoRR abs/2305.08125 (2023) - [i31]Niclas Boehmer, L. Elisa Celis, Lingxiao Huang, Anay Mehrotra, Nisheeth K. Vishnoi:
Subset Selection Based On Multiple Rankings in the Presence of Bias: Effectiveness of Fairness Constraints for Multiwinner Voting Score Functions. CoRR abs/2306.09835 (2023) - [i30]Niclas Boehmer, Markus Brill, Alfonso Cevallos, Jonas Gehrlein, Luis Sánchez Fernández, Ulrike Schmidt-Kraepelin:
Approval-Based Committee Voting in Practice: A Case Study of (Over-)Representation in the Polkadot Blockchain. CoRR abs/2312.11408 (2023) - [i29]Niclas Boehmer, Piotr Faliszewski, Lukasz Janeczko, Dominik Peters, Grzegorz Pierczynski, Simon Schierreich, Piotr Skowron, Stanislaw Szufa:
Evaluation of Project Performance in Participatory Budgeting. CoRR abs/2312.14723 (2023) - 2022
- [i28]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo:
Multivariate Algorithmics for Eliminating Envy by Donating Goods. CoRR abs/2202.01716 (2022) - [i27]Niclas Boehmer, Nathan Schaar:
Collecting, Classifying, Analyzing, and Using Real-World Elections. CoRR abs/2204.03589 (2022) - [i26]Niclas Boehmer, Klaus Heeger:
Adapting Stable Matchings to Forced and Forbidden Pairs. CoRR abs/2204.10040 (2022) - [i25]Niclas Boehmer, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa, Tomasz Was:
Understanding Distance Measures Among Elections. CoRR abs/2205.00492 (2022) - [i24]Matthias Bentert, Niclas Boehmer, Maciej Rymar, Henri Tannenberg:
Who won? Winner Determination and Robustness in Liquid Democracy. CoRR abs/2205.05482 (2022) - [i23]Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana:
Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences. CoRR abs/2205.07550 (2022) - [i22]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) - [i21]Niclas Boehmer, Tomohiro Koana:
The Complexity of Finding Fair Many-to-One Matchings. CoRR abs/2206.06988 (2022) - [i20]Niclas Boehmer, Klaus Heeger, Rolf Niedermeier:
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. CoRR abs/2208.01563 (2022) - [i19]Niclas Boehmer, Klaus Heeger, Stanislaw Szufa:
A Map of Diverse Synthetic Stable Roommates Instances. CoRR abs/2208.04041 (2022) - [i18]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) - [i17]Niclas Boehmer, Robert Bredereck, Dominik Peters:
Rank Aggregation Using Scoring Rules. CoRR abs/2209.08856 (2022) - [i16]Niclas Boehmer, Martin Bullinger, Anna Maria Kerkmann:
Causes of Stability in Dynamic Coalition Formation. CoRR abs/2211.17169 (2022) - 2021
- [i15]Niclas Boehmer, Markus Brill, Ulrike Schmidt-Kraepelin:
Selecting Matchings via Multiwinner Voting: How Structure Defeats a Large Candidate Space. CoRR abs/2102.07441 (2021) - [i14]Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier:
A Refined Complexity Analysis of Fair Districting over Graphs. CoRR abs/2102.11864 (2021) - [i13]Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo:
Finding Small Multi-Demand Set Covers with Ubiquitous Elements and Large Sets is Fixed-Parameter Tractable. CoRR abs/2104.10124 (2021) - [i12]Niclas Boehmer, Vincent Froese, Julia Henkel, Yvonne Lasars, Rolf Niedermeier, Malte Renken:
Two Influence Maximization Games on Graphs Made Temporal. CoRR abs/2105.05987 (2021) - [i11]Luca Kreisel, Niclas Boehmer, Vincent Froese, Rolf Niedermeier:
Equilibria in Schelling Games: Computational Complexity and Robustness. CoRR abs/2105.06561 (2021) - [i10]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Stanislaw Szufa:
Putting a Compass on the Map of Elections. CoRR abs/2105.07815 (2021) - [i9]Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo:
Fine-Grained View on Bribery for Group Identification. CoRR abs/2105.08376 (2021) - [i8]Niclas Boehmer, Klaus Heeger, Rolf Niedermeier:
Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets. CoRR abs/2112.05777 (2021) - [i7]Niclas Boehmer, Robert Bredereck, André Nichterlein:
Combating Collusion Rings is Hard but Possible. CoRR abs/2112.08444 (2021) - 2020
- [i6]Niclas Boehmer, Edith Elkind:
Stable Roommate Problem with Diversity Preferences. CoRR abs/2004.14640 (2020) - [i5]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier:
Bribery and Control in Stable Marriage. CoRR abs/2007.04948 (2020) - [i4]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier:
Line-Up Elections: Parallel Voting with Shared Candidate Pool. CoRR abs/2007.04960 (2020) - [i3]Niclas Boehmer, Klaus Heeger:
A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas. CoRR abs/2009.14171 (2020) - [i2]Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier:
On the Robustness of Winners: Counting Briberies in Elections. CoRR abs/2010.09678 (2020) - 2019
- [i1]Niclas Boehmer, Edith Elkind:
Individual-Based Stability in Hedonic Diversity Games. CoRR abs/1911.08669 (2019)
Coauthor Index
a service of 
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-08-25 20:07 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:
