Imagen de Portada

Finding Cliques in Geometric Intersection Graphs with Grounded or Stabbed Constraints

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Keil, J. Mark, Mondal, Debajyoti
Formato:	Preprint
Publicado:	2025
Materias:	Computational Geometry Discrete Mathematics 52C99, 68Q25 F.2.2; I.3.5
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Maximum Clique Problem in a Disk Graph Made Easy
por: Keil, J. Mark, et al.
Publicado: (2024)

On Finding Randomly Planted Cliques in Arbitrary Graphs
por: Agrimonti, Francesco, et al.
Publicado: (2025)

Geometric realizations of dichotomous ordinal graphs
por: Angelini, Patrizio, et al.
Publicado: (2025)

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
por: Bonnet, Édouard, et al.
Publicado: (2026)

Induced Disjoint Paths Without an Induced Minor
por: Aboulker, Pierre, et al.
Publicado: (2025)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
por: Laekhanukit, Bundit
Publicado: (2024)

Interval Graphs are Reconstructible
por: Heinrich, Irene, et al.
Publicado: (2025)

Maximum Matchings in Geometric Intersection Graphs
por: Bonnet, Édouard, et al.
Publicado: (2019)

ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes
por: Philip, Geevarghese, et al.
Publicado: (2026)

Continuous Flattening and Reversing of Convex Polyhedral Linkages
por: Demaine, Erik D., et al.
Publicado: (2024)

Coloring Hardness on Low Twin-Width Graphs
por: Bonnet, Édouard
Publicado: (2025)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
por: Hougardy, Stefan, et al.
Publicado: (2025)

Answering Related Questions
por: Bonnet, Édouard
Publicado: (2025)

Folding One Polyhedral Metric Graph into Another
por: Chung, Lily, et al.
Publicado: (2024)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
por: Chen, Yijia, et al.
Publicado: (2023)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
por: Feldman, Moran, et al.
Publicado: (2026)

Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)
por: Wulf, Lasse
Publicado: (2025)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
por: Sun, Hao
Publicado: (2023)

On the Uncrossed Number of Graphs
por: Balko, Martin, et al.
Publicado: (2024)

Robust Bichromatic Classification using Two Lines
por: Glazenburg, Erwin, et al.
Publicado: (2024)

The Tower of Hanoi: Optimality Proofs, Multi-Peg Bounds, and Computational Frontiers
por: Junyi, Qi
Publicado: (2025)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
por: Heimann, Sophia, et al.
Publicado: (2025)

Intersection patterns of set systems on manifolds with slowly growing homological shatter functions
por: Avvakumov, Sergey, et al.
Publicado: (2026)

Sublinear-Time Computation in the Presence of Online Erasures
por: Kalemaj, Iden, et al.
Publicado: (2021)

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
por: Agarwal, Pankaj K., et al.
Publicado: (2018)

Rotation-Invariant Vectorized Shape Representations
por: Shafieasl, Hamid, et al.
Publicado: (2026)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
por: Heimann, Sophia, et al.
Publicado: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
por: Hougardy, Stefan, et al.
Publicado: (2024)

Pliability and Approximating Max-CSPs
por: Romero, Miguel, et al.
Publicado: (2019)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
por: Michel, Stefan
Publicado: (2025)

Quantum Speedup for Some Geometric 3SUM-Hard Problems and Beyond
por: Keil, J. Mark, et al.
Publicado: (2024)

Some Counterexamples for Compatible Triangulations
por: Barnson, Cody, et al.
Publicado: (2016)

The Gallai Vertex Problem is $Θ_2^p$-Complete
por: Nikabadi, Amir, et al.
Publicado: (2026)

On the Connectivity of the Flip Graph of Plane Spanning Paths
por: Kleist, Linda, et al.
Publicado: (2024)

Minimizing an Uncrossed Collection of Drawings
por: Hliněný, Petr, et al.
Publicado: (2023)

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
por: Charvy, Gaspard, et al.
Publicado: (2025)

Searching in trees with monotonic query times
por: Dereniowski, Dariusz, et al.
Publicado: (2024)

Graphs whose vertices of degree at least 2 lie in a triangle
por: Forte, Vinicius L. do, et al.
Publicado: (2022)

Probabilistic Approach for Detection of High-Frequency Periodic Signals using an Event Camera
por: Ben-Ezra, David El-Chai, et al.
Publicado: (2022)

AI Model for Predicting Binding Affinity of Antidiabetic Compounds Targeting PPAR
por: Aman, La Ode, et al.
Publicado: (2024)