|
| | Preview | Author(s) | Title | Type | Issue Date |
| 221 | | Chen, Jiehua | Fractional Matchings under Preferences: Stability and Optimality | Präsentation Presentation | 2021 |
| 222 | | Ganian, Robert ; Schidler, Andre ; Sorge, Manuel ; Szeider, Stefan | Threshold Treewidth and Hypertree Width | Konferenzbeitrag Inproceedings | 2021 |
| 223 | | Kratsch, Stefan ; Masařík, Tomáš ; Muzi, Irene ; Pilipczuk, Marcin ; Sorge, Manuel | Optimal Discretization is Fixed-parameter Tractable | Konferenzbeitrag Inproceedings  | 2021 |
| 224 | | Bhore, Sujoy ; Da Lozzo, Giordano ; Montecchiani, Fabrizio ; Nöllenburg, Martin | On the Upward Book Thickness Problem: Combinatorial and Complexity Results | Konferenzbeitrag Inproceedings | 2021 |
| 225 | | Horn, Matthias ; Frohner, Nikolaus ; Raidl, Günther R. | Driver Shift Planning for an Online Store with Short Delivery Times | Konferenzbeitrag Inproceedings | 2021 |
| 226 | | Bhore, Sujoy ; Li, Guangping ; Nöllenburg, Martin ; Rutter, Ignaz ; Wu, Hsiang-Yun | Untangling Circular Drawings: Algorithms and Complexity | Konferenzbeitrag Inproceedings | 2021 |
| 227 | | Kirchweger, Markus ; Szeider, Stefan | SAT Modulo Symmetries for Graph Generation | Konferenzbeitrag Inproceedings | 2021 |
| 228 | | Bhore, Sujoy ; Ganian, Robert ; Li, Guangping ; Nöllenburg, Martin ; Wulms, Jules | Worbel: Aggregating Point Labels intoWord Clouds | Konferenzbeitrag Inproceedings | 2021 |
| 229 | | Chew, Leroy | Hardness and Optimality in QBF Proof Systems Modulo NP | Konferenzbeitrag Inproceedings | 2021 |
| 230 | | Reichl, Franz-Xaver ; Slivovsky, Friedrich ; Szeider, Stefan | Certified DQBF Solving by Definition Extraction | Konferenzbeitrag Inproceedings | 2021 |
| 231 | | Dreier, Jan ; Rossmanith, Peter | Approximate Evaluation of First-Order Counting Queries | Konferenzbeitrag Inproceedings | 2021 |
| 232 | | Li, Shaohua ; Pilipczuk, Marcin ; Sorge, Manuel | Cluster Editing Parameterized Above Modification-Disjoint P3-Packings | Konferenzbeitrag Inproceedings | 2021 |
| 233 | | Gupta, Sushmita ; Jain, Pallavi ; Panolan, Fahad ; Roy, Sanjukta ; Saurabh, Saket | Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms | Konferenzbeitrag Inproceedings | 2021 |
| 234 | | Bhore, Sujoy ; Haunert, Jan-Henrik ; Klute, Fabian ; Li, Guangping ; Nöllenburg, Martin | Balanced Independent and Dominating Sets on Colored Interval Graphs | Konferenzbeitrag Inproceedings | 2021 |
| 235 | | Bandyapadhyay, Sayan ; Fomin, Fedor ; Golovach, Petr ; Simonov, Kirill | Parameterized Complexity of Feature Selection for Categorical Data Clustering | Konferenzbeitrag Inproceedings | 2021 |
| 16 | | Ganian, Robert ; Hamm, Thekla ; Klute, Fabian ; Parada, Irene ; Vogtenhuber, Birgit | Crossing-Optimal Extension of Simple Drawings | Konferenzbeitrag Inproceedings | 2021 |
| 17 | | Chen, Jiehua ; Czerwinski, Wojciech ; Disser, Yann ; Feldmann, Andreas Emil ; Hermelin, Danny ; Nadara, Wojciech ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Sorge, Manuel ; Wróblewski, Bartłomiej ; Zych-Pawlewicz, Anna | Efficient fully dynamic elimination forests with applications to detecting long paths and cycles | Konferenzbeitrag Inproceedings | 2021 |
| 18 | | Blinkhorn, Joshua ; Peitl, Tomáš ; Slivovsky, Friedrich | Davis and Putnam Meet Henkin: Solving DQBF with Resolution | Konferenzbeitrag Inproceedings | 2021 |
| 19 | | Mengel, Stefan ; Slivovsky, Friedrich | Proof Complexity of Symbolic QBF Reasoning | Konferenzbeitrag Inproceedings | 2021 |
| 20 | | Ganian, Robert ; Hamm, Thekla ; Mescoff, Guillaume | The Complexity Landscape of Resource-Constrained Scheduling | Konferenzbeitrag Inproceedings | 2021 |
