


default search action
SIAM Journal on Discrete Mathematics, Volume 29
Volume 29, Number 1, 2015
- Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý

, Mathias Weller:
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. 1-25 - Roman Cada

, Shuya Chiba, Kenta Ozeki
, Petr Vrána
, Kiyoshi Yoshimoto:
A Relationship Between Thomassen's Conjecture and Bondy's Conjecture. 26-35 - Venkatesan Guruswami, Sushant Sachdeva

, Rishi Saket:
Inapproximability of Minimum Vertex Cover on k-Uniform k-Partite Hypergraphs. 36-58 - Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew

, Deepak Rajendraprasad
:
Separation Dimension of Bounded Degree Graphs. 59-64 - Florent Foucaud

, Michael Krivelevich, Guillem Perarnau
:
Large Subgraphs without Short Cycles. 65-78 - Cunsheng Ding

, Longjiang Qu, Qiang Wang, Jin Yuan, Pingzhi Yuan:
Permutation Trinomials Over Finite Fields with Even Characteristic. 79-92 - Ciprian Borcea, Ileana Streinu, Shin-ichi Tanigawa:

Periodic Body-and-Bar Frameworks. 93-112 - Steffen Borgwardt, Elisabeth Finhold, Raymond Hemmecke:

On the Circuit Diameter of Dual Transportation Polyhedra. 113-121 - Stefan Kratsch, Marcin Pilipczuk

, Michal Pilipczuk, Magnus Wahlström
:
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. 122-144 - Daniel C. McDonald:

On-Line Vertex Ranking of Trees. 145-156 - Max A. Alekseyev

, Marina G. Basova, Nikolai Yu. Zolotykh
:
On the Minimal Teaching Sets of Two-Dimensional Threshold Functions. 157-165 - Michele Conforti, Alberto Del Pia

, Marco Di Summa, Yuri Faenza, Roland Grappe:
Reverse Chvátal-Gomory Rank. 166-181 - Cristopher Moore

, Alexander Russell
:
Approximate Representations, Approximate Homomorphisms, and Low-Dimensional Embeddings of Groups. 182-197 - János Barát

, Vida Dujmovic, Gwenaël Joret, Michael S. Payne
, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood
:
Empty Pentagons in Point Sets with Collinearities. 198-209 - Huy Tài Hà

, Kuei-Nuan Lin
:
Normal 0-1 Polytopes. 210-223 - Fabrício Siqueira Benevides

, Michal Przykucki
:
Maximum Percolation Time in Two-Dimensional Bootstrap Percolation. 224-251 - Jaroslaw Grytczuk

, Wojciech Lubawski:
Splitting Multidimensional Necklaces and Measurable Colorings of Euclidean Spaces. 252-258 - José A. Soto:

Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning. 259-268 - Martin E. Malandro

:
Fourier Inversion for Finite Inverse Semigroups. 269-296 - Maria Chudnovsky

, Sergey Norin, Bruce A. Reed, Paul D. Seymour
:
Excluding a Substar and an Antisubstar. 297-308 - Michael A. Henning

, Anders Yeo
:
Total Transversals in Hypergraphs and Their Applications. 309-320 - Guido F. Montúfar, Jason Morton:

When Does a Mixture of Products Contain a Product of Mixtures? 321-347 - Petr A. Golovach

, Daniël Paulusma
, Erik Jan van Leeuwen:
Induced Disjoint Paths in Claw-Free Graphs. 348-375 - Igor E. Shparlinski

:
Cayley Graphs Generated by Small Degree Polynomials over Finite Fields. 376-381 - Albrecht Böttcher, Lenny Fukshansky

, Stephan Ramon Garcia
, Hiren Maharaj
:
On Lattices Generated by Finite Abelian Groups. 382-404 - Stephane Durocher, Debajyoti Mondal:

Plane 3-Trees: Embeddability and Approximation. 405-420 - Richard Montgomery

:
Almost All Friendly Matrices Have Many Obstructions. 421-430 - Brendon Rhoades:

Alexander Duality and Rational Associahedra. 431-460 - Melody Chan

, Darren B. Glass, Matthew Macauley, David Perkinson, Caryn Werner, Qiaoyu Yang:
Sandpiles, Spanning Trees, and Plane Duality. 461-471 - David Conlon

, Jacob Fox, William I. Gasarch, David G. Harris, Douglas Ulrich, Samuel Zbarsky:
Distinct Volume Subsets. 472-480 - Péter L. Erdös

, István Miklós, Zoltán Toroczkai
:
A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix. 481-499 - Andrzej Grzesik

