Fuzzy c-auto regression models. - Thomas A. Runkler; Hans Georg Seedig (FUZZ-IEEE, 2008)

Forecasting of clustered time series with recurrent neural networks and a fuzzy clustering scheme. - Hans Georg Seedig; Ralph Grothmann; Thomas A. Runkler (IJCNN, 2009)

Network Flow Optimization with Minimum Quantities. - Hans Georg Seedig (OR, 2010)

Stable partitions in additively separable hedonic games. - Haris Aziz 001; Felix Brandt 001; Hans Georg Seedig (AAMAS, 2011)

Optimal Partitions in Additively Separable Hedonic Games. - Haris Aziz 001; Felix Brandt 001; Hans Georg Seedig (IJCAI, 2011)

On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions. - Felix Brandt 001; Markus Brill; Hans Georg Seedig (IJCAI, 2011)

It only takes a few: on the hardness of voting with a constant number of agents. - Felix Brandt 001; Paul Harrenstein; Keyvan Kardel; Hans Georg Seedig (AAMAS, 2013)

Computing desirable partitions in additively separable hedonic games. - Haris Aziz 001; Felix Brandt 001; Hans Georg Seedig (Artif. Intell., 2013)

A tournament of order 24 with two disjoint TEQ-retentive sets - Felix Brandt 001; Hans Georg Seedig (CoRR, 2013)

On the Discriminative Power of Tournament Solutions. - Felix Brandt 001; Hans Georg Seedig (OR, 2014)

On the Susceptibility of the Deferred Acceptance Algorithm. - Haris Aziz 001; Hans Georg Seedig; Jana Karina von Wedel (AAMAS, 2015)

Consistent Probabilistic Social Choice. - Florian Brandl; Felix Brandt 001; Hans Georg Seedig (CoRR, 2015)

Bounds on the disparity and separation of tournament solutions. - Felix Brandt 001; Andre Dau; Hans Georg Seedig (Discret. Appl. Math., 2015)

Possible and Necessary Winners of Partial Tournaments. - Haris Aziz 001; Markus Brill; Felix A. Fischer; Paul Harrenstein; Jérôme Lang; Hans Georg Seedig (J. Artif. Intell. Res., 2015)

Majority Relations and Tournament Solutions (Mehrheitsrelationen und Turnierlösungen) - Hans Georg Seedig (2015)

k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters. - Georg Bachmeier; Felix Brandt 001; Christian Geist; Paul Harrenstein; Keyvan Kardel; Dominik Peters; Hans Georg Seedig (CoRR, 2017)

Minimal extending sets in tournaments. - Felix Brandt 001; Paul Harrenstein; Hans Georg Seedig (Math. Soc. Sci., 2017)

k-Majority digraphs and the hardness of voting with a constant number of voters. - Georg Bachmeier; Felix Brandt 001; Christian Geist; Paul Harrenstein; Keyvan Kardel; Dominik Peters; Hans Georg Seedig (J. Comput. Syst. Sci., 2019)

On the Structure of Stable Tournament Solutions. - Felix Brandt 001; Markus Brill; Hans Georg Seedig; Warut Suksompong (CoRR, 2020)