@inproceedings{17652,
author = {Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees},
booktitle = {Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I},
isbn = {978-3-319-71150-8},
keyword = {flow, filter, MMSA, set cover, approximation, local ratio algorithm},
pages = {3--17},
publisher = {Springer International Publishing},
title = {{Filtering Undesirable Flows in Networks}},
doi = {10.1007/978-3-319-71150-8_1},
year = {2017},
}
@article{20206,
author = {Lüke, Carina and Ritterfeld, Ute and Grimminger, Angela and Liszkowski, Ulf and Rohlfing, Katharina},
journal = {Journal of Speech, Language, and Hearing Research},
pages = {3185--3197},
title = {{Development of pointing gestures in children with typical and delayed language acquisition. }},
doi = {10.1044/2017_JSLHR-L-16-0129},
year = {2017},
}
@unpublished{17811,
abstract = {We consider a swarm of $n$ autonomous mobile robots, distributed on a
2-dimensional grid. A basic task for such a swarm is the gathering process: All
robots have to gather at one (not predefined) place. A common local model for
extremely simple robots is the following: The robots do not have a common
compass, only have a constant viewing radius, are autonomous and
indistinguishable, can move at most a constant distance in each step, cannot
communicate, are oblivious and do not have flags or states. The only gathering
algorithm under this robot model, with known runtime bounds, needs
$\mathcal{O}(n^2)$ rounds and works in the Euclidean plane. The underlying time
model for the algorithm is the fully synchronous $\mathcal{FSYNC}$ model. On
the other side, in the case of the 2-dimensional grid, the only known gathering
algorithms for the same time and a similar local model additionally require a
constant memory, states and "flags" to communicate these states to neighbors in
viewing range. They gather in time $\mathcal{O}(n)$.
In this paper we contribute the (to the best of our knowledge) first
gathering algorithm on the grid that works under the same simple local model as
the above mentioned Euclidean plane strategy, i.e., without memory (oblivious),
"flags" and states. We prove its correctness and an $\mathcal{O}(n^2)$ time
bound in the fully synchronous $\mathcal{FSYNC}$ time model. This time bound
matches the time bound of the best known algorithm for the Euclidean plane
mentioned above. We say gathering is done if all robots are located within a
$2\times 2$ square, because in $\mathcal{FSYNC}$ such configurations cannot be
solved.},
author = {Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm},
booktitle = {arXiv:1702.03400},
title = {{Gathering Anonymous, Oblivious Robots on a Grid}},
year = {2017},
}
@techreport{20314,
author = {Ditz, Michael and Meschut, Gerson and Schwarze, Thomas and Smart, Dominic},
keyword = {Kleben, Bruchbild, Versagen},
publisher = {Forschungsvereinigung Stahlanwendung e.V.},
title = {{Entwicklung und Qualifizierung einer rechnergestützten Auswertemethode zur Differenzierung der Versagensanteile klebtechnisch gefügter Proben}},
year = {2017},
}
@inproceedings{20376,
author = {Nagel, C. and Fiedler, A. and Brede, M. and Çavdar, Serkan and Meschut, Gerson and Kroll, U. and Matzenmiller, A. and Rybar, G. and Melz, T.},
booktitle = {17. Kolloquium Gemeinsame Forschung in der Klebtechnik},
title = {{Analyse der Schwingfestigkeit geklebter Stahlverbindungen unter mehrkanaliger Belastung}},
year = {2017},
}
@article{20460,
author = {Berner, K and Morris, L and Baumeister, J and Louw, Q},
journal = {BMC Musculoskelet Disord},
number = {1},
pages = {325},
title = {{Objective impairments of glait and balance in adults living with HIV-1 infection: a systematic review and meta-analysis of observational studies}},
volume = {18},
year = {2017},
}
@article{10006,
author = {Dammann, Christian and Lenz, Peter and Mahnken, Rolf},
issn = {2212-8271},
journal = {Procedia CIRP},
pages = {51--56},
publisher = {Elsevier},
title = {{"Thermo-chemo-mechanical Effective Properties for Homogeneous and Heterogeneous n -Phase Mixtures with Application to Curing"}},
doi = {10.1016/j.procir.2017.03.360},
volume = {66},
year = {2017},
}
@article{10020,
author = {Landmann, M. and Rauls, E. and Schmidt, Wolf Gero},
issn = {2469-9950},
journal = {Physical Review B},
title = {{Understanding band alignments in semiconductor heterostructures: Composition dependence and type-I–type-II transition of natural band offsets in nonpolar zinc-blendeAlxGa1−xN/AlyGa1−yNcomposites}},
doi = {10.1103/physrevb.95.155310},
year = {2017},
}
@article{10157,
author = {Jin, Ligang and Steffen, Eckhard},
journal = {J. Graph Theory},
pages = {109 -- 120 },
title = {{Petersen cores and the oddness of cubic graphs}},
volume = {84},
year = {2017},
}
@techreport{1057,
author = {Sürücü, Oktay and Mir Djawadi, Behnud and Brangewitz, Sonja},
publisher = {Universität Paderborn},
title = {{Asymmetric Dominance Effect with Multiple Decoys for Low- and High-Variance Lotteries}},
year = {2017},
}