:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Levin, Leonid A.
Format:	Preprint
Published:	2005
Subjects:	Discrete Mathematics
Online Access:	https://arxiv.org/abs/cs/0503039
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Note on the Complexity of Graph Recoloring
by: Bousquet, Nicolas
Published: (2024)

A Note on Polychromatic Colorings of Shift-Chains
by: Ueckerdt, Torsten
Published: (2024)

Note on polychromatic coloring of hereditary hypergraph families II
by: Pálvölgyi, Dömötör
Published: (2026)

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

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
by: Joret, Gwenaël, et al.
Published: (2026)

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

Note on the Number of Almost Ordinary Triangles
by: Dumitrescu, Adrian, et al.
Published: (2025)

Note on Min-k-Planar Drawings of Graphs
by: Hliněný, Petr, et al.
Published: (2024)

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

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

A Weight Function Lemma Heuristic for Graph Pebbling
by: Bridi, G. A., et al.
Published: (2025)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
by: Fuchser, Janne, et al.
Published: (2025)

Algorithms for the Global Domination Problem
by: Inza, Ernesto Parra, et al.
Published: (2023)

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

The Balanced Up-Down Walk
by: Akitaya, Hugo A., et al.
Published: (2026)

Study on (r,s)- Generalised Transformation Graphs, A Novel Perspective Based on Transformation Graphs
by: Ali, Parvez, et al.
Published: (2024)

Efficient approximation schemes for scheduling on a stochastic number of machines
by: Epstein, Leah, 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)

Space-time reversible graph rewriting
by: Arrighi, Pablo, et al.
Published: (2025)

Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
by: Sawada, J., et al.
Published: (2023)

Boxicity of Zero Divisor Graphs
by: Chandran, L. Sunil, et al.
Published: (2025)

Pairwise similarity method for majority domination problem
by: Shushko, N. I., et al.
Published: (2025)

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

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

On the rigidity of Arnoux-Rauzy words
by: Berthé, Valérie, et al.
Published: (2022)

Temporal Orienteering with Changing Fuel Costs
by: Corsini, Timothée, et al.
Published: (2025)

Spectral Moment of Order Four and the Uniqueness of the CCZ class of Dublin APN Permutation
by: Gillot, Valérie, et al.
Published: (2025)

CAZAC sequence generation of any length with iterative projection onto unit circle: principle and first results
by: Amis, Karine, et al.
Published: (2025)

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

Why Districting Becomes NP-hard
by: Jost, Niklas, et al.
Published: (2025)

Word-representability and comparability: Minimal forbidden induced subgraphs and cover number bounds
by: Kenkireth, Benny George, et al.
Published: (2025)

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

The Power of Amortization on Minimizing Total Completion Time with Explorable Uncertainty
by: Krekelberg, Bob, et al.
Published: (2025)

RDNF Oriented Analytics to Random Boolean Functions
by: Aslanyan, Levon, et al.
Published: (2024)

Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model
by: Bentert, Matthias, et al.
Published: (2023)

From Tripods to Bipods: Reducing the Queue Number of Planar Graphs Costs Just One Leg
by: Förster, Henry
Published: (2024)

Topological Analysis and Synthesis of Structures related to Certain Classes of K-Geodetic Computer Networks
by: Frasser, Carlos E.
Published: (2017)

Multi-Agent Search-Type Problems on Polygons
by: Georgiou, Konstantinos, et al.
Published: (2024)

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)

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