:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Golinelli, Olivier
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics
Online Access:	https://arxiv.org/abs/2405.16938
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Remote control system of a binary tree of switches -- II. balancing for a perfect binary tree
by: Golinelli, Olivier
Published: (2024)

Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
by: Montanez-Barrera, Alejandro, et al.
Published: (2022)

Greed is slow on sparse graphs of oriented valued constraints
by: Kaznatcheev, Artem, et al.
Published: (2025)

Homomorphisms of (n,m)-graphs with respect to generalised switch
by: Sen, Sagnik, et al.
Published: (2022)

On the existence of heavy columns in binary matrices with distinct rows
by: Abdurakhmanov, Jamolidin K.
Published: (2026)

Binary constraints on one additional variable can create exponential ascents
by: Cohen, David A., et al.
Published: (2026)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
by: Claus, Quentin, et al.
Published: (2026)

Stability for binary scalar products
by: Kupavskii, Andrey, et al.
Published: (2024)

Mathematical and computational perspectives on the Boolean and binary rank and their relation to the real rank
by: Parnas, Michal
Published: (2026)

Optimal energy collection with rotational movements constraints in concentrated solar power plants
by: Díaz-Bañez, J. M., et al.
Published: (2024)

On the parameterized complexity of computing tree-partitions
by: Bodlaender, Hans L., et al.
Published: (2022)

Effective approach of the tridendriform Schroeder tree algebra
by: Catoire, Pierre, et al.
Published: (2026)

Neighbour sum distinguishing edge-weightings with local constraints
by: Dailly, Antoine, et al.
Published: (2022)

Regular packing of rooted hyperforests with root constraints in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2023)

Extended formulations for induced tree and path polytopes of chordal graphs
by: Dupont-Bouillard, Alexandre
Published: (2025)

Note about the complexity of the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2025)

Some polynomial classes for the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2026)

Critical exponent of binary words with few distinct palindromes
by: Dvořáková, L'ubomíra, et al.
Published: (2023)

How to see the forest for the trees
by: Bérczi-Kovács, Erika, et al.
Published: (2025)

Factorized binary polynomial optimization
by: Del Pia, Alberto
Published: (2024)

Sorting with constraints
by: Manas, A.
Published: (2025)

Solving decision problems by distributed consensus with one-dimensional, binary, radius-$2$ cellular automata over cyclic configurations
by: Ruivo, Eurico, et al.
Published: (2025)

Further Results and Questions on $S$-Packing Coloring of Subcubic Graphs
by: Mortada, Maidoun, et al.
Published: (2024)

Conflict-free chromatic index of trees
by: Guo, Shanshan, et al.
Published: (2024)

Characterizing traces of processes defined by precedence and response constraints: an order theory approach
by: Dukes, Mark, et al.
Published: (2023)

Labeling and folding multi-labeled trees
by: Moulton, Vincent, et al.
Published: (2025)

Computational complexity of covering regular trees
by: Bok, Jan, et al.
Published: (2025)

Tree-partitions and small-spread tree-decompositions
by: Distel, Marc, et al.
Published: (2026)

On coarse tree decompositions and coarse balanced separators
by: Abrishami, Tara, et al.
Published: (2025)

Bipartite Turán number of paths and other trees
by: Bonamy, Marthe, et al.
Published: (2025)

On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)

Interaction between skew-representability, tensor products, extension properties, and rank inequalities
by: Bérczi, Kristóf, et al.
Published: (2025)

The complete edge relaxation for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2025)

Listing spanning trees of outerplanar graphs by pivot-exchanges
by: Behrooznia, Nastaran, et al.
Published: (2024)

Tight bound for the Erdős-Pósa property of tree minors
by: Dujmović, Vida, et al.
Published: (2024)

A complete $t$-intersection theorem for families of spanning trees
by: Iarovikova, Elizaveta, et al.
Published: (2025)

Trade-off between spread and width for tree decompositions
by: Bodlaender, Hans L., et al.
Published: (2026)

Induced matching treewidth and tree-independence number, revisited
by: Alon, Noga, et al.
Published: (2025)

On Iiro Honkala's contributions to identifying codes
by: Hudry, Olivier, et al.
Published: (2024)