Guilherme Dias da Fonseca

From MaRDI portal
Person:499353

Available identifiers

zbMath Open da-fonseca.guilherme-diasMaRDI QIDQ499353

List of research outcomes

PublicationDate of PublicationType
On the longest flip sequence to untangle segments in the plane2023-11-24Paper
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes2023-10-31Paper
Complexity results on untangling red-blue matchings2023-07-26Paper
Shadoks Approach to Low-Makespan Coordinated Motion Planning2023-06-26Paper
Complexity results on untangling red-blue matchings2023-06-20Paper
Greedy and Local Search Heuristics to Build Area-Optimal Polygons2022-09-06Paper
https://portal.mardi4nfdi.de/entity/Q50095602021-08-04Paper
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes2021-02-02Paper
Efficiently testing digital convexity and recognizing digital convex polygons2020-10-06Paper
Efficient independent set approximation in unit disk graphs2020-05-18Paper
Efficient Algorithms to Test Digital Convexity2019-10-16Paper
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances2019-10-15Paper
https://portal.mardi4nfdi.de/entity/Q57433752019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q45800822018-08-13Paper
Optimal Approximate Polytope Membership2018-07-16Paper
Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs2018-02-22Paper
https://portal.mardi4nfdi.de/entity/Q31328442018-01-30Paper
Approximate Polytope Membership Queries2018-01-12Paper
On the combinatorial complexity of approximating polytopes2018-01-11Paper
The cost of perfection for matchings in graphs2016-06-22Paper
On the ratio between maximum weight perfect matchings and maximum weight matchings in grids2016-06-01Paper
Linear-Time Approximation Algorithms for Unit Disk Graphs2015-11-20Paper
On the recognition of unit disk graphs and the distance geometry problem with ranges2015-09-30Paper
Optimal area-sensitive bounds for polytope approximation2014-08-07Paper
Approximate polytope membership queries2014-06-05Paper
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs2013-09-13Paper
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges2012-05-13Paper
FITTING FLATS TO POINTS WITH OUTLIERS2012-04-19Paper
Complexity dichotomy on partial grid recognition2011-05-10Paper
A Unified Approach to Approximate Proximity Searching2010-09-06Paper
Enclosing weighted points with an almost-unit ball2010-09-01Paper
Approximate range searching: The absolute model2010-03-16Paper
Hamiltonian paths in odd graphs2010-01-12Paper
Kinetic hanger2009-07-09Paper
Approximate Range Searching: The Absolute Model2009-02-17Paper
https://portal.mardi4nfdi.de/entity/Q54590592008-04-24Paper
Algorithms for the homogeneous set sandwich problem2006-11-06Paper
The stable marriage problem with restricted pairs.2004-03-14Paper
Kinetic heap-ordered trees: Tight analysis and improved algorithms2003-01-22Paper
https://portal.mardi4nfdi.de/entity/Q27414552001-10-24Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Guilherme Dias da Fonseca