|
| | Preview | Author(s) | Title | Type | Issue Date |
| 281 | | Bredereck, Robert ; Chen, Jiehua ; Knop, Dusan ; Luo, Junjie ; Niedermeier, Rolf | Adapting Stable Matchings to Evolving Preferences | Konferenzbeitrag Inproceedings  | 2020 |
| 282 | | Frohner, Nikolaus ; Neumann, Bernhard ; Raidl, Günther R. | A Beam Search Approach to the Traveling Tournament Problem | Konferenzbeitrag Inproceedings | 2020 |
| 283 | | Wu, Hsiang-Yun ; Nöllenburg, Martin ; Viola, Ivan | Multi-level Area Balancing of Clustered Graphs | Artikel Article | 2020 |
| 284 | | Fichte, Johannes ; Manthey, Norbert ; Stecklina, Julian ; Schidler, Andre | Towards Faster Reasoners by Using Transparent Huge Pages | Konferenzbeitrag Inproceedings | 2020 |
| 285 | | Fichte, Johannes K. ; Hecher, Markus ; Szeider, Stefan | Breaking Symmetries with RootClique and LexTopSort | Konferenzbeitrag Inproceedings | 2020 |
| 286 | | Fichte, Johannes K. ; Hecher, Markus ; Szeider, Stefan | A Time Leap Challenge for SAT-Solving | Konferenzbeitrag Inproceedings | 2020 |
| 287 | | Bergougnoux, Benjamin ; Eiben, Eduard ; Ganian, Robert ; Ordyniak, Sebastian ; Ramanujan, M. S. | Towards a Polynomial Kernel for Directed Feedback VertexSet | Artikel Article | 2020 |
| 288 | | Eiben, Eduard ; Ganian, Robert ; Ordyniak, Sebastian | Usingdecomposition-parametersforQBF:Mindtheprefix! | Artikel Article | 2020 |
| 289 | | Ganian, Robert ; Kanj, Iyad ; Ordyniak, Sebastian ; Szeider, Stefan | On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank | Konferenzbeitrag Inproceedings | 2020 |
| 290 | | Ganian, Robert ; Ordyniak, Sebastian | The Power of Cut‑Based Parameters for Computing Edge‑Disjoint Paths | Artikel Article | 2020 |
| 291 | | Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Ordyniak, Sebastian | Parameterized Complexity of Envy-Free Resource Allocation in Social Networks | Konferenzbeitrag Inproceedings | 2020 |
| 292 | | Ganian, Robert ; Klute, Fabian ; Ordyniak, Sebastian | On Structural Parameterizations of the Bounded‑Degree Vertex Deletion Problem | Artikel Article | 2020 |
| 293 | | Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Klute, Fabian ; Nöllenburg, Martin | Extending Nearly Complete 1-Planar Drawings in Polynomial Time | Konferenzbeitrag Inproceedings | 2020 |
| 294 | | Wu, Hsiang‐Yun ; Niedermann, Benjamin ; Takahashi, Shigeo ; Roberts, Maxwell J. ; Nöllenburg, Martin | A Survey on Transit Map Layout - from Design, Machine, and Human Perspectives | Artikel Article | 2020 |
| 295 | | Djukanovic, Marko ; Berger, Christoph ; Raidl, Günther R. ; Blum, Christian | An A∗Search Algorithm for the Constrained Longest Common Subsequence Problem | Artikel Article | 2020 |
| 296 | | Djukanovic, Marko ; Berger, Christoph ; Raidl, Günther R. ; Blum, Christian | On Solving a Generalized Constrained Longest Common Subsequence Problem | Konferenzbeitrag Inproceedings | 2020 |
| 297 | | Bhore, Sujoy ; Ganian, Robert ; Montecchiani, Fabrizio ; Nöllenburg, Martin | Parameterized Algorithms for Book Embedding Problems | Artikel Article | 2020 |
| 298 | | Bhore, Sujoy ; Haunert, Jan-Henrik ; Klute, Fabian ; Li, Guangping ; Nöllenburg, Martin | Balanced Independent and Dominating Sets onColored Interval Graphs | Präsentation Presentation | 2020 |
| 299 | | Bhore, Sujoy ; Li, Guangping ; Nöllenburg, Martin | An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling | Konferenzbeitrag Inproceedings | 2020 |
| 300 | | Bandyapadhyay, Sayan ; Banik, Aritra ; Bhore, Sujoy ; Nöllenburg, Martin | Geometric Planar Networks on Bichromatic Points | Konferenzbeitrag Inproceedings | 2020 |
