Conceptio
›
discrete-mathematics
Topic
discrete-mathematics
Knowledge-graph topic
· documents ABOUT discrete-mathematics across the archive
309
Documents about discrete-mathematics
Documents about discrete-mathematics
Set families: restricted distances via restricted intersections
#974190
arXiv (All)
Synchronization Strings over the Optimal Alphabet
#984257
arXiv (All)
List coloring uncrowded hypergraphs at the shattering threshold
#985137
arXiv (All)
Connectivity of Districting Metagraphs
#986871
arXiv (All)
Algebraic Structure and Orthogonality Properties of Rational Polynomial Phase Rings on Discrete Lattices
#986899
arXiv (All)
On the Parameterized Complexity of Coloring Discovery
#996655
arXiv (All)
Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
#998092
arXiv (All)
An FPTAS for Two-Machine Open-Shop Scheduling with a Single Unavailability Interval
#999386
arXiv (All)
Improved Algorithms for Beck--Fiala with Bounded Sets
#1014302
arXiv (All)
Integrality gap preserving reductions
#1033749
arXiv (All)
Contextual Fraction Beyond Satisfiability: Pure NAE Completeness, Exact Orbit Packings, and Width Barriers
#1034049
arXiv (All)
Tree-independence number of $P_5$-free graphs with no large bicliques
#1035482
arXiv (All)
Balanced Multi-Party Tournament Designs
#173875
DigitalCommons@WayneState
Complexity of Firefighting on Graphs
#141736
arXiv (OAI)
Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
#146996
arXiv (OAI)
Block encoding the 3D heterogeneous Poisson equation with application to fracture flow
#147142
arXiv (OAI)
Note on the capacity and geometric realizability of combinatorial mobile sensor networks
#611197
arXiv (OAI Expanded)
Note on the capacity and geometric realizability of combinatorial mobile sensor networks
#612674
arXiv (All)
Stability in stochastic hypergraph matching II: weights, batch arrivals, and continuous time
#618715
arXiv (OAI Expanded)
Stability in stochastic hypergraph matching II: weights, batch arrivals, and continuous time
#620394
arXiv (All)
Transience Bounds for Distributed Algorithms
#629689
HAL Science
Flow Shop Scheduling with Stochastic Reentry
#783559
arXiv (OAI Expanded)
Flow Shop Scheduling with Stochastic Reentry
#785149
arXiv (All)
A Parametrized Complexity View on Robust Scheduling with Budgeted Uncertainty
#789563
arXiv (OAI Expanded)
A Parametrized Complexity View on Robust Scheduling with Budgeted Uncertainty
#793567
arXiv (All)
FirstFit online coloring in the random order model
#796830
arXiv (OAI Expanded)
FirstFit online coloring in the random order model
#798243
arXiv (All)
Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
#809376
arXiv (OAI Expanded)
Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
#819369
arXiv (All)
The Most Malicious Maître D'
#820148
arXiv (All)
Equality cases of the Stanley--Yan log-concave matroid inequality
#920791
arXiv (OAI Expanded)
The Minimum-Weight Mixed Dominating Set on Threshold Graphs
#924639
arXiv (All)
Equality cases of the Stanley--Yan log-concave matroid inequality
#925025
arXiv (All)
A proof of Ross's conjecture for two-site moving-target search
#926160
arXiv (All)
On the Vertices That Belong to All Minimum Identifying Codes
#996668
arXiv (All)
Digraphs of Large Girth and Dichromatic Number in Tournaments with Large Dichromatic Number
#1036284
arXiv (All)
End-to-End Speedup for Quantum Simulation-Based Optimization in Power Grid Management
#177065
arXiv (OAI)
Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
#183190
arXiv (OAI)
An Overview of Universal Obstructions for Graph Parameters
#189015
arXiv
An Overview of Universal Obstructions for Graph Parameters
#189065
arXiv Biology
An Overview of Universal Obstructions for Graph Parameters
#189115
arXiv (OAI Expanded)
An Overview of Universal Obstructions for Graph Parameters
#189165
arXiv (OAI)
Optimizing Discrete Hopfield Neural Networks Using Major Random 1,3-Satisfiability And Hybrid Artificial Bee Colony
#352752
USM Repository
Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with GFlowNets
#682375
arXiv (OAI Expanded)
Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with GFlowNets
#684150
arXiv (All)
Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join
#789500
arXiv (OAI Expanded)
Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join
#793504
arXiv (All)
Logarithmic Chowla Correlations Across All Shift Scales
#821481
arXiv (All)
Helly-Type Theorems for Splitting Point Sets
#926245
arXiv (All)
Minimizing the makespan in job shop scheduling under conflict graph constraints
#927027
arXiv (All)
← Previous
Page 5 of 8
Next →
Topic record
· derived from the Conceptio knowledge graph (shared subject terms across the corpus)
Conceptio Open Knowledge Archive — topic hubs link to canonical document pages with full provenance.