Nicolas Bonichon
61
Documents
Publications
Local Routing Algorithms on Euclidean Spanners with Small DiameterLATIN'2022, 2022, Guanajuato, Mexico
Conference papers
hal-04172465v1
|
|
|
Improved Routing on the Delaunay TriangulationESA 2018 - 26th Annual European Symposium on Algorithms, Aug 2018, Helsinki, Finland. ⟨10.4230/LIPIcs.ESA.2018.22⟩
Conference papers
hal-01881280v1
|
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and RecognitionProceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016), Sep 2016, Athènes, Greece
Conference papers
hal-01412047v1
|
|
|
Rook-drawing for plane graphs23rd International Symposium on Graph Drawing and Network Visualization, Sep 2015, Los Angeles, United States
Conference papers
hal-01207960v1
|
Upper and Lower Bounds for Online Routing on Delaunay TriangulationsESA 2015, 2015, Patras, Greece. pp.203-214
Conference papers
hal-01207275v1
|
|
There are Plane Spanners of Maximum Degree 4 (extended abstract)SoCG, Jun 2014, Kyoto, Japan
Conference papers
hal-00964206v1
|
|
|
Minimizing Weighted Mean Completion Time for Malleable Tasks SchedulingIPDPS 2012, 26th IEEE International Parallel & Distributed Processing Symposium, May 2012, Shangai, China
Conference papers
inria-00564056v2
|
|
Mixed Data-Parallel Scheduling for Distributed Continuous IntegrationHeterogeneity in Computing Workshop, in IPDPS 2012, May 2012, Shangaï, China
Conference papers
hal-00684220v1
|
The Stretch Factor of ${L}_1$- and ${L}_\infty$-{D}elaunay Triangulations20th Annual European Symposium on Algorithms (ESA), Sep 2012, Ljubljana, Slovenia. pp.205-216
Conference papers
hal-00725844v1
|
|
|
Modeling and Practical Evaluation of a Service Location Problem in Large Scale NetworksInternation Conference on Parallel Computing 2011, Sep 2011, Taipei, Taiwan. pp.10
Conference papers
inria-00580969v1
|
|
Utilisation d'outils de plongement d'Internet pour l'agrégation de ressources hétérogènesConférence : 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France
Conference papers
inria-00585254v1
|
|
Use of Internet Embedding Tools for Heterogeneous Resources AggregationHeterogeneity in Computing Workshop (HCW) - in IPDPS 2011, May 2011, Anchorage, United States. pp.114-124
Conference papers
inria-00588650v1
|
|
Broadcasting on Large Scale Heterogeneous Platforms with connectivity artifacts under the Bounded Multi-Port ModelICPADS 2011 - 17th Internation Conference on Parallel and Distributed Systems, IEEE, Dec 2011, Taïnan, Taiwan. pp.173-180
Conference papers
inria-00618784v1
|
|
Comment résumer le plan12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France
Conference papers
inria-00476151v1
|
|
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal SurfacesWG 2010, Jun 2010, Greece. pp.266--278, ⟨10.1007/978-3-642-16926-7_25⟩
Conference papers
hal-00536710v1
|
Plane Spanners of Maximum Degree SixICALP, 2010, France. pp.19-30, ⟨10.1007/978-3-642-14165-2_3⟩
Conference papers
hal-00534212v1
|
|
Permutations de Baxter et orientations bipolairesPremières Journées de Combinatoire de Bordeaux, Feb 2009, Bordeaux, France
Conference papers
hal-00366290v1
|
|
Baxter permutations and plane bipolar orientationsTGGT, May 2008, Paris, France. pp.69-74
Conference papers
hal-00355755v1
|
|
Distributed Approximation Algorithm for Resource ClusteringOpodis 2008, 2008, Luxor, Egypt. pp.564--567, ⟨10.1007/978-3-540-92221-6_41⟩
Conference papers
hal-00396449v1
|
|
Distributed Approximation Algorithm for Resource ClusteringSIROCCO 2008, 2008, Switzerland. pp.61--73
Conference papers
hal-00323068v1
|
|
Scheduling divisibleworkloads on heterogeneous platforms under bounded multi-port modelHeterogeneity in Computing Workshop, in IEEE International Symposium on Parallel and Distributed Processing, 2008. IPDPS 2008., Apr 2008, Miami, FL, United States
Conference papers
inria-00336189v1
|
|
Permutations de Baxter et orientations bipolaires planesRencontres ALEA 2008, Mar 2008, Luminy, France
Conference papers
hal-00366287v1
|
|
Catalans intervals and realizers of triangulations (extended abstract)FPSAC07, 2007, China
Conference papers
hal-00307858v1
|
|
Short Labels by Traversal and Jumping6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague, mars 2007, Mar 2007, Prague, Czech Republic. pp.153-160, ⟨10.1016/j.endm.2007.01.022⟩
Conference papers
hal-00369657v1
|
|
Short Labels by Traversal and Jumping$13^{th}$ International Colloquium on Structural Information & Communication Complexity (SIROCCO), 2006, United Kingdom. pp.143--156
Conference papers
hal-00307597v1
|
|
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
Conference papers
hal-00378390v1
|
|
Edge partition of toroidal graphs into forests in linear time7th International Conference on Graph Theory (ICGT), 2005, France. pp.421-425
Conference papers
hal-00307600v1
|
|
Convex Drawings of 3-Connected Planar Graphs - (Extended Abstract)Graph Drawing: 12th International Symposium, GD 2004, 2004, United States. pp.60--70
Conference papers
hal-00307595v1
|
|
Planar Graphs, via Well-Orderly Maps and Trees$30^{th}$ International Workshop, Graph - Theoretic Concepts in Computer Science (WG), 2004, Germany. pp.270-284
Conference papers
hal-00307603v1
|
|
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation$29^{th}$ International Workshop, Graph - Theoretic Concepts in Computer Science (WG), 2003, Netherlands. pp.81-92
Conference papers
hal-00307598v1
|
|
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation$20^{th}$ Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2003, Germany. pp.499-510
Conference papers
hal-00307599v1
|
|
Wagner's theorem on realizerslncs, 2002, Malaga, Spain. pp.1043--1053
Conference papers
hal-00341260v1
|
|
A Bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck pathsProceedings of FPSAC'02, 2002, Australia. pp.123--132
Conference papers
hal-00307596v1
|
|
Optimal area algorithm for planar polyline drawings.WG 2002, 2002, Czech Republic. pp.35--46
Conference papers
hal-00323077v1
|
|
Orthogonal Drawings based on the Stratification of Planar GraphsICGT 2000, 2000, France. pp.139--142
Conference papers
hal-00323078v1
|
An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly MapsDehmer, 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
Book sections
hal-00649898v1
|
|
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
Habilitation à diriger des recherches
tel-00922501v1
|
|
Aspects algorithmiques et combinatoires des réaliseurs des graphes plans maximauxInformatique [cs]. Université Sciences et Technologies - Bordeaux I, 2002. Français. ⟨NNT : ⟩
Theses
tel-00338407v1
|
There are Plane Spanners of Maximum Degree 42014
Preprints, Working Papers, ...
hal-00966353v1
|
|
|
Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations2014
Preprints, Working Papers, ...
hal-01092761v1
|
|
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces2010
Preprints, Working Papers, ...
hal-00454565v1
|
Asymptotics of geometrical navigation on a random set of points of the plane2010
Preprints, Working Papers, ...
hal-00534217v1
|