|
341 |
A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs
Biedl, Therese. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
342 |
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
Jacob, Ashwin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
343 |
A Programming Language Embedded in Magic: The Gathering
Yin, Howe Choong. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
344 |
A Row Generation Algorithm for Finding Optimal Burning Sequences of Large Graphs
Pereira, Felipe de Carvalho. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
345 |
A Simple Deterministic Near-Linear Time Approximation Scheme for Transshipment with Arbitrary Positive Edge Costs
Fox, Emily. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
346 |
A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
Li, Qian. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
347 |
A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
Hamada, Kou. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
348 |
A Textbook Solution for Dynamic Strings
Lipták, Zsuzsanna. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
349 |
A Tractability Gap Beyond Nim-Sums: It’s Hard to Tell Whether a Bunch of Superstars Are Losers
Burke, Kyle. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
350 |
A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs
Ascone, Rocco. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
Administration
