|
331 |
A Lower Bound for Local Search Proportional Approval Voting
Kraiczy, Sonja. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
332 |
A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles
Harada, Kaito. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
333 |
A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs
Biedl, Therese. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
334 |
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
Jacob, Ashwin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
335 |
A Programming Language Embedded in Magic: The Gathering
Yin, Howe Choong. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
336 |
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
|
|
|
|
337 |
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
|
|
|
|
338 |
A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
Li, Qian. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
339 |
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
|
|
|
|
340 |
A Textbook Solution for Dynamic Strings
Lipták, Zsuzsanna. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
Administration