, Michal Morayne, Malgorzata Sulkowska:
From Directed Path to Linear Order - The Best Choice Problem for Powers of Directed Path. 500-513 - Brendan Murphy

, Oliver Roche-Newton
, Ilya D. Shkredov
:
Variations on the Sum-Product Problem. 514-540 - Valentas Kurauskas, Katarzyna Rybarczyk:

On the Chromatic Index of Random Uniform Hypergraphs. 541-558 - Mareike Fischer

, Leo van Iersel, Steven Kelk, Céline Scornavacca:
On Computing the Maximum Parsimony Score of a Phylogenetic Network. 559-585 - Michael Fuchs

, Chung-Kuei Lee:
The Wiener Index of Random Digital Trees. 586-614 - Tian-Yi Jiang, Ziv Scully

, Yan X. Zhang:
Motors and Impossible Firing Patterns in the Parallel Chip-Firing Game. 615-630 - Nader H. Bshouty, Hanna Mazzawi:

On Parity Check (0, 1)-Matrix over ℤp. 631-657 - Richard P. Stanley, Fabrizio Zanello:

The Catalan Case of Armstrong's Conjecture on Simultaneous Core Partitions. 658-666 - Xiang-Ke Chang

, Xing-Biao Hu, Guoce Xin:
Hankel Determinant Solutions to Several Discrete Integrable Systems and the Laurent Property. 667-682 - Valérie Gauthier-Umaña

, Mauricio Velasco
:
Dual Toric Codes and Polytopes of Degree One. 683-692 - Darryn E. Bryant

, Daniel Horsley
:
Steiner Triple Systems without Parallel Classes. 693-696
Volume 29, Number 2, 2015
- Jing Xi, Ruriko Yoshida:

The Characteristic Imset Polytope of Bayesian Networks with Ordered Nodes. 697-715 - Florian Pfender

:
Combined Degree and Connectivity Conditions for H-Linked Graphs. 716-729 - Peter Nelson:

Matroids Denser than a Projective Geometry. 730-735 - Nathan Reading

:
Noncrossing Arc Diagrams and Canonical Join Representations. 736-750 - Xavier Allamigeon, Pascal Benchimol, Stéphane Gaubert, Michael Joswig

:
Tropicalizing the Simplex Algorithm. 751-795 - Peter Nelson, Stefan H. M. van Zwam:

Matroids Representable Over Fields With a Common Subfield. 796-810 - József Balogh, Gelasio Salazar:

Book Embeddings of Regular Graphs. 811-822 - Maximilien Gadouleau, Nicholas Georgiou

:
New Constructions and Bounds for Winkler's Hat Game. 823-834 - Magnus Bordewich

, Charles Semple
:
Defining a Phylogenetic Tree with the Minimum Number of r-State Characters. 835-853 - Ayça Çesmelioglu, Wilfried Meidl, Alexander Pott:

Bent Functions, Spreads, and o-Polynomials. 854-867 - Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:

Turán Problems and Shadows III: Expansions of Graphs. 868-876 - Manuel Lafond, Ben Seamone:

Hamiltonian Chordal Graphs are not Cycle Extendable. 877-887 - René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:

Network-Based Vertex Dissolution. 888-914 - José Correa, Omar Larré, José A. Soto:

TSP Tours in Cubic Graphs: Beyond 4/3. 915-939 - Katharina T. Huber

, George Kettleborough:
Distinguished Minimal Topological Lassos. 940-961 - Julia Böttcher

, Yoshiharu Kohayakawa
, Anusch Taraz, Andreas Würfl:
An Extension of the Blow-up Lemma to Arrangeable Graphs. 962-1001 - Jonathan L. Gross, Toufik Mansour

, Thomas W. Tucker, David G. L. Wang
:
Log-Concavity of Combinations of Sequences and Applications to Genus Distributions. 1002-1029 - Guantao Chen, Ronald J. Gould, Kazuhide Hirohata, Katsuhiro Ota, Songling Shan

:
Disjoint Chorded Cycles of the Same Length. 1030-1041 - Mihyun Kang

, Christoph Koch, Angélica Pachón
:
The Phase Transition in Multitype Binomial Random Graphs. 1042-1064 - Barnaby Martin

, Florent R. Madelaine
, Juraj Stacho:
Constraint Satisfaction with Counting Quantifiers. 1065-1113 - Ignacio Cascudo

, Ronald Cramer, Diego Mirandola, Carles Padró, Chaoping Xing
:
On Secret Sharing with Nonlinear Product Reconstruction. 1114-1131
Volume 29, Number 3, 2015
- Zhihan Gao:

