default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 10
Volume 10, Number 1, 1997
- J. Hyam Rubinstein, Doreen A. Thomas, Nicholas C. Wormald:
Steiner Trees for Terminals Constrained to Curves. 1-17 - Svante Linusson:
Partitions with Restricted Block Sizes, Möbius Functions, and the k-of-Each Problem. 18-29 - Nabil Kahalé
:
Isoperimetric Inequalities and Eigenvalues. 30-40 - George E. Andrews, Davide Crippa, Klaus Simon:
q-Series Arising From The Study of Random Graphs. 41-56 - Martin Juvan, Bojan Mohar:
Obstructions For 2-Möbius Band Embedding Extension Problem. 57-72 - L. Bruce Richmond, Donatella Merlini:
Stirling Numbers for Complex Arguments. 73-82 - Peter C. Fishburn, Jerry S. Kelly:
Super Arrovian Domains with Strict Preferences. 83-95 - Regina Urbaniak, Robert Weismantel, Günter M. Ziegler:
A Variant of the Buchberger Algorithm for Integer Programming. 96-108 - Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs. 109-127 - Pascale Charpin, Victor A. Zinoviev:
On Coset Weight Distributions of the 3-Error-Correcting BCH-Codes. 128-145 - Siddharthan Ramachandramurthi:
The Structure and Number of Obstructions to Treewidth. 146-157 - András Frank, Alexander V. Karzanov, András Sebö:
On Integer Multiflow Maximization. 158-170
Volume 10, Number 2, 1997
- Leandros Tassiulas:
Worst Case Length of Nearest Neighbor Tours for the Euclidean Traveling Salesman Problem. 171-179 - Andreas Hefner:
A Min-Max Theorem for a Constrained Matching Problem. 180-189 - Bo Yu, Joseph Cheriyan, Penny E. Haxell:
Hypercubes and Multicommodity Flows. 190-200 - Mark Ramras:
Congestion-free Optimal Routings of Hypercube Automorphisms. 201-208 - Raphael Yuster, Uri Zwick:
Finding Even Cycles Even Faster. 209-222 - Ron Holzman, Yosi Marcus, David Peleg:
Load Balancing in Quorum Systems. 223-245 - Michael Drmota, Michèle Soria:
Images and Preimages in Random Mappings. 246-269 - Chris J. Mitchell:
De Bruijn Sequences and Perfect Factors. 270-281 - Nicolas Sendrier:
On the Dimension of the Hull. 282-293 - Satoru Fujishige:
A Min-Max Theorem for Bisubmodular Polyhedra. 294-308 - Edward A. Bertram, Peter Horák:
Decomposing 4-Regular Graphs into Triangle-Free 2-Factors. 309-317 - Béla Bollobás, Graham R. Brightwell:
The Structure of Random Graph Orders. 318-335
Volume 10, Number 3, 1997
- Arvind Gupta, Russell Impagliazzo:
Bounding the Size of Planar Intertwines. 337-358 - Angèle M. Hamel, Michael Anthony Steel:
The Length of a Leaf Coloration on a Random Binary Tree. 359-372 - Hal A. Kierstead:
Classes of Graphs that Are Not Vertex Ramsey. 373-380 - Neil J. Calkin, Paul Erdös, Craig A. Tovey:
New Ramsey Bounds from Cyclic Graphs of Prime Order. 381-387 - J. F. Weng:
Linear Steiner Trees for Infinite Spirals. 388-398 - Derek G. Corneil, Stephan Olariu, Lorna Stewart:
Asteroidal Triple-Free Graphs. 399-430 - Aravamuthan Sarangarajan:
A Lower Bound for Adjacencies on the Traveling Salesman Polytope. 431-435 - J. Scott Provan, Manoj K. Chari:
Counting Problems Associated With Steiner Trees In Graphs. 436-446 - Jean-Pierre Tillich, Gilles Zémor:
Optimal Cycle Codes Constructed From Ramanujan Graphs. 447-459 - Michael J. Adams, Bryan L. Shader:
A Construction for (t, m, s)-nets in Base q. 460-468 - Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki:
Computing All Small Cuts in an Undirected Network. 469-481 - Shao C. Fang, Santosh S. Venkatesh:
A Threshold Function for Harmonic Update. 482-498 - Lily Yen:
A Combinatorial Proof for Stockhausen's Problem. 499-504 - Mourad Baïou, Ali Ridha Mahjoub:
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs. 505-514
Volume 10, Number 4, 1997
- Graham R. Brightwell, William T. Trotter:
The Order Dimension of Planar Maps. 515-528 - Jan Arne Telle, Andrzej Proskurowski:
Algorithms for Vertex Partitioning Problems on Partial k-Trees. 529-550 - Andrew V. Goldberg, Robert Kennedy:
Global Price Updates Help. 551-572 - Cynthia A. Phillips, Clifford Stein, Joel Wein:
Task Scheduling in Networks. 573-598 - Lenwood S. Heath, Sriram V. Pemmaraju:
Stack and Queue Layouts of Posets. 599-625 - André Bouchet:
Multimatroids I. Coverings by Independent Sets. 626-646 - Eyal Kushilevitz, Yishay Mansour:
Randomness in Private Computations. 647-661 - Itsik Pe'er, Ron Shamir:
Realizing Interval Graphs with Size and Distance Constraints. 662-687
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.
last updated on 2025-10-30 00:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
