|
| | Preview | Author(s) | Title | Type | Issue Date |
| 1 |  | Binucci, Carla ; Di Giacomo, Emilio ; Lenhart, William ; Liotta, Giuseppe ; Montecchiani, Fabrizio ; Nöllenburg, Martin ; Symvonis, Antonios | On the complexity of the storyplan problem | Article Artikel    | Feb-2024 |
| 2 | | Ekstein, Jan ; Fleischner, Herbert | The most general structure of graphs with hamiltonian or hamiltonian connected square | Article Artikel | 1-Jan-2024 |
| 3 | | Ganian, Robert ; Hamm, Thekla ; Knop, Dušan ; Schierreich, Šimon ; Suchý, Ondřej | Hedonic diversity games: A complexity picture with more than two colors | Article Artikel | Dec-2023 |
| 4 | | Khazaliya, Liana ; Kindermann, Philipp ; Liotta, Giuseppe ; Montecchiani, Fabrizio ; Simonov, Kirill | The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable | Inproceedings Konferenzbeitrag | Dec-2023 |
| 5 | | Brand, Cornelius ; Lassota, Alexandra | Fast Convolutions for Near-Convex Sequences | Inproceedings Konferenzbeitrag | Dec-2023 |
| 6 |  | Schidler, Andre ; Szeider, Stefan | SAT-boosted tabu search for coloring massive graphs | Article Artikel | Dec-2023 |
| 7 |  | Schidler, André ; Szeider, Stefan | Computing optimal hypertree decompositions with SAT | Article Artikel | Dec-2023 |
| 8 | | Chen, Jiehua | Advancing Stability in Matching Markets: Multi-Modal Preferences and Beyond | Presentation Vortrag | 6-Nov-2023 |
| 9 |  | Peitl, Tomáš ; Szeider, Stefan | Are hitting formulas hard for resolution? | Article Artikel | 15-Oct-2023 |
| 10 |  | Chen, Jiehua ; Hatschka, Christian ; Simola, Sofia | Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences | Inproceedings Konferenzbeitrag | 28-Sep-2023 |
| 11 |  | Zhang, Tianwei ; Szeider, Stefan | Searching for Smallest Universal Graphs and Tournaments with SAT | Inproceedings Konferenzbeitrag | 22-Sep-2023 |
| 12 |  | Ramaswamy, Vaidyanathan Peruvemba ; Szeider, Stefan | Proven Optimally-Balanced Latin Rectangles with SAT | Inproceedings Konferenzbeitrag | 22-Sep-2023 |
| 13 |  | Depian, Thomas ; Li, Guangping ; Nöllenburg, Martin ; Wulms, Jules | Transitions in Dynamic Point Labeling | Inproceedings Konferenzbeitrag | 7-Sep-2023 |
| 14 | | Bergougnoux, Benjamin ; Chekan, Vera ; Ganian, Robert ; Kanté, Mamadou M. ; Mnich, Matthias ; Oum, Sang-il ; Pilipczuk, Michał ; van Leeuwen, Erik Jan | Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth | Inproceedings Konferenzbeitrag | 1-Sep-2023 |
| 15 | | Brand, Cornelius ; Ganian, Robert ; Rocton, Mathis Teva | New Complexity-Theoretic Frontiers of Tractability for Neural Network Training | Inproceedings Konferenzbeitrag | Sep-2023 |
| 16 | | Brand, Cornelius ; Ganian, Robert ; Röder Sebastian ; Schager Florian | Fixed-Parameter Algorithms for Computing {RAC} Drawings of Graphs | Inproceedings Konferenzbeitrag | Sep-2023 |
| 17 |  | Dreier, Jan ; Ordyniak, Sebastian ; Szeider, Stefan | CSP beyond tractable constraint languages | Article Artikel | Sep-2023 |
| 18 |  | Bhore, Sujoy ; Ganian, Robert ; Li, Guangping ; Nöllenburg, Martin ; Wulms, Jules | Worbel: aggregating point labels into word clouds | Article Artikel | Sep-2023 |
| 19 |  | Wallinger, Markus ; Archambault, Daniel ; Auber, David ; Nöllenburg, Martin ; Peltonen, Jaakko | Faster edge‐path bundling through graph spanners | Article Artikel | Sep-2023 |
| 20 |  | Dreier, Jan ; Mock, Daniel ; Rossmanith, Peter | Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond | Inproceedings Konferenzbeitrag | 30-Aug-2023 |
