![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
10th ADG 2014: Coimbra, Portugal
- Francisco Botana, Pedro Quaresma
:
Automated Deduction in Geometry - 10th International Workshop, ADG 2014, Coimbra, Portugal, July 9-11, 2014, Revised Selected Papers. Lecture Notes in Computer Science 9201, Springer 2015, ISBN 978-3-319-21361-3 - Md. Ashraful Alam, Ileana Streinu:
Star-Unfolding Polygons. 1-20 - Ciprian S. Borcea, Ileana Streinu:
Volume Frameworks and Deformation Varieties. 21-36 - James H. Davenport
, Matthew England
:
Recent Advances in Real Geometric Reasoning. 37-52 - Zoltán Kovács
:
The Relation Tool in GeoGebra 5. 53-71 - Vesna Marinkovic
, Predrag Janicic
, Pascal Schreck:
Computer Theorem Proving for Verifiable Solving of Geometric Construction Problems. 72-93 - Shuichi Moritsugu:
Integrated Circumradius and Area Formulae for Cyclic Pentagons and Hexagons. 94-107 - Pavel Pech
:
Extension of Simson-Wallace Theorem on Skew Quadrilaterals and Further Properties. 108-118 - Pedro Quaresma
, Nuno Baeta
:
Current Status of the I2GATP Common Format. 119-128 - Meera Sitharam, Joel Willoughby:
On Flattenability of Graphs. 129-148 - Dan Song, Dongming Wang, Xiaoyu Chen:
Discovering Geometric Theorems from Scanned and Photographed Images of Diagrams. 149-165 - Menghan Wang, Meera Sitharam:
Combinatorial Rigidity and Independence of Generalized Pinned Subspace-Incidence Constraint Systems. 166-180
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.