Nombre de documents

52

Nicolas Bonichon


Article dans une revue12 documents

  • Nicolas Bonichon, Iyad Kanj, Ljubomir Perković, Ge Xia. There are Plane Spanners of Degree 4 and Moderate Stretch Factor. Journal of Discrete and Computational Geometry, Springer, 2015, 53 (3), pp.514-546. <hal-01207271>
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic. Tight Stretch Factors for $L_1$- and $L_\infty$-Delaunay Triangulations. Computational Geometry, Elsevier, 2015, 48, pp.237-250. <hal-00964470>
  • Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois, Przemyslaw Uznanski, Shailesh Kumar Agrawal. Broadcasting on Large Scale Heterogeneous Platforms under the Bounded Multi-Port Model. IEEE Transactions on Parallel and Distributed Systems, Institute of Electrical and Electronics Engineers, 2014, 25 (10), pp.2520-2528. <10.1109/TPDS.2013.245>. <hal-00861830>
  • Jean-François Marckert, Nicolas Bonichon. Asymptotics of geometrical navigation on a random set of points of the plane. Advances in Applied Probability, Applied Probability Trust, 2011, 43 (4), pp.899-942. <10.1239/aap/1324045692>. <hal-00649901>
  • Nicolas Bonichon, Mireille Bousquet-Mélou, Eric Fusy. Baxter permutations and plane bipolar orientations. Seminaire Lotharingien de Combinatoire, Université Louis Pasteur, 2010, 61A, pp.B61Ah. <hal-00282571>
  • Olivier Bernardi, Nicolas Bonichon. Catalan's intervals and realizers of triangulations. Journal of Combinatorial Theory, Series A, Elsevier, 2009, 116 (1), pp.55-75. <hal-00143870>
  • Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah. Convex Drawings of 3-Connected Plane Graphs. Algorithmica, Springer Verlag, 2007, 47, pp.399--420. <hal-00306291>
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer. Planar graphs, via well-orderly maps and trees. Graphs and Combinatorics, Springer Verlag, 2006, 22 (2), pp.185-202. <hal-00159296>
  • Nicolas Bonichon. A Bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths. Discrete Mathematics, Elsevier, 2005, 298, pp.104--114. <hal-00307593>
  • Cyril Gavoille, Nicolas Bonichon, Nicolas Hanusse. Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation. Journal of Graph Algorithms and Applications (JGAA), Brown University, 2005, 9, pp.185--204. <hal-00307594>
  • Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah. Orthogonal Drawings based on the Stratification of Planar Graphs. Discrete Mathematics, Elsevier, 2004, 276 (1-3), pp.43--57. <hal-00323049>
  • Nicolas Bonichon, Mohamed Mosbah. Watermelon uniform random generation with applications. Theoretical Computer Science, Elsevier, 2003, 307, pp.241--256. <hal-00307592>

