|
| | Preview | Author(s) | Title | Type | Issue Date |
| 1 | | Bjorklund, Henrik ; Vorobyov, Sergei | A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games | Artikel Article | 2007 |
| 2 | | Creignou, Nadia ; Kröll, Markus ; Pichler, Reinhard ; Skritek, Sebastian ; Vollmer, Heribert | A complexity theory for hard enumeration problems | Artikel Article  | 2019 |
| 3 | | Panholzer, Alois | A distributional study of the path edge-covering numbers for random trees | Artikel Article | 2008 |
| 4 | | Klocker, Benedikt ; Fleischner, Herbert ; Raidl, Günther R. | A model for finding transition-minors | Artikel Article | 2020 |
| 5 | | Ausserhofer, Markus ; Dann, Susanna ; Lángi, Zsolt ; Tóth, Géza | An algorithm to find maximum area polygons circumscribed about a convex polygon | Artikel Article | 2019 |
| 6 | | Kuba, Markus ; Mahmoud, Hosam ; Panholzer, Alois | Analysis of a generalized Friedman's urn with multiple drawings | Artikel Article | 2013 |
| 7 |  | Peitl, Tomáš ; Szeider, Stefan | Are hitting formulas hard for resolution? | Article Artikel   | 15-Oct-2023 |
| 8 | | Eiter, Thomas ; Makino, Kazuhisa ; Gottlob, Georg | Computational Aspects of Monotone Dualization: A Brief Survey | Artikel Article | 2008 |
| 9 | | Vorobyov, Sergei | Cyclic Games and Linear Programming | Artikel Article | 2008 |
| 10 | | Bliem, Bernhard ; Woltran, Stefan | Defensive alliances in graphs of bounded treewidth | Artikel Article | 31-Dec-2018 |
| 11 | | Ganian, Robert ; Hliněný, Petr ; Kneis, Joachim ; Langer, Alexander ; Obdržálek, Jan ; Rossmanith, Peter | Digraph Width Measures in Parameterized Algorithmics | Artikel Article | 2014 |
| 12 | | Engelmann, Viktor ; Ordyniak, Sebastian ; Kreutzer, Stephan | Directed elimination games | Artikel Article | 2016 |
| 13 | | Eiben, Eduard ; Ganian, Robert ; Szeider, Stefan | Meta-kernelization using well-structured modulators | Artikel Article | 2018 |
| 14 | | Blieberger, Johann | Monotonically Labelled Motzkin Trees | Artikel Article | 1987 |
| 15 | | Prosanov, Roman | A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space | Artikel Article | 2020 |
| 16 | | Charron-Bost, Bernadette ; Függer, Matthias ; Nowak, Thomas | New transience bounds for max-plus linear systems | Artikel Article | 2017 |
| 17 | | van ’t Hof, Pim ; Kamiński, Marcin ; Paulusma, Daniël ; Szeider, Stefan ; Thilikos, Dimitrios M. | On Graph Contractions and Induced Minors | Artikel Article | 2012 |
| 18 | | Zeiner, Martin ; Schwarz, Manfred ; Schmid, Ulrich | On Linear-Time Data Dissemination in Dynamic Rooted Trees | Artikel Article | 2019 |
| 19 | | Eiben, Eduard ; Ganian, Robert ; Lauri, Juho | On the Complexity of Rainbow Coloring Problems | Artikel Article | 2018 |
| 20 | | Kuba, Markus ; Panholzer, Alois | On the distribution of distances between specified nodes in increasing trees | Artikel Article | 2010 |
