:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Arnau, R., Calabuig, J. M., Raffi, L. M. García, Pérez, E. A. Sánchez, Sanjuan, S.
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Discrete Mathematics Mathematical Software 05C38 (Primary) 90C35 (Secondary)
Online Access:	https://arxiv.org/abs/2411.00819
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Loop unrolling of UCA models: distance labeling
by: Soulignac, Francisco J, et al.
Published: (2022)

Balanced connected partitions of edge-weighted graphs: Hardness and solving methods
by: Davari, Morteza, et al.
Published: (2025)

Invariant Polydiagonal Subspaces of Matrices and Constraint Programming
by: Neuberger, John M., et al.
Published: (2024)

Better and Simpler Reducibility Bounds over the Integers
by: Levin, Asaf
Published: (2025)

Isolation critical graphs under multiple edge subdivision
by: Bartolo, Karl, et al.
Published: (2026)

Link Residual Closeness of Harary Graphs
by: Dangalchev, Ch.
Published: (2023)

Young domination on Hamming rectangles
by: Gravner, Janko, et al.
Published: (2025)

Solving the Graph Burning Problem for Large Graphs
by: Pereira, Felipe de Carvalho, et al.
Published: (2024)

Polyhedral approach to weighted connected matchings in general graphs
by: Samer, Phillippe, et al.
Published: (2023)

Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-shortest Induced Paths
by: Chiu, Yung-Chung, et al.
Published: (2021)

Solution to a problem on isolation of $3$-vertex paths
by: Bartolo, Karl, et al.
Published: (2025)

Cycles of weight divisible by $k$
by: Diwan, Ajit A.
Published: (2024)

Reconfiguring homomorphisms to reflexive graphs via a simple reduction
by: Mühlenthaler, Moritz, et al.
Published: (2024)

Isolation of squares in graphs
by: Bartolo, Karl, et al.
Published: (2023)

Adaptive Improvements of Multi-Objective Branch and Bound
by: Bauß, Julius, et al.
Published: (2023)

Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm
by: Klein, Kim-Manuel, et al.
Published: (2024)

Isolation of non-triangle cycles in graphs
by: Borg, Peter, et al.
Published: (2025)

Edge coloring of products of signed graphs
by: Janczewski, Robert, et al.
Published: (2023)

A Menger-type theorem for two induced paths
by: Albrechtsen, Sandra, et al.
Published: (2023)

4-cop-win graphs have at least 19 vertices
by: Turcotte, Jérémie, et al.
Published: (2020)

A unified worst case for classical simplex and policy iteration pivot rules
by: Disser, Yann, et al.
Published: (2023)

Graph parameters that are coarsely equivalent to path-length
by: Dragan, Feodor F., et al.
Published: (2025)

Branching $k$-path vertex cover of forests
by: Makarov, Mikhail
Published: (2026)

Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
by: McFarland, Caleb
Published: (2026)

Generation of weighted trees, block trees and block graphs
by: Ekim, Tınaz, et al.
Published: (2024)

Branch-width of connectivity functions is fixed-parameter tractable
by: Korhonen, Tuukka, et al.
Published: (2026)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
by: Masařík, Tomáš, et al.
Published: (2026)

Closeness of Some Graph Operations
by: Dangalchev, Chavdar
Published: (2023)

Isolation of regular graphs and $k$-chromatic graphs
by: Borg, Peter
Published: (2023)

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
by: Dallard, Clément, et al.
Published: (2024)

The Planted Spanning Tree Problem
by: Moharrami, Mehrdad, et al.
Published: (2025)

Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
by: Baste, Julien, et al.
Published: (2019)

The Complexity of Distance-$r$ Dominating Set Reconfiguration
by: Banerjee, Niranka, et al.
Published: (2023)

Isolation of regular graphs, stars and $k$-chromatic graphs
by: Borg, Peter
Published: (2023)

Tree independence number V. Walls and claws
by: Chudnovsky, Maria, et al.
Published: (2025)

Signed double Roman domination on cubic graphs
by: Iurlano, Enrico, et al.
Published: (2023)

Fast approximation algorithms for the 1-median problem on real-world large graphs
by: Ueta, Keisuke, et al.
Published: (2025)

A column generation algorithm for finding co-3-plexes in chordal graphs
by: Dupont-Bouillard, Alexandre
Published: (2026)

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

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