default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 38
Volume 38, Number 1, March 2024
- Joseph Paat
, Ingo Stallknecht, Zach Walsh, Luze Xu:
On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices. 1-18 - Tony Huynh, O-joung Kwon:
On the Erdős-Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs. 19-42 - Raphael Yuster:
Packing and Covering a Given Directed Graph in a Directed Graph. 43-54 - Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta, Jonathan Rollin:
Ramsey Equivalence for Asymmetric Pairs of Graphs. 55-74 - Eva Fluck:
Tangles and Hierarchical Clustering. 75-92 - Abdulmajeed Alqasem, Heshan Aravinda, Arnaud Marsiglietti, James Melbourne:
On a Conjecture of Feige for Discrete Log-Concave Distributions. 93-102 - Dmitriy Kunisky, Cristopher Moore:
The Spectrum of the Grigoriev-Laurent Pseudomoments. 103-131 - Kristóf Bérczi, Tamás Schwarcz:
Exchange Distance of Basis Pairs in Split Matroids. 132-147 - Martin Hoefer, Kevin Schewior, Daniel Schmand:
Stochastic Probing with Increasing Precision. 148-169 - Eun Jung Kim, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström:
On Weighted Graph Separation Problems and Flow Augmentation. 170-189 - Mikhael Carmona, Victor Chepoi, Guyslain Naves, Pascal Préa:
Modules in Robinson Spaces. 190-224 - Domagoj Bradac, Lior Gishboliner, Benny Sudakov:
On Ramsey Size-Linear Graphs and Related Questions. 225-242 - Tung H. Nguyen:
Highly Connected Subgraphs with Large Chromatic Number. 243-260 - Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev:
The Treewidth and Pathwidth of Graph Unions. 261-276 - Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko:
Geometric Network Creation Games. 277-315 - Hao Chen, Jie Ma:
A Property on Monochromatic Copies of Graphs Containing a Triangle. 316-326 - Yann Disser, David Weckbecker:
Unified Greedy Approximability beyond Submodular Maximization. 348-379 - Steven Kelk, Ruben Meuwese, Stephan Wagner:
Convex Characters, Algorithms, and Matchings. 380-411 - Yuval Filmus, Idan Mehalel:
Optimal Sets of Questions for Twenty Questions. 412-452 - Daniel Neuen:
Isomorphism Testing Parameterized by Genus and Beyond. 453-484 - Steffen Borgwardt, Weston Grewe, Jon Lee:
On the Combinatorial Diameters of Parallel and Series Connections. 485-503 - Dimitrios Los, Thomas Sauerwald, John Sylvester:
The Power of Filling in Balanced Allocations. 529-565 - Michel Habib, Lalla Mouatadid, Éric Sopena, Mengchuan Zou:
\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs. 566-589 - Lele Liu:
Graph Limits and Spectral Extremal Problems for Graphs. 590-608 - Maria Axenovich, Hanno Lefmann:
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations. 609-628 - Sebastian Babinski, Andrzej Grzesik:
Graphs without a Rainbow Path of Length 3. 629-644 - Alex D. Scott, Paul D. Seymour, Sophie Theresa Spirkl:
Pure Pairs. IX. Transversal Trees. 645-667 - Brendan Nagle, John Theado:
Some Cubic Time Regularity Algorithms for Triple Systems. 668-701 - Sarah Miracle, Amanda Pascoe Streib:
Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations. 702-725 - Rad Niazadeh, Renato Paes Leme, Jon Schneider:
Bernoulli Factories for Flow-Based Polytopes. 726-742 - James Cruickshank, Fatemeh Mohammadi, Harshit J. Motwani, Anthony Nixon, Shin-ichi Tanigawa:
Global Rigidity of Line Constrained Frameworks. 743-763 - Yann Disser, Max Klimm, Annette Lutz, David Weckbecker:
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows. 764-789 - Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma:
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. 790-827 - Pavol Hell, Jing Huang, Jephian C.-H. Lin:
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices. 828-844 - Noga Alon, Emil Powierski, Michael Savery, Alex D. Scott, Elizabeth Wilmer:
Invertibility of Digraphs and Tournaments. 327-347 - Nicolas Bousquet, Quentin Deschamps, Lucas de Meyer, Théo Pierron:
Square Coloring Planar Graphs with Automatic Discharging. 504-528 - Maria Chudnovsky, Sergey Norin, Paul D. Seymour, Jérémie Turcotte:
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs. 845-856 - Marcin Brianski, Gwenaël Joret, Michal T. Seweryn:
Pathwidth Versus Cocircumference. 857-866 - Deepak Bal, Alan M. Frieze, Pawel Pralat:
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\). 867-882 - Joshua Brakensiek, Sami Davies:
Robust Factorizations and Colorings of Tensor Graphs. 883-916 - Yen-Jen Cheng, Sen-Peng Eu, Tung-Shan Fu, Jyun-Cheng Yao:
On \({\boldsymbol q}\)-Counting of Noncrossing Chains and Parking Functions. 917-946 - Catherine Babecki, David Shiroma:
Eigenpolytope Universality and Graphical Designs. 947-964 - Robert Hickingbotham, Freddie Illingworth, Bojan Mohar, David R. Wood:
Treewidth, Circle Graphs, and Circular Drawings. 965-987 - Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski:
On the Concentration of the Maximum Degree in the Duplication-Divergence Models. 988-1006 - Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros A. Voudouris:
Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond. 1007-1029 - Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth:
Online Spanners in Metric Spaces. 1030-1056 - Robert Hickingbotham, David R. Wood:
Shallow Minors, Graph Products, and Beyond-Planar Graphs. 1057-1089 - Debsoumya Chakraborti, Kevin Hendrey, Ben Lund, Casey Tompkins:
Rainbow Saturation for Complete Graphs. 1090-1112 - Pakawut Jiradilok, Supanat Kamtue:
Transportation Distance between Probability Measures on the Infinite Regular Tree. 1113-1157 - Sepehr Hajebi, Yanjia Li, Sophie Spirkl:
List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraph. 1158-1190 - Benjamin Bergougnoux, Mamadou Moustapha Kanté:
Erratum: More Applications of the \(d\)-Neighbor Equivalence: Acyclicity and Connectivity Constraints. 1191-1192
Volume 38, Number 2, 2024
- Bryce Frederickson, Lukas Michel:
Circuit Decompositions of Binary Matroids. 1193-1201 - Telikepalli Kavitha:
Maximum Matchings and Popularity. 1202-1221 - Lily Li, Aleksandar Nikolov:
On the Gap Between Hereditary Discrepancy and the Determinant Lower Bound. 1222-1238 - Natalie C. Behague, Tom Johnston, Shoham Letzter, Natasha Morrison, Shannon Ogden:
The Rainbow Saturation Number Is Linear. 1239-1249 - Kenta Noguchi:
Spanning Bipartite Quadrangulations of Triangulations of the Projective Plane. 1250-1268 - Zichao Dong, Zijian Xu:
Rainbow Even Cycles. 1269-1284 - John Fernley:
Discursive Voter Models on the Supercritical Scale-Free Network. 1285-1314 - Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma:
An Algorithmic Framework for Locally Constrained Homomorphisms. 1315-1350 - Maria Dascalu, Annie Raymond:
Tropicalizing the Graph Profile of Some Almost-Stars. 1351-1368 - Patrick Bennett, Alan M. Frieze:
On the Chromatic Number of Random Regular Hypergraphs. 1369-1380 - Noga Alon, Dor Elboim, János Pach, Gábor Tardos:
Random Necklaces Require Fewer Cuts. 1381-1408 - Anqi Li, Lisa Sauermann:
Sárközy's Theorem in Various Finite Field Settings. 1409-1416 - Kristóf Bérczi, Endre Boros, Kazuhisa Makino:
Hypergraph Horn Functions. 1417-1437 - Sandra Albrechtsen, Tony Huynh, Raphael W. Jacobs, Paul Knappe, Paul Wollan:
A Menger-Type Theorem for Two Induced Paths. 1438-1450 - Stijn Cambie, Penny Haxell, Ross J. Kang, Ronen Wdowinski:
A Precise Condition for Independent Transversals in Bipartite Covers. 1451-1461 - Ivailo Hartarsky, Lyuben Lichev:
The Maximal Running Time of Hypergraph Bootstrap Percolation. 1462-1471 - Florian Hörsch, Tomás Kaiser, Matthias Kriesell:
Rainbow Bases in Matroids. 1472-1491 - Umberto De Ambroggio:
A Simple Path to Component Sizes in Critical Random Graphs. 1492-1525 - Xiangying Chen:
An Axiomatization of Matroids and Oriented Matroids as Conditional Independence Models. 1526-1536 - Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff:
Bounding and Computing Obstacle Numbers of Graphs. 1537-1565 - Kolja Knauer, William T. Trotter:
Concepts of Dimension for Convex Geometries. 1566-1585 - Leonardo Nagami Coregliano:
Left-Cut-Percolation and Induced-Sidorenko Bigraphs. 1586-1629 - Margaret Bayer, Mark Denker, Marija Jelic Milutinovic, Rowan Rowlands, Sheila Sundaram, Lei Xue:
Topology of Cut Complexes of Graphs. 1630-1675 - Kazuhiro Nomoto, Jorn G. van der Pol:
Tuza's Conjecture for Binary Geometries. 1676-1685 - Bernardo M. Ábrego, Julia Kinzel, Silvia Fernández-Merchant, Evgeniya Lagoda, Yakov Sapozhnikov:
On Book Crossing Numbers of the Complete Graph. 1686-1700 - Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis, Imrich Vrto:
Which is the Worst-Case Nash Equilibrium? 1701-1732 - Sijie Ren, Jian Wang, Shipeng Wang, Weihua Yang:
A Stability Result for \(\boldsymbol{C}_{\boldsymbol{2k+1}}\)-Free Graphs. 1733-1756 - Jie Ma, Long-Tu Yuan:
A Stability Result of the Pósa Lemma. 1757-1783 - Herbert Edelsbrunner, Alexey Garber, Mohadese Ghafari, Teresa Heiss, Morteza Saghafian, Mathijs Wintraecken:
Brillouin Zones of Integer Lattices and Their Perturbations. 1784-1807 - Igor Araujo, Simón Piga, Andrew Treglown, Zimu Xiang:
Tiling Edge-Ordered Graphs with Monotone Paths and Other Structures. 1808-1839 - Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca:
On Graphs Coverable by k Shortest Paths. 1840-1862 - Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud:
On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs. 1863-1901 - Bo Bai, Yu Gao, Jie Ma, Yuze Wu:
Phase Transitions of Structured Codes of Graphs. 1902-1914 - Jin Guo, Alexander L. Gavrilyuk, Ilia Ponomarenko:
On the Weisfeiler-Leman Dimension of Permutation Graphs. 1915-1929 - Federico Ardila-Mantilla, Christopher Eur, Raul Penaguiao:
The Tropical Critical Points of an Affine Matroid. 1930-1942 - Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller:
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. 1943-2000 - Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths, Pasin Manurangsi, Daniel Reichman, Igor Shinkar, Tal Wagner:
Erratum: Multitasking Capacity: Hardness Results and Improved Constructions. 2001-2003
Volume 38, Number 3, 2024
- Dániel Garamvölgyi, Tibor Jordán:
Partial Reflections and Globally Linked Pairs in Rigid Graphs. 2005-2040 - Víctor Dalmau, Andrei A. Krokhin, Jakub Oprsal:
Functors on Relational Structures Which Admit Both Left and Right Adjoints. 2041-2068 - Benedikt M. Plank, Kevin Schewior:
Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios. 2069-2088 - Bryan Park, Jan Vondrák:
A Simple Proof of the Nonuniform Kahn-Kalai Conjecture. 2089-2094 - Marc Distel, Vida Dujmovic, David Eppstein, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, Michal T. Seweryn, David R. Wood:
Product Structure Extension of the Alon-Seymour-Thomas Theorem. 2095-2107 - Julian Romero, Levent Tunçel:
Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz. 2108-2131 - Xinyu Hu, Qizhong Lin:
Two-Colored Ramsey-Turán Densities Involving Triangles. 2132-2162 - Bryce Kerr, Ali Mohammadi, Igor E. Shparlinski:
Additive Energy of Polynomial Images. 2163-2180 - Louis Esperet, Nathaniel Harms, Viktor Zamaraev:
Optimal Adjacency Labels for Subgraphs of Cartesian Products. 2181-2193 - Elena S. Hafner, Karola Mészáros, Linus Setiabrata, Avery St. Dizier:
M-Convexity of Vexillary Grothendieck Polynomials via Bubbling. 2194-2225 - Gergely Kál Csáji, Tamás Király, Yu Yokoi:
Solving the Maximum Popular Matching Problem with Matroid Constraints. 2226-2242 - Radel Ben-Av, Xuemei Chen, Assaf Goldberger, Shujie Kang, Kasso A. Okoudjou:
Phase Transitions for the Minimizers of the \(p\)-Frame Potentials in \(\mathbb{R}^{2}\). 2243-2259 - Abdul Basit, David J. Galvin:
Generalized Tuza's Conjecture for Random Hypergraphs. 2260-2288 - Camille Lanuel, Francis Lazarus, Rudi Pendavingh:
A Linear Bound for the Colin de Verdière Parameter \(\boldsymbol{\mu }\) for Graphs Embedded on Surfaces. 2289-2296 - József Balogh, Anita Liebenau, Letícia Mattos, Natasha Morrison:
On Multicolor Turán Numbers. 2297-2311 - David Gamarnik, Mihyun Kang, Pawel Pralat:
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process. 2312-2334 - Natalie C. Behague, Natasha Morrison, Jonathan A. Noel:
Off-Diagonal Commonality of Graphs via Entropy. 2335-2360 - Tolson Bell, Alan M. Frieze, Trent G. Marbach:
Rainbow Thresholds. 2361-2369 - Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Bounds on Maximum Weight Directed Cut. 2370-2391 - Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon:
Search-Space Reduction via Essential Vertices. 2392-2415 - Csongor Beke, Oliver Janzer:
On the Generalized Turán Problem for Odd Cycles. 2416-2428 - Jialei Song, Changhong Lu, Long-Tu Yuan:
On the Turán Number of Edge Blow-Ups of Cliques. 2429-2446 - Maryam Abdi, Ebrahim Ghorbani:
Graphs of Degree at Least \({3}\) with Minimum Algebraic Connectivity. 2447-2467 - Stepan Vakhrushev, Maksim Zhukovskii:
Maximum Number of Symmetric Extensions in Random Graphs. 2468-2488 - Ming Chen, Jie Han, Yantao Tang, Donglei Yang:
On Powers of Hamilton Cycles in Ramsey-Turán Theory. 2489-2508 - Caelan Atamanchuk, Luc Devroye, Massimo Vicenzo:
An Algorithm to Recover Shredded Random Matrices. 2509-2529 - Ali Khezeli:
An Improved Lower Bound on the Largest Common Subtree of Random Leaf-Labeled Binary Trees. 2530-2541
Volume 38, Number 4, 2024
- József Balogh, Andrew Treglown, Camila Zárate-Guerén:
A Note on Color-Bias Perfect Matchings in Hypergraphs. 2543-2552 - Katharina T. Huber, Vincent Moulton, Guillaume E. Scholz:
Shared Ancestry Graphs and Symbolic Arboreal Maps. 2553-2577 - Stefano Lia, Giovanni Longobardi, Giuseppe Marino, Rocco Trombetti:
Short Rank-Metric Codes and Scattered Subspaces. 2578-2598 - Konstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria E. Vretta:
Decomposition of Quaternary Signed-Graphic Matroids. 2599-2642 - Antoine Deza, Shmuel Onn, Sebastian Pokutta, Lionel Pournin:
Kissing Polytopes. 2643-2664 - Olga Polverino, Paolo Santonastaso, Ferdinando Zullo:
Maximum Weight Codewords of a Linear Rank-Metric Code. 2665-2690 - Kyungduk Moon, Kangbok Lee, Loïc Paulevé:
Computational Complexity of Minimal Trap Spaces in Boolean Networks. 2691-2708 - António Girão, Freddie Illingworth, Lukas Michel, Emil Powierski, Alex D. Scott:
Reconstructing a Point Set from a Random Subset of Its Pairwise Distances. 2709-2720 - Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Longest Cycle above Erdős-Gallai Bound. 2721-2749 - Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Andrés Herrera-Poyatos, Nitya Mani, Ankur Moitra:
Fast Sampling of Satisfying Assignments from Random \(\boldsymbol{k}\)-SAT with Applications to Connectivity. 2750-2811 - Georgios Amanatidis, Pieter Kleer:
Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals. 2812-2840 - Yin Chen, Runxuan Zhang:
Shape Enumerators of Self-Dual NRT Codes over Finite Fields. 2841-2854 - Cesar Ceballos, Viviane Pons:
The \(s\)-Weak Order and \(s\)-Permutahedra I: Combinatorics and Lattice Structure. 2855-2895 - Dániel Gerbner:
The Turán Number of Berge Book Hypergraphs. 2896-2912 - James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Extending Dekking's Construction of an Infinite Binary Word Avoiding Abelian 4-Powers. 2913-2925 - Alexandr Grebennikov, Xenia Isaeva, Andrei Malyutin, Mikhail Mikhailov, Oleg R. Musin:
Logarithmic Algorithms for Fair Division Problems. 2926-2939 - Heide Gluesing-Luerssen, Benjamin Jany:
Decompositions of \(q\)-Matroids Using Cyclic Flats. 2940-2970 - Andrew Suk, Ji Zeng:
On Cliques in Three-Dimensional Dense Point-Line Arrangements. 2971-2981 - Volker Kaibel, Kirill Kukharenko:
Rock Extensions with Linear Diameters. 2982-3003 - Daniel W. Cranston, Chun-Hung Liu:
Proper Conflict-Free Coloring of Graphs with Large Maximum Degree. 3004-3027 - Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira:
Trimming Forests Is Hard (Unless They Are Made of Stars). 3028-3042 - Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii:
On Isomorphism-Invariant Antistochastic Properties of Random Graphs. 3043-3078 - Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma:
On the Parameterized Complexity of Deletion to \(\boldsymbol{\mathcal{H}}\)-Free Strong Components. 3079-3110 - Felix Klingelhöfer, Alantha Newman:
Coloring Tournaments with Few Colors: Algorithms and Complexity. 3111-3133 - Yangyang Cheng, Peter Keevash:
On the Length of Directed Paths in Digraphs. 3134-3139 - Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Masaríková, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza:
Taming Graphs with No Large Creatures and Skinny Ladders. 3140-3149 - Grzegorz Adamski, Malgorzata Bednarska-Bzdega, Václav Blazej:
Online Ramsey Numbers: Long versus Short Cycles. 3150-3175 - Ruiwen Dong:
Semigroup Intersection Problems in the Heisenberg Groups. 3176-3197 - Karthekeyan Chandrasekaran, Weihang Wang:
Approximating Submodular \({k}\)-Partition via Principal Partition Sequence. 3198-3219 - Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood:
Corrigendum: Orthogonal Tree-Decompositions of Graphs. 3220-3221
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 2026-02-08 22:57 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:
