@inproceedings{ls_leimeister,
  address = {Helsinki, Finland (accepted for publication)},
  author = {Kipp, Philipp and Bittner, Eva and Hoffmann, Axel and Bretschneider, Ulrich and Leimeister, Jan Marco},
  booktitle = {Eighth International Conference on Design Science Research in Information Systems and Technology (DESRIST)},
  interhash = {d3515c1566a88779023850fd2afa6c76},
  intrahash = {8bd24c443bac843255d687884a5d7695},
  note = {JML_394},
  title = {Collaborative Idea Elaboration on Web-Based Ideation Platforms},
  year = 2013
}

@inproceedings{ls_leimeister,
  address = {Rome, Italy},
  author = {Blohm, I. and Ott, F. and Bretschneider, U. and Huber, M. and Rieger, M. and Glatz, F. and Koch, M. and Leimeister, J. M. and Krcmar, H.},
  booktitle = {10. European Academy of Management Conference (EURAM) 2010},
  interhash = {dfecc9fb1946790fa7e081efbe748002},
  intrahash = {436434c956e0b059895bc4fe28b58930},
  note = {197 (45-10) },
  number = 10,
  title = {Extending Open Innovation Platforms into the real world - 
Using Large Displays in Public Spaces},
  url = {http://www.uni-kassel.de/fb7/ibwl/leimeister/pub/JML_197.pdf},
  year = 2010
}

@inproceedings{ls_leimeister,
  address = {Rome, Italy},
  author = {Blohm, I. and Ott, F. and Bretschneider, U. and Huber, M. and Rieger, M. and Glatz, F. and Koch, M. and Leimeister, J. M. and Krcmar, H.},
  booktitle = {10. European Academy of Management Conference (EURAM) 2010},
  interhash = {dfecc9fb1946790fa7e081efbe748002},
  intrahash = {436434c956e0b059895bc4fe28b58930},
  note = {197 (45-10) },
  number = 10,
  title = {Extending Open Innovation Platforms into the real world - Using Large Displays in Public Spaces},
  url = {http://pubs.wi-kassel.de/wp-content/uploads/2013/03/JML_248.pdf},
  year = 2010
}

@inproceedings{kdml26,
  abstract = {We study the problem of listing all closed sets of a closure operator $\sigma$ that is a partial function on the power set of some finite ground set $E$, i.e., $\sigma : {\cal F} \to {\cal F}$ with ${\cal F} \subseteq {\cal P}(E)$. A very simple divide-and-conquer algorithm is analyzed that correctly solves this problem if and only if the domain of the closure operator is a strongly accessible set system. Strong accessibility is a strict relaxation of greedoids as well as of independence systems. This algorithm turns out to have delay $O (|E| (T_{\cal F} +T_\sigma + |E|))$ and space $O(|E| + S_{\cal F} S_\sigma)$, where $T_{\cal F}$, $S_{\cal F}$, $T_\sigma$, and $S_\sigma$  are the time and space complexities of checking membership in $\cal  F$ and computing $\sigma$, respectively. In contrast, we show that the problem becomes intractable for accessible set systems. We relate our results to the data mining problem of listing all support-closed patterns of a dataset and show that there is a corresponding closure operator for all datasets if and only if the set system satisfies a certain confluence property.},
  address = {Kassel, Germany},
  author = {Boley, Mario and Horvath, Tamas and Poigne, Axel and Wrobel., Stefan},
  booktitle = {Proceedings of LWA2010 - Workshop-Woche: Lernen, Wissen {\&} Adaptivitaet},
  crossref = {lwa2010},
  editor = {Atzmüller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd},
  interhash = {49ca7e8ee8dcb2236232e9653cb576d1},
  intrahash = {75f0dabe405564eb640a8261edfce283},
  presentation_end = {2010-10-06 10:45:00},
  presentation_start = {2010-10-06 10:22:30},
  room = {0446},
  session = {kdml4},
  title = {Listing closed sets of strongly accessible set systems with applications to data},
  track = {kdml},
  url = {http://www.kde.cs.uni-kassel.de/conf/lwa10/papers/kdml26.pdf},
  year = 2010
}