Imagen de Portada

Euclidean Affine Functions and Applications to Calendar Algorithms

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Neri, Cassio, Schneider, Lorenz
Formato:	Preprint
Publicado:	2021
Materias:	Data Structures and Algorithms Discrete Mathematics 65Y04 68R01
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Precision Arithmetic: A New Floating-Point Arithmetic
por: Wang, Chengpu
Publicado: (2006)

Optimal Discretization is Fixed-parameter Tractable
por: Kratsch, Stefan, et al.
Publicado: (2020)

Tight bounds on adjacency labels for monotone graph classes
por: Bonnet, Édouard, et al.
Publicado: (2023)

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
por: Bonnet, Édouard, et al.
Publicado: (2023)

Adjacency Labeling Schemes for Small Classes
por: Bonnet, Édouard, et al.
Publicado: (2024)

Degree Realization by Bipartite Cactus Graphs
por: Bar-Noy, Amotz, et al.
Publicado: (2025)

Unbent Collections of Orthogonal Drawings
por: Antić, Todor, et al.
Publicado: (2025)

On the thinness of trees
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2025)

A scalable clustering algorithm to approximate graph cuts
por: Suchan, Leo, et al.
Publicado: (2023)

On algorithmic applications of sim-width and mim-width of $(H_1, H_2)$-free graphs
por: Munaro, Andrea, et al.
Publicado: (2022)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
por: Rahat, Md Tanzeem, et al.
Publicado: (2025)

Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases
por: Meusel, Julia, et al.
Publicado: (2025)

Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence
por: Dutta, Kunal, et al.
Publicado: (2026)

Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
por: Fomin, Fedor V., et al.
Publicado: (2026)

Transit Functions and Clustering Systems
por: Changat, Manoj, et al.
Publicado: (2024)

Exact Wirelength of Embedding 3-Ary n-Cubes into certain Cylinders and Trees
por: S, Rajeshwari, et al.
Publicado: (2022)

Approximation Algorithms for Optimal Hopsets
por: Dinitz, Michael, et al.
Publicado: (2025)

Algorithmic Aspects of Temporal Betweenness
por: Buß, Sebastian, et al.
Publicado: (2020)

Greedy Algorithms for Shortcut Sets and Hopsets
por: Bals, Ben, et al.
Publicado: (2025)

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

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

Optimized Degree Realization: Minimum Dominating Set & Maximum Matching
por: Bar-Noy, Amotz, et al.
Publicado: (2025)

An Approximation Algorithm for Monotone Submodular Cost Allocation
por: Mizutani, Ryuhei
Publicado: (2025)

Minimum Sum Set Cover: Structures and Algorithm
por: Zhang, Zhongyi, et al.
Publicado: (2026)

Terminal Steiner tree problem : Complexity and Algorithms
por: S, Jyothish, et al.
Publicado: (2026)

Matching Algorithms in the Sparse Stochastic Block Model
por: Brandenberger, Anna, et al.
Publicado: (2024)

Revisiting Tree Isomorphism: An Algorithmic Bric-à-Brac
por: Ingels, Florian
Publicado: (2023)

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
por: Foucaud, Florent, et al.
Publicado: (2026)

Improved Streaming Algorithm for Fair $k$-Center Clustering
por: Guo, Longkun, et al.
Publicado: (2025)

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

Algorithmic Results for Weak Roman Domination Problem in Graphs
por: Paul, Kaustav, et al.
Publicado: (2024)

Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
por: Abbasi, Ali, et al.
Publicado: (2026)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
por: Wang, Chen, et al.
Publicado: (2024)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
por: Harada, Tsubasa, et al.
Publicado: (2024)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
por: Gahlawat, Harmender, et al.
Publicado: (2025)

Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
por: Antony, Dhanyamol, et al.
Publicado: (2023)

UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm
por: Arhire, Andrei, et al.
Publicado: (2025)

Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems
por: Duvignau, Romaric, et al.
Publicado: (2024)

Approximation Algorithms for the $b$-Matching and List-Restricted Variants of MaxQAP
por: Nanta, Jiratchaphat, et al.
Publicado: (2025)

A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
por: Abboud, Amir, et al.
Publicado: (2025)