|
||
---|---|---|
hal-00684510v1
Journal articles
On Point-sets that Support Planar Graphs Computational Geometry, Elsevier, 2013, 43 (1), pp.29--50. ⟨10.1016/j.comgeo.2012.03.003⟩ |
||
hal-01366148v1
Conference papers
Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$ 24th International Symposium on Graph Drawing & Network Visualization, Sep 2016, Athens, Greece |
||
hal-01529154v2
Journal articles
Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$ Discrete Mathematics and Theoretical Computer Science, DMTCS, 2018, 20 (1), pp.1-11. ⟨10.23638/DMTCS-20-1-1⟩ |
||
hal-01132712v1
Conference papers
Concept Vocabularies in Programmer Sociolects (Work in Progress) PPIG 2014 - 25th Annual Conference, Psychology of Programming Interest Group (PPIG), Jun 2014, Brighton, United Kingdom |
||
hal-01442383v1
Journal articles
The Herschel Multi-tiered Extragalactic Survey: SPIRE-mm photometric redshifts Monthly Notices of the Royal Astronomical Society, Oxford University Press (OUP): Policy P - Oxford Open Option A, 2012, 419 (4), pp.2758-2773. ⟨10.1111/j.1365-2966.2011.19827.x⟩ ![]() |
||
inria-00071219v1
Reports
Drawing $K_n$ in Three Dimensions with One Bend per Edge [Research Report] RR-5708, INRIA. 2005 |
||
inria-00431769v1
Journal articles
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices Discrete and Computational Geometry, Springer Verlag, 2010, 43 (2), pp.272-288. ⟨10.1007/s00454-009-9149-3⟩ |
||
inria-00126428v2
Reports
Time- and Space-Efficient Evaluation of Some Hypergeometric Constants [Research Report] RR-6105, INRIA. 2007 |
||
inria-00192927v1
Journal articles
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint International Journal of Computational Geometry and Applications, World Scientific Publishing, 2007, 17 (4), pp.297-304. ⟨10.1142/S0218195907002343⟩ |
||
inria-00189036v1
Conference papers
Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices The 15th International Symposium on Graph Drawing - GD 2007, Sep 2007, Sydney, Australia. pp.345-351, ⟨10.1007/978-3-540-77537-9_34⟩ |
||
inria-00103923v1
Journal articles
Drawing Kn in Three Dimensions with One Bend per Edge Journal of Graph Algorithms and Applications, Brown University, 2006, 10 (2), pp.287-295 |
||
inria-00000374v1
Conference papers
Drawing $K_n$ in Three Dimensions with One Bend per Edge 13th International Symposium on Graph Drawing - GD'2005, Sep 2005, University of Limerick, Ireland |
||
inria-00077116v1
Reports
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint [Research Report] RR-5742, INRIA. 2005, pp.11 |
||
inria-00177850v1
Conference papers
Time- and Space-Efficient Evaluation of Some Hypergeometric Constants ISSAC '07: Proceedings of the 2007 international symposium on Symbolic and algebraic computation, Association for Computing Machinery, Jul 2007, Waterloo, Canada. pp.85-91, ⟨10.1145/1277548.1277561⟩ |
||
inria-00000569v1
Conference papers
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint 17th Canadian Conference on Computational Geometry - CCCG'2005, Aug 2005, Windsor, Canada |
||
lirmm-00324589v1
Conference papers
A Note on α-Drawable k-Trees CCCG'08: Canadian Conference on Computational Geometry, Canada. pp.23-27 |
||
hal-00643824v1
Conference papers
On Point-sets that Support Planar Graphs 19th International Symposium on Graph Drawing, Sep 2011, Eindhoven, Netherlands |
||
hal-01326779v1
Conference papers
On the Planar Split Thickness of Graphs LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Apr 2016, Ensenada, Mexico. pp.403-415, ⟨10.1007/978-3-662-49529-2_30⟩ ![]() |
||
hal-01819362v1
Journal articles
On the Planar Split Thickness of Graphs Algorithmica, Springer Verlag, 2018, 80 (3), pp.977 - 994. ⟨10.1007/s00453-017-0328-y⟩ |
||
|