Text

SIAM Journal on Discrete Mathematics | Vol. 28 No.4

---

Table of Contents:
- Enumeration of 2-polymatroids on up to seven elements (Thomas J. Savitsky)
- Sink-stable sets of disgraphs (Dóra Erdös, András Frank, and Krisztián Kun)
- On list coloring and list homomorphism of permutation and interval graphs (Jessica Enright, Lorna Stewart, and Gábor Tardos)
- On packing two graphs with bounded sum of sizes and maximum degree (Andrzej Żak)
- Testing similar means (Reut Levi, Dana Ron, and Ronitt Rubinfeld)
- Fully polynomial time approximation schemes for stochastic dynamic program (Nir Halman, Diego Klabjan, Chung-Lun Li, James Orlin, and David Simchi-Levi)
- Combinatorial conditions for the unique completability of low-rank matrices (Bill Jackson, Tibor Jordán, and Shin-ichi Tanigawa)
- On MOD (2s + 1)-orientations of graphs (Ping Li and Hong-Jian Lai)
- Oracle tractability of skew bisubmodular functions (Anna Huber and Andrei Krokhin)
- Spectral extremal problems for hypergraphs (Peter Keevash, John Lenz, and Dhruv Mubayi)
- A min-max theorem for transversal submodular functions and its implications (Satoru Fujishige and Shin-ichi Tanigawa)
- k-Blocks: A Connectivity Invariant for Graphs (J. Carmesin, R. Diestel, M. Hamann, and F. Hundertmark)
- Planar Graphs with ▲ ≥ 9 are Entirely (▲ +2)-Colorable (Yiqiao Wang, Xiaoxue Hu, and Weifan Wang)
- On a Family of Diamond-Free Strongly Regular Graphs (A. Mohammadian and B. Tayfeh-Rezaie)
- On the Enumeration of Minimal Dominating Sets and Related Notions (Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, and Lhouari Nourine)
- A Finite Family of Pseudodiscs Must Include a “Small” Pseudodisc (Rom Pinchasi)
- Upper Bound Constructions for Untangling Planar Geometric Graphs (Javier Cano, Csaba D. Tóth, and Jorge Urrutia)
- An Improved Kalai--Kleitman Bound for the Diameter of a Polyhedron (Michael J. Todd
- Making Octants Colorful and Related Covering Decomposition Problems (Jean Cardinal, Kolja Knauer, Piotr Micek, and Torsten Ueckerdt)
- Lower Bounds on Geometric Ramsey Functions (Marek Eliáš, Jiří Matoušek, Edgardo Roldán-Pensado, and Zuzana Safernová)
- From One Stable Marriage to the Next: How Long Is the Way? (Pavlos Eirinakis, Dimitrios Magos, and Ioannis Mourtos)
- On the Number of Graphs Without Large Cliques (Frank Mousset, Rajko Nenadov, and Angelika Steger)
- Cop and Robber Game and Hyperbolicity (Jérémie Chalopin, Victor Chepoi, Panos Papasoglu, and Timothée Pecatte)
- A Characterization of Generically Rigid Frameworks on Surfaces of Revolution (A. Nixon, J. C. Owen, and S. C. Power)
- Weighted Coloring in Trees (Julio Araujo, Nicolas Nisse, and Stéphane Pérennes)
- Longest Common Subsequences in Sets of Words (Boris Bukh and Jie Ma)

---

Availability

Detail Information

Series Title

-

Call Number

-

Publisher

Philadelphia USA : Society for Industrial and Applied Mathematics., 2015

Collation

-

Language

English

ISBN/ISSN

8954801

Classification

Unclass

Content Type

-

Media Type

-

Carrier Type

-

Edition

Vol. 28 No. 4 (Feb 2015)

Subject(s)

Mathematics
Savitsky, Thomas J.
Erdos, Dora
Frank, Andras
Kun, Krisztian
Enright, Jessica
Stewart, Lorna
Tardos, Gabor
Zak, Andrzej
Levi, Reut
Ron, Dana
Rubunfield, Ronitt
Halman, Nir
Klabjan, Diego
Chung-Lun Li
Orlin, James
Simchi-Levi, David
Jackson, Bill
Jordan, Tibor
Tanigawa, Shin-Ichi
Ping Li
Hong-Jian Lai
Huber, Anna
Krokhin, Andrei
Keevash, Peter
Lenz, John
Mubayi, Dhruv
Fujishige, Satoru
Carmesin, J
Diestel, R
Hamann, M.
Hundertmark, F.
Yiqiao Wang
Xiaoxue Hu
Weifan Wang
Mohammadian, A.
Tayfeh-Rezaie, B.
Limouzy, Vincent
Mary, Arnaud
Nourine, Lhouari
Pinchasi, Rom
Cano, Javier
Tóth, Csaba D.
Urrutia, Jorge
Todd, Michael J.
Cardinal, Jean
Knauer, Kolja
Micek, Piotr
Ueckerdt, Torsten

Specific Detail Info

Articles originally published online October to December 2014

Statement of Responsibility

D.P. Williamson

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment