The following pages link to Matias Korman (Q364846):
Displaying 50 items.
- (Q299838) (redirect page) (← links)
- Locating a single facility and a high-speed line (Q299840) (← links)
- Coloring planar homothets and three-dimensional hypergraphs (Q364847) (← links)
- Helly numbers of polyominoes (Q367067) (← links)
- The geodesic diameter of polygonal domains (Q368771) (← links)
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Theta-3 is connected (Q396473) (← links)
- Computing a visibility polygon using few variables (Q396475) (← links)
- Minimizing interference in ad hoc networks with bounded communication radius (Q456109) (← links)
- New results on stabbing segments with a polygon (Q474818) (← links)
- Balanced partitions of 3-colored geometric sets in the plane (Q479011) (← links)
- Geodesic order types (Q486983) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited (Q512987) (← links)
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
- Hanabi is NP-hard, even for cheaters who look at their cards (Q528493) (← links)
- Covering points by disjoint boxes with outliers (Q617548) (← links)
- Colorful strips (Q659707) (← links)
- Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs (Q691765) (← links)
- A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
- Routing in histograms (Q782155) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q827313) (← links)
- On the complexity of barrier resilience for fat regions and bounded ply (Q1615674) (← links)
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- Computing the geodesic centers of a polygonal domain (Q1622342) (← links)
- The dual diameter of triangulations (Q1699295) (← links)
- Colored spanning graphs for set visualization (Q1699297) (← links)
- Stabbing segments with rectilinear objects (Q1738129) (← links)
- Gap-planar graphs (Q1786592) (← links)
- On the complexity of barrier resilience for fat regions (Q1796437) (← links)
- Establishing strong connectivity using optimal radius half-disk antennas (Q1931278) (← links)
- Efficient segment folding is hard (Q2123292) (← links)
- Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays (Q2172660) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- Symmetric assembly puzzles are hard, beyond a few pieces (Q2206733) (← links)
- Snipperclips: cutting tools into desired polygons using themselves (Q2230404) (← links)
- The 1-median and 1-highway problem (Q2253533) (← links)
- Faster algorithms for growing prioritized disks and rectangles (Q2330036) (← links)
- Packing plane spanning graphs with short edges in complete geometric graphs (Q2331211) (← links)
- Reprint of: Theta-3 is connected (Q2341694) (← links)
- Geometric biplane graphs. I: Maximal graphs (Q2345511) (← links)
- Geometric biplane graphs. II: Graph augmentation (Q2345512) (← links)
- Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time (Q2349742) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- Line segment covering of cells in arrangements (Q2410576) (← links)
- Packing plane spanning trees and paths in complete geometric graphs (Q2628273) (← links)
- Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers (Q2663707) (← links)
- Circumscribing polygons and polygonizations for disjoint line segments (Q2671176) (← links)
- Negative instance for the edge patrolling beacon problem (Q2695468) (← links)
- Colored Spanning Graphs for Set Visualization (Q2867665) (← links)