Communication dans un congrès32 documents

  • David Auber, Nicolas Bonichon, Paul Dorbec, Claire Pennarun. Rook-drawing for plane graphs. 23rd International Symposium on Graph Drawing and Network Visualization, Sep 2015, Los Angeles, United States. <hal-01207960>
  • Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André Van Renssen. Upper and Lower Bounds for Online Routing on Delaunay Triangulations. ESA 2015, 2015, Patras, Greece. pp.203-214, 2015. <hal-01207275>
  • Nicolas Bonichon, Iyad Kanj, Ljubomir Perkovic, Ge Xia. There are Plane Spanners of Maximum Degree 4 (extended abstract). SoCG, Jun 2014, Kyoto, Japan. 2014. <hal-00964206>
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic. The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations. 20th Annual European Symposium on Algorithms (ESA), Sep 2012, Ljubljana, Slovenia. 7501 of Lecture Notes in Computer Science, pp.205-216, 2012. <hal-00725844>
  • Olivier Beaumont, Nicolas Bonichon, Ludovic Courtès, Xavier Hanin, Eelco Dolstra. Mixed Data-Parallel Scheduling for Distributed Continuous Integration. IEEE. Heterogeneity in Computing Workshop, in IPDPS 2012, May 2012, Shangaï, China. 2012, Proceedings IPDPS 2012. <hal-00684220>
  • Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois, Loris Marchal. Minimizing Weighted Mean Completion Time for Malleable Tasks Scheduling. IEEE. IPDPS 2012, 26th IEEE International Parallel & Distributed Processing Symposium, May 2012, Shangai, China. 2012, Proceedings IPDPS 2012. <inria-00564056v2>
  • Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque. Use of Internet Embedding Tools for Heterogeneous Resources Aggregation. IEEE. Heterogeneity in Computing Workshop (HCW) - in IPDPS 2011, May 2011, Anchorage, United States. pp.114-124, 2011. <inria-00588650>
  • Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois, P. Uznanski. Broadcasting on Large Scale Heterogeneous Platforms with connectivity artifacts under the Bounded Multi-Port Model. IEEE. ICPADS 2011 - 17th Internation Conference on Parallel and Distributed Systems, Dec 2011, Taïnan, Taiwan. Proceeding of ICPADS 2011, pp.173-180, 2011. <inria-00618784>
  • Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque. Utilisation d'outils de plongement d'Internet pour l'agrégation de ressources hétérogènes. Ducourthial, Bertrand et Felber, Pascal. Conférence : 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France. 2011. <inria-00585254>
  • Olivier Beaumont, Nicolas Bonichon, Hubert Larchevêque. Modeling and Practical Evaluation of a Service Location Problem in Large Scale Networks. Internation Conference on Parallel Computing 2011, Sep 2011, Taipei, Taiwan. pp.10, 2011. <inria-00580969>
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas. Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. WG 2010, Jun 2010, Greece. Springer Berlin / Heidelberg, 6410, pp.266--278, 2010, Lecture Notes in Computer Science. <10.1007/978-3-642-16926-7_25>. <hal-00536710>
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas, Ljubomir Perkovic. Comment résumer le plan. Maria Gradinariu Potop-Butucaru et Hervé Rivano. 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France. 2010. <inria-00476151>
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic. Plane Spanners of Maximum Degree Six. ICALP, 2010, France. 6198, pp.19-30, 2010, <10.1007/978-3-642-14165-2_3>. <hal-00534212>
  • Nicolas Bonichon, Mireille Bousquet-Mélou, Eric Fusy. Permutations de Baxter et orientations bipolaires. Premières Journées de Combinatoire de Bordeaux, Feb 2009, Bordeaux, France. <hal-00366290>
  • Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque. Distributed Approximation Algorithm for Resource Clustering. SIROCCO 2008, 2008, Switzerland. pp.61--73, 2008. <hal-00323068>
  • Mireille Bousquet-Mélou, Nicolas Bonichon, Eric Fusy. Baxter permutations and plane bipolar orientations. TGGT, May 2008, Paris, France. 31, pp.69-74, 2008, Electronic Notes in Discrete Mathematics. <hal-00355755>
  • Olivier Beaumont, Nicolas Bonichon, Lionel Eyraud-Dubois. Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port model. Heterogeneity in Computing Workshop, in IEEE International Symposium on Parallel and Distributed Processing, 2008. IPDPS 2008., Apr 2008, Miami, FL, United States. 2008. <inria-00336189>
  • Nicolas Bonichon, Mireille Bousquet-Mélou, Eric Fusy. Permutations de Baxter et orientations bipolaires planes. Rencontres ALEA 2008, Mar 2008, Luminy, France. <hal-00366287>
  • Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Lionel Eyraud-Dubois, Hubert Larchevêque. Distributed Approximation Algorithm for Resource Clustering. Baker, T.P., Bui, A., Tixeuil, S. Opodis 2008, 2008, Luxor, Egypt. 5401, pp.564--567, 2008, lncs. <10.1007/978-3-540-92221-6_41>. <hal-00396449>
  • Cyril Gavoille, Nicolas Bonichon, Arnaud Labourel. Short Labels by Traversal and Jumping. Electronic Notes in Discrete Mathematics. 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague, mars 2007, Mar 2007, Prague, Czech Republic. Elsevier, 28, pp.153-160, 2007, <10.1016/j.endm.2007.01.022>. <hal-00369657>
  • Olivier Bernardi, Nicolas Bonichon. Catalans intervals and realizers of triangulations (extended abstract). FPSAC07, 2007, China. 2007. <hal-00307858>
  • Cyril Gavoille, Nicolas Bonichon, Arnaud Labourel. Schéma d'étiquetage d'adjacence pour les arbres de degrés borné. 8èmes Journées Graphes et Algorithmes, Orléans, novembre 2006, Nov 2006, Orléans, France. 2006. <hal-00378390>
  • Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel. Short Labels by Traversal and Jumping. $13^$ International Colloquium on Structural Information & Communication Complexity (SIROCCO), 2006, United Kingdom. 4056, pp.143--156, 2006. <hal-00307597>
  • Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel. Edge partition of toroidal graphs into forests in linear time. 7th International Conference on Graph Theory (ICGT), 2005, France. 22, pp.421-425, 2005. <hal-00307600>
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, D. Poulalhon, Gilles Schaeffer. Planar Graphs, via Well-Orderly Maps and Trees. $30^$ International Workshop, Graph - Theoretic Concepts in Computer Science (WG), 2004, Germany. 3353, pp.270-284, 2004. <hal-00307603>
  • Nicolas Bonichon, S. Felsner, Mohamed Mosbah. Convex Drawings of 3-Connected Planar Graphs - (Extended Abstract). Graph Drawing: 12th International Symposium, GD 2004, 2004, United States. 3383, pp.60--70, 2005. <hal-00307595>
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation. $29^$ International Workshop, Graph - Theoretic Concepts in Computer Science (WG), 2003, Netherlands. 2880, pp.81-92, 2003. <hal-00307598>
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. $20^$ Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2003, Germany. 2607 of Lecture Note, pp.499-510, 2003. <hal-00307599>
  • Nicolas Bonichon, Bertrand Le Saec, Mohamed Mosbah. Wagner's theorem on realizers. spring-Verlag. lncs, 2002, Malaga, Spain. 2380, pp.1043--1053, 2002, lncs. <hal-00341260>
  • Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah. Optimal area algorithm for planar polyline drawings.. WG 2002, 2002, Czech Republic. 2573, pp.35--46, 2002. <hal-00323077>
  • Nicolas Bonichon. A Bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths. Proceedings of FPSAC'02, 2002, Australia. pp.123--132, 2002. <hal-00307596>
  • Nicolas Bonichon. Orthogonal Drawings based on the Stratification of Planar Graphs. ICGT 2000, 2000, France. pp.139--142, 2000. <hal-00323078>

