| 2025 | AAAI | Weak Strategyproofness in Randomized Social Choice. | Felix Brandt, Patrick Lederer |
| 2022 | AAAI | Single-Agent Dynamics in Additively Separable Hedonic Games. | Felix Brandt, Martin Bullinger, Leo Tappe |
| 2022 | IJCAI | Incentives in Social Decision Schemes with Pairwise Comparison Preferences. | Felix Brandt, Patrick Lederer, Warut Suksompong |
| 2021 | AAAI | Reaching Individually Stable Coalition Structures in Hedonic Games. | Felix Brandt, Martin Bullinger, Analle Wilczynski |
| 2021 | CSIT | Method for Identifying, Measuring and Quantifying Fluctuations in Production Systems. | Rocky Telatko, Eric Brandt, Felix Brandt, Dirk Reichelt |
| 2020 | ETFA | Fully-Automated Packaging Structure Recognition in Logistics Environments. | Laura Drr, Felix Brandt, Martin Pouls, Alexander Naumann |
| 2019 | ICMLA | Lean Training Data Generation for Planar Object Detection Models in Unsteady Logistics Contexts. | Laura Drr, Felix Brandt, Anne Meyer, Martin Pouls |
| 2018 | IJCAI | An Analytical and Experimental Comparison of Maximal Lottery Schemes. | Florian Brandl, Felix Brandt, Christian Stricker |
| 2016 | IJCAI | Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving. | Florian Brandl, Felix Brandt, Christian Geist |
| 2015 | IJCAI | Strategic Abstention Based on Preference Extensions: Positive Results and Computer-Generated Impossibilities. | Florian Brandl, Felix Brandt, Christian Geist, Johannes Hofbauer |
| 2015 | STACS | Computational Social Choice (Tutorial). | Felix Brandt |
| 2014 | AAAI | On the Incompatibility of Efficiency and Strategyproofness in Randomized Social Choice. | Haris Aziz, Florian Brandl, Felix Brandt |
| 2014 | AAAI | Extending Tournament Solutions. | Felix Brandt, Markus Brill, Paul Harrenstein |
| 2014 | ISAIM | Extending Tournament Solutions. | Felix Brandt, Markus Brill, Paul Harrenstein |
| 2013 | SAGT | On Popular Random Assignments. | Haris Aziz, Felix Brandt, Paul Stursberg |
| 2011 | IJCAI | Optimal Partitions in Additively Separable Hedonic Games. | Haris Aziz, Felix Brandt, Hans Georg Seedig |
| 2011 | IJCAI | Group-Strategyproof Irresolute Social Choice Functions. | Felix Brandt |
| 2011 | IJCAI | On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions. | Felix Brandt, Markus Brill, Hans Georg Seedig |
| 2011 | SAGT | Pareto Optimality in Coalition Formation. | Haris Aziz, Felix Brandt, Paul Harrenstein |
| 2011 | TARK | Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions. | Felix Brandt, Markus Brill |
| 2010 | AAAI | Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates. | Felix Brandt, Markus Brill, Edith Hemaspaandra, Lane A. Hemaspaandra |
| 2010 | CIAC | The Complexity of Computing Minimal Unidirectional Covering Sets. | Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jrg Rothe |
| 2010 | STACS | On Iterated Dominance, Matrix Elimination, and Matched Paths. | Felix Brandt, Felix A. Fischer, Markus Holzer |
| 2010 | SAGT | On the Rate of Convergence of Fictitious Play. | Felix Brandt, Felix A. Fischer, Paul Harrenstein |
| 2009 | SAGT | The Computational Complexity of Weak Saddles. | Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann |
| 2009 | SAGT | On the Complexity of Iterated Weak Dominance in Constant-Sum Games. | Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein |
| 2008 | AAAI | A Computational Analysis of the Tournament Equilibrium Set. | Felix Brandt, Felix A. Fischer, Paul Harrenstein, Maximilian Mair |
| 2008 | SAGT | On the Hardness and Existence of Quasi-Strict Equilibria. | Felix Brandt, Felix A. Fischer |
| 2007 | AAAI | Computational Aspects of Covering in Dominance Graphs. | Felix Brandt, Felix A. Fischer |
| 2007 | IJCAI | A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios. | Felix Brandt, Felix A. Fischer, Paul Harrenstein, Yoav Shoham |
| 2007 | IJCAI | Spiteful Bidding in Sealed-Bid Auctions. | Felix Brandt, Tuomas Sandholm, Yoav Shoham |
| 2007 | STACS | Symmetries and the Complexity of Pure Nash Equilibrium. | Felix Brandt, Felix A. Fischer, Markus Holzer |
| 2007 | TARK | The computational complexity of choice sets. | Felix Brandt, Felix A. Fischer, Paul Harrenstein |
| 2006 | AAAI | On Strictly Competitive Multi-Player Games. | Felix Brandt, Felix A. Fischer, Yoav Shoham |
| 2005 | FC | Efficient Privacy-Preserving Protocols for Multi-unit Auctions. | Felix Brandt, Tuomas Sandholm |
| 2005 | ICISC | Efficient Cryptographic Protocol Design Based on Distributed El Gamal Encryption. | Felix Brandt |
| 2005 | IJCAI | On Correctness and Privacy in Distributed Mechanisms. | Felix Brandt, Tuomas Sandholm |
| 2005 | TARK | Unconditional privacy in social choice. | Felix Brandt, Tuomas Sandholm |
| 2003 | FC | Fully Private Auctions in a Constant Number of Rounds. | Felix Brandt |
| 1999 | FlAIRS | Using Term Space Maps to Capture Search Control Knowledge in Equational Theorem Proving. | Stephan Schulz, Felix Brandt |