default search action
SIAM Journal on Discrete Mathematics, Volume 37
Volume 37, Number 1, March 2023
- Boris G. Pittel:
Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree. 1-16 - Andriy Prymak
:
A New Bound for Hadwiger's Covering Problem in \(\boldsymbol{\mathbb{E}}^3\). 17-24 - Anurag Bishnoi, Simona Boyadzhiyska
On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles. 25-50 - Debsoumya Chakraborti, Alan M. Frieze
Colorful Hamilton Cycles in Random Graphs. 51-64 - Daniele Bartoli, Martino Borello:
Small Strong Blocking Sets by Concatenation. 65-82 - Mario Huicochea:
A Kneser-Type Theorem for Restricted Sumsets. 83-93 - Lochlan Brick, Pu Gao, Angus Southwell:
The Threshold of Symmetry in Random Graphs with Specified Degree Sequences. 94-113 - Patrick Chan, Katherine Johnston, Joseph Lent, Alexander Ruys de Perez, Anne Shiu
Nondegenerate Neural Codes and Obstructions to Closed-Convexity. 114-145 - Mihyun Kang
The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes. 146-162 - Joseph Cheriyan, Robert Cummings, Jack Dippel
An Improved Approximation Algorithm for the Matching Augmentation Problem. 163-190 - Luis Montejano, Jorge L. Ramírez Alfonsín
Self-Dual Maps II: Links and Symmetry. 191-220 - Hong Wang, Yun Wang
Disjoint Cycles in a Digraph with Partial Degree. 221-232 - Svante Linusson, Petter Restadh
Greedy Causal Discovery Is Geometric. 233-252 - Siyan Liu, Rong-Xia Hao, Rong Luo, Cun-Quan Zhang
5-Cycle Double Covers, 4-Flows, and Catlin Reduction. 253-267 - Varun Sivashankar
Extremal Uniquely Resolvable Multisets. 268-278 - Kunal Dutta
On Induced Paths, Holes, and Trees in Random Graphs. 279-303 - Duksang Lee, Sang-il Oum
Intertwining Connectivities for Vertex-Minors and Pivot-Minors. 304-314 - Sabrina Lato:
A Spectral Moore Bound for Bipartite Semiregular Graphs. 315-331 - Valentin Bartier, Nicolas Bousquet, Carl Feghali, Marc Heinrich
Recoloring Planar Graphs of Girth at Least Five. 332-350 - Hiroshi Hirai
Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity. 351-378 - Noga Alon, Anna Gujgiczer, János Körner, Aleksa Milojevic, Gábor Simonyi:
Structured Codes of Graphs. 379-403
Volume 37, Number 2, June 2023
- Norbert Peyerimhoff, Marc Roth
Parameterized Counting and Cayley Graph Expanders. 405-486 - Alessio D'Alì
On the Gamma-Vector of Symmetric Edge Polytopes. 487-515 - Arjun Kodagehalli Ramachandra, Karthik Natarajan
Tight Probability Bounds with Pairwise Independence. 516-555 - Rajesh Chitnis
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs. 556-572 - Sammy Luo
On Connected Components with Many Edges. 573-585 - Dmitriy Kunisky:
The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant. 586-603 - Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron:
Strengthening a Theorem of Meyniel. 604-611 - Mahdi Cheraghchi
Simple Codes and Sparse Recovery with Fast Decoding. 612-631 - Marianne Akian
Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria. 632-674 - Sam Spiro
On t-Intersecting Hypergraphs with Minimum Positive Codegrees. 675-683 - Sarah Allred
Unavoidable Induced Subgraphs of Large 2-Connected Graphs. 684-698 - Zdenek Dvorák
On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs. 699-717 - Valeriya Kirova, Arsenii Sagdeev
Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions. 718-732 - Qinghong Zhao
Bonds Intersecting Long Paths in \(k\) -Connected Graphs. 733-747 - Kuan Cheng
Efficient Linear and Affine Codes for Correcting Insertions/Deletions. 748-778 - Panagiotis Kanellopoulos, Alexandros A. Voudouris, Rongsen Zhang:
On Discrete Truthful Heterogeneous Two-Facility Location. 779-799 - David G. Harris, Hsin-Hao Su, Hoa T. Vu:
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition. 800-830 - Emilia L. K. Blåsten
Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs. 831-863 - Gal Kronenberg, Adva Mond
\(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs. 864-916 - Naidan Ji, Dong Ye
The Number of Cliques in Graphs Covered by Long Cycles. 917-924 - Andrii Arman
Colorful Matchings. 925-950 - Boris Bukh
Planar Convex Codes are Decidable. 951-963 - Pierre Bergé
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts. 964-996 - Christoph Hertrich
Towards Lower Bounds on the Depth of ReLU Neural Networks. 997-1029 - Carme Àlvarez, Arnau Messegué Buisan
On the PoA Conjecture: Trees versus Biconnected Components. 1030-1052 - Chien-Chung Huang, Justin Ward:
FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective. 1053-1078 - Anina Gruica, Alberto Ravagnani, John Sheekey, Ferdinando Zullo
Rank-Metric Codes, Semifields, and the Average Critical Problem. 1079-1117 - Vladimir Boskovic
Saturation of Ordered Graphs. 1118-1141 - Gregory Z. Gutin, Anders Yeo
Lower Bounds for Maximum Weighted Cut. 1142-1161 - Linyuan Lu
Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs. 1162-1172 - József Balogh, Felix Christian Clemen, Bernard Lidický, Sergey Norin, Jan Volec
The Spectrum of Triangle-Free Graphs. 1173-1179 - Tao Zhang:
Fuglede's Conjecture Holds in \(\boldsymbol{\mathbb{Z}_{p}\times \mathbb{Z}_{p^{n}}}\). 1180-1197 - Frantisek Kardos, Jonathan Narboni, Reza Naserasr, Zhouningxin Wang
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs. 1198-1211 - Nick Brettell
Cyclic Matroids. 1212-1236 - Xiao-Chuan Liu
On the Turán Number of Generalized Theta Graphs. 1237-1251 - Carla Groenland
Decomposing Random Permutations into Order-Isomorphic Subpermutations. 1252-1261 - Yan Wang:
Balanced Subdivisions of a Large Clique in Graphs with High Average Degree. 1262-1274 - Michael A. Henning, Christian Löwenstein, Anders Yeo
The Tuza-Vestergaard Theorem. 1275-1310 - Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Matroid Intersection under Restricted Oracles. 1311-1330 - Charlotte Knierim, Anders Martinsson, Raphael Steiner:
Hat Guessing Numbers of Strongly Degenerate Graphs. 1331-1347 - Akiyoshi Tsuchiya:
Cayley Sums and Minkowski Sums of Lattice Polytopes. 1348-1357
Volume 37, Number 3, September 2023
- Yury Demidovich, Arkadiy Skorkin, Maksim Zhukovskii:
Cycle Saturation in Random Graphs. 1359-1385 - Marcelo Campos, Matthew Coulson, Oriol Serra, Maximilian Wötzel
The Typical Approximate Structure of Sets with Bounded Sumset. 1386-1418 - Tom Bohman, Emily Zhu:
On Multicolor Ramsey Numbers of Triple System Paths of Length 3. 1419-1435 - Rachel Kirsch
Many Cliques in Bounded-Degree Hypergraphs. 1436-1456 - Gergely Ambrus
Piercing the Chessboard. 1457-1471 - Samir Shukla
On Vietoris-Rips Complexes (with Scale 3) of Hypercube Graphs. 1472-1495 - Fabio Enrique Brochero Martínez, Abílio Lemos, Bhavinkumar Kishor Sinh Moriya, Sávio Ribas
The Main Zero-Sum Constants over \({\boldsymbol{D}}\) 2n \({\boldsymbol{\times C_2}}\). 1496-1508 - Jean Cardinal, Hung Phuc Hoang, Arturo Merino
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations. 1509-1547 - Yulai Ma, Davide Mattiolo, Eckhard Steffen
Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs. 1548-1565 - Jesper Nederlof
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. 1566-1586 - Dung M. Ha, Hieu T. Ngo
Expanders on Matrices over a Finite Chain Ring, II. 1587-1609 - Tyler Helmuth
Approximation Algorithms for the Random Field Ising Model. 1610-1629 - Braxton Osting
Extremal Graph Realizations and Graph Laplacian Eigenvalues. 1630-1644 - Xavier Allamigeon, Stéphane Gaubert
Tropical Complementarity Problems and Nash Equilibria. 1645-1665 - Yan Cao, Guantao Chen
On Gupta's Codensity Conjecture. 1666-1673 - Matthias Bentert, André Nichterlein
Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths. 1674-1703 - Ron Aharoni, Eli Berger, Maria Chudnovsky
Nonuniform Degrees and Rainbow Versions of the Caccetta-Häggkvist Conjecture. 1704-1714 - Joseph E. Bonin
The Excluded Minors for Three Classes of 2-Polymatroids Having Special Types of Natural Matroids. 1715-1737 - Yangyan Gu, Yiting Jiang
Refined List Version of Hadwiger's Conjecture. 1738-1750 - Joseph E. Bonin
The Natural Matroid of an Integer Polymatroid. 1751-1770 - Kristóf Bérczi, Erika R. Bérczi-Kovács, Evelin Szögi:
A Dual Approach for Dynamic Pricing in Multidemand Markets. 1771-1787 - Miao Fu
Lower Bounds on Lattice Covering Densities of Simplices. 1788-1804 - Tao Jiang, Sean Longbrake:
Tree-Degenerate Graphs and Nested Dependent Random Choice. 1805-1817 - Calum MacRury, Tomás Masarík
The Phase Transition of Discrepancy in Random Hypergraphs. 1818-1841 - Swee Hong Chan, Igor Pak, Greta Panova:
Effective Poset Inequalities. 1842-1880 - José Aliste-Prieto
Marked Graphs and the Chromatic Symmetric Function. 1881-1919 - Chong Shangguan
Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity. 1920-1929 - Jie Hu, Hao Li, Yue Wang, Donglei Yang:
Graph Tilings in Incompatibility Systems. 1930-1951 - Esme Bajo, Matthias Beck:
Boundary \({\boldsymbol{H^\ast}}\) -Polynomials of Rational Polytopes. 1952-1969 - Mingyang Guo, Hongliang Lu, Xing Peng:
Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs. 1970-1987 - Eimear Byrne
Tensor Codes and Their Invariants. 1988-2015 - Michael Skotnica, Martin Tancer:
NP-Hardness of Computing PL Geometric Category in Dimension 2. 2016-2029 - Jian Wang
Extremal Problem for Matchings and Rainbow Matchings on Direct Products. 2030-2048 - Wen-Horng Sheu
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples. 2049-2071 - Sam Adriaensen
A Note on Small Weight Codewords of Projective Geometric Codes and on the Smallest Sets of Even Type. 2072-2087 - Peter Dukes, Jonathan A. Noel
Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three. 2088-2125 - Farbod Shokrieh, Cameron Wright
On Torsor Structures on Spanning Trees. 2126-2147 - Aniruddha Biswas
Influence of a Set of Variables on a Boolean Function. 2148-2171 - David Schaller
Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees. 2172-2207 - Mario Kummer
Matroids on Eight Elements with the Half-Plane Property and Related Concepts. 2208-2227 - Sebastian M. Cioaba, Dheer Noal Desai, Michael Tait
A Spectral Erdős-Sós Theorem. 2228-2239
Volume 37, Number 4, December 2023
- Esther Galby, Liana Khazaliya, Fionn Mc Inerney
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. 2241-2264 - Dániel Gerbner:
The Profile Polytope of Nontrivial Intersecting Families. 2265-2275 - Matias Korman, André van Renssen
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon. 2276-2311 - Paul Jungeblut
A Sublinear Bound on the Page Number of Upward Planar Graphs. 2312-2331 - Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Combing a Linkage in an Annulus. 2332-2364 - Reza Naserasr, Weiqiang Yu:
Packing Signatures in Signed Graphs. 2365-2381 - Xin Ren
Gröbner Bases of Radical Li-Li Type Ideals Associated with Partitions. 2382-2396 - Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Extremal Problems for Hypergraph Blowups of Trees. 2397-2416 - Ahmad Abdi
On Packing Dijoins in Digraphs and Weighted Digraphs. 2417-2461 - Yongtao Li, Yuejian Peng:
Refinement on Spectral Turán's Theorem. 2462-2485 - Xiaolan Hu, Xing Peng:
The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs. 2486-2507 - Xiutao Zhu, Ervin Györi, Zhen He
Edges Not Covered by Monochromatic Bipartite Graph. 2508-2522 - Melissa M. Fuentes
The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings. 2523-2543 - Barnabás Janzer
Partial Shuffles by Lazy Swaps. 2544-2557 - Robert Brignall
A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width. 2558-2584 - Jérémie Chalopin
Sample Compression Schemes for Balls in Graphs. 2585-2616 - Amin Bahmanian
Symmetric Layer-Rainbow Colorations of Cubes. 2617-2625 - Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. 2626-2669 - Dror Chawin, Ishay Haviv
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank. 2670-2688 - Andrzej Grzesik, Daniel Il'kovic, Bartlomiej Kielak, Daniel Král':
Quasirandom-Forcing Orientations of Cycles. 2689-2716 - Noga Alon, Ehud Friedgut, Gil Kalai, Guy Kindler
The Success Probability in Levine's Hat Problem, and Independent Sets in Graphs. 2717-2729
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-14 21:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: