Forschungspapier (740)
11101.
Forschungspapier
Matching Dynamics with Constraints. (2014), 27 S.
11102.
Forschungspapier
Linear Kernels for k-Tuple and Liar's Domination in Bounded Genus Graphs. (2014), 17 S.
11103.
Forschungspapier
Solving Polynomial Equations with Equation Constraints: the Zero-dimensional Case. (2014), 12 S.
11104.
Forschungspapier
Learning Multi-scale Representations for Material Classification. (2014), 8 S.
11105.
Forschungspapier
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design. (2014), 22 S.
11106.
Forschungspapier
Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. (2014), 37 S.
11107.
Forschungspapier
Estimating Maximally Probable Constrained Relations by Mathematical Programming. (2014), 16 pages S.
11108.
Forschungspapier
The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm. (2014), brief announcement appears at DISC 2014 S.
11109.
Forschungspapier
Near-optimal Asymmetric Binary Matrix Partitions. (2014), 15 pages S.
11110.
Forschungspapier
The Offset Filtration of Convex Objects. (2014), 30 S.
11111.
Forschungspapier
Approximate Range Emptiness in Constant Time and Optimal Space. (2014), 11 S.
11112.
Forschungspapier
Combinatorics of Finite Abelian Groups and Weil Representations. (2014), 26 pages, 3 figures Revised version, to appear in Pacific Journal of Mathematics S.
11113.
Forschungspapier
Approximation and Streaming Algorithms for Projective Clustering via Random Projections. (2014), 16 S.
11114.
Forschungspapier
A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State. (2014), 15 S.
11115.
Forschungspapier
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. (2014), Major update. In particular: new overview of the proofs, weighted variant of the main theorem, a lower bound for Steiner Forest S.
11116.
Forschungspapier
Local Doubling Dimension of Point Sets. (2014), 13 pages S.
11117.
Forschungspapier
Parameterized Complexity Dichotomy for Steiner Multicut. (2014), 26 S.
11118.
Forschungspapier
A really Simple Approximation of Smallest Grammar. (2014), 11 S.
11119.
Forschungspapier
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. (2014), 18 S.
11120.
Forschungspapier
Balls into Bins via Local Search: Cover Time and Maximum Load. (2014), arXiv admin note: text overlap with arXiv:1207.2125 S.