The following pages link to Carlos Seara (Q170492):
Displaying 50 items.
- (Q419499) (redirect page) (← links)
- The class cover problem with boxes (Q419500) (← links)
- Distinguishing trees in linear time (Q426889) (← links)
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- New results on stabbing segments with a polygon (Q474818) (← links)
- Balanced partitions of 3-colored geometric sets in the plane (Q479011) (← links)
- Production matrices for geometric graphs (Q510608) (← links)
- Stabbers of line segments in the plane (Q543793) (← links)
- Fitting a two-joint orthogonal chain to a point set (Q617541) (← links)
- On the coarseness of bicolored point sets (Q714904) (← links)
- Non-crossing matchings of points with geometric objects (Q714905) (← links)
- On the determining number and the metric dimension of graphs (Q976713) (← links)
- Small weak epsilon-nets (Q1025302) (← links)
- Facility location problems in the plane based on reverse nearest neighbor queries (Q1038383) (← links)
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position. (Q1410590) (← links)
- Characteristic polynomials of production matrices for geometric graphs (Q1689984) (← links)
- On Hamiltonian alternating cycles and paths (Q1699287) (← links)
- On the \(\mathcal{O}_\beta\)-hull of a planar point set (Q1699299) (← links)
- Stabbing segments with rectilinear objects (Q1738129) (← links)
- Stabbing circles for sets of segments in the plane (Q1742369) (← links)
- On the Steiner, geodetic and hull numbers of graphs (Q1779492) (← links)
- Separability by two lines and by nearly straight polygonal chains (Q1885815) (← links)
- Capturing points with a rotating polygon (and a 3D extension) (Q2000002) (← links)
- Antimagic labelings of caterpillars (Q2008558) (← links)
- Shortest watchman tours in simple polygons under rotated monotone visibility (Q2019474) (← links)
- Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations (Q2022326) (← links)
- Optimizing generalized kernels of polygons (Q2046316) (← links)
- Rectilinear convex hull of points in 3D (Q2081624) (← links)
- Trees whose even-degree vertices induce a path are antimagic (Q2151224) (← links)
- Caterpillars are antimagic (Q2223075) (← links)
- Maximum rectilinear convex subsets (Q2291424) (← links)
- Extremal graph theory for metric dimension and diameter (Q2380462) (← links)
- On finding widest empty curved corridors (Q2385694) (← links)
- Matching points with disks with a common intersection (Q2421852) (← links)
- On the number of edges in geometric graphs without empty triangles (Q2637713) (← links)
- On maximum-sum matchings of points (Q2679241) (← links)
- Separating bichromatic point sets in the plane by restricted orientation convex hulls (Q2694525) (← links)
- Stabbing Circles for Sets of Segments in the Plane (Q2802948) (← links)
- ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS (Q3007722) (← links)
- Red-Blue Separability Problems in 3D (Q3082970) (← links)
- On the metric dimension of some families of graphs (Q3439322) (← links)
- Some structural, metric and convex properties on the boundary of a graph (Q3439437) (← links)
- Extremal Graph Theory for Metric Dimension and Diameter (Q3503491) (← links)
- Matching Points with Things (Q3557040) (← links)
- (Q3625873) (← links)
- SEPARABILITY OF POINT SETS BY k-LEVEL LINEAR CLASSIFICATION TREES (Q4650094) (← links)
- Complexity classes between $\Theta _k^P$ and $\Delta _k^P$ (Q4717047) (← links)
- Rectilinear Convex Hull with Minimum Area (Q4899283) (← links)
- New Results on Stabbing Segments with a Polygon (Q4924645) (← links)
- Characterizations of some complexity classes between Θ2p and Δ2p (Q5096790) (← links)
