|
421 |
Safe Sequences via Dominators in DAGs for Path-Covering Problems
Sena, Francisco. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
422 |
Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
Can Esmer, Barış. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
423 |
#SAT-Algorithms for Classes of Threshold Circuits Based on Probabilistic Rank
Limaye, Nutan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
424 |
Scheduling on Identical Machines with Setup Time and Unknown Execution Time
Kawase, Yasushi. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
425 |
Searching for Falsified Clause in Random (logn})-CNFs Is Hard for Randomized Communication
Riazanov, Artur. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
426 |
Securing Dynamic Data: A Primer on Differentially Private Data Structures (Invited Talk)
Henzinger, Monika. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
427 |
Self-assessment in tracking algorithms using subjective logic
Griebel, Thomas. - Ulm : Kommunikations- und Informationszentrum, Universitätsbibliothek Ulm, 2025
|
|
|
|
428 |
Semantic composition of robotic solver algorithms on graph structures
Schneider, Sven. - Sankt Augustin : Hochschule Bonn-Rhein-Sieg, 2025
|
|
|
|
429 |
Semi-Streaming Algorithms for Hypergraph Matching
Reinstädtler, Henrik. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
430 |
Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds
Spalding-Jamieson, Jack. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
Administration
