Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 36
Volume 36, Number 1, March 2022
- Nikolaos Fountoulakis, Felix Joos
, Guillem Perarnau:
Percolation on Random Graphs with a Fixed Degree Sequence. 1-46 - Ajani De Vas Gunasekara, Daniel Horsley:
An Evans-Style Result for Block Designs. 47-63 - Manuel Lafond, Binhai Zhu, Peng Zou:
Computing the Tandem Duplication Distance is NP-Hard. 64-91 - Anthony Harrison, Jenya Soprunova, Patrick E. Tierney:
Lattice Size of Plane Convex Bodies. 92-102 - Jiaxi Nie, Jacques Verstraëte:
Ramsey Numbers for Nontrivial Berge Cycles. 103-113 - Michal Lason, Mateusz Michalek:
A Note on Seminormality of Cut Polytopes. 114-117 - Georgios Amanatidis, Pieter Kleer:
Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices. 118-146 - Pedro Araújo, Simón Piga, Mathias Schacht:
Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs. 147-169 - Alex Scott, Paul D. Seymour, Sophie Spirkl:
Pure Pairs VI: Excluding an Ordered Tree. 170-187 - Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers:
Understanding Popular Matchings via Stable Matchings. 188-213 - Martin Balko, Máté Vizer:
On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs. 214-228 - Zichao Dong, Zhuo Wu:
On the Stability of the Graph Independence Number. 229-240 - Zequn Lv, Mei Lu, Yi Zhang:
Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs. 241-251 - Sandra Kiefer, Daniel Neuen:
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. 252-298 - David J. Aldous:
On the Largest Common Subtree of Random Leaf-Labeled Binary Trees. 299-314 - Vsevolod F. Lev:
Small Doubling in Groups with Moderate Torsion. 315-335 - Magnus Bordewich, Simone Linz, Megan Owen, Katherine St. John, Charles Semple, Kristina Wicke:
On the Maximum Agreement Subtree Conjecture for Balanced Trees. 336-354 - Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi Yoshida:
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model. 355-382 - Marta Panizzut, Magnus Dehli Vigeland:
Tropical Lines on Cubic Surfaces. 383-410 - Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos:
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. 411-435 - Barnabás Janzer:
The Generalized Rainbow Turán Problem for Cycles. 436-448 - Hongyi Jiang, Amitabh Basu:
Enumerating Integer Points in Polytopes with Bounded Subdeterminants. 449-460 - Gianira N. Alfarano, Martino Borello, Alessandro Neri, Alberto Ravagnani:
Three Combinatorial Perspectives on Minimal Codes. 461-489 - Guillermo Pineda-Villavicencio, Benjamin Schröter:
Reconstructibility of Matroid Polytopes. 490-508 - Victor Chepoi, Kolja Knauer, Manon Philibert:
Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids. 509-535 - Pavel Dvorák, Dusan Knop, Tomás Toufar:
Target Set Selection in Dense Graph Classes. 536-572 - Paul Balister, Emil Powierski, Alex D. Scott, Jane Tan:
A Note on Infinite Antichain Density. 573-577 - Jørgen Bang-Jensen, Thomas Schweser, Michael Stiebitz:
Digraphs and Variable Degeneracy. 578-595 - Sushmita Gupta, Saket Saurabh, Meirav Zehavi:
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization). 596-681 - Caitlyn Booms-Peot, Daniel Erman, Jay Yang:
Characteristic Dependence of Syzygies of Random Monomial Ideals. 682-701 - Kenjiro Takazawa:
Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids. 702-727 - Yahav Alon, Michael Krivelevich:
Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs. 728-754 - Carol T. Zamfirescu:
Regular Graphs with Few Longest Cycles. 755-776 - Jérémy Lavollée, Konrad J. Swanepoel:
Bounding the Number of Edges of Matchstick Graphs. 777-785 - Zilong Yan, Yuejian Peng:
An Irrational Lagrangian Density of a Single Hypergraph. 786-822 - Nicolas Bitar, Eric Goles, Pedro Montealegre:
Computational Complexity of Biased Diffusion-Limited Aggregation. 823-866
Volume 36, Number 2, June 2022
- Karl Däubel:
An Improved Upper Bound for the Ring Loading Problem. 867-887 - M. Levent Dogan, Alperen Ali Ergür, Jake D. Mundo, Elias P. Tsigaridas:
The Multivariate Schwartz-Zippel Lemma. 888-910 - Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs. 911-921 - Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Constant Congestion Brambles in Directed Graphs. 922-938 - Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang:
Maximizing Line Subgraphs of Diameter at Most t. 939-950 - Grigory Ivanov, Márton Naszódi:
A Quantitative Helly-Type Theorem: Containment in a Homothet. 951-957 - Esther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl:
Counting and Cutting Rich Lenses in Arrangements of Circles. 958-974 - Thomas Kahle, Dinh Van Le, Tim Römer:
Invariant Chains in Algebra and Discrete Geometry. 975-999 - Guorong Gao, An Chang, Yuan Hou:
Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$. 1000-1011 - Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Clean Clutters and Dyadic Fractional Packings. 1012-1037 - Candida Bowtell, Joseph Hyde:
A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs. 1038-1063 - Igor E. Shparlinski:
Multiplicative Properties of Hilbert Cubes. 1064-1070 - Anup Rao, Amir Yehudayoff:
Anticoncentration and the Exact Gap-Hamming Problem. 1071-1092 - Tongseok Lim, Robert J. McCann:
On the Cardinality of Sets in $R^d$ Obeying a Slightly Obtuse Angle Bound. 1093-1101 - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. 1102-1123 - Ewan Davies, Freddie Illingworth:
The $\chi$-Ramsey Problem for Triangle-Free Graphs. 1124-1134 - Péter Pál Pach, Richárd Palincza:
Sets Avoiding Six-Term Arithmetic Progressions in $\mathbb{Z}_6^{n}$ are Exponentially Small. 1135-1142 - Maria Elisa Fernandes, Claudio Alexandre Piedade:
The Degrees of Regular Polytopes of Type [4, 4, 4]. 1143-1155 - Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, Warut Suksompong:
The Price of Connectivity in Fair Division. 1156-1186 - Oliver Janzer, Abhishek Methuku, Zoltán Lóránt Nagy:
On the Turán Number of the Blow-Up of the Hexagon. 1187-1199 - Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj:
On Covering Segments with Unit Intervals. 1200-1230 - James G. Oxley, Zach Walsh:
2-Modular Matrices. 1231-1248 - Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon:
On Hop-Constrained Steiner Trees in Tree-Like Metrics. 1249-1273 - Pu Gao, Calum MacRury, Pawel Pralat:
Perfect Matchings in the Semirandom Graph Process. 1274-1290 - Michaela Coleman, Anton Dochtermann, Nathan Geist, Suho Oh:
Completing and Extending Shellings of Vertex Decomposable Complexes. 1291-1305 - Amin Coja-Oghlan, Philipp Loick, Balázs F. Mezei, Gregory B. Sorkin:
The Ising Antiferromagnet and Max Cut on Random Regular Graphs. 1306-1342 - Raphael Steiner:
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree. 1343-1362 - Viresh Patel, Fabian Stroh:
A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs. 1363-1393 - Tuan A. Do, Joshua Erde, Mihyun Kang:
Planarity and Genus of Sparse Random Bipartite Graphs. 1394-1415 - Peter Bradshaw, Tomás Masarík, Jana Novotná, Ladislav Stacho:
Robust Connectivity of Graphs on Surfaces. 1416-1435 - S. Rasoul Etesami:
Online Assortment and Market Segmentation under Bertrand Competition with Set-Dependent Revenues. 1436-1466 - Naoyuki Kamiyama:
A Matroid Generalization of the Super-Stable Matching Problem. 1467-1482 - József Balogh, Ryan R. Martin, Dániel T. Nagy, Balázs Patkós:
On Generalized Turán Results in Height Two Posets. 1483-1495 - On-Hei Solomon Lo, Jianguo Qian:
Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators. 1496-1501
Volume 36, Number 3, September 2022
- Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta:
Minimal Ramsey Graphs with Many Vertices of Small Degree. 1503-1528 - Michael Elkin, Ofer Neiman:
Lossless Prioritized Embeddings. 1529-1550 - Luis Montejano, Jorge L. Ramírez Alfonsín, Iván Rasskin:
Self-Dual Maps I: Antipodality. 1551-1566 - Guyslain Naves, F. Bruce Shepherd:
When Do Gomory-Hu Subtrees Exist? 1567-1585 - Vincent Moulton, Taoyang Wu:
Posets and Spaces of $k$-Noncrossing RNA Structures. 1586-1611 - Yahav Alon, Michael Krivelevich, Peleg Michaeli:
Spanning Trees at the Connectivity Threshold. 1612-1626 - Rong Chen:
The 9-Connected Excluded Minors for the Class of Quasi-graphic Matroids. 1627-1644 - Hongliang Lu, Yan Wang, Xingxing Yu:
Rainbow Perfect Matchings for 4-Uniform Hypergraphs. 1645-1662 - Ian M. Wanless, David R. Wood:
A General Framework for Hypergraph Coloring. 1663-1677 - Adam Blumenthal, Bernard Lidický, Ryan R. Martin, Sergey Norin, Florian Pfender, Jan Volec:
Counterexamples to a Conjecture of Harris on Hall Ratio. 1678-1686 - Alan M. Frieze, Wesley Pegden, Tomasz Tkocz:
On the Cover Time of the Emerging Giant. 1687-1710 - Peter Nelson, Kazuhiro Nomoto:
The Structure of $I_4$-Free and Triangle-Free Binary Matroids. 1711-1729 - Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang:
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case. 1730-1747 - María A. Hernández Cifre, Eduardo Lucas:
On Discrete LOG-Brunn-Minkowski Type Inequalities. 1748-1760 - Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi:
Grundy Distinguishes Treewidth from Pathwidth. 1761-1787 - Margarita Akhmejanova, Maksim Zhukovskii:
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs. 1788-1799 - Arpitha P. Bharathi, Monaldo Mastrolilli:
Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism. 1800-1822 - Mengyu Cao, Benjian Lv, Kaishun Wang, Sanming Zhou:
Nontrivial t-Intersecting Families for Vector Spaces. 1823-1847 - Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky:
On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs. 1848-1860 - Maximus Redman, Lauren L. Rose, Raphael Walker:
A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$. 1861-1867 - Umberto Martínez-Peñas:
A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices. 1868-1886 - Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau:
Adapting the Directed Grid Theorem into an FPT Algorithm. 1887-1917 - Martin Henk, Stefan Kuhlmann, Robert Weismantel:
On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases. 1918-1942 - Nicolas Fraiman, Lyuben Lichev, Dieter Mitsche:
On the Power of Choice for Boolean Functions. 1943-1954 - Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse:
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. 1955-1990 - Jiaao Li, Xueliang Li, Meiling Wang:
The Flow Index of Regular Class I Graphs. 1991-2003 - Sepehr Hajebi, Yanjia Li, Sophie Spirkl:
Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph. 2004-2027 - Debarun Ghosh, Ervin Györi, Ryan R. Martin, Addisu Paulos, Chuanqi Xiao:
Planar Turán Number of the 6-Cycle. 2028-2050 - James G. Oxley, Jagdeep Singh:
The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements. 2051-2072 - Peter Frankl, János Pach, Dömötör Pálvölgyi:
Exchange Properties of Finite Set-Systems. 2073-2081 - Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk:
Shorter Labeling Schemes for Planar Graphs. 2082-2099 - Peter Nelson, Zach Walsh:
The Extremal Function for Excluding Geometry Minors over Prime Fields. 2100-2120 - Kazuki Matoya, Taihei Oki:
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems. 2121-2158 - Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos:
The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs. 2159-2204 - Michal Debski, Marta Piecyk, Pawel Rzazewski:
Faster 3-Coloring of Small-Diameter Graphs. 2205-2224 - Neil J. Y. Fan, Peter L. Guo:
Poincaré Polynomials of Odd Diagram Classes. 2225-2237 - Colin Cooper, Alan M. Frieze:
Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs. 2238-2257 - Yan Cao, Guantao Chen, Guangming Jing, Songling Shan:
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree. 2258-2270 - François Clément, Thang Pham:
Distribution of Distances in Five Dimensions and Related Problems. 2271-2281 - Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik:
A Spectral Independence View on Hard Spheres via Block Dynamics. 2282-2322 - Yulin Chang, Huifen Ge, Jie Han, Guanghui Wang:
Matching of Given Sizes in Hypergraphs. 2323-2338 - Mingyang Guo, Hongliang Lu, Dingjia Mao:
A Stability Result on Matchings in 3-Uniform Hypergraphs. 2339-2351 - Jungho Ahn, Kevin Hendrey, Donggyu Kim, Sang-il Oum:
Bounds for the Twin-Width of Graphs. 2352-2366 - Tibor Jordán, Shin-ichi Tanigawa:
Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices. 2367-2392 - Vojtech Dvorak, Ohad Klein:
Probability Mass of Rademacher Sums Beyond One Standard Deviation. 2393-2410 - Sujoy Bhore, Csaba D. Tóth:
Euclidean Steiner Spanners: Light and Sparse. 2411-2444 - Ahmad Abdi, Gérard Cornuéjols, Zuzanna Palion:
On Dyadic Fractional Packings of $T$-Joins. 2445-2451
Volume 36, Number 4, December 2022
- Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs. 2453-2472 - Csaba Király, András Mihálykó:
Globally Rigid Augmentation of Rigid Graphs. 2473-2496 - Pierre Aboulker, Guillaume Aubian, Raphael Steiner:
Heroes in Orientations of Chordal Graphs. 2497-2505 - Mohammad Reza Pournaki, Milad Poursoltani, N. Terai, S. Yassemi:
Simplicial Complexes Satisfying Serre's Condition versus the Ones Which Are Cohen-Macaulay in a Fixed Codimension. 2506-2522 - Zoltán Füredi, Yi Zhao:
Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition. 2523-2533 - Marin Bougeret, György Dósa, Noam Goldberg, Michael Poss:
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty. 2534-2552 - Alice L. L. Gao, Matthew H. Y. Xie, Arthur L. B. Yang:
The Equivariant Inverse Kazhdan-Lusztig Polynomials of Uniform Matroids. 2553-2569 - Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong:
On the Size of Matchings in 1-Planar Graph with High Minimum Degree. 2570-2584 - Rongxing Xu, Xuding Zhu:
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs. 2585-2601 - Bernd Schulze, Hattie Serocold, Louis Theran:
Frameworks with Coordinated Edge Motions. 2602-2618 - Florent Foucaud, Tuomo Lehtilä:
Revisiting and Improving Upper Bounds for Identifying Codes. 2619-2634 - Robert Ganian, Eun Jung Kim, Stefan Szeider:
Algorithmic Applications of Tree-Cut Width. 2635-2666 - Eng Keat Hng:
Minimum Degrees for Powers of Paths and Cycles. 2667-2736 - Marin Bougeret, Bart M. P. Jansen, Ignasi Sau:
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. 2737-2773 - Bogdan Alecu, Robert Ferguson, Mamadou Moustapha Kanté, Vadim V. Lozin, Vincent Vatter, Victor Zamaraev:
Letter Graphs and Geometric Grid Classes of Permutations. 2774-2797 - Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems. 2798-2821 - James G. Oxley, Zach Walsh:
Small Cocircuits in Minimally Vertically 4-Connected Matroids. 2822-2829 - Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun:
Hitting Weighted Even Cycles in Planar Graphs. 2830-2862 - Dylan Heuer, Jessica Striker:
Partial Permutation and Alternating Sign Matrix Polytopes. 2863-2888 - Andrés Fielbaum, Ignacio Morales, José Verschae:
A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems. 2889-2915 - Daniel McGinnis, Shira Zerbib:
Line Transversals in Families of Connected Sets in the Plane. 2916-2919 - Guillermo Pineda-Villavicencio, David T. Yost:
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices. 2920-2941 - John Haslegrave, Jie Hu, Jaehoon Kim, Hong Liu, Bingyu Luan, Guanghui Wang:
Crux and Long Cycles in Graphs. 2942-2958 - Marcus Schaefer:
Hanani-Tutte and Hierarchical Partial Planarity. 2959-2974 - Elad Aigner-Horev, Oran Danon, Dan Hefetz, Shoham Letzter:
Large Rainbow Cliques in Randomly Perturbed Dense Graphs. 2975-2994 - Kristóf Bérczi, Matthias Mnich, Roland Vincze:
A 3/2-Approximation for the Metric Many-Visits Path TSP. 2995-3030 - John Rhodes, Anne Schilling:
Upper Bounds on Mixing Time of Finite Markov Chains. 3031-3057
a service of 
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 2024-04-15 21:34 CEST 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:
