:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Efremenko, Klim, Molter, Hendrik, Zehavi, Meirav
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics
Online Access:	https://arxiv.org/abs/2506.03701
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Treewidth Parameterized by Feedback Vertex Number
by: Molter, Hendrik, et al.
Published: (2025)

A Parameterized Perspective on Uniquely Restricted Matchings
by: Chaudhary, Juhi, et al.
Published: (2025)

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

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
by: Jacob, Ashwin, et al.
Published: (2024)

Adaptive Manipulation for Coalitions in Knockout Tournaments
by: Chaudhary, Juhi, et al.
Published: (2024)

How to Make Knockout Tournaments More Popular?
by: Chaudhary, Juhi, et al.
Published: (2023)

Parameterized Analysis of Bribery in Challenge the Champ Tournaments
by: Chaudhary, Juhi, et al.
Published: (2024)

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
by: Kaul, Matthias, et al.
Published: (2024)

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

Temporal Graph Realization With Bounded Stretch
by: Mertzios, George B., et al.
Published: (2025)

Fairness in Repetitive Scheduling
by: Hermelin, Danny, et al.
Published: (2021)

Characterizing Large Clique Number in Tournaments
by: Crew, Logan, et al.
Published: (2026)

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
by: Ai, Jiangdong, et al.
Published: (2024)

On Kernelization with Access to NP-Oracles
by: Molter, Hendrik, et al.
Published: (2025)

Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
by: Spirkl, Sophie, et al.
Published: (2026)

The Complexity of Transitively Orienting Temporal Graphs
by: Mertzios, George B., et al.
Published: (2021)

Isomorphism for Tournaments of Small Twin Width
by: Grohe, Martin, et al.
Published: (2023)

Transducing Linear Decompositions of Tournaments
by: Geniet, Colin, et al.
Published: (2026)

Query Complexity of Tournament Solutions
by: Maiti, Arnab, et al.
Published: (2016)

Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances
by: Brakensiek, Joshua, et al.
Published: (2026)

Fair Schedules for Single Round Robin Tournaments with Ranked Participants
by: Wessel, Sten, et al.
Published: (2025)

Minimum Temporal Spanners in Happy Graphs
by: Casteigts, Arnaud, et al.
Published: (2026)

Robust Filter Design for Graph Signals
by: Testa, Lucia, et al.
Published: (2024)

Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction
by: Matuschke, Jannik
Published: (2025)

Redundancy analysis using lcm-filtrations: networks, system signature and sensitivity evaluation
by: Mohammadi, Fatemeh, et al.
Published: (2025)

Semi-Random Graphs, Robust Asymmetry, and Reconstruction
by: Asilis, Julian, et al.
Published: (2025)

Optimal Average Disk-Inspection via Fermat's Principle
by: Georgiou, Konstantinos
Published: (2025)

Near-optimal edge partitioning via intersecting families
by: Yakunin, Alexander, et al.
Published: (2025)

An Identity for Catalan Numbers via Restricted Dyck Paths
by: Bernini, Antonio, et al.
Published: (2026)

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges
by: Zhou, Xiaotian, et al.
Published: (2025)

Stereotype graph: A mathematical framework of category stereotypes via graph theory
by: Yan, Yijia
Published: (2025)

A recursive linear time modular decomposition algorithm via LexBFS
by: Corneil, Derek, et al.
Published: (2007)

Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents
by: Moses Jr., William K., et al.
Published: (2025)

A Novel Approach for Bent Functions with Dillon-like Exponents and Characterizing Three Classes of Bent Functions via Kloosterman Sums
by: Tu, Ziran, et al.
Published: (2024)

Fractional coloring via entropy
by: Dhawan, Abhishek
Published: (2026)

Matroid products via submodular coupling
by: Bérczi, Kristóf, et al.
Published: (2024)

Robust Deterministic Policies for Markov Decision Processes under Budgeted Uncertainty
by: Wu, Fei, et al.
Published: (2024)

Bounds on treewidth via excluding disjoint unions of cycles
by: Hatzel, Meike, et al.
Published: (2025)

Efficient counting of permutation patterns via double posets
by: Diehl, Joscha, et al.
Published: (2024)

Combinatorial generation via permutation languages. VI. Binary trees
by: Gregor, Petr, et al.
Published: (2023)