:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Banerjee, Niranka, Engels, Christian, Hoang, Duc A.
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Discrete Mathematics
Accès en ligne:	https://arxiv.org/abs/2402.12705
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Complexity of Distance-$r$ Dominating Set Reconfiguration
par: Banerjee, Niranka, et autres
Publié: (2023)

Directed Token Sliding
par: Banerjee, Niranka, et autres
Publié: (2024)

Distance-Preserving Graph Compression Techniques
par: Madani, Amirali, et autres
Publié: (2023)

On the Complexity of Distance-$d$ Independent Set Reconfiguration
par: Hoang, Duc A.
Publié: (2022)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
par: Bandopadhyay, Susobhan, et autres
Publié: (2023)

When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
par: Bentert, Matthias, et autres
Publié: (2025)

Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
par: Komusiewicz, Christian, et autres
Publié: (2026)

Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
par: Rosenke, Christian, et autres
Publié: (2026)

Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
par: Fomin, Fedor V., et autres
Publié: (2026)

Graph Visualization for Blockchain Data
par: Dietl, Marcell, et autres
Publié: (2024)

Distance Vector Domination
par: Cordasco, Gennaro, et autres
Publié: (2024)

Finding Minimum Distance Preservers: A Parameterized Study
par: Simonov, Kirill, et autres
Publié: (2026)

Distance Approximating Minors for Planar and Minor-Free Graphs
par: Chang, Hsien-Chih, et autres
Publié: (2025)

Sorting with constraints
par: Manas, A.
Publié: (2025)

Source-Oblivious Broadcast
par: Fraigniaud, Pierre, et autres
Publié: (2025)

Twice-Ramanujan Sparsifiers
par: Batson, Joshua, et autres
Publié: (2008)

Functional design of efficient and parallelizable combinatorial generators using convolution
par: He, Xi, et autres
Publié: (2025)

Polynomial Kernels for Spanning Tree with Diversity Requirements
par: Golovach, Petr A., et autres
Publié: (2026)

Stability in Graphs with Matroid Constraints
par: Fomin, Fedor V., et autres
Publié: (2024)

When does FTP become FPT?
par: Bentert, Matthias, et autres
Publié: (2025)

Edge Clique Partition and Cover Beyond Independence
par: Fomin, Fedor V., et autres
Publié: (2025)

Fault-Tolerant Matroid Bases
par: Bentert, Matthias, et autres
Publié: (2025)

H-Planarity and Parametric Extensions: when Modulators Act Globally
par: Fomin, Fedor V., et autres
Publié: (2025)

Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
par: Fomin, Fedor V., et autres
Publié: (2024)

The complexity of strong conflict-free vertex-connection $k$-colorability
par: Hsieh, Sun-Yuan, et autres
Publié: (2024)

Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice
par: Tan, Jingjing
Publié: (2024)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
par: Harada, Tsubasa
Publié: (2024)

Exponential Time Approximation for Coloring 3-Colorable Graphs
par: Guruswami, Venkatesan, et autres
Publié: (2024)

Generation of weighted trees, block trees and block graphs
par: Ekim, Tınaz, et autres
Publié: (2024)

Circular-arc graphs and the Helly property
par: Derbisz, Jan, et autres
Publié: (2024)

Parameterized Saga of First-Fit and Last-Fit Coloring
par: Agrawal, Akanksha, et autres
Publié: (2024)

Detecting Disjoint Shortest Paths in Linear Time and More
par: Akmal, Shyan, et autres
Publié: (2024)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
par: Wang, Chen, et autres
Publié: (2024)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
par: Harada, Tsubasa, et autres
Publié: (2024)

Deterministic counting from coupling independence
par: Chen, Xiaoyu, et autres
Publié: (2024)

Generalizing Roberts' characterization of unit interval graphs
par: Martínez, Virginia Ardévol, et autres
Publié: (2024)

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
par: Kaul, Matthias, et autres
Publié: (2024)

Reconfiguration of labeled matchings in triangular grid graphs
par: Kakimura, Naonori, et autres
Publié: (2024)

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem
par: Disser, Yann, et autres
Publié: (2024)

Nearly Tight Bounds on Testing of Metric Properties
par: Bao, Yiqiao, et autres
Publié: (2024)