Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra

Συγγραφείς: Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto

Συνεισφορές: Takehiro Ito and Naonori Kakimura and Naoyuki Kamiyama and Yusuke Kobayashi and Shun-ichi Maezawa and Yuta Nozaki and Yoshio Okamoto

Πηγή: SIAM Journal on Discrete Mathematics. 40:554-575

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, polymatroids, Discrete Mathematics (cs.DM), combinatorial shortest path, Computer Science - Data Structures and Algorithms, NP-hardness, FOS: Mathematics, Mathematics - Combinatorics, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Graph associahedra, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2304.14782
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.82

Polynomial Gyárfás–Sumner conjecture for graphs of bounded boxicity

Συγγραφείς: Davies, James, Yuditsky, Yelena

Πηγή: Innovations in Graph Theory. 3:37-48

Θεματικοί όροι: Mathematics - Combinatorics, Computer Science - Computational Geometry

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2407.16882

Hopf Arborescent Links, Minor Theory, and Decidability of the Genus Defect

Συγγραφείς: Dehornoy, Pierre, Lunel, Corentin, de Mesmay, Arnaud

Συνεισφορές: Dehornoy, Pierre, Pierre Dehornoy and Corentin Lunel and Arnaud de Mesmay

Πηγή: Discrete & Computational Geometry. 75:294-319

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, Genus, Theory of computation → Computational geometry, Arborescent links, Geometric Topology (math.GT), Well-Quasi-Order, Mathematics of computing → Geometric topology, Well-quasi-order, Slice Genus, Mathematics - Geometric Topology, Knot Theory, 4-genus, FOS: Mathematics, Computer Science - Computational Geometry, Hopf Arborescent Links, [MATH.MATH-GT] Mathematics [math]/Geometric Topology [math.GT]

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2312.09094
https://hal.science/hal-04552398v1/document
https://doi.org/10.4230/lipics.socg.2024.48
https://hal.science/hal-04552398v1
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.48

Quantum Algorithms for Hopcroft's problem

Συγγραφείς: Vladimirs Andrejevs, Aleksandrs Belovs, Jevgēnijs Vihrovs

Συνεισφορές: Vladimirs Andrejevs and Aleksandrs Belovs and Jevgēnijs Vihrovs

Πηγή: ACM Transactions on Quantum Computing. 7:1-22

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, Quantum algorithms, Quantum Physics, Computational Geometry, Computer Science - Computational Geometry, FOS: Physical sciences, Quantum Physics (quant-ph), Quantum walks

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2405.01160
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.9

The Power of Recursive Embeddings for ℓ p Metrics

Συγγραφείς: Robert Krauthgamer, Nir Petruschka, Shay Sapir

Πηγή: 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS). :2546-2554

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, Mathematics - Metric Geometry, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), Metric Geometry (math.MG)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2503.18508

Query-Efficient Fixpoints of ℓ p -Contractions

Συγγραφείς: Sebastian Haslebacher, Jonas Lill, Patrick Schnider, Simon Weber 0001

Πηγή: 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS). :2037-2053

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Computational Geometry, Computational Complexity (cs.CC)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2503.16089

Topological k-Metrics

Συγγραφείς: Willow Barkan-Vered, Huck Bennett, Amir Nayyeri

Συνεισφορές: Willow Barkan and Huck Bennett and Amir Nayyeri

Πηγή: Discrete & Computational Geometry. 75:343-390

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, metric embeddings, k-metrics, computational topology, Computer Science - Computational Geometry, simplicial complexes

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2308.04609
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.13

Optimal Euclidean Tree Covers

Συγγραφείς: Hsien-Chih Chang, Jonathan Conroy, Hung Le 0001, Lazar Milenkovic, Shay Solomon, Cuong Than

Συνεισφορές: Hsien-Chih Chang and Jonathan Conroy and Hung Le and Lazar Milenković and Shay Solomon and Cuong Than

Πηγή: Discrete & Computational Geometry. 75:625-659

Θεματικοί όροι: spanner, Computational Geometry (cs.CG), FOS: Computer and information sciences, Tree cover, quadtree, routing, bounded-degree, Computer Science - Computational Geometry, Steiner point, net-tree

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2403.17754
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.37

Isometric Simplices for High-Order Anisotropic Mesh Adaptation. Part I: Definition and Existence of Isometric Triangulations

Συγγραφείς: Arthur Bawin, André Garon, Jean-François Remacle

Πηγή: SIAM Journal on Scientific Computing. 48:A335-A362

Θεματικοί όροι: Structural Analysis and Optimization, Computational Geometry (cs.CG), FOS: Computer and information sciences, Elasticity and Material Modeling, Biomedical Engineering, FOS: Mathematics, Computer Science - Computational Geometry, 65L50, 65N50, 53Z05, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), Computational Geometry and Mesh Generation, Computer Graphics and Computer-Aided Design, Civil and Structural Engineering

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2501.06328
https://publications.polymtl.ca/74007/
https://doi.org/10.1137/25m1731381

Projected distances for multi-parameter persistence modules

Συγγραφείς: Nicolas Berkouk, François Petit

Πηγή: Annales de l'Institut Fourier. :1-60

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, FOS: Mathematics, Computer Science - Computational Geometry, Algebraic Topology (math.AT), Mathematics - Algebraic Topology, 0101 mathematics, 01 natural sciences

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2206.08818

Circular coordinates for density-robust analysis

Συγγραφείς: Taejin Paik, Jaemin Park

