|
| | Preview | Author(s) | Title | Type | Issue Date |
| 121 | | Pop, Petrica ; Cosmin, Sabo ; Biesinger, Benjamin ; Hu, Bin ; Raidl, Günther | Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm | Artikel Article  | 2017 |
| 122 | | Ganian, Robert ; Ramanujan, M. S. ; Szeider, Stefan | Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting | Artikel Article | 2017 |
| 123 | | Haan, Ronald De ; Kanj, Iyad ; Szeider, Stefan | On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances | Artikel Article | 2017 |
| 124 | | Müller, Moritz ; Szeider, Stefan | The Treewidth of Proofs | Artikel Article | 2017 |
| 125 | | Riedler, Martin ; Jatschka, Thomas ; Maschler, Johannes ; Raidl, Günther | An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem | Artikel Article | 2017 |
| 126 | | Gajarsky, Jakub ; Hlinený, Petr ; Kaiser, Tomas ; Král, Daniel ; Kupec, Martin ; Obdrzalek, Jan ; Ordyniak, Sebastian ; Vojtech, Tuma | First order limits of sparse graphs: Plane trees and path-width | Artikel Article | 2017 |
| 127 | | Nöllenburg, Martin ; Prutkin, Roman ; Rutter, Ignaz | Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions | Artikel Article | 2017 |
| 128 | | Eiben, Eduard ; Ganian, Robert ; Szeider, Stefan | Solving Problems on Graphs of High Rank-Width | Artikel Article | 2017 |
| 129 | | Gaspers, Serge ; Misra, Neeldhara ; Ordyniak, Sebastian ; Szeider, Stefan ; Živný, Stanislav | Backdoors into heterogeneous classes of SAT and CSP | Artikel Article | 2017 |
| 130 | | de Haan, Ronald ; Szeider, Stefan | Parameterized complexity classes beyond para-NP | Artikel Article | 2017 |
| 131 | | Kloimüllner, Christian ; Raidl, Günther | Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition | Artikel Article | 2017 |
| 132 | | Li, Ping ; Li, Hao ; Chen, Ye ; Fleischner, Herbert ; Lai, Hong-Jian | Supereulerian graphs with width s and s-collapsible graphs | Artikel Article | 19-Feb-2016 |
| 133 | | Gemsa, Andreas ; Nöllenburg, Martin ; Rutter, Ignaz | Evaluation of Labeling Strategies for Rotating Maps | Artikel Article | 2016 |
| 134 | | Löffler, Maarten ; Nöllenburg, Martin ; Staals, Frank | Mixed map labeling | Artikel Article | 2016 |
| 135 | | Biesinger, Benjamin ; Hu, Bin ; Raidl, Günther | Models and algorithms for competitive facility location problems with different customer behavior. | Artikel Article | 2016 |
| 136 | | Nöllenburg, Martin ; Prutkin, Roman ; Rutter, Ignaz | On Self-Approaching And Increasing-Chord Drawings Of 3-Connected Planar Graphs | Artikel Article | 2016 |
| 137 | | Eppstein, David ; Holten, Danny ; Löffler, Maarten ; Nöllenburg, Martin ; Speckmann, Bettina ; Verbeek, Kevin | Strict Confluent Drawing | Artikel Article | 2016 |
| 138 | | Ganian, Robert ; Slivovsky, Friedrich ; Szeider, Stefan | Meta-kernelization with structural parameters | Artikel Article | 2016 |
| 139 | | Gemsa, Andreas ; Nöllenburg, Martin ; Rutter, Ignaz | Consistent Labeling Of Rotating Maps | Artikel Article | 2016 |
| 140 | | Mchedlidze, Tamara ; Nöllenburg, Martin ; Rutter, Ignaz | Extending Convex Partial Drawings of Graphs | Artikel Article | 2016 |