Chapitre d'ouvrage1 document

  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse. An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps. Dehmer, Matthias and Emmert-Streib, Frank and Mehler, Alexander. Towards an Information Theory of Complex Networks, Birkhäuser Boston, pp.17-46, 2011, 978-0-8176-4904-3. <hal-00649898>

HDR1 document

  • Nicolas Bonichon. Quelques algorithmes entre le monde des graphes et les nuages de points.. Algorithme et structure de données [cs.DS]. Université Sciences et Technologies - Bordeaux I, 2013. <tel-00922501>

Thèse1 document

  • Nicolas Bonichon. Aspects algorithmiques et combinatoires des réaliseurs des graphes plans maximaux. Informatique [cs]. Université Sciences et Technologies - Bordeaux I, 2002. Français. <tel-00338407>

Pré-publication, Document de travail5 documents

  • Nicolas Bonichon, Mireille Bousquet-Mélou, Paul Dorbec, Claire Pennarun. On the number of planar Eulerian orientations. 2016. <hal-01389264>
  • Nicolas Bonichon, Iyad Kanj, Ljubomir Perković, Ge Xia. There are Plane Spanners of Maximum Degree 4. 2014. <hal-00966353>
  • Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perković, André Van Renssen. Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations. 2014. <hal-01092761>
  • Nicolas Bonichon, Jean-François Marckert. Asymptotics of geometrical navigation on a random set of points of the plane. 2010. <hal-00534217>
  • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas. Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. 2010. <hal-00454565>