Image de couverture de livre

Tournament Robustness via Redundancy

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Efremenko, Klim, Molter, Hendrik, Zehavi, Meirav
Format:	Preprint
Publié:	2025
Sujets:	Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Treewidth Parameterized by Feedback Vertex Number
par: Molter, Hendrik, et autres
Publié: (2025)

A Parameterized Perspective on Uniquely Restricted Matchings
par: Chaudhary, Juhi, et autres
Publié: (2025)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
par: Gahlawat, Harmender, et autres
Publié: (2025)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
par: Jacob, Ashwin, et autres
Publié: (2024)

Adaptive Manipulation for Coalitions in Knockout Tournaments
par: Chaudhary, Juhi, et autres
Publié: (2024)

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

How to Make Knockout Tournaments More Popular?
par: Chaudhary, Juhi, et autres
Publié: (2023)

Parameterized Analysis of Bribery in Challenge the Champ Tournaments
par: Chaudhary, Juhi, et autres
Publié: (2024)

Algorithmic Aspects of Temporal Betweenness
par: Buß, Sebastian, et autres
Publié: (2020)

Characterizing Large Clique Number in Tournaments
par: Crew, Logan, et autres
Publié: (2026)

Temporal Graph Realization With Bounded Stretch
par: Mertzios, George B., et autres
Publié: (2025)

Fairness in Repetitive Scheduling
par: Hermelin, Danny, et autres
Publié: (2021)

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
par: Ai, Jiangdong, et autres
Publié: (2024)

Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
par: Spirkl, Sophie, et autres
Publié: (2026)

Isomorphism for Tournaments of Small Twin Width
par: Grohe, Martin, et autres
Publié: (2023)

On Kernelization with Access to NP-Oracles
par: Molter, Hendrik, et autres
Publié: (2025)

Transducing Linear Decompositions of Tournaments
par: Geniet, Colin, et autres
Publié: (2026)

The Complexity of Transitively Orienting Temporal Graphs
par: Mertzios, George B., et autres
Publié: (2021)

Query Complexity of Tournament Solutions
par: Maiti, Arnab, et autres
Publié: (2016)

Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances
par: Brakensiek, Joshua, et autres
Publié: (2026)

Robust Filter Design for Graph Signals
par: Testa, Lucia, et autres
Publié: (2024)

Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction
par: Matuschke, Jannik
Publié: (2025)

Fair Schedules for Single Round Robin Tournaments with Ranked Participants
par: Wessel, Sten, et autres
Publié: (2025)

Semi-Random Graphs, Robust Asymmetry, and Reconstruction
par: Asilis, Julian, et autres
Publié: (2025)

Optimal Average Disk-Inspection via Fermat's Principle
par: Georgiou, Konstantinos
Publié: (2025)

Near-optimal edge partitioning via intersecting families
par: Yakunin, Alexander, et autres
Publié: (2025)

An Identity for Catalan Numbers via Restricted Dyck Paths
par: Bernini, Antonio, et autres
Publié: (2026)

Redundancy analysis using lcm-filtrations: networks, system signature and sensitivity evaluation
par: Mohammadi, Fatemeh, et autres
Publié: (2025)

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges
par: Zhou, Xiaotian, et autres
Publié: (2025)

Stereotype graph: A mathematical framework of category stereotypes via graph theory
par: Yan, Yijia
Publié: (2025)

A recursive linear time modular decomposition algorithm via LexBFS
par: Corneil, Derek, et autres
Publié: (2007)

Minimum Temporal Spanners in Happy Graphs
par: Casteigts, Arnaud, et autres
Publié: (2026)

Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents
par: Moses Jr., William K., et autres
Publié: (2025)

A Novel Approach for Bent Functions with Dillon-like Exponents and Characterizing Three Classes of Bent Functions via Kloosterman Sums
par: Tu, Ziran, et autres
Publié: (2024)

Fractional coloring via entropy
par: Dhawan, Abhishek
Publié: (2026)

Matroid products via submodular coupling
par: Bérczi, Kristóf, et autres
Publié: (2024)

Bounds on treewidth via excluding disjoint unions of cycles
par: Hatzel, Meike, et autres
Publié: (2025)

Efficient counting of permutation patterns via double posets
par: Diehl, Joscha, et autres
Publié: (2024)

Combinatorial generation via permutation languages. VI. Binary trees
par: Gregor, Petr, et autres
Publié: (2023)

Hypergraph Representation via Axis-Aligned Point-Subspace Cover
par: Firman, Oksana, et autres
Publié: (2021)