default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 32
Volume 32, Number 1, 2018
- Tyler Seacrest, Francis Edward Su:
A Lower Bound Technique for Triangulations of Simplotopes. 1-28 - Jiaao Li
, Xinmin Hou, Miaomiao Han, Hong-Jian Lai:
Mod (2p+1)-Orientation on Bipartite Graphs and Complementary Graphs. 29-43 - Jaroslaw Byrka, Aravind Srinivasan:
Approximation Algorithms for Stochastic and Risk-Averse Optimization. 44-63 - Fatemeh Mohammadi, Caroline Uhler, Charles Wang, Josephine Yu:
Generalized Permutohedra from Probabilistic Graphical Models. 64-93 - Zdenek Dvorák, Bernard Lidický:
Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces. 94-105 - Selçuk Kavut, Subhamoy Maitra, Ferruh Özbudak:
A Super-Set of Patterson-Wiedemann Functions: Upper Bounds and Possible Nonlinearities. 106-122 - Gwenaël Joret, David R. Wood:
K4-Minor-Free Induced Subgraphs of Sparse Connected Graphs. 123-147 - Mathew C. Francis, Dalu Jacob, Satyabrata Jana:
Uniquely Restricted Matchings in Interval Graphs. 148-172 - Bobby Shen:
Parametrizing an Integer Linear Program by an Integer. 173-190 - Kyungyong Lee, Li Li, Nicholas A. Loehr:
A Combinatorial Approach to the Symmetry of q, t-Catalan Numbers. 191-232 - Alexander Hoyer, Robin Thomas:
Four Edge-Independent Spanning Trees. 233-248 - Daniel Pellicer, Gordon Ian Williams:
Pyramids Over Regular 3-Tori. 249-265 - Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós:
On the Number of Cycles in a Graph with Restricted Cycle Lengths. 266-279 - Benny Sudakov, Pedro Vieira:
Two Remarks on Eventown and Oddtown Problems. 280-295 - Jie Ma, Bo Ning:
Coloring Graphs with Two Odd Cycle Lengths. 296-319 - David Hartvigsen:
Packing k-Matchings and k-Critical Graphs. 320-351 - Stephen R. Chestnut, Robert Hildebrand, Rico Zenklusen:
Sublinear Bounds for a Quantitative Doignon-Bell-Scarf Theorem. 352-371 - Jun Wang, Huajun Zhang:
Intersecting Families in Symmetric Unions of Direct Products of Set Families. 372-381 - Hongliang Lu, Xingxing Yu:
On Rainbow Matchings for Hypergraphs. 382-393 - Shuya Chiba, Tomoki Yamashita:
On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs. 394-409 - Yoshiharu Kohayakawa, Sangjune Lee, Carlos Gustavo Moreira, Vojtech Rödl:
Infinite Sidon Sets Contained in Sparse Random Sets of Integers. 410-449 - António Girão, Kamil Popielarz:
Large Induced Subgraphs with k Vertices of Almost Maximum Degree. 450-454 - Miroslav Rada, Michal Cerný:
A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search. 455-473 - William Y. C. Chen, Lisa Hui Sun:
Stanley's Lemma and Multiple Theta Functions. 474-504 - Jianfeng Hou, Shufei Wu, Qinghou Zeng, Wenxing Zhu:
The Bollobás-Scott Conjecture for 4-Uniform Hypergraphs. 505-521 - Hongliang Lu, Yan Wang, Xingxing Yu:
Almost Perfect Matchings in k-Partite k-Graphs. 522-533 - Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le, Stéphan Thomassé:
Additive Bases and Flows in Graphs. 534-542 - Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
The Geodetic Hull Number is Hard for Chordal Graphs. 543-547 - He Huang, Binzhou Xia, Sanming Zhou:
Perfect Codes in Cayley Graphs. 548-559 - Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi:
Making Bipartite Graphs DM-Irreducible. 560-590 - Megumi Asada, Florian Frick, Vivek Pisharody, Maxwell Polevy, David Stoner, Ling Hei Tsang, Zoe Wellner:
Fair Division and Generalizations of Sperner- and KKM-type Results. 591-610 - Michael Krivelevich:
Finding and Using Expanders in Locally Sparse Graphs. 611-623 - Lucas Boczkowski, Yuval Peres, Perla Sousi:
Sensitivity of Mixing Times in Eulerian Digraphs. 624-655 - Till Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier:
Fractals for Kernelization Lower Bounds. 656-681 - David Coudert, Guillaume Ducoffe:
Revisiting Decomposition by Clique Separators. 682-694 - Chris Dowden, Mihyun Kang, Philipp Sprüssel:
The Evolution of Random Graphs on Surfaces. 695-727 - Benoît Larose, Mark H. Siggers:
NU Polymorphisms on Reflexive Digraphs. 728-749 - Herbert Edelsbrunner, Mabel Iglesias Ham:
On the Optimality of the FCC Lattice for Soft Sphere Packing. 750-782 - Tri Lai:
Lozenge Tilings of a Halved Hexagon with an Array of Triangles Removed from the Boundary. 783-814
Volume 32, Number 2, 2018
- Simon Macourt:
Incidence Results and Bounds Of Trilinear and Quadrilinear Exponential Sums. 815-825 - Hiêp Hàn, Vojtech Rödl, Tibor Szabó:
Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs. 826-838 - Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood:
Orthogonal Tree Decompositions of Graphs. 839-863 - Dániel Gerbner, Balázs Keszegh, Gábor Mészáros, Balázs Patkós, Máté Vizer:
Line Percolation in Finite Projective Planes. 864-881 - Geevarghese Philip, Ashutosh Rai, Saket Saurabh:
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel. 882-901 - Laurent Beaudou, Peter Dankelmann, Florent Foucaud, Michael A. Henning, Arnaud Mary, Aline Parreau:
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension. 902-918 - Jie Han:
On Perfect Matchings and Tilings in Uniform Hypergraphs. 919-932 - Beka Ergemlidze, Ervin Györi, Abhishek Methuku:
3-Uniform Hypergraphs and Linear Cycles. 933-950 - Maria Chudnovsky, Vaidy Sivaraman:
Odd Holes in Bull-Free Graphs. 951-955 - Jian Cheng, You Lu, Rong Luo, Cun-Quan Zhang:
Signed Graphs: From Modulo Flows to Integer-Valued Flows. 956-965 - Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi:
Matrix Rigidity from the Viewpoint of Parameterized Complexity. 966-985 - Danny Nguyen, Igor Pak:
Enumerating Projections of Integer Points in Unbounded Polyhedra. 986-1002 - Sean Cleary, Roland Maio:
Edge Conflicts do not Determine Geodesics in the Associahedron. 1003-1015 - Zoltán Füredi, Ida Kantor:
Kneser Ranks of Random Graphs and Minimum Difference Representations. 1016-1028 - Samantha Dahlberg, Stephanie van Willigenburg:
Lollipop and Lariat Symmetric Functions. 1029-1039 - David Jekel, Avi Levy, Will Dana, Austin J. Stromme, Collin Litterell:
Algebraic Properties of Generalized Graph Laplacians: Resistor Networks, Critical Groups, and Homological Algebra. 1040-1110 - Maria Chudnovsky, Juraj Stacho:
3-Colorable Subclasses of P8-Free Graphs. 1111-1138 - Donald K. Wagner:
A Characterization of Graphic Matroids Based on Circuit Orderings. 1139-1144 - Peter Nelson, Jorn G. van der Pol:
Doubly Exponentially Many Ingleton Matroids. 1145-1153 - Allan Lo, Yi Zhao:
Codegree Turán Density of Complete r-Uniform Hypergraphs. 1154-1158 - Pu Gao:
The Stripping Process Can be Slow: Part II. 1159-1188 - Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay, Saket Saurabh:
Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs. 1189-1208 - Ilkyoo Choi, Chun-Hung Liu, Sang-il Oum:
Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs. 1209-1228 - Bo Lin, Ruriko Yoshida:
Tropical Fermat-Weber Points. 1229-1245 - Henning Bruhn, Matthias Heinlein, Felix Joos:
Frames, A-Paths, and the Erdös-Pósa Property. 1246-1260 - Dániel Korándi:
Rainbow Saturation and Graph Capacities. 1261-1264 - Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu:
Local Testing of Lattices. 1265-1295 - Mehtaab Sawhney, David Stoner:
On Symmetric But Not Cyclotomic Numerical Semigroups. 1296-1304 - Xiaofeng Gu:
Spanning Rigid Subgraph Packing and Sparse Subgraph Covering. 1305-1313 - Tobias Friedrich, Anton Krohmer:
On the Diameter of Hyperbolic Random Graphs. 1314-1334 - Konstanty Junosza-Szaniawski, Pawel Rzazewski, Joanna Sokól, Krzysztof Wesek:
Online Coloring and L(2, 1)-Labeling of Unit Disk Intersection Graphs. 1335-1350 - Jonathan Chappelon, Leonardo Martínez-Sandoval, Luis Montejano, Luis Pedro Montejano, Jorge L. Ramírez Alfonsín:
Codimension Two and Three Kneser Transversals. 1351-1363 - Hiêp Hàn, Andrea Jiménez:
Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors. 1364-1368 - Andreas Alpers, Peter Gritzmann:
On Double-Resolution Imaging and Discrete Tomography. 1369-1399 - Kevin Hendrey:
Sparse Graphs of High Gonality. 1400-1407 - David P. Bourne, David Cushing, Shiping Liu, Florentin Münch, Norbert Peyerimhoff:
Ollivier-Ricci Idleness Functions of Graphs. 1408-1424 - Petr Hlinený:
A Simpler Self-reduction Algorithm for Matroid Path-Width. 1425-1440 - Anne-Maria Ernvall-Hytönen, Esa V. Vesalainen:
On the Secrecy Gain of ℓ-Modular Lattices. 1441-1457 - Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca:
The Densest k-Subhypergraph Problem. 1458-1477 - Claudio L. Lucchesi, Marcelo Henriques de Carvalho, Nishad Kothari, Uppaluri S. R. Murty:
On Two Unsolved Problems Concerning Matching Covered Graphs. 1478-1504 - Michael Anastos, Joseph Briggs:
Packing Directed Hamilton Cycles Online. 1505-1539
Volume 32, Number 3, 2018
- Nicole Megow, José Verschae:
Dual Techniques for Scheduling on a Machine with Varying Speed. 1541-1571 - Isabella Novik:
From Acute Sets to Centrally Symmetric 2-Neighborly Polytopes. 1572-1576 - Peter Keevash, Liana Yepremyan:
Rainbow Matchings in Properly Colored Multigraphs. 1577-1584 - Lisa Espig, Alan M. Frieze, Michael Krivelevich:
Elegantly Colored Paths and Cycles in Edge Colored Random Graphs. 1585-1618 - Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh:
Kernelization of Cycle Packing with Relaxed Disjointness Constraints. 1619-1643 - Hoang Dau, Olgica Milenkovic:
MaxMinSum Steiner Systems for Access Balancing in Distributed Storage. 1644-1671 - Lukasz Kowalik, Juho Lauri, Arkadiusz Socala:
On the Fine-Grained Complexity of Rainbow Coloring. 1672-1705 - Christoph Glanzer, Robert Weismantel, Rico Zenklusen:
On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants. 1706-1720 - Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev:
Expanding Generating Sets for Solvable Permutation Groups. 1721-1740 - Gaetan Bisson, Mehdi Tibouchi:
Constructing Permutation Rational Functions from Isogenies. 1741-1749 - Ahmad Abdi, Kanstantsin Pashkovich:
Delta Minors, Delta Free Clutters, and Entanglement. 1750-1774 - Zdenek Dvorák, Bernard Lidický:
Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains. 1775-1805 - Stefan Kratsch:
A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter. 1806-1839 - María A. Hernández Cifre, David Iglesias, Jesús Yepes Nicolás:
On a Discrete Brunn-Minkowski Type Inequality. 1840-1856 - Manuel Aprile, Alfonso Cevallos, Yuri Faenza:
On 2-Level Polytopes Arising in Combinatorial Settings. 1857-1886 - Harry H. Y. Huang, Larry X. W. Wang:
The Corners of Core Partitions. 1887-1902 - Reuven Bar-Yehuda, Erez Kantor, Shay Kutten, Dror Rawitz:
Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks. 1903-1921 - Maximilien Gadouleau:
Finite Dynamical Systems, Hat Games, and Coding Theory. 1922-1945 - Yanping Wang, WeiGuo Zhang, Zhengbang Zha:
Six New Classes of Permutation Trinomials over 픽2n. 1946-1961 - Petr Hlinený, Carsten Thomassen:
Deciding Parity of Graph Crossing Number. 1962-1965 - Sarah Cannon, Sarah Miracle, Dana Randall:
Phase Transitions in Random Dyadic Tilings and Rectangular Dissections. 1966-1992 - Bao-Xuan Zhu:
Positivity of Iterated Sequences of Polynomials. 1993-2010 - Guillermo Pineda-Villavicencio, Julien Ugon, David T. Yost:
The Excess Degree of a Polytope. 2011-2046 - Leo van Iersel, Vincent Moulton:
Leaf-Reconstructibility of Phylogenetic Networks. 2047-2066 - Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Optimization over Degree Sequences. 2067-2079 - Carlos A. Alfaro, Alan Arroyo, Marek Dernár, Bojan Mohar:
The Crossing Number of the Cone of a Graph. 2080-2093 - Barbora Duník, Robert Lukotka:
Cubic TSP: A 1.3-Approximation. 2094-2114 - Alan M. Frieze, Wesley Pegden, Gregory B. Sorkin:
The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights. 2115-2133 - Chandra Chekuri, Alina Ene, Marcin Pilipczuk:
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. 2134-2160 - Sihuang Hu, Nir Weinberger, Ofer Shayevitz:
On the VC-Dimension of Binary Codes. 2161-2171 - Linyuan Lu, Zhiyu Wang:
On the Size-Ramsey Number of Tight Paths. 2172-2179 - Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Deterministic Random Walks for Rapidly Mixing Chains. 2180-2193 - Michael Anastos:
Connectivity of the k-Out Hypercube. 2194-2216 - Ramin Javadi, Gholam Reza Omidi:
On a Question of Erdös and Faudree on the Size Ramsey Numbers. 2217-2228 - Sihuang Hu, Itzhak Tamo, Ofer Shayevitz:
A Bound on the Shannon Capacity via a Linear Programming Variation. 2229-2241 - Arseniy V. Akopyan, Erel Segal-Halevi:
Counting Blanks in Polygonal Arrangements. 2242-2257 - Bart M. P. Jansen, Marcin Pilipczuk:
Approximation and Kernelization for Chordal Vertex Deletion. 2258-2301 - Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau:
A Tight Erdös-Pósa Function for Wheel Minors. 2302-2312 - Catherine Erbes, Michael Ferrara, Ryan R. Martin, Paul S. Wenger:
Stability of the Potential Function. 2313-2331 - Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh:
Below All Subsets for Minimal Connected Dominating Set. 2332-2345 - Tim E. Wilson, David R. Wood:
Anagram-Free Colorings of Graph Subdivisions. 2346-2360 - Adam Mammoliti, Thomas Britz:
On Mubayi's Conjecture and Conditionally Intersecting Sets. 2361-2380
Volume 32, Number 4, 2018
- Michaël Rao, Matthieu Rosenfeld:
Avoiding Two Consecutive Blocks of Same Size and Same Sum over ℤ2. 2381-2397 - Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolás Rivera:
Discordant Voting Processes on Finite Graphs. 2398-2420