|
| | Preview | Author(s) | Title | Type | Issue Date |
| 261 | | Horn, Matthias ; Djukanovic, Marko ; Blum, Christian ; Raidl, Günther R. | On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences | Konferenzbeitrag Inproceedings  | 2020 |
| 262 | | Kaufmann, Thomas ; Horn, Matthias ; Raidl, Günther R. | A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem | Konferenzbeitrag Inproceedings | 2020 |
| 263 | | Frohner, Nikolaus ; Raidl, Günther | A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility | Konferenzbeitrag Inproceedings | 2020 |
| 264 | | Ganian, Robert ; Hamm, Thekla ; Talvitie, Topi | An Efficient Algorithm for Counting Markov Equivalent DAGs | Konferenzbeitrag Inproceedings | 2020 |
| 265 | | Klocker, Benedikt ; Fleischner, Herbert ; Raidl, Günther R. | A model for finding transition-minors | Artikel Article | 2020 |
| 266 | | Nickel, Soeren ; Nöllenburg, Martin | Towards Data-Driven Multilinear Metro Maps | Konferenzbeitrag Inproceedings | 2020 |
| 267 | | Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Klute, Fabian ; Nöllenburg, Martin | Extending Partial 1-Planar Drawings | Konferenzbeitrag Inproceedings | 2020 |
| 268 | | Biedl, Therese ; Chaplick, Steven ; Kaufmann, Michael ; Montecchiani, Fabrizio ; Nöllenburg, Martin ; Raftopoulou, Chrysanthi | Layered Fan-Planar Graph Drawings | Konferenzbeitrag Inproceedings | 2020 |
| 269 | | Frohner, Nikolaus ; Raidl, Günther | Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers | Konferenzbeitrag Inproceedings | 2020 |
| 270 | | Jatschka, Thomas ; Rodemann, Tobias ; Raidl, Günther | Distributing Battery Swapping Stations for Electric Scooters in an Urban Area | Konferenzbeitrag Inproceedings | 2020 |
| 271 | | Horn, Matthias ; Djukanovic, Marko ; Blum, Christian ; Raidl, Günther | On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences | Präsentation Presentation | 2020 |
| 272 | | Löffler, Maarten ; Nöllenburg, Martin | Labeling Nonograms | Präsentation Presentation | 2020 |
| 273 | | Gemsa, Andreas ; Niedermann, Benjamin ; Nöllenburg, Martin | A Unified Model and Algorithms for Temporal Map Labeling | Artikel Article | 2020 |
| 274 | | Fenz, Thomas ; Foerster, Klaus-Tycho ; Schmid, Stefan ; Villedieu, Anaïs | Efficient non-segregated routing for reconfigurable demand-aware networks | Artikel Article | 2020 |
| 275 | | Horn, Matthias ; Maschler, Johannes ; Raidl, Günther R. ; Rönnberg, Elina | A*-based construction of decision diagrams for a prize-collecting scheduling problem | Artikel Article | 2020 |
| 276 | | Horn, Matthias ; Raidl, Günther R. ; Rönnberg, Elina | A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources | Artikel Article | 2020 |
| 17 | | Blum, Christian ; Djukanovic, Marko ; Santini, Alberto ; Jiang, Hua ; Li, Chu-Min ; Manyà, Felip ; Raidl, Günter R. | Solving longest common subsequence problems via a transformation to the maximum clique problem | Artikel Article | 2020 |
| 18 | | Klocker, Benedikt ; Fleischner, Herbert ; Raidl, Günther R. | A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three | Artikel Article | 2020 |
| 19 | | Djukanovic, Marko ; Raidl, Günther R. ; Blum, Christian | Anytime algorithms for the longest common palindromic subsequence problem | Artikel Article | 2020 |
| 20 | | Bredereck, Robert ; Chen, Jiehua ; Finnendahl, Ugo Paavo ; Niedermeier, Rolf | Stable roommates with narcissistic, single-peaked, andsingle-crossing preferences | Artikel Article | 2020 |
