Image de couverture de livre

When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bentert, Matthias, Fomin, Fedor V., Golovach, Petr A., Ramanujan, M. S., Saurabh, Saket
Format:	Preprint
Publié:	2025
Sujets:	Computational Geometry Discrete Mathematics Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
par: Fomin, Fedor V., et autres
Publié: (2026)

When does FTP become FPT?
par: Bentert, Matthias, et autres
Publié: (2025)

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
par: Bentert, Matthias, et autres
Publié: (2024)

Fault-Tolerant Matroid Bases
par: Bentert, Matthias, et autres
Publié: (2025)

Stability in Graphs with Matroid Constraints
par: Fomin, Fedor V., et autres
Publié: (2024)

Cuts in Graphs with Matroid Constraints
par: Banik, Aritra, et autres
Publié: (2024)

Polynomial Kernels for Spanning Tree with Diversity Requirements
par: Golovach, Petr A., et autres
Publié: (2026)

Edge Clique Partition and Cover Beyond Independence
par: Fomin, Fedor V., et autres
Publié: (2025)

H-Planarity and Parametric Extensions: when Modulators Act Globally
par: Fomin, Fedor V., et autres
Publié: (2025)

Path Contraction Faster than $2^n$
par: Agrawal, Akanksha, et autres
Publié: (2025)

Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
par: Fomin, Fedor V., et autres
Publié: (2024)

Distance Approximating Minors for Planar and Minor-Free Graphs
par: Chang, Hsien-Chih, et autres
Publié: (2025)

Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
par: Fomin, Fedor V., et autres
Publié: (2025)

Parameterized Geometric Graph Modification with Disk Scaling
par: Fomin, Fedor V., et autres
Publié: (2024)

Hybrid k-Clustering: Blending k-Median and k-Center
par: Fomin, Fedor V., et autres
Publié: (2024)

A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
par: Bentert, Matthias, et autres
Publié: (2026)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
par: Bentert, Matthias, et autres
Publié: (2024)

Distance Recoloring
par: Banerjee, Niranka, et autres
Publié: (2024)

Packing Short Cycles
par: Bentert, Matthias, et autres
Publié: (2024)

Parameterized Saga of First-Fit and Last-Fit Coloring
par: Agrawal, Akanksha, et autres
Publié: (2024)

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
par: Bentert, Matthias, et autres
Publié: (2026)

Flip Distance of Triangulations of Convex Polygons / Rotation Distance of Binary Trees is NP-complete
par: Dorfer, Joseph
Publié: (2026)

Distance-Preserving Graph Compression Techniques
par: Madani, Amirali, et autres
Publié: (2023)

Upward Pointset Embeddings of Planar st-Graphs
par: Alegria, Carlos, et autres
Publié: (2024)

Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems
par: Bentert, Matthias, et autres
Publié: (2025)

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST
par: Jana, Satyabrata, et autres
Publié: (2025)

Approximation of Spanning Tree Congestion using Hereditary Bisection
par: Kolman, Petr
Publié: (2024)

Fixed-Parameter Tractability of Hedge Cut
par: Fomin, Fedor V., et autres
Publié: (2024)

Slant/Gokigen Naname is NP-complete, and Some Variations are in P
par: Lynch, Jayson, et autres
Publié: (2025)

Boosting Rectilinear Steiner Minimum Tree Algorithms with Augmented Bounding Volume Hierarchy
par: Yang, Puhan, et autres
Publié: (2025)

Internally-Convex Drawings of Outerplanar Graphs in Small Area
par: Bekos, Michael A., et autres
Publié: (2025)

Simple Compact Monotone Tree Drawings
par: Oikonomou, Anargyros, et autres
Publié: (2017)

A Practical Algorithm with Performance Guarantees for the Art Gallery Problem
par: Hengeveld, Simon, et autres
Publié: (2020)

Reweighted Spectral Partitioning Works: A Simple Algorithm for Vertex Separators in Special Graph Classes
par: Spalding-Jamieson, Jack
Publié: (2025)

From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs
par: Di Battista, Giuseppe, et autres
Publié: (2021)

Freeze-Tag in $L_1$ has Wake-up Time Five
par: Bonichon, Nicolas, et autres
Publié: (2024)

An algorithm for accurate and simple-looking metaphorical maps
par: Katsanou, Eleni, et autres
Publié: (2025)

On Tight Robust Coresets for $k$-Medians Clustering
par: Huang, Lingxiao, et autres
Publié: (2025)

A Polynomial Coreset for Furthest Neighbor in Planar Metrics
par: Kluk, Kacper, et autres
Publié: (2026)

Geometric Thickness of Multigraphs is $\exists \mathbb{R}$-complete
par: Förster, Henry, et autres
Publié: (2023)