:: Library Catalog

Cover Image

Saved in:

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

Similar Items

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
by: Elbassioni, Khaled
Published: (2025)

Two-person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies
by: Boros, Endre, et al.
Published: (2024)

Polynomial Bounds in the Apex Minor Theorem
by: Hendrey, Kevin, et al.
Published: (2025)

On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations
by: Au, Yu Hin, et al.
Published: (2020)

Monotone Bounded-Depth Complexity of Homomorphism Polynomials
by: Bhargav, C. S., et al.
Published: (2025)

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
by: Laddha, Aditi, et al.
Published: (2025)

From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP
by: Gurvits, Leonid, et al.
Published: (2023)

Asymptotic Bounds and Online Algorithms for Average-Case Matrix Discrepancy
by: Kunisky, Dmitriy, et al.
Published: (2024)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
by: Bandopadhyay, Susobhan, et al.
Published: (2023)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
by: Proença, Nathan Benedetto, et al.
Published: (2026)

Polynomial-Size Enumeration Kernelizations for Long Path Enumeration
by: Komusiewicz, Christian, et al.
Published: (2025)

Isoperimetric Inequalities Made Simpler
by: Eldan, Ronen, et al.
Published: (2022)

Bears with Hats and Independence Polynomials
by: Blažej, Václav, et al.
Published: (2021)

Graphs, Disjoint Matchings and Some Inequalities
by: Hambardzumyan, Lianna, et al.
Published: (2015)

Hypergraphs with Polynomial Representation: Introducing $r$-splits
by: Pitois, François, et al.
Published: (2022)

A Euclidean Distance Matrix Model for Convex Clustering
by: Wang, Zhaowei, et al.
Published: (2021)

Using Graph Theory to Derive Inequalities for the Bell Numbers
by: Hertz, Alain, et al.
Published: (2021)

Another Way to Lower the Bound for Distinct Squares
by: Tomita, Eitatsu, et al.
Published: (2026)

Improved Lower Bounds on Multiflow-Multicut Gaps
by: Kalantarzadeh, Sina, et al.
Published: (2025)

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

Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
by: Gerke, Stefanie, et al.
Published: (2024)

Digraph Branchings and Matrix Determinants
by: Ghosh, Sayani, et al.
Published: (2023)

Positional Identifiability from Pairwise Collision Data
by: Li, Yun-Han, et al.
Published: (2026)

Weighted Treedepth is NP-complete on Graphs of Bounded Degree
by: Dirks, Jona, et al.
Published: (2025)

Polynomial-time recognition and maximum independent set in Burling graphs
by: Rzążewski, Paweł, et al.
Published: (2024)

Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets
by: Chen, Yeyuan
Published: (2024)

An orderly algorithm for generation of Condorcet Domains
by: Zhou, Bei, et al.
Published: (2025)

Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
by: Dubinsky, Manuel, et al.
Published: (2024)

A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion
by: Agrawal, Akanksha, et al.
Published: (2024)

Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation
by: Georgiou, Konstantinos, et al.
Published: (2024)

A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering
by: Kawamura, Akitoshi, et al.
Published: (2025)

Bounds on Path Energy of Graphs
by: Narke, Amol P., et al.
Published: (2022)

Computation of Graph Polynomials via Tree Decomposition: Theory, Algorithms, and Python Implementation
by: Bafna, Mehul, et al.
Published: (2025)

Axiomatic characterizations of dissimilarity orderings and distances between sets
by: Marchant, Thierry, et al.
Published: (2025)

Bounds on the Complete Forcing Number of Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)

Bounds on Linear Turán Number for Trees
by: Adak, Rajat, et al.
Published: (2026)

Lower Bounds for Induced-Universal Graphs
by: Gavoille, Cyril, et al.
Published: (2025)

Supports for Outerplanar and Bounded Treewidth Graphs
by: Raman, Rajiv, et al.
Published: (2025)

Lower Bounds for Maximum Weighted Cut
by: Gutin, Gregory, et al.
Published: (2021)

Single machine rescheduling for new orders: properties and complexity results
by: Rener, Elena, et al.
Published: (2023)