:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Enright, Jessica, Lee, Duncan, Meeks, Kitty, Pettersson, William, Sylvester, John
Formato:	Preprint
Publicado:	2020
Materias:	Data Structures and Algorithms Computational Complexity
Acceso en línea:	https://arxiv.org/abs/2010.10314
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Nearly optimal independence oracle algorithms for edge estimation in hypergraphs
por: Dell, Holger, et al.
Publicado: (2022)

Cops and Robbers on Multi-Layer Graphs
por: Enright, Jessica, et al.
Publicado: (2023)

On the instance optimality of detecting collisions and subgraphs
por: Ben-Eliezer, Omri, et al.
Publicado: (2023)

A New Temporal Interpretation of Cluster Editing
por: Bocci, Cristiano, et al.
Publicado: (2022)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
por: Davot, Tom, et al.
Publicado: (2024)

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

A general framework for finding diverse solutions via network flow and its applications
por: Iwamasa, Yuni, et al.
Publicado: (2025)

The communication complexity of distributed estimation
por: Gopalan, Parikshit, et al.
Publicado: (2025)

Parameterized complexity of reconfiguration of atoms
por: Cooper, Alexandre, et al.
Publicado: (2021)

On optimal distinguishers for Planted Clique
por: Nagda, Ansh, et al.
Publicado: (2025)

$O(n +f(k))$: Truly Linear FPT
por: Bumpus, Benjamin Merlin, et al.
Publicado: (2026)

On girth and the parameterized complexity of token sliding and token jumping
por: Bartier, Valentin, et al.
Publicado: (2020)

On the complexity and approximability of Bounded access Lempel Ziv coding
por: Cicalese, Ferdinando, et al.
Publicado: (2024)

The complexity of testing all properties of planar graphs, and the role of isomorphism
por: Basu, Sabyasachi, et al.
Publicado: (2021)

Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut
por: Michel, Lukas, et al.
Publicado: (2023)

A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients
por: Yang, Yang
Publicado: (2024)

List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
por: Esmer, Barış Can, et al.
Publicado: (2022)

On the complexity of global Roman domination problem in graphs
por: Reddy, Sangam Balchandar, et al.
Publicado: (2026)

Parameterized Algorithms for Balanced Cluster Edge Modification Problems
por: Madathil, Jayakrishnan, et al.
Publicado: (2024)

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

DNF formulas are efficiently testable with relative error
por: Chen, Xi, et al.
Publicado: (2026)

Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
por: Kumar, Mrinal, et al.
Publicado: (2024)

A lossless a priori splitting rule for split-delivery routing problems
por: Jones, Bo, et al.
Publicado: (2025)

On the average-case complexity landscape for Tensor-Isomorphism-complete problems over finite fields
por: Li, Tiange, et al.
Publicado: (2026)

Faster maximal clique enumeration in large real-world link streams
por: Baudin, Alexis, et al.
Publicado: (2023)

Stable algorithms cannot reliably find isolated perceptron solutions
por: Gong, Shuyang, et al.
Publicado: (2026)

On the complexity of symmetric vs. functional PCSPs
por: Nakajima, Tamio-Vesa, et al.
Publicado: (2022)

On the parameterized complexity of Broadcast Independence and Broadcast Packing
por: Dumont, Joanne, et al.
Publicado: (2026)

Centrality of shortest paths: Algorithms and complexity results
por: Phosavanh, Johnson, et al.
Publicado: (2024)

The complexity of strong conflict-free vertex-connection $k$-colorability
por: Hsieh, Sun-Yuan, et al.
Publicado: (2024)

Asymptotically Optimal Hardness for $k$-Set Packing and $k$-Matroid Intersection
por: Lee, Euiwoong, et al.
Publicado: (2024)

BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs
por: Baudin, Alexis, et al.
Publicado: (2024)

Some easy optimization problems have the overlap-gap property
por: Li, Shuangping, et al.
Publicado: (2024)

Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
por: Abbas, Amira, et al.
Publicado: (2025)

A note on the complexity of the picker routing problem in multi-block warehouses and related problems
por: Prunet, Thibault, et al.
Publicado: (2023)

Rate-optimal community detection near the KS threshold via node-robust algorithms
por: Ding, Jingqiu, et al.
Publicado: (2025)

Improved Algorithm for Permutation Testing
por: Zhang, Xiaojin
Publicado: (2020)

On the Mysteries of MAX NAE-SAT
por: Brakensiek, Joshua, et al.
Publicado: (2020)

Removable Online Knapsack and Advice
por: Böckenhauer, Hans-Joachim, et al.
Publicado: (2020)

The Query Complexity of Local Search and Brouwer in Rounds
por: Brânzei, Simina, et al.
Publicado: (2020)