Phillip Keldenich

From MaRDI portal
(Redirected from Person:1986951)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Graph tiles (poster abstract)2026-09-21Paper
Exact algorithms for minimum dilation triangulation2026-08-11Paper
Packing squares into a disk with optimal worst-case density2026-04-27Paper
Exact algorithms for minimum dilation triangulation
Journal of Computational Geometry
2026-02-24Paper
Worst-case optimal covering of triangles by disks
CGT. Computing in Geometry and Topology
2025-10-21Paper
Worst-case optimal covering of rectangles by disks
Discrete & Computational Geometry
2024-10-25Paper
Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
ACM Journal of Experimental Algorithmics
2024-07-26Paper
Edge sparsification for geometric tour problems2024-04-02Paper
scientific article; zbMATH DE number 7788582 (Why is no real title available?)
(available as arXiv preprint)
2024-01-15Paper
Worst-case optimal covering of rectangles by disks
(available as arXiv preprint)
2023-11-02Paper
Space ants: constructing and reconfiguring large-scale structures with finite automata (media exposition)2023-11-02Paper
Covering rectangles by disks: the video (media exposition)2023-11-02Paper
Parallel online algorithms for the bin packing problem
Algorithmica
2023-04-21Paper
Packing disks into disks with optimal worst-case density
Discrete & Computational Geometry
2023-01-23Paper
Worst-case optimal squares packing into disks2022-10-31Paper
Area-optimal simple polygonalizations: the CG challenge 2019
ACM Journal of Experimental Algorithmics
2022-09-06Paper
Computing area-optimal simple polygonizations
ACM Journal of Experimental Algorithmics
2022-09-06Paper
Computing coordinated motion plans for robot swarms: the CG:SHOP challenge 2021
ACM Journal of Experimental Algorithmics
2022-09-06Paper
Packing disks into disks with optimal worst-case density
(available as arXiv preprint)
2022-07-18Paper
Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)2022-07-18Paper
CADbots: algorithmic aspects of manipulating programmable matter with finite automata
Algorithmica
2021-02-01Paper
Tilt assembly: algorithms for micro-factories that build objects with uniform external forces
(available as arXiv preprint)
2020-11-25Paper
Conflict-free coloring of intersection graphs2020-11-25Paper
Parallel online algorithms for the Bin Packing Problem
(available as arXiv preprint)
2020-08-24Paper
Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch2020-08-18Paper
Coordinated motion planning: the video (multimedia exposition)2020-08-18Paper
Tilt assembly: algorithms for micro-factories that build objects with uniform external forces
Algorithmica
2020-04-09Paper
Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
SIAM Journal on Computing
2019-12-09Paper
Conflict-free coloring of graphs
SIAM Journal on Discrete Mathematics
2018-11-28Paper
Conflict-free coloring of intersection graphs
International Journal of Computational Geometry & Applications
2018-11-26Paper
Three colors suffice: conflict-free coloring of planar graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper


Research outcomes over time


This page was built for person: Phillip Keldenich