Imagen de Portada

Recognizing 2-Layer and Outer $k$-Planar Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kobayashi, Yasuaki, Okada, Yuto, Wolff, Alexander
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Computational Complexity Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

2-Layer Fan-Planarity in Polynomial Time
por: Kobayashi, Yasuaki, et al.
Publicado: (2025)

Min-1-Planarity is NP-Hard
por: Okada, Yuto
Publicado: (2026)

Structural Parameterizations of $k$-Planarity
por: Gima, Tatsuya, et al.
Publicado: (2025)

On connections between k-coloring and Euclidean k-means
por: Aman, Enver, et al.
Publicado: (2024)

Finding One Local Optimum Is Easy -- but What About Two?
por: Kobayashi, Yasuaki, et al.
Publicado: (2025)

Fine-Grained Complexity of Continuous Euclidean k-Center
por: Blank, Lotte, et al.
Publicado: (2026)

Near-Optimal Bounds for Parameterized Euclidean k-means
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

Subcoloring of (Unit) Disk Graphs
por: Marin, Malory, et al.
Publicado: (2025)

Universal Solvability for Robot Motion Planning on Graphs
por: Dhar, Anubhav, et al.
Publicado: (2025)

Finding a Minimum Spanning Tree with a Small Non-Terminal Set
por: Hanaka, Tesshu, et al.
Publicado: (2023)

Finding Diverse Strings and Longest Common Subsequences in a Graph
por: Shida, Yuto, et al.
Publicado: (2024)

The Complexity of Maximal Common Subsequence Enumeration
por: Buzzega, Giovanni, et al.
Publicado: (2025)

Morphing Planar Graph Drawings Through 3D
por: Buchin, Kevin, et al.
Publicado: (2022)

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
por: Bringmann, Karl, et al.
Publicado: (2024)

Computational Complexities of Folding
por: Eppstein, David
Publicado: (2024)

Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
por: Goodrich, Michael T., et al.
Publicado: (2024)

On Approximating the Dynamic and Discrete Network Flow Problem
por: Manna, Bubai, et al.
Publicado: (2024)

Ideal Membership Problem for Boolean Minority and Dual Discriminator
por: Bharathi, Arpitha P., et al.
Publicado: (2024)

Inapproximability of Maximum Diameter Clustering for Few Clusters
por: Fleischmann, Henry, et al.
Publicado: (2023)

A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams
por: Khanna, Sanjeev, et al.
Publicado: (2025)

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2020)

Improved Hardness of Approximation for Geometric Bin Packing
por: Ray, Arka, et al.
Publicado: (2023)

Beyond Bits: An Introduction to Computation over the Reals
por: Miltzow, Tillmann
Publicado: (2026)

Fast and simple multiplication of bounded twin-width matrices
por: Kozma, László, et al.
Publicado: (2026)

Hardness of Median and Center in the Ulam Metric
por: Fischer, Nick, et al.
Publicado: (2025)

On Approximability of Steiner Tree in $\ell_p$-metrics
por: Fleischmann, Henry, et al.
Publicado: (2023)

Approximate Algorithms for Chamfer Distance Under Translation
por: Halevi, Gil, et al.
Publicado: (2026)

Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

Tight Additive Sensitivity on LZ-style Compressors and String Attractors
por: Fujie, Yuto, et al.
Publicado: (2025)

Broadcasting under Structural Restrictions
por: Egami, Yudai, et al.
Publicado: (2025)

Time complexity of the Analyst's Traveling Salesman algorithm
por: Ramirez, Anthony, et al.
Publicado: (2022)

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
por: S., Karthik C., et al.
Publicado: (2024)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the $\sqrt{n}$ Dimension Threshold
por: Guruswami, Venkatesan, et al.
Publicado: (2024)

On Approximability of $\ell_2^2$ Min-Sum Clustering
por: S., Karthik C., et al.
Publicado: (2024)

Ranking and Unranking of the Planar Embeddings of a Planar Graph
por: Di Battista, Giuseppe, et al.
Publicado: (2024)

On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
por: Firbas, Alexander, et al.
Publicado: (2024)

Complexity of Paired Domination Problems on Circle and $k$-Polygon Graphs
por: Mu, Ta-Yu, et al.
Publicado: (2024)

Recognizing Sumsets is NP-Complete
por: Abboud, Amir, et al.
Publicado: (2024)

k-SUM Hardness Implies Treewidth-SETH
por: Lampis, Michael
Publicado: (2025)