|
| | Preview | Author(s) | Title | Type | Issue Date |
| 141 | | Alon, Noga ; Gutin, Gregory ; Kim, Eun Jung ; Szeider, Stefan ; Yeo, Anders | Solving MAX-r-SAT Above a Tight Lower Bound | Artikel Article | 2011 |
| 142 | | Dantchev, Stefan S. ; Martin, Barnaby ; Szeider, Stefan | Parameterized Proof Complexity | Artikel Article | 2011 |
| 143 | | Samer, Marko ; Szeider, Stefan | Tractable Cases of the Extended Global Cardinality Constraint | Artikel Article | 2011 |
| 144 | | Bessy, Stéphane ; Fomin, Fedor V. ; Gaspers, Serge ; Paul, Christophe ; Perez, Anthony ; Saurabh, Saket ; Thomassé, Stéphan | Kernels for Feedback Arc Set In Tournaments | Artikel Article | 2011 |
| 145 | | Fellows, Michael R. ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Rosamond, Frances ; Saurabh, Saket ; Szeider, Stefan ; Thomassen, Carsten | On the Complexity of Some Colorful Problems Parameterized by Treewidth | Artikel Article | 2011 |
| 146 | | Kreutzer, Stephan ; Ordyniak, Sebastian | Digraph decompositions and monotonicity in digraph searching | Artikel Article | 2011 |
| 147 | | Kim, Eun Jung ; Ordyniak, Sebastian ; Szeider, Stefan | Algorithms and Complexity Results for Persuasive Argumentation | Artikel Article | 2011 |
| 148 | | Atserias, A. ; Fichte, J. K. ; Thurley, M. | Clause-learning algorithms with many restarts and bounded-width resolution | Artikel Article | 2011 |
| 149 | | Szeider, Stefan | Monadic Second Order Logic on Graphs with Local Cardinality Constraints | Artikel Article | 2011 |
| 150 | | Gutin, Gregory ; Kim, Eun Jung ; Szeider, Stefan ; Yeo, Anders | A Probabilistic Approach to Problems Parameterized Above or Below Tight Bounds | Artikel Article | 2011 |
| 151 | | Szeider, Stefan | The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT | Artikel Article | 2011 |
| 152 | | Bruijn, Jos De ; Eiter, Thomas ; Polleres, Axel ; Tompits, Hans | Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge Base Combination | Artikel Article | 2011 |
| 153 | | Eiter, Thomas ; Ianni, Giovambattista ; Lukasiewicz, Thomas ; Schindlauer, Roman | Well-founded semantics for description logic programs in the Semantic Web | Artikel Article | 2011 |
| 154 | | FINK, MICHAEL | A General Framework for Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There | Artikel Article | 2011 |
| 155 | | Jennings, R. E. ; Chen, Y. ; Sahasrabudhe, J. | On a new Idiom in the study of Entailment | Artikel Article  | 2011 |
| 156 | | Eiter, Thomas ; Šimkus, Mantas | FDNC: Decidable nonmonotonic Disjunctive Logic Programs with Function Symbols | Artikel Article | 22-Jan-2010 |
| 157 | | Egly, Uwe ; Gaggl, Sarah ; Woltran, Stefan | Answer-Set Programming Encodings for Argumentation Frameworks | Artikel Article | 2010 |
| 158 | | Broersma, Hajo ; Dantchev, Stefan S. ; Johnson, Matthew ; Szeider, Stefan | Journal of Discrete Algorithms 8(2) - Editorial | Artikel Article | 2010 |
| 159 | | Binkele-Raible, Daniel ; Fernau, Henning ; Gaspers, Serge ; Liedloff, Mathieu | Exact exponential-time algorithms for finding bicliques | Artikel Article | 2010 |
| 160 | | Lukasiewicz, Thomas | A novel combination of answer set programming with description logics for the Semantic Web | Artikel Article | 2010 |
