default search action
SIAM Journal on Discrete Mathematics, Volume 30
Volume 30, Number 1, 2016
- Dániel Korándi, Yuval Peled, Benny Sudakov:
A Random Triadic Process. 1-19 - Michael A. Henning, William B. Kinnersley:
Domination Game: A proof of the 3/5-Conjecture for Graphs with Minimum Degree at Least Two. 20-35 - François Dross:
Fractional Triangle Decompositions in Graphs with Large Minimum Degree. 36-42 - Nathan Lindzey, Ross M. McConnell:
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. 43-69 - Diego A. Morán R., Santanu S. Dey
:
Closedness of Integer Hulls of Simple Conic Sets. 70-99 - Karola Mészáros:
Pipe Dream Complexes and Triangulations of Root Polytopes Belong Together. 100-111 - Ken-ichi Kawarabayashi, Kenta Ozeki
5-Connected Toroidal Graphs are Hamiltonian-Connected. 112-140 - Ahmad Abdi
Lehman's Theorem and the Directed Steiner Tree Problem. 141-153 - Felix Joos, Viet Hang Nguyen:
Induced Matchings in Graphs of Degree at Most 4. 154-165 - Colin Cooper, Alan M. Frieze
Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk. 166-205 - Louis Esperet
Islands in Graphs on Surfaces. 206-219 - Gregory Z. Gutin, Viresh Patel:
Parameterized Traveling Salesman Problem: Beating the Average. 220-238 - Gábor Braun, Sebastian Pokutta:
A Polyhedral Characterization of Border Bases. 239-265 - Nirattaya Khamsemanan, Rafail Ostrovsky, William E. Skeith III:
On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols. 266-295 - Fan Chung, Xing Peng:
Decomposition of Random Graphs into Complete Bipartite Graphs. 296-310 - Mamadou Moustapha Kanté, Lhouari Nourine:
Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs. 311-326 - Martin Skutella:
A Note on the Ring Loading Problem. 327-342 - Klaus Jansen, Felix Land, Kati Land:
Bounding the Running Time of Algorithms for Scheduling and Packing Problems. 343-366 - David Covert, Doowon Koh, Youngjin Pi:
On the Sums of Any k Points in Finite Fields. 367-382 - Fedor V. Fomin
Hitting Forbidden Minors: Approximation and Kernelization. 383-410 - Yu Hin Au, Levent Tunçel
A Comprehensive Analysis of Polyhedral Lift-and-Project Methods. 411-451 - J. Adrian Bondy, Zbigniew Lonc
Constructing Optimal k-Radius Sequences. 452-464 - Paul N. Balister
Random Hypergraph Irregularity. 465-473 - Yutaro Yamaguchi:
Packing A-Paths in Group-Labelled Graphs via Linear Matroid Parity. 474-492 - James G. Oxley, Charles Semple
A Wheels-and-Whirls Theorem for 3-Connected 2-Polymatroids. 493-524 - Michael Hebdige, Daniel Král
Third Case of the Cyclic Coloring Conjecture. 525-548 - Boris Bukh:
Bounds on Equiangular Lines and on Related Spherical Codes. 549-554 - Andrzej Dudek, Pawel Pralat:
Acquaintance Time of Random Graphs Near Connectivity Threshold. 555-568 - Derek G. Corneil, Jérémie Dusart, Michel Habib, Ekkehard Köhler:
On the Power of Graph Searching for Cocomparability Graphs. 569-591 - Irena Penev
Isolating Highly Connected Induced Subgraphs. 592-619
Volume 30, Number 2, 2016
- Michael Drmota, Manuel Kauers, Lukas Spiegelhofer
On a Conjecture of Cusick Concerning the Sum of Digits of n and n+t. 621-649 - Emil-Alexandru Ciolan, Pedro A. García-Sánchez
Cyclotomic Numerical Semigroups. 650-668 - Mónica Blanco, Francisco Santos
Lattice 3-Polytopes with Few Lattice Points. 669-686 - Mónica Blanco, Francisco Santos
Lattice 3-Polytopes with Six Lattice Points. 687-717 - Noga Alon, Humberto Naves, Benny Sudakov:
On the Maximum Quartet Distance between Phylogenetic Trees. 718-735 - Karola Mészáros:
h-Polynomials of Reduction Trees. 736-762 - Kai Kellner, Thorsten Theobald
Sum of Squares Certificates for Containment of H-Polytopes in V-Polytopes. 763-776 - Takuro Fukunaga
Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation. 777-800 - Sarah Miracle, Dana Randall, Amanda Pascoe Streib, Prasad Tetali:
Sampling and Counting 3-Orientations of Planar Triangulations. 801-831 - Henning Bruhn, Oliver Schaudt:
Claw-Free t-Perfect Graphs Can Be Recognized in Polynomial Time. 832-855 - Benjamin Bond, Lionel Levine
Abelian Networks I. Foundations and Examples. 856-874 - Jens Vygen:
Reassembling Trees for the Traveling Salesman. 875-894 - Jaehoon Kim, Daniela Kühn, Deryk Osthus:
Bipartitions of Highly Connected Tournaments. 895-911 - Winfried Just, Sungwoo Ahn
Lengths of Attractors and Transients in Neuronal Networks with Random Connectivities. 912-933 - Misha Rudnev, J. M. Selig
On the Use of the Klein Quadric for Geometric Incidence Problems in Two Dimensions. 934-954 - Mark N. Ellingham, Emily Abernethy Marshall, Kenta Ozeki
A Characterization of K2, 4-Minor-Free Graphs. 955-975 - Tuan-Yow Chien, Shayne Waldron
A Characterization of Projective Unitary Equivalence of Finite Frames and Applications. 976-994 - François Gonze, Raphaël M. Jungers:
On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata. 995-1014 - Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin
Deciding the Bell Number for Hereditary Graph Properties. 1015-1031 - Or Ordentlich, Ofer Shayevitz:
An Upper Bound on the Sizes of Multiset-Union-Free Families. 1032-1045 - Arun P. Mani, Rebecca J. Stones:
The Number of Labeled Connected Graphs Modulo Prime Powers. 1046-1057 - Anindya De, Ilias Diakonikolas, Rocco A. Servedio
A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry. 1058-1094 - Zdenek Dvorák
Strongly Sublinear Separators and Polynomial Expansion. 1095-1101 - Shagnik Das
Removal and Stability for Erdös-Ko-Rado. 1102-1114 - Johnny Guzmán, Caroline J. Klivans:
Chip Firing on General Invertible Matrices. 1115-1127 - Abraham Isgur, Robert Lech, Scott Moore, Stephen M. Tanny, Yvon Verberne
Constructing New Families of Nested Recursions with Slow Solutions. 1128-1147 - Sören Lennart Berg, Martin Henk:
Lattice Point Inequalities for Centered Convex Bodies. 1148-1158 - Marthe Bonamy, Nicolas Bousquet
The Erdös-Hajnal Conjecture for Long Holes and Antiholes. 1159-1164 - Jeff Cooper, Dhruv Mubayi:
Coloring Sparse Hypergraphs. 1165-1180 - Mei-Chu Chang:
A Remark on Sieving in Biased Coin Convolutions. 1181-1192 - Fatemeh Mohammadi
The Algebraic Method in Tree Percolation. 1193-1212 - Martin Grohe, Pascal Schweitzer
Computing with Tangles. 1213-1247 - Tomás Kaiser
Nowhere-Zero Flows in Signed Series-Parallel Graphs. 1248-1258 - Hailun Zheng:
Minimal Balanced Triangulations of Sphere Bundles over the Circle. 1259-1268 - Sinan Aksoy
Graphs with Many Strong Orientations. 1269-1282 - Pat Devlin, Jeff Kahn:
On "stability" in the Erdös-Ko-Rado Theorem. 1283-1289 - Mourad Baïou, Francisco Barahona:
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs. 1290-1301 - Iddo Ben-Ari, Steven J. Miller:
A Probabilistic Approach to Generalized Zeckendorf Decompositions. 1302-1332 - Mikhail Lavrov:
An Upper Bound for the Hales-Jewett Number $\mathrm{HJ}(4, 2)$. 1333-1342
Volume 30, Number 3, 2016
- Daniela Kühn, Deryk Osthus, Amelia Taylor:
On the Random Greedy F-Free Hypergraph Process. 1343-1350 - Jie Han
Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture. 1351-1357 - Phong Q. Nguyen, Igor E. Shparlinski
Counting Co-Cyclic Lattices. 1358-1370 - Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation. 1371-1384 - Richard Ehrenborg
Cyclically Consecutive Permutation Avoidance. 1385-1390 - Matthias Hamann
Bounding Connected Tree-Width. 1391-1400 - Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh:
Partially Polynomial Kernels for Set Cover and Test Cover. 1401-1423 - David Coudert, Guillaume Ducoffe, Nicolas Nisse:
To Approximate Treewidth, Use Treelength! 1424-1436 - Jun Yang
Lower Bounds on the Probability of a Finite Union of Events. 1437-1452 - Jie Han
Near Perfect Matchings in k-Uniform Hypergraphs II. 1453-1469 - Matthias Beck, Benjamin Braun
Generating Functions and Triangulations for Lecture Hall Cones. 1470-1479 - Ben Clark, Dillon Mayhew
The Structure of U2, 5, U3, 5-Fragile Matroids. 1480-1508 - Sebastian M. Cioaba
Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue. 1509-1525 - Mark Wildon:
A Combinatorial Proof of a Plethystic Murnaghan-Nakayama Rule. 1526-1533 - Diego Cifuentes, Pablo A. Parrilo
Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach. 1534-1570 - Michele Conforti, Samuel Fiorini, Kanstantsin Pashkovich:
Cut Dominants and Forbidden Minors. 1571-1589 - Carolyn Chun
Unavoidable Connected Matroids Retaining a Specified Minor. 1590-1606 - Leo van Iersel, Steven Kelk, Nela Lekic, Chris Whidden
Hybridization Number on Three Rooted Binary Trees is EPT. 1607-1631 - William Y. C. Chen, Alan J. X. Guo
s-Inversion Sequences and P-Partitions of Type B. 1632-1643 - Thomas Boys, Claudiu Valculescu, Frank de Zeeuw:
On the Number of Ordinary Conics. 1644-1659 - Ricky X. F. Chen
Plane Permutations and Applications to a Result of Zagier-Stanley and Distances of Permutations. 1660-1684 - Archontia C. Giannopoulou, George B. Mertzios:
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. 1685-1725 - Hiroshi Hirai, Yuni Iwamasa
On k-Submodular Relaxation. 1726-1736 - Carolina Benedetti, Joshua Hallam, John M. Machacek
Combinatorial Hopf Algebras of Simplicial Complexes. 1737-1757 - Kristóf Bérczi, Tamás Király, Yusuke Kobayashi:
Covering Intersecting Bi-set Families under Matroid Constraints. 1758-1774 - Bertrand Guenin, Leanne Stuive:
Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids. 1775-1797 - Julien Cassaigne, Éric Duchêne, Michel Rigo
Nonhomogeneous Beatty Sequences Leading to Invariant Games. 1798-1829 - Csilla Bujtás
Transversal Game on Hypergraphs and the 3/4-Conjecture on the Total Domination Game. 1830-1847 - Kunal Dutta
Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs. 1848-1865 - Octavio Arizmendi
Large Area Convex Holes in Random Point Sets. 1866-1875 - Felix Joos:
Induced Matchings in Graphs of Bounded Maximum Degree. 1876-1882 - Thomas Perrett:
Chromatic Roots and Minor-Closed Families of Graphs. 1883-1897
Volume 30, Number 4, 2016
- Victor Falgas-Ravry
Codegree Thresholds for Covering 3-Uniform Hypergraphs. 1899-1917 - Luca Ferrari
Dyck Algebras, Interval Temporal Logic, and Posets of Intervals. 1918-1937 - Ross J. Kang, François Pirot
Coloring Powers and Girth. 1938-1949 - Sergey Bereg
Representing Permutations with Few Moves. 1950-1977 - Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee:
An Algorithmic View of Voting. 1978-1996 - Ben Lund
Incidence Bounds for Block Designs. 1997-2010 - Charles J. Colbourn, Bingli Fan, Daniel Horsley
Disjoint Spread Systems and Fault Location. 2011-2026 - Tomasz Kociumaka
Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence. 2027-2046 - Christine T. Cheng:
On the Stable Matchings That Can Be Reached When the Agents Go Marching in One By One. 2047-2063 - Stasys Jukna
Tropical Complexity, Sidon Sets, and Dynamic Programming. 2064-2085 - Barbora Candráková, Robert Lukotka:
Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor. 2086-2106 - Csaba Király
On Maximal Independent Arborescence Packing. 2107-2114 - Michael Tait, Craig Timmons:
Independent Sets in Polarity Graphs. 2115-2129 - Tobias Windisch
Rapid Mixing and Markov Bases. 2130-2145 - Benjamin Iriarte:
Largest Eigenvalue of the Laplacian Matrix: Its Eigenspace and Transitive Orientations. 2146-2161 - Arnau Padrol
Extension Complexity of Polytopes with Few Vertices or Facets. 2162-2176 - Gregory Z. Gutin, Mark Jones, Magnus Wahlström
The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth. 2177-2205 - Michele Conforti, Marco Di Summa:
Maximal S-Free Convex Sets and the Helly Number. 2206-2216 - Mustazee Rahman
Factor of IID Percolation on Trees. 2217-2242 - Chong Shangguan
Separating Hash Families: A Johnson-type bound and New Constructions. 2243-2264 - J. V. de Jong, Jeanette C. McLeod, Michael Anthony Steel
Neighborhoods of Phylogenetic Trees: Exact and Asymptotic Counts. 2265-2287 - Andreas Brandstädt, Raffaele Mosca:
Weighted Efficient Domination for P5-Free and P6-Free Graphs. 2288-2303
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-11-15 19:42 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: