Filtrer vos résultats
- 20
- 3
- 13
- 9
- 1
- 23
- 1
- 2
- 5
- 2
- 2
- 2
- 4
- 4
- 1
- 23
- 21
- 12
- 4
- 2
- 2
- 1
- 1
- 23
- 9
- 4
- 4
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
23 résultats
|
|
triés par
|
|
Approximate Convex Intersection Detection with Applications to Width and Minkowski SumsESA 2018 - European Symposium on Algorithms, Aug 2018, Helsinki, Finland. ⟨10.4230/LIPIcs.ESA.2018.3⟩
Communication dans un congrès
hal-01890039v1
|
||
|
Near-Optimal ε-Kernel Construction and Related ProblemsSymposium on Computational Geometry (SoCG 2017), Jul 2017, Brisbane, Australia
Communication dans un congrès
hal-01890096v1
|
||
|
Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection GraphsInternational Journal of Computational Geometry and Applications, 2017, 27 (04), pp.255 - 276. ⟨10.1142/S0218195917500078⟩
Article dans une revue
hal-01893789v1
|
||
|
Efficient Algorithms for Battleship10th International Conference on Fun with Algorithms (FUN 2021), Jul 2021, Sicily, Italy
Communication dans un congrès
hal-03559058v1
|
||
|
Efficient independent set approximation in unit disk graphsDiscrete Applied Mathematics, 2018, ⟨10.1016/j.dam.2018.05.049⟩
Article dans une revue
hal-01893742v1
|
||
|
Optimal Bound on the Combinatorial Complexity of Approximating PolytopesACM Transactions on Algorithms, 2022, 18 (4), pp.1-29. ⟨10.1145/3559106⟩
Article dans une revue
hal-04501906v1
|
||
|
Complexity Results on Untangling Red-Blue MatchingsLATIN 2022, Nov 2022, Guanajuato (Mexico), Mexico. pp.730-745, ⟨10.1007/978-3-031-20624-5_44⟩
Communication dans un congrès
hal-04501910v1
|
||
|
Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings2022
Pré-publication, Document de travail
hal-03588674v1
|
||
|
Shadoks Approach to Convex Covering (CG Challenge)SoCG 2023, Jun 2023, Dallas (TX), United States. ⟨10.4230/LIPIcs.SoCG.2023.67⟩
Communication dans un congrès
hal-04501898v1
|
||
|
On the Combinatorial Complexity of Approximating PolytopesDiscrete and Computational Geometry, 2017, 58 (4), pp.849 - 870. ⟨10.1007/s00454-016-9856-5⟩
Article dans une revue
hal-01893753v1
|
||
|
Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge)37th International Symposium on Computational Geometry, SoCG 2021, June 7-11, 2021, Buffalo, NY, USA (Virtual Conference), Jun 2021, Buffalo, United States. ⟨10.4230/LIPIcs.SoCG.2021.63⟩
Communication dans un congrès
hal-03485486v1
|
||
|
Optimal Approximate Polytope MembershipTwenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2017, Barcelona, Spain. ⟨10.1137/1.9781611974782.18⟩
Communication dans un congrès
hal-01893784v1
|
||
|
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted DistancesSODA 2019 - Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2019, San Diego, United States. pp.355-372, ⟨10.1137/1.9781611975482.23⟩
Communication dans un congrès
hal-01981332v1
|
||
|
Approximate Polytope Membership QueriesSIAM Journal on Computing, 2018, 47 (1), pp.1 - 51. ⟨10.1137/16M1061096⟩
Article dans une revue
hal-01890054v1
|
||
|
Short Flip Sequences to Untangle Segments in the Plane ⋆WALCOM 2024, Mar 2024, Kanazawa, Ishikawa, Japan. pp.163-178, ⟨10.1007/978-981-97-0566-5_13⟩
Communication dans un congrès
hal-04505473v1
|
||
|
Efficiently Testing Digital Convexity and Recognizing Digital Convex PolygonsJournal of Mathematical Imaging and Vision, 2020, ⟨10.1007/s10851-020-00957-6⟩
Article dans une revue
hal-03559062v1
|
||
|
Greedy and Local Search Heuristics to Build Area-Optimal PolygonsACM Journal of Experimental Algorithmics, 2022, 27 (2.2), pp.1-11. ⟨10.1145/3503999⟩
Article dans une revue
hal-03559069v1
|
||
|
Efficient Algorithms to Test Digital Convexity21st IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2019, Mar 2019, Paris, France
Communication dans un congrès
hal-01983460v1
|
||
|
On the Combinatorial Complexity of Approximating Polytopes32nd Symposium on Computational Geometry (SoCG 2016), Jun 2016, Boston, United States
Communication dans un congrès
hal-01893799v1
|
||
Peeling Digital PotatoesCoRR, 2018, abs/1812.05410
Article dans une revue
hal-02092761v1
|
|||
|
Optimal Bound on the Combinatorial Complexity of Approximating PolytopesSODA 2020, Jan 2020, Salt Lake City, United States. pp.786-805, ⟨10.1137/1.9781611975994.48⟩
Communication dans un congrès
hal-02440482v1
|
||
|
On the Longest Flip Sequence to Untangle Segments in the PlaneWALCOM 17th International Conference and Workshops on Algorithms and Computation, Mar 2023, Hsinchu, Taiwan. pp.102-112, ⟨10.1007/978-3-031-27051-2_10⟩
Communication dans un congrès
hal-04051496v1
|
||
|
Shadoks Approach to Low-Makespan Coordinated Motion PlanningACM Journal of Experimental Algorithmics, 2022, 27, pp.1-17. ⟨10.1145/3524133⟩
Article dans une revue
hal-04051506v1
|