|
| | Preview | Author(s) | Title | Type | Issue Date |
| 141 |  | Huber, Marc ; Raidl, Günther | Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems | Inproceedings Konferenzbeitrag    | 2-Feb-2022 |
| 142 |  | Bergren, Dan ; Eiben, Eduard ; Ganian, Robert ; Kanj, Iyad | On Covering Segments with Unit Intervals | Article Artikel | 1-Jan-2022 |
| 143 | | Wallinger, Markus ; Archambault, Daniel ; Auber, David ; Nöllenburg, Martin ; Peltonen, Jaakko | Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach | Artikel Article | Jan-2022 |
| 144 |  | Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Jaffke, Lars ; Kwon, O-Joung | A Unifying Framework for Characterizing and Computing Width Measures | Inproceedings Konferenzbeitrag | Jan-2022 |
| 145 | | Djukanović, Marko ; Kartelj, Aleksandar ; Matić, Dragan ; Grbić, Milana ; Blum, Christian ; Raidl, Günther R. | Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences | Article Artikel | 2022 |
| 146 | | Schidler, André ; Szeider, Stefan | A SAT Approach to Twin-Width | Inproceedings Konferenzbeitrag | 2022 |
| 147 | | Jatschka, Thomas ; Rodemann, Tobias ; Raidl, Günther | A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning | Presentation Vortrag | 2022 |
| 148 | | Brand, Cornelius ; Ceylan, Esra ; Ganian, Robert ; Hatschka, Christian ; Korchemna, Viktoriia | Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts | Inproceedings Konferenzbeitrag | 2022 |
| 149 | | Batik, Tobias ; Terziadis, Soeren ; Wang, Yu-Shuen ; Nöllenburg, Martin ; Wu, Hsiang-Yun | Shape-Guided Mixed Metro Map Layout | Inproceedings Konferenzbeitrag | 2022 |
| 150 | | Frohner, Nikolaus ; Raidl, Günther | Learning Value Functions for Same-Day Delivery Problems | Inproceedings Konferenzbeitrag | 2022 |
| 151 | | Md. Alam, Jawaherul ; Bekos, Michael A. ; Gronemann, Martin ; Kaufmann, Michael ; Pupyrev, Sergey | The mixed page number of graphs | Article Artikel | 2022 |
| 152 | | Slivovsky, Friedrich | QBF Solvers and their Proof Complexity | Presentation Vortrag | 2022 |
| 153 | | Szeider, Stefan | The Parameterized Complexity of SAT | Presentation Vortrag | 2022 |
| 154 | | Szeider, Stefan | SLIM- SAT-based Local Improvement | Presentation Vortrag | 2022 |
| 155 | | Szeider, Stefan | SAT-based Local Improvement | Presentation Vortrag | 2022 |
| 156 | | Brand, Cornelius | Discriminantal subset convolution: Refining exterior-algebraic methods for parameterized algorithms | Article Artikel | 2022 |
| 157 | | Szeider, Stefan | From Twin-Width to Propositional Logic and Back | Presentation Vortrag | 2022 |
| 158 | | Depian, Thomas ; Li, Guangping ; Nöllenburg, Martin ; Wulms, Jules | Transitions in Dynamic Map Labeling | Presentation Vortrag | 2022 |
| 159 | | Huber, Marc ; Raidl, Günther | A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems | Inproceedings Konferenzbeitrag | 2022 |
| 160 | | Ganian, Robert ; Korchemna, Viktoriia | Slim Tree-Cut Width | Inproceedings Konferenzbeitrag | 2022 |
