Volume 10,
Number 1,
1997
- J. H. Rubinstein, D. A. Thomas, Nicholas C. Wormald:
Steiner Trees for Terminals Constrained to Curves.
1-17
Electronic Edition (link) BibTeX
- Svante Linusson:
Partitions with Restricted Block Sizes, Möbius Functions, and the k-of-Each Problem.
18-29
Electronic Edition (link) BibTeX
- Nabil Kahale:
Isoperimetric Inequalities and Eigenvalues.
30-40
Electronic Edition (link) BibTeX
- George E. Andrews, Davide Crippa, Klaus Simon:
q-Series Arising From The Study of Random Graphs.
41-56
Electronic Edition (link) BibTeX
- Martin Juvan, Bojan Mohar:
Obstructions For 2-Möbius Band Embedding Extension Problem.
57-72
Electronic Edition (link) BibTeX
- L. Bruce Richmond, Donatella Merlini:
Stirling Numbers for Complex Arguments.
73-82
Electronic Edition (link) BibTeX
- Peter C. Fishburn, Jerry S. Kelly:
Super Arrovian Domains with Strict Preferences.
83-95
Electronic Edition (link) BibTeX
- Regina Urbaniak, Robert Weismantel, Günter M. Ziegler:
A Variant of the Buchberger Algorithm for Integer Programming.
96-108
Electronic Edition (link) BibTeX
- Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs.
109-127
Electronic Edition (link) BibTeX
- Pascale Charpin, Victor Zinoviev:
On Coset Weight Distributions of the 3-Error-Correcting BCH-Codes.
128-145
Electronic Edition (link) BibTeX
- Siddharthan Ramachandramurthi:
The Structure and Number of Obstructions to Treewidth.
146-157
Electronic Edition (link) BibTeX
- András Frank, Alexander V. Karzanov, András Sebö:
On Integer Multiflow Maximization.
158-170
Electronic Edition (link) BibTeX
Volume 10,
Number 2,
1997
Volume 10,
Number 3,
1997
- Arvind Gupta, Russell Impagliazzo:
Bounding the Size of Planar Intertwines.
337-358
Electronic Edition (link) BibTeX
- A. M. Hamel, Michael Anthony Steel:
The Length of a Leaf Coloration on a Random Binary Tree.
359-372
Electronic Edition (link) BibTeX
- Hal A. Kierstead:
Classes of Graphs that Are Not Vertex Ramsey.
373-380
Electronic Edition (link) BibTeX
- Neil J. Calkin, Paul Erdös, Craig A. Tovey:
New Ramsey Bounds from Cyclic Graphs of Prime Order.
381-387
Electronic Edition (link) BibTeX
- J. F. Weng:
Linear Steiner Trees for Infinite Spirals.
388-398
Electronic Edition (link) BibTeX
- Derek G. Corneil, Stephan Olariu, Lorna Stewart:
Asteroidal Triple-Free Graphs.
399-430
Electronic Edition (link) BibTeX
- A. Sarangarajan:
A Lower Bound for Adjacencies on the Traveling Salesman Polytope.
431-435
Electronic Edition (link) BibTeX
- J. Scott Provan, Manoj K. Chari:
Counting Problems Associated With Steiner Trees In Graphs.
436-446
Electronic Edition (link) BibTeX
- Jean-Pierre Tillich, Gilles Zémor:
Optimal Cycle Codes Constructed From Ramanujan Graphs.
447-459
Electronic Edition (link) BibTeX
- Michael J. Adams, Bryan L. Shader:
A Construction for (t, m, s)-nets in Base q.
460-468
Electronic Edition (link) BibTeX
- Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki:
Computing All Small Cuts in an Undirected Network.
469-481
Electronic Edition (link) BibTeX
- Shao C. Fang, Santosh S. Venkatesh:
A Threshold Function for Harmonic Update.
482-498
Electronic Edition (link) BibTeX
- Lily Yen:
A Combinatorial Proof for Stockhausen's Problem.
499-504
Electronic Edition (link) BibTeX
- Mourad Baïou, Ali Ridha Mahjoub:
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs.
505-514
Electronic Edition (link) BibTeX
Volume 10,
Number 4,
1997
Copyright © Sun May 17 00:19:00 2009
by Michael Ley (ley@uni-trier.de)
