Image de couverture de livre

A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Eiben, Eduard, Ganian, Robert, Kanj, Iyad, Sridharan, Ramanujan M.
Format:	Preprint
Publié:	2025
Sujets:	Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
par: Deligkas, Argyrios, et autres
Publié: (2024)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
par: Deligkas, Argyrios, et autres
Publié: (2026)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
par: Eiben, Eduard, et autres
Publié: (2023)

How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs
par: Deligkas, Argyrios, et autres
Publié: (2024)

Induced Minors and Region Intersection Graphs
par: Bonnet, Édouard, et autres
Publié: (2025)

Token Sliding Reconfiguration on DAGs
par: Dirks, Jona, et autres
Publié: (2025)

Effective Sampling for Robot Motion Planning Through the Lens of Lattices
par: Panasoff, Itai, et autres
Publié: (2025)

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
par: Eiben, Eduard, et autres
Publié: (2024)

The Excluded Tree Minor Theorem Revisited
par: Dujmović, Vida, et autres
Publié: (2023)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
par: Deligkas, Argyrios, et autres
Publié: (2025)

Grid Minors and Products
par: Dujmović, Vida, et autres
Publié: (2024)

Polynomial Bounds in the Apex Minor Theorem
par: Hendrey, Kevin, et autres
Publié: (2025)

Packing Topological Minors Half-Integrally
par: Liu, Chun-Hung
Publié: (2017)

Basis Number of Graphs Excluding Minors
par: Geniet, Colin, et autres
Publié: (2026)

Frankl's diversity theorem for permutations
par: Inozemtsev, Eduard, et autres
Publié: (2026)

Two questions on Kneser colorings
par: Inozemtsev, Eduard, et autres
Publié: (2024)

Matchings in permutations
par: Inozemtsev, Eduard, et autres
Publié: (2026)

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

The Computational Complexity of Positive Non-Clashing Teaching in Graphs
par: Ganian, Robert, et autres
Publié: (2025)

Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure
par: Dadush, Daniel, et autres
Publié: (2025)

Sparse String Graphs and Region Intersection Graphs over Minor-Closed Classes have Linear Expansion
par: Karol, Nikolai, et autres
Publié: (2026)

A Scalable Lift-and-Project Differentiable Approach For the Maximum Cut Problem
par: Alkhouri, Ismail, et autres
Publié: (2025)

When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
par: Bentert, Matthias, et autres
Publié: (2025)

A Novel Approach for Bent Functions with Dillon-like Exponents and Characterizing Three Classes of Bent Functions via Kloosterman Sums
par: Tu, Ziran, et autres
Publié: (2024)

Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components
par: Schwieger, Robert, et autres
Publié: (2023)

The Freight Multimodal Transport Problem with Buses and Drones: An Integrated Approach for Last-Mile Delivery
par: Su, E, et autres
Publié: (2025)

On the Parameterized Complexity of Motion Planning for Rectangular Robots
par: Kanj, Iyad, et autres
Publié: (2024)

Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
par: Marx, Dániel, et autres
Publié: (2026)

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

Induced Minors and Coarse Tree Decompositions
par: Chudnovsky, Maria, et autres
Publié: (2026)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
par: Bourneuf, Romain, et autres
Publié: (2025)

A Weight Function Lemma Heuristic for Graph Pebbling
par: Bridi, G. A., et autres
Publié: (2025)

Induced Minors, Asymptotic Dimension, and Baker's Technique
par: Hickingbotham, Robert
Publié: (2025)

Logic-Constrained Shortest Paths for Flight Planning
par: Euler, Ricardo, et autres
Publié: (2024)

Theoretical and Computational Approaches to Determining Sets of Orders for $(k,g)$-Graphs
par: Eze, L. C., et autres
Publié: (2025)

Optimal energy collection with rotational movements constraints in concentrated solar power plants
par: Díaz-Bañez, J. M., et autres
Publié: (2024)

Property Testing in Bounded Degree Hypergraphs
par: Aaronson, Hugo, et autres
Publié: (2025)

Combinatorial Group Testing in Presence of Deletions
par: Gandikota, Venkata, et autres
Publié: (2023)

Facial diagrams and cycle double cover
par: Ghanbari, Babak, et autres
Publié: (2026)

Coarse Balanced Separators in Fat-Minor-Free Graphs
par: Bonnet, Édouard, et autres
Publié: (2026)