default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 35
Volume 35, Number 1, 2021
- Hiroki Oshima:
Improved Randomized Algorithm for k-Submodular Function Maximization. 1-22 - Qizhong Lin, Xiudi Liu:
Ramsey Numbers Involving Large Books. 23-34 - Hélène Barcelo
, Curtis Greene, Abdul Salam Jarrah, Volkmar Welker:
On the Vanishing of Discrete Singular Cubical Homology for Graphs. 35-54 - Laurent Feuilloley, Michel Habib:
Graph Classes and Forbidden Patterns on Three Vertices. 55-90 - Meysam Alishahi, Frédéric Meunier:
Topological Bounds for Graph Representations over Any Field. 91-104 - Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. 105-151 - Steffen Borgwardt, Charles Viss:
Constructing Clustering Transformations. 152-178 - Satoshi Noguchi, Xiao-Nan Lu, Masakazu Jimbo, Ying Miao:
BCH Codes with Minimum Distance Proportional to Code Length. 179-193 - Oliver Roche-Newton:
Sums, Products, and Dilates on Sparse Graphs. 194-204 - Alexander Garver, Stefan Grosser, Jacob P. Matherne, Alejandro H. Morales:
Counting Linear Extensions of Posets with Determinants of Hook Lengths. 205-233 - Dustin G. Mixon, Hans Parshall:
Globally Optimizing Small Codes in Real Projective Spaces. 234-249 - Louis DeBiasio, Allan Lo, Theodore Molla, Andrew Treglown:
Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree. 250-266 - Oliver Cooley, Nemanja Draganic, Mihyun Kang, Benny Sudakov:
Large Induced Matchings in Random Graphs. 267-280 - Nina Kamcev, Anita Liebenau, David R. Wood, Liana Yepremyan:
The Size Ramsey Number of Graphs with Bounded Treewidth. 281-293 - A. Nicholas Day, Amites Sarkar:
On a Conjecture of Nagy on Extremal Densities. 294-306 - Ilya D. Shkredov, József Solymosi:
The Uniformity Conjecture in Additive Combinatorics. 307-321 - Quentin Dubroff, Jacob Fox, Max Wenqiang Xu:
A Note on the Erdös Distinct Subset Sums Problem. 322-324 - Matteo Gallet, Georg Grasegger, Jan Legerský, Josef Schicho:
On the Existence of Paradoxical Motions of Generically Rigid Graphs on the Sphere. 325-361 - Pavol Hell, César Hernández-Cruz, Jing Huang, Jephian C.-H. Lin:
Strong Chordality of Graphs with Possible Loops. 362-375 - Miaomiao Han, Jiaao Li, Rong Luo, Yongtang Shi, Cun-Quan Zhang:
Integer Flows and Modulo Orientations of Signed Graphs. 376-391 - Henning Bruhn, Matthias Heinlein:
K4-Subdivisions Have the Edge-Erdös-Pósa Property. 392-430 - Runrun Liu, Martin Rolek, D. Christopher Stephens, Dong Ye, Gexin Yu:
Connectivity for Kite-Linked Graphs. 431-446 - Marcin Brianski, Piotr Micek, Michal Pilipczuk, Michal T. Seweryn:
Erdös-Hajnal Properties for Powers of Sparse Graphs. 447-464 - Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosén, Adrian Thillard, Damien Vergnaud:
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND. 465-484 - Ngo Dac Tan:
Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths. 485-494 - M. McDevitt, Nikola Ruskuc:
Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations. 495-520 - Michael Tait, Robert J. Won:
Improved Bounds on Sizes of Generalized Caps in AG(n, q). 521-531 - Qizhong Lin, Xing Peng:
Large Book-Cycle Ramsey Numbers. 532-545 - Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý:
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. 546-574 - Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström:
Parameterized Pre-Coloring Extension and List Coloring Problems. 575-596
Volume 35, Number 2, 2021
- O-joung Kwon, Jean-Florent Raymond:
Packing and Covering Induced Subdivisions. 597-636 - Oleg Karpenkov, Christian Müller:
Geometric Criteria for Realizability of Tensegrities in Higher Dimensions. 637-660 - Rose McCarty:
Dense Induced Subgraphs of Dense Bipartite Graphs. 661-667 - Pasin Manurangsi, Warut Suksompong:
Closing Gaps in Asymptotic Fair Division. 668-706 - Martín D. Safe:
Circularly Compatible Ones, D-Circularity, and Proper Circular-Arc Bigraphs. 707-751 - Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen:
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths. 752-769 - Stasys Jukna:
Notes on Hazard-Free Circuits. 770-787 - Hoon Oh, Ariel D. Procaccia, Warut Suksompong:
Fairly Allocating Many Goods with Few Queries. 788-813 - Ivan Aidun, Frances Dean, Ralph Morrison, Teresa Yu, Julie Yuan:
Gonality Sequences of Graphs. 814-839 - Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman:
Kernelization of Graph Hamiltonicity: Proper H-Graphs. 840-892 - Henning Bruhn, Felix Joos, Oliver Schaudt:
Erdös-Pósa Property for Labeled Minors: 2-Connected Minors. 893-914 - Gábor Damásdi, Stefan Felsner, António Girão, Balázs Keszegh, David Lewis, Dániel T. Nagy, Torsten Ueckerdt:
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets. 915-927 - Bill Jackson, Anthony Nixon, Shin-ichi Tanigawa:
An Improved Bound for the Rigidity of Linearly Constrained Frameworks. 928-933 - Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk:
Improved Bounds for the Excluded-Minor Approximation of Treedepth. 934-947 - Xiaofeng Gu:
A Proof of Brouwer's Toughness Conjecture. 948-952 - Guillaume Ducoffe:
Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs. 953-969 - Andrea Freschi, Joseph Hyde, Joanna Lada, Andrew Treglown:
A Note on Color-Bias Hamilton Cycles in Dense Graphs. 970-975 - Igor E. Shparlinski, Qiang Wang:
Exponential Sums with Sparse Polynomials over Finite Fields. 976-987 - Rajko Nenadov, Milos Trujic:
Sprinkling a Few Random Edges Doubles the Power. 988-1004 - Xiaonan Liu, Xingxing Yu:
Number of Hamiltonian Cycles in Planar Triangulations. 1005-1021 - Hongliang Lu, Xingxing Yu, Xiaofan Yuan:
Nearly Perfect Matchings in Uniform Hypergraphs. 1022-1049 - Alan Arroyo, R. Bruce Richter, Matthew Sunohara:
Extending Drawings of Complete Graphs into Arrangements of Pseudocircles. 1050-1076 - Dongchun Han, Hanbin Zhang:
A Reciprocity on Finite Abelian Groups Involving Zero-Sum Sequences. 1077-1095 - Amin Coja-Oghlan, Max Hahn-Klimroth:
The Cut Metric for Probability Distributions. 1096-1135 - Maria Axenovich, Jean-Sébastien Sereni, Richard Snyder, Lea Weber:
Bipartite Independence Number in Graphs with Bounded Maximum Degree. 1136-1148 - Zdenek Dvorák, Rose McCarty, Sergey Norin:
Sublinear Separators in Intersection Graphs of Convex Shapes. 1149-1164 - Debsoumya Chakraborti, Da Qi Chen, Mihir Hasabnis:
Minimizing the Number of Edges in K(s, t)-Saturated Bipartite Graphs. 1165-1181 - Alan M. Frieze:
The Effect of Adding Randomly Weighted Edges. 1182-1200 - Mohamed Barakat, Reimer Behrends, Christopher Jefferson, Lukas Kühne, Martin Leuner:
On the Generation of Rank 3 Simple Matroids with an Application to Terao's Freeness Conjecture. 1201-1223 - Louis Esperet, Cyril Gavoille, Carla Groenland:
Isometric Universal Graphs. 1224-1237 - Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni:
On the Query Complexity of Estimating the Distance to Hereditary Graph Properties. 1238-1251 - Stefan Kiefer, Corto Mascle:
On Nonnegative Integer Matrices and Short Killing Words. 1252-1267 - Dusko Jojic, Gaiane Panina, Rade T. Zivaljevic:
Splitting Necklaces, with Constraints. 1268-1286 - Edita Mácajová, Martin Skoviera:
Perfect Matching Index versus Circular Flow Number of a Cubic Graph. 1287-1297 - Fedor V. Fomin, Petr A. Golovach:
Kernelization of Whitney Switches. 1298-1336 - Sándor P. Fekete, Linda Kleist, Dominik Krupke:
Minimum Scan Cover with Angular Transition Costs. 1337-1355 - Ben Clark, Kevin Grace, James G. Oxley, Stefan H. M. van Zwam:
On the Highly Connected Dyadic, Near-Regular, and Sixth-Root-of-Unity Matroids. 1356-1380 - Wenjian Liu, Ning Ning:
Phase Transition of the Reconstructability of a General Model with Different In-Community and Out-Community Mutations on an Infinite Tree. 1381-1417 - Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
The Recognition Problem of Graph Search Trees. 1418-1446 - Yoshiharu Kohayakawa, Walner Mendonça, Guilherme Oliveira Mota, Bjarne Schülke:
Covering 3-Edge-Colored Random Graphs with Monochromatic Trees. 1447-1459 - Safwat Nassar, Raphael Yuster:
All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint k-Cliques (and This Is Tight). 1460-1477 - John Engbers, Aysel Erey, Jacob Fox, Xiaoyu He:
Tomescu's Graph Coloring Conjecture for ℓ-Connected Graphs. 1478-1502 - Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic:
Counting Weighted Independent Sets beyond the Permanent. 1503-1524
Volume 35, Number 3, 2021
- József Balogh, Nathan Lemons, Cory Palmer:
Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree. 1525-1535 - Martin Vodicka:
Normality of the Kimura 3-Parameter Model. 1536-1547 - Tao Zhang, Gennian Ge:
On the Codegree Density of PGm(q). 1548-1556 - Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan:
Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming. 1557-1568 - Elad Aigner-Horev, Dan Hefetz:
Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs. 1569-1577 - Oleg R. Musin:
Majorization and Minimal Energy on Spheres. 1578-1591 - Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, Csaba D. Tóth:
On the Stretch Factor of Polygonal Chains. 1592-1614 - Travis Dillon, Pablo Soberón:
A Mélange of Diameter Helly-Type Theorems. 1615-1627 - Mokshay Madiman, Liyao Wang, Jae Oh Woo:
Entropy Inequalities for Sums in Prime Cyclic Groups. 1628-1649 - Jang Soo Kim, Meesue Yoo:
Generalized Schur Function Determinants Using the Bazin Identity. 1650-1672 - James A. Long Jr., Kevin G. Milans, Andrea Munaro:
Sublinear Longest Path Transversals. 1673-1677 - Imre Leader, Zarko Randelovic, Eero Räty:
Inequalities on Projected Volumes. 1678-1687 - Rohit Gurjar, Nisheeth K. Vishnoi:
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes). 1688-1705 - Carol T. Zamfirescu:
K2-Hamiltonian Graphs: I. 1706-1728 - Wanshun Yang, Yiqiao Wang, Wei-Fan Wang, Ko-Wei Lih:
IC-Planar Graphs Are 6-Choosable. 1729-1745 - Moïse Blanchard, Jesús A. De Loera, Quentin Louveaux:
On the Length of Monotone Paths in Polyhedra. 1746-1768 - Daniel W. Cranston, Matthew P. Yancey:
Vertex Partitions into an Independent Set and a Forest with Each Component Small. 1769-1791 - Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky:
Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm. 1792-1853 - Michael Anastos, Alan M. Frieze, Pu Gao:
Hamiltonicity of Random Graphs in the Stochastic Block Model. 1854-1880 - Benjamin Bergougnoux, Mamadou Moustapha Kanté:
More Applications of the d-Neighbor Equivalence: Acyclicity and Connectivity Constraints. 1881-1926 - Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann:
Rainbow Erdös-Rothschild Problem for the Fano Plane. 1927-1951 - Papa A. Sissokho:
Geometry of the Minimal Solutions of a Linear Diophantine Equation. 1952-1963 - Radoslav Fulek, Balázs Keszegh:
Saturation Problems about Forbidden 0-1 Submatrices. 1964-1977 - Thomas Magnard, Michael Skotnica, Martin Tancer:
Shellings and Sheddings Induced by Collapses. 1978-2002 - Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse:
Parameterized Complexity of Conflict-Free Graph Coloring. 2003-2038 - Qing Cui, On-Hei Solomon Lo:
Tight Gaps in the Cycle Spectrum of 3-Connected Planar Graphs. 2039-2048 - Eric N. Stucky:
Parity-Unimodality and a Cyclic Sieving Phenomenon for Necklaces. 2049-2069 - Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
On the Probabilistic Degrees of Symmetric Boolean Functions. 2070-2092 - Linus Setiabrata:
Faces of Root Polytopes. 2093-2114 - Guozhen Rong, Wenjun Li, Jianxin Wang, Yongjie Yang:
Cycle Extendability of Hamiltonian Strongly Chordal Graphs. 2115-2128 - Shang-En Huang, Seth Pettie:
Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts. 2129-2144 - Patrick Bennett, Ryan Cushman, Andrzej Dudek:
Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process. 2145-2169 - Sam Spiro, Jacques Verstraëte:
Relative Turán Problems for Uniform Hypergraphs. 2170-2191 - Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi:
List Coloring of Two Matroids through Reduction to Partition Matroids. 2192-2209 - Luiz Moreira:
Ramsey Goodness of Clique Versus Paths in Random Graphs. 2210-2222 - Edita Mácajová, Martin Skoviera:
Cubic Graphs with No Short Cycle Covers. 2223-2233 - Weiting Cao, Douglas B. West, Yan Yang:
On the Bar Visibility Number of Complete Bipartite Graphs. 2234-2248 - David Conlon, Mykhaylo Tyomkyn:
Repeated Patterns in Proper Colorings. 2249-2264 - Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
How to Secure Matchings against Edge Failures. 2265-2292
Volume 35, Number 4, 2021
- Ron Aharoni, Joseph Briggs, Ron Holzman, Zilin Jiang:
Rainbow Odd Cycles. 2293-2303 - Oliver Weller-Davies, Mike A. Steel, Jotun Hein:
Combinatorics of Polymer-Based Models of Early Metabolism. 2304-2316 - Jun Gao, Qingyi Huo, Jie Ma:
A Strengthening on Odd Cycles in Graphs of Given Chromatic Number. 2317-2327 - Bernard Lidický, Florian Pfender:
Semidefinite Programming and Ramsey Numbers. 2328-2344 - S. Thomas McCormick, Britta Peis, Robert Scheidweiler, Frank Vallentin:
A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices. 2345-2356 - Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl:
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. 2357-2386 - Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen:
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. 2387-2429 - Oliver Cooley, Frederik Garbe, Eng Keat Hng, Mihyun Kang, Nicolás Sanhueza-Matamala, Julian Zalla:
Longest Paths in Random Hypergraphs. 2430-2458 - Nathan J. Bowler, Joshua Erde, Florian Lehner, Max Pitz:
Bounding the Cop Number of a Graph by Its Genus. 2459-2489 - Momoko Hayamizu:
A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks. 2490-2516 - Dani Kotlar, Elad Roda, Ran Ziv:
On Sequential Basis Exchange in Matroids. 2517-2519 - Xiaofeng Gu, Wei Meng, Martin Rolek, Yue Wang, Gexin Yu:
Sufficient Conditions for 2-Dimensional Global Rigidity. 2520-2534 - Hong-Jian Lai, Lucian Mazza:
A Note on Group Colorings and Group Structure. 2535-2543 - Jisu Jeong, Eun Jung Kim, Sang-il Oum:
Finding Branch-Decompositions of Matroids, Hypergraphs, and More. 2544-2617 - Clément Dallard, Martin Milanic, Kenny Storgel:
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure. 2618-2646 - Logan Crew, Sophie Spirkl:
A Complete Multipartite Basis for the Chromatic Symmetric Function. 2647-2661 - Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi:
Market Pricing for Matroid Rank Valuations. 2662-2678 - Tzvi Alon, Nir Halman:
Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier. 2679-2722 - Dennis Clemens, Fabian Hamann, Yannick Mogge, Olaf Parczyk:
Maker-Breaker Games on Randomly Perturbed Graphs. 2723-2748 - Jacob Focke, Leslie Ann Goldberg, Marc Roth, Stanislav Zivný:
Counting Homomorphisms to K4-Minor-Free Graphs, Modulo 2. 2749-2814 - François Pirot, Jean-Sébastien Sereni:
Fractional Chromatic Number, Maximum Degree, and Girth. 2815-2843 - Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Yoshiharu Kohayakawa, Tássio Naia:
Orientation Ramsey Thresholds for Cycles and Cliques. 2844-2857 - Bin Han, Jianxi Mao, Jiang Zeng:
Equidistributions around Special Kinds of Descents and Excedances. 2858-2879 - Nathan Benedetto Proença, Marcel Kenji de Carli Silva, Gabriel Coutinho:
Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming. 2880-2907 - Carla Michini:
Tight Cycle Relaxations for the Cut Polytope. 2908-2921 - Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma:
Tree Pivot-Minors and Linear Rank-Width. 2922-2945 - Tristram Bogart, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Alessandro Neri, Mauricio Velasco:
Constructing Partial MDS Codes from Reducible Algebraic Curves. 2946-2970 - Bao-Xuan Zhu:
Total Positivity from the Exponential Riordan Arrays. 2971-3003 - Philip M. Long:
Superlinear Integrality Gaps for the Minimum Majority Problem. 3004-3016 - Michal Debski, Malgorzata Sleszynska-Nowak:
t-Strong Cliques and the Degree-Diameter Problem. 3017-3029 - Donald K. Wagner:
Nonseparating Cocircuits in Binary Matroids. 3030-3049
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-09-21 23:41 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:
