# Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada

@inproceedings{Froese2016ProceedingsOT, title={Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada}, author={Vincent Froese and Iyad A. Kanj and Andr{\'e} Nichterlein and Rolf Niedermeier}, booktitle={Canadian Conference on Computational Geometry}, year={2016} }

A fundamental problem in Distributed Computing is the Pattern Formation problem, where some independent mobile entities, called robots, have to rearrange themselves in such a way as to form a given figure from every possible (non-degenerate) initial configuration. In the present paper, we consider robots that operate in the Euclidean plane and are dimensionless, anonymous, oblivious, silent, asynchronous, disoriented, nonchiral, and non-rigid. For this very elementary type of robots, the…

## References

SHOWING 1-10 OF 422 REFERENCES

### On the General Position Subset Selection Problem

- Mathematics, Computer ScienceSIAM J. Discret. Math.
- 2013

It is proved that if $\ell \leq O(n^{(1-\epsilon)/2})$ then f(n,\ell) \geq \Omega(\sqrt{n\log_\ell n})$, which implies all previously known lower bounds on $f(n)$ and improves them when $\ell$ is not fixed.

### Some APX-completeness results for cubic graphs

- MathematicsTheor. Comput. Sci.
- 2000

### Point Line Cover: The Easy Kernel is Essentially Tight

- Computer Science, MathematicsSODA
- 2014

This work shows, by reduction from Vertex Cover, that---unless the polynomial hierarchy collapses---PLC has no kernel of total size O(k2-e) bits, which implies the claimed lower bound on the number of points.

### Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses

- Computer Science, MathematicsSTOC '10
- 2010

It is shown that if satisfiability for n-variable d-CNF formulas has a protocol of cost O(nd-ε) then coNP is in NP/poly, which implies that the polynomial-time hierarchy collapses to its third level.

### Covering Things with Things

- Computer Science, MathematicsESA
- 2002

These algorithms lead to fixed-parameter tractable algorithms for many geometric and non-geometric covering problems.

### Computers and Intractability: A Guide to the Theory of NP-Completeness

- Computer Science
- 1978

It is proved here that the number ofrules in any irredundant Horn knowledge base involving n propositional variables is at most n 0 1 times the minimum possible number of rules.

### Mathematical Gems II

- PhilosophyThe Mathematical Gazette
- 1977

Eventually, you will very discover a new experience and endowment by spending more cash. yet when? accomplish you take that you require to get those all needs next having significantly cash? Why…

### Minimal Witness Sets For Art Gallery Problems

- Computer Science
- 2016

An algorithm for computing witness sets of points, line segments and, if necessary, regions in O(n 4 ) time is proposed and determines whether guarding the boundary of a polygon is sucient to guard the entire polygon.