On the Metric s-t Path Traveling Salesman Problem. 1133-1149 - George B. Mertzios

:
The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial. 1150-1185 - Roman Glebov, Anita Liebenau

, Tibor Szabó:
On the Concentration of the Domination Number of the Random Graph. 1186-1206 - Yair Bartal, Lee-Ad Gottlieb

, Ofer Neiman:
On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp. 1207-1222 - David J. Galvin

, Jeff Kahn, Dana Randall, Gregory B. Sorkin
:
Phase coexistence and torpid mixing in the 3-coloring model on ℤd. 1223-1244 - Miriam Farber, Charles R. Johnson, Leon Zhang:

The Number of Interlacing Equalities Resulting from Removal of a Vertex from a Tree. 1245-1258 - Bernd Schulze

, Shin-ichi Tanigawa:
Infinitesimal Rigidity of Symmetric Bar-Joint Frameworks. 1259-1286 - David Adjiashvili, Timm Oertel

, Robert Weismantel:
A Polyhedral Frobenius Theorem with Applications to Integer Optimization. 1287-1302 - Cristopher Moore

, Alexander Russell
:
Optimal ε-Biased Sets with Just a Little Randomness. 1303-1311 - Michael Elkin, Ofer Neiman, Shay Solomon:

Light Spanners. 1312-1321 - Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:

Detecting and Counting Small Pattern Graphs. 1322-1339 - Jayadev Acharya

, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
String Reconstruction from Substring Compositions. 1340-1371 - Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth:

Computing Opaque Interior Barriers à la Shermer. 1372-1386 - Barbora Candráková, Robert Lukot'ka

:
Avoiding 5-Circuits in 2-Factors of Cubic Graphs. 1387-1405 - Péter Csikvári, Zhicong Lin:

Homomorphisms of Trees into a Path. 1406-1422 - Guantao Chen, Hikoe Enomoto, Kenta Ozeki

, Shoichi Tsuchiya:
Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs. 1423-1426 - Petr A. Golovach

, Pinar Heggernes, Pim van 't Hof
, Christophe Paul
:
Hadwiger Number of Graphs with Small Chordality. 1427-1451 - Kshipra Bhawalkar, Jon M. Kleinberg, Kevin Lewi, Tim Roughgarden, Aneesh Sharma:

Preventing Unraveling in Social Networks: The Anchored k-Core Problem. 1452-1475 - Lisa Espig, Alan M. Frieze

, Michael Krivelevich, Wesley Pegden
:
Walker-Breaker Games. 1476-1485 - Claudio M. Qureshi, Daniel Panario

:
Rédei Actions on Finite Fields and Multiplication Map in Cyclic Group. 1486-1503 - Victor Falgas-Ravry

, Edward Marchant, Oleg Pikhurko
, Emil R. Vaughan:
The Codegree Threshold for 3-Graphs with Independent Neighborhoods. 1504-1539 - Yeow Meng Chee

, Han Mao Kiah, Punarbasu Purkayastha, Patrick Solé:
Product Construction of Affine Codes. 1540-1552 - Louis DeBiasio, Daniela Kühn, Theodore Molla

, Deryk Osthus, Amelia Taylor:
Arbitrary Orientations of Hamilton Cycles in Digraphs. 1553-1584 - Deeparnab Chakrabarty, Zhiyi Huang

:
Recognizing Coverage Functions. 1585-1599 - Clemens Heuberger, Daniel Krenn

, Stephan G. Wagner:
Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis. 1600-1653 - Michael Krivelevich, Daniel Reichman, Wojciech Samotij

:
Smoothed Analysis on Connected Graphs. 1654-1669 - Ross J. Kang

, János Pach, Viresh Patel, Guus Regts:
A Precise Threshold for Quasi-Ramsey Numbers. 1670-1682 - Dennis Clemens

, Asaf Ferber
, Roman Glebov, Dan Hefetz
, Anita Liebenau
:
Building Spanning Trees Quickly in Maker-Breaker Games. 1683-1705 - Shou-Jun Xu, Rob Gysel, Dan Gusfield:

Minimum Average Distance Clique Trees. 1706-1734 - Marthe Bonamy:

Planar graphs with Δ ≥ 8 are (Δ+1)-edge-choosable. 1735-1763 - Attila Bernáth, Yusuke Kobayashi, Tatsuya Matsuoka:

The Generalized Terminal Backup Problem. 1764-1782
Volume 29, Number 4, 2015
- Joel A. Tropp:

