Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarThe Electronic Journal of Combinatorics, Volume 12
Volume 12, 2005
Jeffrey H. Dinitz, Peter Dukes, Douglas R. Stinson:
Sequentially Perfect and Uniform One-Factorizations of the Complete Graph.- Tom Roby, Itaru Terada:
A Two-Dimensional Pictorial Presentation of Berele's Insertion Algorithm for Symplectic Tableaux. - Philippe Di Francesco, Paul Zinn-Justin:
Around the Razumov-Stroganov Conjecture: Proof of a Multi-Parameter Sum Rule. - Marek Janata, Martin Loebl, Jácint Szabó:
The Edmonds-Gallai Decomposition for the k-Piece Packing Problem. - Andreas Baltz, Peter Hegarty, Jonas Knape, Urban Larsson, Tomasz Schoen:
The Structure of Maximum Subsets of {1, ..., n} with No Solutions to a+b = kc. - Dale Beihoffer, Jemimah Hendry, Albert Nijenhuis, Stan Wagon:
Faster Algorithms for Frobenius Numbers. - E. Rodney Canfield, Brendan D. McKay:
Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums. - Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Chris C. Handley, Derek A. Holton, D. J. McCaughan, Hans P. van Ditmarsch:
Sorting Classes. - A. D. Forbes, Mike J. Grannell, Terry S. Griggs:
Steiner Triple Systems and Existentially Closed Graphs. - Kendra Killpatrick:
A Relationship between the Major Index for Tableaux and the Charge Statistic for Permutations. - Avraham Goldstein, Petr Kolman, Jie Zheng:
Minimum Common String Partition Problem: Hardness and Approximations. - Yuqin Zhang, Yonghui Fan:
Packing and Covering a Unit Equilateral Triangle with Equilateral Triangles. - Edward A. Bender, E. Rodney Canfield:
Locally Restricted Compositions I. Restricted Adjacent Differences. - Mike D. Atkinson, Maximillian M. Murphy, Nikola Ruskuc:
Pattern Avoidance Classes and Subpermutations. - Bhalchandra D. Thatte:
Kocay's Lemma, Whitney's Theorem, and some Polynomial Invariant Reconstruction Problems.
- Masao Ishikawa, Hiroyuki Kawamuko, Soichi Okada:
A Pfaffian-Hafnian Analogue of Borchardt's Identity. - Bostjan Bresar:
Vizing-like Conjecture for the Upper Domination of Cartesian Products of Graphs - The Proof. - Tomasz Dzido, Andrzej Nowik, Piotr Szuca:
New Lower Bound for Multicolor Ramsey Numbers for Even Cycles.
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-09-21 22:43 CEST by the dblp team