|
| | Preview | Author(s) | Title | Type | Issue Date |
| 121 | | Wulms, Jules ; Buchmüller, Juri ; Meulemans, Wouter ; Verbeek, Kevin ; Speckmann, Bettina | Stable Visual Summaries for Trajectory Collections | Konferenzbeitrag Inproceedings  | 2021 |
| 122 | | Chen, Jiehua ; Roy, Sanjukta ; Sorge, Manuel | Fractional Matchings under Preferences: Stability and Optimality | Konferenzbeitrag Inproceedings | 2021 |
| 123 | | Liu, Zhenjun ; Chew, Leroy ; Heule, Marijn | Avoiding Monochromatic Rectangles Using Shift Patterns | Konferenzbeitrag Inproceedings | 2021 |
| 124 | | Deligkas, Argyrios ; Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Ordyniak, Sebastian | The Parameterized Complexity of Connected Fair Division | Konferenzbeitrag Inproceedings | 2021 |
| 125 | | Schidler, Andre ; Szeider, Stefan | Computing Optimal Hypertree Decompositions with SAT | Konferenzbeitrag Inproceedings | 2021 |
| 126 | | Peitl, Tomáš ; Szeider, Stefan | Finding the Hardest Formulas for Resolution (Extended Abstract) | Konferenzbeitrag Inproceedings | 2021 |
| 127 | | Eiben, Eduard ; Ganian, Robert ; Kanj, Iyad ; Ordyniak, Sebastian ; Szeider, Stefan | The Parameterized Complexity of Clustering Incomplete Data | Konferenzbeitrag Inproceedings | 2021 |
| 128 | | Schidler, Andre ; Szeider, Stefan | SAT-based Decision Tree Learning for Large Data Sets | Konferenzbeitrag Inproceedings | 2021 |
| 129 | | Ganian, Robert ; Hamm, Thekla ; Ordyniak, Sebastian | The Complexity of Object Association in Multiple Object Tracking | Konferenzbeitrag Inproceedings | 2021 |
| 130 | | Ordyniak, Sebastian ; Szeider, Stefan | Parameterized Complexity of Small Decision Tree Learning | Konferenzbeitrag Inproceedings | 2021 |
| 131 | | Ramaswamy, Vaidyanathan P. ; Szeider, Stefan | Turbocharging Treewidth-Bounded Bayesian Network Structure Learning | Konferenzbeitrag Inproceedings | 2021 |
| 132 | | Ganian, Robert ; Schidler, Andre ; Sorge, Manuel ; Szeider, Stefan | Threshold Treewidth and Hypertree Width | Konferenzbeitrag Inproceedings | 2021 |
| 133 | | Kratsch, Stefan ; Masařík, Tomáš ; Muzi, Irene ; Pilipczuk, Marcin ; Sorge, Manuel | Optimal Discretization is Fixed-parameter Tractable | Konferenzbeitrag Inproceedings | 2021 |
| 134 | | Bhore, Sujoy ; Da Lozzo, Giordano ; Montecchiani, Fabrizio ; Nöllenburg, Martin | On the Upward Book Thickness Problem: Combinatorial and Complexity Results | Konferenzbeitrag Inproceedings | 2021 |
| 135 | | Horn, Matthias ; Frohner, Nikolaus ; Raidl, Günther R. | Driver Shift Planning for an Online Store with Short Delivery Times | Konferenzbeitrag Inproceedings | 2021 |
| 136 | | Bhore, Sujoy ; Li, Guangping ; Nöllenburg, Martin ; Rutter, Ignaz ; Wu, Hsiang-Yun | Untangling Circular Drawings: Algorithms and Complexity | Konferenzbeitrag Inproceedings | 2021 |
| 137 | | Kirchweger, Markus ; Szeider, Stefan | SAT Modulo Symmetries for Graph Generation | Konferenzbeitrag Inproceedings | 2021 |
| 138 | | Bhore, Sujoy ; Ganian, Robert ; Li, Guangping ; Nöllenburg, Martin ; Wulms, Jules | Worbel: Aggregating Point Labels intoWord Clouds | Konferenzbeitrag Inproceedings | 2021 |
| 139 | | Chew, Leroy | Hardness and Optimality in QBF Proof Systems Modulo NP | Konferenzbeitrag Inproceedings | 2021 |
| 140 | | Reichl, Franz-Xaver ; Slivovsky, Friedrich ; Szeider, Stefan | Certified DQBF Solving by Definition Extraction | Konferenzbeitrag Inproceedings | 2021 |
