The following pages link to Guilherme Dias da Fonseca (Q499353):
Displayed 40 items.
- (Q290098) (redirect page) (← links)
- On the ratio between maximum weight perfect matchings and maximum weight matchings in grids (Q290099) (← links)
- The cost of perfection for matchings in graphs (Q299061) (← links)
- On the recognition of unit disk graphs and the distance geometry problem with ranges (Q499355) (← links)
- Complexity dichotomy on partial grid recognition (Q533881) (← links)
- Algorithms for the homogeneous set sandwich problem (Q850795) (← links)
- Enclosing weighted points with an almost-unit ball (Q990963) (← links)
- Kinetic hanger (Q1029070) (← links)
- The stable marriage problem with restricted pairs. (Q1426462) (← links)
- On the combinatorial complexity of approximating polytopes (Q1688856) (← links)
- Kinetic heap-ordered trees: Tight analysis and improved algorithms (Q1853697) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- Efficiently testing digital convexity and recognizing digital convex polygons (Q2203347) (← links)
- Approximate range searching: The absolute model (Q2269144) (← links)
- (Q2741455) (← links)
- Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs (Q2848916) (← links)
- Optimal area-sensitive bounds for polytope approximation (Q2874597) (← links)
- Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges (Q2883585) (← links)
- (Q3132844) (← links)
- Linear-Time Approximation Algorithms for Unit Disk Graphs (Q3453289) (← links)
- A Unified Approach to Approximate Proximity Searching (Q3586478) (← links)
- Approximate Range Searching: The Absolute Model (Q3603509) (← links)
- Hamiltonian paths in odd graphs (Q3655060) (← links)
- Optimal Approximate Polytope Membership (Q4575755) (← links)
- (Q4580082) (← links)
- Approximate Polytope Membership Queries (Q4600697) (← links)
- Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← links)
- (Q5009560) (← links)
- Greedy and Local Search Heuristics to Build Area-Optimal Polygons (Q5102069) (← links)
- Optimal Bound on the Combinatorial Complexity of Approximating Polytopes (Q5146818) (← links)
- Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances (Q5236204) (← links)
- Efficient Algorithms to Test Digital Convexity (Q5237086) (← links)
- FITTING FLATS TO POINTS WITH OUTLIERS (Q5388712) (← links)
- Approximate polytope membership queries (Q5419128) (← links)
- (Q5459059) (← links)
- (Q5743375) (← links)
- Optimal Bound on the Combinatorial Complexity of Approximating Polytopes (Q6058263) (← links)
- On the longest flip sequence to untangle segments in the plane (Q6091152) (← links)
- Complexity results on untangling red-blue matchings (Q6101837) (← links)
- Shadoks Approach to Low-Makespan Coordinated Motion Planning (Q6163580) (← links)