Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee’s Measure Problem and Related Problems in Dimensions d ≥ 4 (Englisch)
Freier Zugriff
- Neue Suche nach: Gorbachev, Egor
- Neue Suche nach: Künnemann, Marvin
- Neue Suche nach: Gorbachev, Egor
- Neue Suche nach: Künnemann, Marvin
- Neue Suche nach: Chambers, Erin W.
- Weitere Informationen zu Chambers, Erin W.:
- https://orcid.org/0000-0001-8333-3676
- Neue Suche nach: Gudmundsson, Joachim
- Weitere Informationen zu Gudmundsson, Joachim:
- https://orcid.org/0000-0002-6778-7990
In:
LIPIcs, Volume 258, SoCG 2023
: 39th International Symposium on Computational Geometry (SoCG 2023)
;
258
;
36:1-36:14
;
2023
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Elektronische Ressource
-
Titel:Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee’s Measure Problem and Related Problems in Dimensions d ≥ 4
-
Beteiligte:Gorbachev, Egor ( Autor:in ) / Künnemann, Marvin ( Autor:in ) / Chambers, Erin W. ( Herausgeber:in ) / Gudmundsson, Joachim ( Herausgeber:in )
-
Erschienen in:LIPIcs, Volume 258, SoCG 2023 : 39th International Symposium on Computational Geometry (SoCG 2023) ; 258 ; 36:1-36:14Leibniz International Proceedings in Informatics (LIPIcs) ; 258 ; 36:1-36:14
-
Verlag:
- Neue Suche nach: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Erscheinungsdatum:09.06.2023
-
Format / Umfang:14 pages , 737032 byte
-
Anmerkungen:LIPIcs, Vol. 258, 39th International Symposium on Computational Geometry (SoCG 2023), pages 36:1-36:14
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Lizenzbestimmungen:
-
Datenquelle:
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Geometric Embeddability of Complexes Is ∃ℝ-CompleteAbrahamsen, Mikkel / Kleist, Linda / Miltzow, Tillmann et al. | 2023
- 2
-
Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex DisksAbrahamsen, Mikkel / Walczak, Bartosz et al. | 2023
- 3
-
Lower Bounds for Intersection Reporting Among Flat ObjectsAfshani, Peyman / Cheng, Pingan et al. | 2023
- 4
-
Computing Instance-Optimal Kernels in Two DimensionsAgarwal, Pankaj K. / Har-Peled, Sariel et al. | 2023
- 5
-
Line Intersection Searching Amid Unit Balls in 3-SpaceAgarwal, Pankaj K. / Ezra, Esther et al. | 2023
- 6
-
Drawings of Complete Multipartite Graphs up to Triangle FlipsAichholzer, Oswin / Chiu, Man-Kwun / Hoang, Hung P. / Hoffmann, Michael / Kynčl, Jan / Maus, Yannic / Vogtenhuber, Birgit / Weinberger, Alexandra et al. | 2023
- 7
-
Decomposition of Zero-Dimensional Persistence Modules via Rooted SubsetsAlonso, Ángel Javier / Kerber, Michael et al. | 2023
- 8
-
On Helly Numbers of Exponential LatticesAmbrus, Gergely / Balko, Martin / Frankl, Nóra / Jung, Attila / Naszódi, Márton et al. | 2023
- 9
-
Optimal Volume-Sensitive Bounds for Polytope ApproximationArya, Sunil / Mount, David M. et al. | 2023
- 10
-
Coresets for Clustering in Geometric Intersection GraphsBandyapadhyay, Sayan / Fomin, Fedor V. / Inamdar, Tanmay et al. | 2023
- 11
-
Minimum-Membership Geometric Set Cover, RevisitedBandyapadhyay, Sayan / Lochet, William / Saurabh, Saket / Xue, Jie et al. | 2023
- 12
-
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster RadiiBandyapadhyay, Sayan / Lochet, William / Saurabh, Saket et al. | 2023
- 13
-
Multilevel Skeletonization Using Local SeparatorsBærentzen, J. Andreas / Christensen, Rasmus Emil / Gæde, Emil Toftegaard / Rotenberg, Eva et al. | 2023
- 14
-
Efficient Computation of Image PersistenceBauer, Ulrich / Schmahl, Maximilian et al. | 2023
- 15
-
Efficient Two-Parameter Persistence Computation via CohomologyBauer, Ulrich / Lenzen, Fabian / Lesnick, Michael et al. | 2023
- 16
-
The Complexity of Geodesic Spannersde Berg, Sarita / van Kreveld, Marc / Staals, Frank et al. | 2023
- 17
-
An Extension Theorem for SignotopesBergold, Helena / Felsner, Stefan / Scheucher, Manfred et al. | 2023
- 18
-
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter TractableBhore, Sujoy / Ganian, Robert / Khazaliya, Liana / Montecchiani, Fabrizio / Nöllenburg, Martin et al. | 2023
- 19
-
Improved Bounds for Covering Paths and Trees in the PlaneBiniaz, Ahmad et al. | 2023
- 20
-
Sparse Higher Order Čech FiltrationsBuchet, Mickaël / B. Dornelas, Bianca / Kerber, Michael et al. | 2023
- 21
-
Finding Large Counterexamples by Selectively Exploring the Pachner GraphBurton, Benjamin A. / He, Alexander et al. | 2023
- 22
-
Improved Algebraic Degeneracy TestingCardinal, Jean / Sharir, Micha et al. | 2023
- 23
-
Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller SizeChan, Timothy M. / Huang, Zhengcheng et al. | 2023
- 24
-
Minimum L_∞ Hausdorff Distance of Point Sets Under Translation: Generalizing Klee’s Measure ProblemChan, Timothy M. et al. | 2023
- 25
-
Meta-Diagrams for 2-Parameter PersistenceClause, Nate / Dey, Tamal K. / Mémoli, Facundo / Wang, Bei et al. | 2023
- 26
-
Algorithms for Length Spectra of Combinatorial ToriDelecroix, Vincent / Ebbens, Matthijs / Lazarus, Francis / Yakovlev, Ivan et al. | 2023
- 27
-
Computing a Dirichlet Domain for a Hyperbolic SurfaceDespré, Vincent / Kolbe, Benedikt / Parlier, Hugo / Teillaud, Monique et al. | 2023
- 28
-
The Parameterized Complexity of Coordinated Motion PlanningEiben, Eduard / Ganian, Robert / Kanj, Iyad et al. | 2023
- 29
-
Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial TimeEppstein, David et al. | 2023
- 30
-
Finding a Maximum Clique in a Disk GraphEspenant, Jared / Keil, J. Mark / Mondal, Debajyoti et al. | 2023
- 31
-
Linear Size Universal Point Sets for Classes of Planar GraphsFelsner, Stefan / Schrezenmaier, Hendrik / Schröder, Felix / Steiner, Raphael et al. | 2023
- 32
-
When Ternary Triangulated Disc Packings Are Densest: Examples, Counter-Examples and TechniquesFernique, Thomas / Pchelina, Daria et al. | 2023
- 33
-
Labeled Nearest Neighbor Search and Metric Spanners via Locality Sensitive OrderingsFiltser, Arnold et al. | 2023
- 34
-
Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile GraphsGalby, Esther / Munaro, Andrea / Yang, Shizhou et al. | 2023
- 35
-
Voronoi Diagrams in the Hilbert MetricGezalyan, Auguste H. / Mount, David M. et al. | 2023
- 36
-
Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee’s Measure Problem and Related Problems in Dimensions d ≥ 4Gorbachev, Egor / Künnemann, Marvin et al. | 2023
- 37
-
A Generalization of the Persistent Laplacian to Simplicial MapsGülen, Aziz Burak / Mémoli, Facundo / Wan, Zhengchao / Wang, Yusu et al. | 2023
- 38
-
The Christoffel-Darboux Kernel for Topological Data AnalysisRoos Hoefgeest, Pepijn / Slot, Lucas et al. | 2023
- 39
-
The Number of Edges in Maximal 2-Planar GraphsHoffmann, Michael / M. Reddy, Meghana et al. | 2023
- 40
-
Worst-Case Deterministic Fully-Dynamic Biconnectivity in Changeable Planar EmbeddingsHolm, Jacob / van der Hoog, Ivor / Rotenberg, Eva et al. | 2023
- 41
-
Disjoint Faces in Drawings of the Complete Graph and Topological Heilbronn ProblemsHubard, Alfredo / Suk, Andrew et al. | 2023
- 42
-
On the Width of Complicated JSJ DecompositionsHuszár, Kristóf / Spreer, Jonathan et al. | 2023
- 43
-
Reconfiguration of Colorings in Triangulations of the SphereIto, Takehiro / Iwamasa, Yuni / Kobayashi, Yusuke / Maezawa, Shun-ichi / Nozaki, Yuta / Okamoto, Yoshio / Ozeki, Kenta et al. | 2023
- 44
-
On the Geometric Thickness of 2-Degenerate GraphsJain, Rahul / Ricci, Marco / Rollin, Jonathan / Schulz, André et al. | 2023
- 45
-
The Localized Union-Of-Balls BifiltrationKerber, Michael / Söls, Matthias et al. | 2023
- 46
-
Online and Dynamic Algorithms for Geometric Set Cover and Hitting SetKhan, Arindam / Lonkar, Aditya / Rahul, Saladi / Subramanian, Aditya / Wiese, Andreas et al. | 2023
- 47
-
Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann FunctionLe, Hung / Milenković, Lazar / Solomon, Shay et al. | 2023
- 48
-
Shortest Paths in PortalgonsLöffler, Maarten / Ophelders, Tim / Silveira, Rodrigo I. / Staals, Frank et al. | 2023
- 49
-
The Geodesic Edge Center of a Simple PolygonLubiw, Anna / Naredla, Anurag Murty et al. | 2023
- 50
-
A Structural Approach to Tree Decompositions of Knots and Spatial GraphsLunel, Corentin / de Mesmay, Arnaud et al. | 2023
- 51
-
Ephemeral Persistence Features and the Stability of Filtered Chain ComplexesMémoli, Facundo / Zhou, Ling et al. | 2023
- 52
-
Abstract Voronoi-Like Graphs: Extending Delaunay’s Theorem and ApplicationsPapadopoulou, Evanthia et al. | 2023
- 53
-
Random Projections for Curves in High DimensionsPsarros, Ioannis / Rohde, Dennis et al. | 2023
- 54
-
New Approximation Algorithms for Touring RegionsQi, Benjamin / Qi, Richard et al. | 2023
- 55
-
Combinatorial Depth Measures for Hyperplane ArrangementsSchnider, Patrick / Soberón, Pablo et al. | 2023
- 56
-
FibeRed: Fiberwise Dimensionality Reduction of Topologically Complex Data with Vector BundlesScoccola, Luis / Perea, Jose A. et al. | 2023
- 57
-
Toroidal Coordinates: Decorrelating Circular Coordinates with Lattice ReductionScoccola, Luis / Gakhar, Hitesh / Bush, Johnathan / Schonsheck, Nikolas / Rask, Tatum / Zhou, Ling / Perea, Jose A. et al. | 2023
- 58
-
Topological Universality of the Art Gallery ProblemStade, Jack / Tucker-Foltz, Jamie et al. | 2023
- 59
-
On Higher Dimensional Point Sets in General PositionSuk, Andrew / Zeng, Ji et al. | 2023
- 60
-
Slice, Simplify and Stitch: Topology-Preserving Simplification Scheme for Massive Voxel DataWagner, Hubert et al. | 2023
- 61
-
Maximum Overlap Area of a Convex Polyhedron and a Convex Polygon Under TranslationZhu, Honglin / Kweon, Hyuk Jun et al. | 2023
- 62
-
Godzilla Onions: A Skit and Applet to Explain Euclidean Half-Plane Fractional Cascading (Media Exposition)Berger, Richard / Ha, Vincent / Kratz, David / Lin, Michael / Moyer, Jeremy / Tralie, Christopher J. et al. | 2023
- 63
-
Interactive 2D Periodic Graphs (Media Exposition)Camero, Alexandra / Streinu, Ileana et al. | 2023
- 64
-
Greedy Permutations and Finite Voronoi Diagrams (Media Exposition)Chubet, Oliver A. / Macnichol, Paul / Parikh, Parth / Sheehy, Donald R. / Sheth, Siddharth S. et al. | 2023
- 65
-
The Sum of Squares in Polycubes (Media Exposition)Sheehy, Donald R. et al. | 2023
- 66
-
Constructing Concise Convex Covers via Clique Covers (CG Challenge)Abrahamsen, Mikkel / Bille Meyling, William / Nusser, André et al. | 2023
- 67
-
Shadoks Approach to Convex Covering (CG Challenge)da Fonseca, Guilherme D. et al. | 2023