Integer Factorization of a Positive-Definite Matrix. 1783-1791 - Daniel W. Cranston

, Landon Rabern:
Graphs with χ=Δ Have Big Cliques. 1792-1814 - Prachi Goyal, Neeldhara Misra, Fahad Panolan

, Meirav Zehavi
:
Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets. 1815-1836 - Nicola Apollonio

, Anna Galluccio:
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths. 1837-1863 - Valentin Garnero, Christophe Paul

, Ignasi Sau
, Dimitrios M. Thilikos:
Explicit Linear Kernels via Dynamic Programming. 1864-1894 - Juan Carlos Vera

, Eric Vigoda, Linji Yang:
Improved Bounds on the Phase Transition for the Hard-Core Model in 2 Dimensions. 1895-1915 - Emanuele Delucchi

, Martin Dlugosch:
Bergman Complexes of Lattice Path Matroids. 1916-1930 - Sepp Hartung, André Nichterlein:

NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. 1931-1960 - Ivan Bliznets

, Fedor V. Fomin
, Marcin Pilipczuk
, Michal Pilipczuk:
A Subexponential Parameterized Algorithm for Proper Interval Completion. 1961-1987 - Qizhong Lin, Yusheng Li:

A Folkman Linear Family. 1988-1998 - Choongbum Lee, Sang-il Oum:

Number of Cliques in Graphs with a Forbidden Subdivision. 1999-2005 - Ross M. McConnell, Yahav Nussbaum:

Linear-Time Recognition of Probe Interval Graphs. 2006-2046 - Nicolas Bousquet

, Aurélie Lagoutte
, Zhentao Li, Aline Parreau, Stéphan Thomassé
:
Identifying Codes in Hereditary Classes of Graphs and VC-Dimension. 2047-2064 - Daniel Irving Bernstein

, Lam Si Tung Ho, Colby Long, Mike A. Steel
, Katherine St. John, Seth Sullivant
:
Bounds on the Expected Size of the Maximum Agreement Subtree. 2065-2074 - Atsuhiro Nakamoto, Kenta Noguchi

, Kenta Ozeki
:
Extension to Even Triangulations. 2075-2087 - Jennifer Diemunsch, Michael Ferrara, Sogol Jahanbekam

, James M. Shook
:
Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem. 2088-2099 - Anton Deitmar:

Ihara Zeta Functions of Infinite Weighted Graphs. 2100-2116 - Gordon F. Royle

, Alan D. Sokal
:
Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs. 2117-2159 - Kosta Dosen, Zoran Petric:

A Planarity Criterion for Graphs. 2160-2165 - Yi Wang, Jian Cheng, Rong Luo, Cun-Quan Zhang:

Vector Flows and Integer Flows. 2166-2178 - Gabriel Coutinho

, Henry Liu
:
No Laplacian Perfect State Transfer in Trees. 2179-2188 - Seth Pettie:

Three Generalizations of Davenport-Schinzel Sequences. 2189-2238 - Telikepalli Kavitha, Nithin M. Varma

:
Small Stretch Pairwise Spanners and Approximate D-Preservers. 2239-2254 - Andrzej Dudek, Alan M. Frieze

, Charalampos E. Tsourakakis
:
Rainbow Connection of Random Regular Graphs. 2255-2266 - Ignacio García-Marco

, Jorge Luis Ramírez Alfonsín:
Matroid Toric Ideals: Complete Intersection, Minors, and Minimal Systems of Generators. 2267-2276 - Shmuel Onn

, Pauline Sarrabezolles:
Huge Unimodular n-Fold Programs. 2277-2283 - Valentin Féray

:
Cyclic Inclusion-Exclusion. 2284-2311 - Maximilien Gadouleau, Adrien Richard

, Søren Riis
:
Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory. 2312-2335 - Daniel J. Harvey, David R. Wood

:
Cycles of Given Size in a Dense Graph. 2336-2349 - Felix Joos:

Random Subgraphs in Sparse Graphs. 2350-2360 - Johan Thapper

, Stanislav Zivný:
Necessary Conditions for Tractability of Valued CSPs. 2361-2384 - Katherine Edwards, Dong Yeap Kang

, Jaehoon Kim
, Sang-il Oum, Paul D. Seymour
:
A Relative of Hadwiger's Conjecture. 2385-2388 - Vsevolod F. Lev:

Edge-Isoperimetric Problem for Cayley Graphs and Generalized Takagi Functions. 2389-2411 - Wei-Fan Wang, Danjun Huang:

A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree. 2412-2431

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID













