arXiv cs.DM Discrete Mathematics
@csdm-bot.bsky.social
Unofficial bot by @vele.bsky.social w/ http://github.com/so-okada/bXiv https://arxiv.org/list/cs.DM/new
List https://bsky.app/profile/vele.bsky.social/lists/3lim7ccweqo2j
ModList https://bsky.app/profile/vele.bsky.social/lists/3lim3qnexsw2g
List https://bsky.app/profile/vele.bsky.social/lists/3lim7ccweqo2j
ModList https://bsky.app/profile/vele.bsky.social/lists/3lim3qnexsw2g
Reposted by arXiv cs.DM Discrete Mathematics
Jean Cardinal, Micha Sharir: Implicit representations via the polynomial method https://arxiv.org/abs/2602.10922 https://arxiv.org/pdf/2602.10922 https://arxiv.org/html/2602.10922
February 12, 2026 at 6:29 AM
Jean Cardinal, Micha Sharir: Implicit representations via the polynomial method https://arxiv.org/abs/2602.10922 https://arxiv.org/pdf/2602.10922 https://arxiv.org/html/2602.10922
[2026-02-12 Thu (UTC), no new articles found for csDM Discrete Mathematics]
February 12, 2026 at 6:30 AM
[2026-02-12 Thu (UTC), no new articles found for csDM Discrete Mathematics]
Reposted by arXiv cs.DM Discrete Mathematics
T. R. Avila, Lars Rohwedder, Leo Wennmann: Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting https://arxiv.org/abs/2602.09948 https://arxiv.org/pdf/2602.09948 https://arxiv.org/html/2602.09948
February 11, 2026 at 6:37 AM
T. R. Avila, Lars Rohwedder, Leo Wennmann: Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting https://arxiv.org/abs/2602.09948 https://arxiv.org/pdf/2602.09948 https://arxiv.org/html/2602.09948
Reposted by arXiv cs.DM Discrete Mathematics
Logan Crew, Xinyue Fan, Hidde Koerts, Benjamin Moore, Sophie Spirkl: Characterizing Large Clique Number in Tournaments https://arxiv.org/abs/2602.09863 https://arxiv.org/pdf/2602.09863 https://arxiv.org/html/2602.09863
February 11, 2026 at 6:37 AM
Logan Crew, Xinyue Fan, Hidde Koerts, Benjamin Moore, Sophie Spirkl: Characterizing Large Clique Number in Tournaments https://arxiv.org/abs/2602.09863 https://arxiv.org/pdf/2602.09863 https://arxiv.org/html/2602.09863
Reposted by arXiv cs.DM Discrete Mathematics
Aryan Sanghi, Anubhav Dhar, Sudeshna Kolay: On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs https://arxiv.org/abs/2602.09585 https://arxiv.org/pdf/2602.09585 https://arxiv.org/html/2602.09585
February 11, 2026 at 6:37 AM
Aryan Sanghi, Anubhav Dhar, Sudeshna Kolay: On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs https://arxiv.org/abs/2602.09585 https://arxiv.org/pdf/2602.09585 https://arxiv.org/html/2602.09585
Reposted by arXiv cs.DM Discrete Mathematics
Alexey Barsukov, Santiago Guzm\'an-Pro: On the complexity of Sandwich Problems for $M$-partitions https://arxiv.org/abs/2602.09576 https://arxiv.org/pdf/2602.09576 https://arxiv.org/html/2602.09576
February 11, 2026 at 6:29 AM
Alexey Barsukov, Santiago Guzm\'an-Pro: On the complexity of Sandwich Problems for $M$-partitions https://arxiv.org/abs/2602.09576 https://arxiv.org/pdf/2602.09576 https://arxiv.org/html/2602.09576
[2026-02-11 Wed (UTC), no new articles found for csDM Discrete Mathematics]
February 11, 2026 at 6:30 AM
[2026-02-11 Wed (UTC), no new articles found for csDM Discrete Mathematics]
Reposted by arXiv cs.DM Discrete Mathematics
Ziyi Cai, D. D. Gao, Prasanna Ramakrishnan, Kangning Wang: Distortion of Metric Voting with Bounded Randomness https://arxiv.org/abs/2602.08871 https://arxiv.org/pdf/2602.08871 https://arxiv.org/html/2602.08871
February 10, 2026 at 6:32 AM
Ziyi Cai, D. D. Gao, Prasanna Ramakrishnan, Kangning Wang: Distortion of Metric Voting with Bounded Randomness https://arxiv.org/abs/2602.08871 https://arxiv.org/pdf/2602.08871 https://arxiv.org/html/2602.08871
Reposted by arXiv cs.DM Discrete Mathematics
Guillaume Aubian, Luis Kuffner: (Claw, C_3)-free digraphs with unbounded dichromatic number https://arxiv.org/abs/2602.08736 https://arxiv.org/pdf/2602.08736 https://arxiv.org/html/2602.08736
February 10, 2026 at 6:37 AM
Guillaume Aubian, Luis Kuffner: (Claw, C_3)-free digraphs with unbounded dichromatic number https://arxiv.org/abs/2602.08736 https://arxiv.org/pdf/2602.08736 https://arxiv.org/html/2602.08736
Reposted by arXiv cs.DM Discrete Mathematics
Moran Feldman, Justin Ward: Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy https://arxiv.org/abs/2602.08473 https://arxiv.org/pdf/2602.08473 https://arxiv.org/html/2602.08473
February 10, 2026 at 6:31 AM
Moran Feldman, Justin Ward: Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy https://arxiv.org/abs/2602.08473 https://arxiv.org/pdf/2602.08473 https://arxiv.org/html/2602.08473
Reposted by arXiv cs.DM Discrete Mathematics
Wojciech Gabryelski, Zbigniew Go{\l}\c{e}biewski, Martin P\'epin: Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs https://arxiv.org/abs/2602.08471 https://arxiv.org/pdf/2602.08471 https://arxiv.org/html/2602.08471
February 10, 2026 at 6:31 AM
Wojciech Gabryelski, Zbigniew Go{\l}\c{e}biewski, Martin P\'epin: Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs https://arxiv.org/abs/2602.08471 https://arxiv.org/pdf/2602.08471 https://arxiv.org/html/2602.08471
Reposted by arXiv cs.DM Discrete Mathematics
Pin-Hsian Lee, Te-Cheng Liu, Meng-Tsung Tsai: Determining the Outerthickness of Graphs Is NP-Hard https://arxiv.org/abs/2602.07607 https://arxiv.org/pdf/2602.07607 https://arxiv.org/html/2602.07607
February 10, 2026 at 6:29 AM
Pin-Hsian Lee, Te-Cheng Liu, Meng-Tsung Tsai: Determining the Outerthickness of Graphs Is NP-Hard https://arxiv.org/abs/2602.07607 https://arxiv.org/pdf/2602.07607 https://arxiv.org/html/2602.07607
Reposted by arXiv cs.DM Discrete Mathematics
Jan Dreier, Nikolas M\"ahlmann, Sebastian Siebertz: The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching https://arxiv.org/abs/2602.07606 https://arxiv.org/pdf/2602.07606 https://arxiv.org/html/2602.07606
February 10, 2026 at 6:29 AM
Jan Dreier, Nikolas M\"ahlmann, Sebastian Siebertz: The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching https://arxiv.org/abs/2602.07606 https://arxiv.org/pdf/2602.07606 https://arxiv.org/html/2602.07606
Reposted by arXiv cs.DM Discrete Mathematics
Johan W\"astlund: Moment generating functions in combinatorial optimization: Bipartite matching https://arxiv.org/abs/2602.07563 https://arxiv.org/pdf/2602.07563 https://arxiv.org/html/2602.07563
February 10, 2026 at 6:40 AM
Johan W\"astlund: Moment generating functions in combinatorial optimization: Bipartite matching https://arxiv.org/abs/2602.07563 https://arxiv.org/pdf/2602.07563 https://arxiv.org/html/2602.07563
Reposted by arXiv cs.DM Discrete Mathematics
Pavel Pat\'ak, Zuzana Pat\'akov\'a: Helly-type problems from a topological perspective https://arxiv.org/abs/2602.07552 https://arxiv.org/pdf/2602.07552 https://arxiv.org/html/2602.07552
February 10, 2026 at 6:29 AM
Pavel Pat\'ak, Zuzana Pat\'akov\'a: Helly-type problems from a topological perspective https://arxiv.org/abs/2602.07552 https://arxiv.org/pdf/2602.07552 https://arxiv.org/html/2602.07552
Reposted by arXiv cs.DM Discrete Mathematics
Prosenjit Bose, Louis Esperet, J\k{e}drzej Hodor, Gwena\"el Joret, Piotr Micek, Cl\'ement Rambaud: Cops and robber in graphs with bounded vertex cover number https://arxiv.org/abs/2602.07435 https://arxiv.org/pdf/2602.07435 https://arxiv.org/html/2602.07435
February 10, 2026 at 6:37 AM
Prosenjit Bose, Louis Esperet, J\k{e}drzej Hodor, Gwena\"el Joret, Piotr Micek, Cl\'ement Rambaud: Cops and robber in graphs with bounded vertex cover number https://arxiv.org/abs/2602.07435 https://arxiv.org/pdf/2602.07435 https://arxiv.org/html/2602.07435
Reposted by arXiv cs.DM Discrete Mathematics
Srinwanti Debgupta, Sarah Morell, Martin Skutella: Unsplittable Transshipments https://arxiv.org/abs/2602.07230 https://arxiv.org/pdf/2602.07230 https://arxiv.org/html/2602.07230
February 10, 2026 at 6:31 AM
Srinwanti Debgupta, Sarah Morell, Martin Skutella: Unsplittable Transshipments https://arxiv.org/abs/2602.07230 https://arxiv.org/pdf/2602.07230 https://arxiv.org/html/2602.07230
Sk Samim Islam: Multipacking on graphs and Euclidean metric space https://arxiv.org/abs/2602.07927 https://arxiv.org/pdf/2602.07927 https://arxiv.org/html/2602.07927
February 10, 2026 at 6:31 AM
Sk Samim Islam: Multipacking on graphs and Euclidean metric space https://arxiv.org/abs/2602.07927 https://arxiv.org/pdf/2602.07927 https://arxiv.org/html/2602.07927
[2026-02-10 Tue (UTC), 1 new article found for csDM Discrete Mathematics]
February 10, 2026 at 6:30 AM
[2026-02-10 Tue (UTC), 1 new article found for csDM Discrete Mathematics]
Reposted by arXiv cs.DM Discrete Mathematics
Sam Spiro: Metric Dimensions of March Madness Brackets https://arxiv.org/abs/2602.06950 https://arxiv.org/pdf/2602.06950 https://arxiv.org/html/2602.06950
February 9, 2026 at 6:37 AM
Sam Spiro: Metric Dimensions of March Madness Brackets https://arxiv.org/abs/2602.06950 https://arxiv.org/pdf/2602.06950 https://arxiv.org/html/2602.06950
Reposted by arXiv cs.DM Discrete Mathematics
Maria Chudnovsky, Ilya Maier: Induced Cycles of Many Lengths https://arxiv.org/abs/2602.06874 https://arxiv.org/pdf/2602.06874 https://arxiv.org/html/2602.06874
February 9, 2026 at 6:37 AM
Maria Chudnovsky, Ilya Maier: Induced Cycles of Many Lengths https://arxiv.org/abs/2602.06874 https://arxiv.org/pdf/2602.06874 https://arxiv.org/html/2602.06874
Reposted by arXiv cs.DM Discrete Mathematics
Keita Ishizuka: Almost All Vectorial Functions Have No Extended-Affine Symmetries https://arxiv.org/abs/2602.06668 https://arxiv.org/pdf/2602.06668 https://arxiv.org/html/2602.06668
February 9, 2026 at 6:37 AM
Keita Ishizuka: Almost All Vectorial Functions Have No Extended-Affine Symmetries https://arxiv.org/abs/2602.06668 https://arxiv.org/pdf/2602.06668 https://arxiv.org/html/2602.06668
Reposted by arXiv cs.DM Discrete Mathematics
Maximilian Gorsky, Evangelos Protopapas, Sebastian Wiederrecht: Quickly excluding an annotated graph https://arxiv.org/abs/2602.06516 https://arxiv.org/pdf/2602.06516 https://arxiv.org/html/2602.06516
February 9, 2026 at 6:37 AM
Maximilian Gorsky, Evangelos Protopapas, Sebastian Wiederrecht: Quickly excluding an annotated graph https://arxiv.org/abs/2602.06516 https://arxiv.org/pdf/2602.06516 https://arxiv.org/html/2602.06516
Reposted by arXiv cs.DM Discrete Mathematics
Danny Hermelin, Dvir Shabtay: Fast Makespan Minimization via Short ILPs https://arxiv.org/abs/2602.06514 https://arxiv.org/pdf/2602.06514 https://arxiv.org/html/2602.06514
February 9, 2026 at 6:31 AM
Danny Hermelin, Dvir Shabtay: Fast Makespan Minimization via Short ILPs https://arxiv.org/abs/2602.06514 https://arxiv.org/pdf/2602.06514 https://arxiv.org/html/2602.06514
[2026-02-09 Mon (UTC), no new articles found for csDM Discrete Mathematics]
February 9, 2026 at 6:30 AM
[2026-02-09 Mon (UTC), no new articles found for csDM Discrete Mathematics]