We gratefully acknowledge support from
the Simons Foundation
and member institutions

Discrete Mathematics

Authors and titles for recent submissions

[ total of 18 entries: 1-18 ]
[ showing up to 25 entries per page: fewer | more ]

Thu, 22 Feb 2018

[1]  arXiv:1802.07632 (cross-list from cs.DS) [pdf, other]
Title: Spanning Tree Congestion and Computation of Generalized Győri-Lov{á}sz Partition
Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC); Discrete Mathematics (cs.DM)
[2]  arXiv:1802.07515 (cross-list from cs.DS) [pdf, other]
Title: A framework for cost-constrained genome rearrangement under Double Cut and Join
Comments: Submitted to the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)
Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM); Combinatorics (math.CO); Genomics (q-bio.GN)

Wed, 21 Feb 2018

[3]  arXiv:1802.07164 (cross-list from math.CO) [pdf, ps, other]
Title: Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence phenomenon
Comments: 17 pages, with 10 figures, and a table
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM)
[4]  arXiv:1802.06871 (cross-list from cs.GT) [pdf, ps, other]
Title: A Deterministic Protocol for Sequential Asymptotic Learning
Subjects: Computer Science and Game Theory (cs.GT); Discrete Mathematics (cs.DM)

Tue, 20 Feb 2018

[5]  arXiv:1802.06669 [pdf, other]
Title: (Arc-disjoint) cycle packing in tournament: classical and parameterized complexity
Comments: 17 pages, 2 figures
Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)
[6]  arXiv:1802.06289 [pdf, ps, other]
Title: Faster Algorithms for Integer Programs with Block Structure
Authors: Friedrich Eisenbrand (1), Christoph Hunkenschröder (1), Kim-Manuel Klein (1) ((1) École polytechnique fédérale de Lausanne)
Subjects: Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS)
[7]  arXiv:1802.06699 (cross-list from cs.CC) [pdf, other]
Title: The Complexity of Drawing a Graph in a Polygonal Region
Comments: 14 pages 13 figures
Subjects: Computational Complexity (cs.CC); Computational Geometry (cs.CG); Discrete Mathematics (cs.DM)
[8]  arXiv:1802.06575 (cross-list from math.OC) [pdf, other]
Title: On the Decidability of Reachability in Linear Time-Invariant Systems
Subjects: Optimization and Control (math.OC); Discrete Mathematics (cs.DM); Logic in Computer Science (cs.LO); Systems and Control (cs.SY)
[9]  arXiv:1802.06564 (cross-list from cs.CC) [pdf, other]
Title: A 4-Approximation Algorithm for k-Prize Collecting Steiner Tree Problems
Comments: This article is under reviewing
Subjects: Computational Complexity (cs.CC); Discrete Mathematics (cs.DM); Optimization and Control (math.OC)
[10]  arXiv:1802.06511 (cross-list from cs.DS) [pdf, other]
Title: Reconfiguration of Colorable Sets in Classes of Perfect Graphs
Comments: 13 pages, 1 figure
Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM); Combinatorics (math.CO)
[11]  arXiv:1802.06204 (cross-list from cs.DS) [pdf, ps, other]
Title: Approximate Set Union Via Approximate Randomization
Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC); Computational Geometry (cs.CG); Discrete Mathematics (cs.DM)
[12]  arXiv:1802.06103 (cross-list from cs.CC) [pdf, other]
Title: Counting Homomorphisms to Trees Modulo a Prime
Subjects: Computational Complexity (cs.CC); Discrete Mathematics (cs.DM)

Mon, 19 Feb 2018

[13]  arXiv:1802.05974 [pdf, other]
Title: A Combinatorial Problem Arising From Ecology: the Maximum Empower Problem
Comments: 23 pages, 3 figures
Subjects: Discrete Mathematics (cs.DM); Populations and Evolution (q-bio.PE)
[14]  arXiv:1802.06026 (cross-list from cs.DS) [pdf, other]
Title: Parameterized Algorithms for Zero Extension and Metric Labelling Problems
Subjects: Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM)
[15]  arXiv:1802.06021 (cross-list from math.CO) [pdf, other]
Title: Gray codes and symmetric chains
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM)
[16]  arXiv:1802.05905 (cross-list from cs.CC) [pdf, ps, other]
Title: Changing times to optimise reachability in temporal graphs
Subjects: Computational Complexity (cs.CC); Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS)

Fri, 16 Feb 2018

[17]  arXiv:1802.05690 (cross-list from quant-ph) [pdf, ps, other]
Title: Learning DNFs under product distributions via μ-biased quantum Fourier sampling
Comments: 16 pages
Subjects: Quantum Physics (quant-ph); Discrete Mathematics (cs.DM); Learning (cs.LG)
[18]  arXiv:1802.05501 (cross-list from cs.DS) [pdf, other]
Title: Finding small-width connected path decompositions in polynomial time
Subjects: Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC); Discrete Mathematics (cs.DM)
[ total of 18 entries: 1-18 ]
[ showing up to 25 entries per page: fewer | more ]

Disable MathJax (What is MathJax?)