Πηγή: Foundations of Data Science. 9:137-163

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, I.5.2, G.3, G.2.2, 0102 computer and information sciences, 01 natural sciences, 55N31 (Primary), 05C90 (Secondary), FOS: Mathematics, Computer Science - Computational Geometry, Algebraic Topology (math.AT), Mathematics - Algebraic Topology, 0101 mathematics

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2301.12742

Advancing geometry with AI: Multi-agent generation of polytopes

Συγγραφείς: Grzegorz Swirszcz, Adam Zsolt Wagner, Geordie Williamson, Sam Blackwell, Bogdan Georgiev, Alex Davies, S. M. Ali Eslami, Sébastien Racanière, Theophane Weber, Pushmeet Kohli

Πηγή: Advances in Theoretical and Mathematical Physics. 30:41-63

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, Mathematics - Metric Geometry, FOS: Mathematics, Mathematics - Combinatorics, Computer Science - Computational Geometry, Metric Geometry (math.MG), Combinatorics (math.CO), 52B05, 52B55, 68T20

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2502.05199

Chromatic alpha complexes

Συγγραφείς: di Montesano, Sebastiano Cultrera, Draganov, Ondřej, Edelsbrunner, Herbert, Saghafian, Morteza

Πηγή: Foundations of Data Science. 8:30-62

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, 55N31, 62R40, FOS: Mathematics, Computer Science - Computational Geometry, Algebraic Topology (math.AT), Mathematics - Algebraic Topology, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2212.03128

Hybrid k-Clustering: Blending k-Median and k-Center

Συγγραφείς: Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Saket Saurabh 0001, Meirav Zehavi

Συνεισφορές: Fedor V. Fomin and Petr A. Golovach and Tanmay Inamdar and Saket Saurabh and Meirav Zehavi

Πηγή: Leibniz International Proceedings in Informatics
4:1-4:19

Θεματικοί όροι: k-median, Computational Geometry (cs.CG), FOS: Computer and information sciences, fpt approximation, Euclidean space, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), k-center, clustering

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2407.08295
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.4
https://hdl.handle.net/11250/3185304

Morse Theory for the k-NN Distance Function

Συγγραφείς: Yohai Reani, Omer Bobrowski

Συνεισφορές: Yohai Reani and Omer Bobrowski

Πηγή: Discrete Comput Geom

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, k-nearest neighbor, Distance function, Article, Applied topology, FOS: Mathematics, Computer Science - Computational Geometry, Mathematics - Combinatorics, Algebraic Topology (math.AT), Morse theory, Mathematics - Algebraic Topology, Combinatorics (math.CO)

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://pmc.ncbi.nlm.nih.gov/articles/PMC12953273/
https://pubmed.ncbi.nlm.nih.gov/41783254/
https://doi.org/10.1007/s00454-025-00795-6
http://arxiv.org/abs/2403.12792
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.75

Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time

Συγγραφείς: Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms

Συνεισφορές: Sujoy Bhore and Martin Nöllenburg and Csaba D. Tóth and Jules Wulms

Πηγή: Discrete & Computational Geometry. 75:391-430

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, Dynamic algorithm, Geometric intersection graph, Independent set, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), Approximation algorithm, Dynamic data structure

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2308.00979
https://research.tue.nl/en/publications/0a8c9d81-1cd7-4658-81e4-f8d01179537a
https://research.tue.nl/en/publications/e63e5e3a-8863-41fb-a0b3-ff2834c206eb
https://doi.org/10.1007/s00454-025-00793-8
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.19

Measure-Theoretic Reeb Graphs and Reeb Spaces

Συγγραφείς: Qingsong Wang, Guanqun Ma, Raghavendra Sridharamurthy, Bei Wang 0001

Συνεισφορές: Qingsong Wang and Guanqun Ma and Raghavendra Sridharamurthy and Bei Wang

Πηγή: Discrete & Computational Geometry. 75:511-536

Θεματικοί όροι: topological data analysis, Computational Geometry (cs.CG), FOS: Computer and information sciences, Reeb graph, Reeb space, metric measure space, Computer Science - Computational Geometry

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2401.06748
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.80

Efficient Computation of Image Persistence

Συγγραφείς: Ulrich Bauer, Maximilian Schmahl

Συνεισφορές: Ulrich Bauer and Maximilian Schmahl

Πηγή: Discrete & Computational Geometry. 74:999-1019

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, 0102 computer and information sciences, 01 natural sciences, image persistence, FOS: Mathematics, Computer Science - Computational Geometry, Algebraic Topology (math.AT), Persistent homology, Mathematics - Algebraic Topology, 0101 mathematics, barcode computation

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2201.04170
https://arxiv.org/abs/2201.04170
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.14

Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane

Συγγραφείς: Pankaj K. Agarwal, Esther Ezra, Micha Sharir

Συνεισφορές: Pankaj K. Agarwal and Esther Ezra and Micha Sharir

Πηγή: Discrete & Computational Geometry. 75:320-342

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, semi-algebraic sets, geometric cuttings, pseudo-lines, duality, Computer Science - Computational Geometry, Range-searching

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2403.12276
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.4

Object Packing and Scheduling for Sequential 3D Printing: a Linear Arithmetic Model and a CEGAR-inspired Optimal Solver

Συγγραφείς: Pavel Surynek, Vojtech Bubnik, Lukas Matena, Petr Kubis

Πηγή: 2025 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). :5679-5686

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, Computer Science - Computational Geometry

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2503.05071