Forschungspapier (740)

11101.
Forschungspapier
Hoefer, M.; Wagner, L.: Matching Dynamics with Constraints. (2014), 27 S.
11102.
Forschungspapier
Bishnu, A.; Ghosh, A.; Paul, S.: Linear Kernels for k-Tuple and Liar's Domination in Bounded Genus Graphs. (2014), 17 S.
11103.
Forschungspapier
Liang, Y.: Solving Polynomial Equations with Equation Constraints: the Zero-dimensional Case. (2014), 12 S.
11104.
Forschungspapier
Li, W.; Fritz, M.: Learning Multi-scale Representations for Material Classification. (2014), 8 S.
11105.
Forschungspapier
Elbassioni, K.; Mehlhorn, K.; Ramezani, F.: Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design. (2014), 22 S.
11106.
Forschungspapier
Chalermsook, P.; Laekhanukit, B.; Nanongkai, D.: Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. (2014), 37 S.
11107.
Forschungspapier
Qu, L.; Andres, B.: Estimating Maximally Probable Constrained Relations by Mathematical Programming. (2014), 16 pages S.
11108.
Forschungspapier
Bertrand, P.; Lenzen, C.: The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm. (2014), brief announcement appears at DISC 2014 S.
11109.
Forschungspapier
Abed, F.; Caragiannis, I.; Voudouris, A. A.: Near-optimal Asymmetric Binary Matrix Partitions. (2014), 15 pages S.
11110.
Forschungspapier
Halperin, D.; Kerber, M.; Shaharabani, D.: The Offset Filtration of Convex Objects. (2014), 30 S.
11111.
Forschungspapier
Goswami, M.; Grønlund, A.; Larsen, K. G.; Pagh, R.: Approximate Range Emptiness in Constant Time and Optimal Space. (2014), 11 S.
11112.
Forschungspapier
Dutta, K.; Prasad, A.: 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
Kerber, M.; Raghvendra, S.: Approximation and Streaming Algorithms for Projective Clustering via Random Projections. (2014), 16 S.
11114.
Forschungspapier
Antoniadis, A.; Huang, C.-C.; Ott, S.: A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State. (2014), 15 S.
11115.
Forschungspapier
Pilipczuk, M.; Pilipczuk, M.; Sankowski, P.; van Leeuwen, E. J.: 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
Choudhary, A.; Kerber, M.: Local Doubling Dimension of Point Sets. (2014), 13 pages S.
11117.
Forschungspapier
Bringmann, K.; Hermelin, D.; Mnich, M.; van Leeuwen, E. J.: Parameterized Complexity Dichotomy for Steiner Multicut. (2014), 26 S.
11118.
Forschungspapier
Jeż, A.: A really Simple Approximation of Smallest Grammar. (2014), 11 S.
11119.
Forschungspapier
Golovach, P. A.; Paulusma, D.; van Leeuwen, E. J.: Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. (2014), 18 S.
11120.
Forschungspapier
Bringmann, K.; Sauerwald, T.; Stauffer, A.; Sun, H.: Balls into Bins via Local Search: Cover Time and Maximum Load. (2014), arXiv admin note: text overlap with arXiv:1207.2125 S.
Zur Redakteursansicht