Making the Most of Parallel Composition in Differential Privacy. | 0 | 0.34 | 2022 |
On the Parameterized Cluster Editing with Vertex Splitting Problem. | 0 | 0.34 | 2019 |
Linearly $χ$-Bounding $(P_6, C_4)$-Free Graphs. | 0 | 0.34 | 2017 |
Backdoor Sets for CSP. | 0 | 0.34 | 2017 |
Linearly \chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free Graphs. | 0 | 0.34 | 2017 |
On the Complexity of Grammar-Based Compression over Fixed Alphabets. | 5 | 0.48 | 2016 |
Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets. | 2 | 0.51 | 2014 |
Strategic aspects of the probabilistic serial rule for the allocation of goods. | 0 | 0.34 | 2014 |
From edge-disjoint paths to independent paths | 1 | 0.36 | 2012 |
How applying Myhill-Nerode methods to hypergraphs helps mastering the Art of Trellis Decoding | 1 | 0.37 | 2012 |