default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 3
Volume 3, Number 1, February 1990
- Hans-Jürgen Bandelt:
Recognition of Tree Metrics. 1-6 - Amotz Bar-Noy, Joseph Naor:
Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments. 7-20 - Béla Bollobás, Graham R. Brightwell:
Parallel Selection with High Probability. 21-31 - Béla Bollobás, Imre Leader:
An Isoperimetric Inequality on the Discrete Torus. 32-37 - M. Carter, Michael D. Hendy, David Penny, László A. Székely, Nicholas C. Wormald:
On the Distribution of Lengths of Evolutionary Trees. 38-47 - Olivier Goldschmidt, Dorit S. Hochbaum:
A Fast Perfect-Matching Algorithm in Random Graphs. 48-57 - Olivier Goldschmidt, Dorit S. Hochbaum:
Asymptotically Optimal Linear Algorithm for the Minimum k-Cut in a Random Graph. 58-73 - Péter Hajnal, Endre Szemerédi:
Brooks Coloring in Parallel. 74-80 - Maria M. Klawe, Daniel J. Kleitman:
An Almost Linear Time Algorithm for Generalized Matrix Searching. 81-97 - Anna Lubiw:
The Boolean Basis Problem and How to Cover Some Polygons by Rectangles. 98-115 - Jean-Luc Petit, Eric Térouanne:
A Theory of Proportional Representation. 116-139 - Muzhong Wang, Ian F. Blake:
Bit Serial Multiplication in Finite Fields. 140-148 - Jiang Zeng:
Calcul Saalschützien des Partitions et des Dérangements Colorés. 149-156
Volume 3, Number 2, May 1990
- Ilan Adler, Steven Cosares:
Advantageous Properties of Dual Transhipment Polyhedra. 157-167 - Jehoshua Bruck
:
Harmonic Analysis of Polynomial Threshold Functions. 168-177 - A. Robert Calderbank, Patrick Morton:
Quasi-Symmetric 3-Designs and Elliptic Curves. 178-196 - Dwight Duffus, Bill Sands, Peter Winkler:
Maximal Chains and Antichains in Boolean Lattices. 197-205 - Michael R. Fellows:
Transversals of Vertex Partitions in Graphs. 206-215 - Philippe Flajolet, Andrew M. Odlyzko:
Singularity Analysis of Generating Functions. 216-240 - G. Jacopini, Patrizia Mentrasti, G. Sontacchi:
Reversible Turing Machines and Polynomial Time Reversibly Computable Functions. 241-254 - Mauricio Karchmer, Avi Wigderson:
Monotone Circuits for Connectivity Require Super-Logarithmic Depth. 255-265 - Bruno Leclerc:
Medians and Majorities in Semimodular Lattices. 266-276 - Alexander Lubotzky:
Locally Symmetric Graphs of Prescribed Girth and Coxeter Groups. 277-280 - Teresa M. Przytycka, Józef H. Przytycki:
On a Lower Bound for Short Noncontractible Cycles in Embedded Graphs. 281-293 - Hans Ulrich Simon:
On Approximate Solutions for Combinatorial Optimization Problems. 294-310
Volume 3, Number 3, August 1990
- Kenneth A. Berman, Mokhtar H. Konsowa:
Random Paths and Cuts, Electrical Networks, and Reversible Markov Chains. 311-319 - Daniel Bienstock, Ernest F. Brickell, Clyde L. Monma:
On the Structure of Minimum-Weight k-Connected Spanning Networks. 320-329 - Nader H. Bshouty, Gadiel Seroussi:
Generalizations of the Normal Basis Theorem of Finite Fields. 330-337 - John Cremona, Susan Landau:
Shrinking Lattice Polyhedra. 338-348 - Ding-Zhu Du, Frank K. Hwang:
Optimal Assembly of an s-Stage k-OUT-OF-n System. 349-354 - Peter Frankl:
Canonical Antichains on the Circle and Applications. 355-363 - Gholamreza B. Khosrovshahi, S. Ajoodani-Namini:
A New Basis for Trades. 364-372 - Daniel J. Kleitman, Rakesh Vohra:
Computing the Bandwidth of Interval Graphs. 373-375 - Shlomo Moran, Yaron Wolfstahl:
One-Page Book Embedding Under Vertex-Neighborhood Constraints. 376-390 - Takao Nishizeki, Kenichi Kashiwagi:
On the 1.1 Edge-Coloring of Multigraphs. 391-410 - Hanif D. Sherali, Warren P. Adams:
A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems. 411-430 - Cun-Quan Zhang:
Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems. 431-438
Volume 3, Number 4, November 1990
- Martin Aigner, Eberhard Triesch:
Irregular Assignments of Trees and Forests. 439-449 - David J. Aldous:
The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees. 450-465 - Edward M. Bolger:
A Characterization of an Extension of the Banzhaf Value to Multicandidate Voting Games. 466-477 - Peter C. Fishburn:
Binary Probabilities Induced by Rankings. 478-488 - Peter C. Fishburn:
Thicknesses of Ordered Sets. 489-501 - Martin Grötschel, Clyde L. Monma:
Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints. 502-523 - Yahya Ould Hamidoune, Ralph Tindell:
Vertex Transitivity and Super Line Connectedness. 524-530 - Tung-Lin Lu, Pei-Hsin Ho, Gerard J. Chang:
The Domatic Number Problem in Interval Graphs. 531-536 - Yannis Manoussakis, Zsolt Tuza:
Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments. 537-543 - Oliver Pretzel, Dale Youngs:
Cycle Lengths and Graph Orientations. 544-553 - Vijaya Ramachandran:
A Minimax Arc Theorem for Reducible Flow Graphs. 554-560 - Carla D. Savage:
Generating Permutations with k-Differences. 561-573 - Lajos Takács:
On the Number of Distinct Forests. 574-581 - Craig A. Tovey:
A Simplified Anomaly and Reduction for Precedence Constrained Multiprocessor Scheduling. 582-584 - Tai-Ching Tuan, S. Louis Hakimi:
River Routing with a Small Number of Jogs. 585-597
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 2024-11-22 19:45 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:
