Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 6
Volume 6, Number 1, February 1993
- A. Robert Calderbank, Philippe Delsarte:
On Error-Correcting Codes and Invariant Linear Forms. 1-23
- Gerard J. Chang, Martin Farber, Zsolt Tuza:
Algorithmic Aspects of Neighborhood Numbers. 24-29 - John Donald, John Elwin:
On the Structure of the Strong Orientations of a Graph. 30-43 - Antonio Machi, Filippo Mignosi:
Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups. 44-56 - S. Thomas McCormick, S. Frank Chang:
The Weighted Sparsity Problem: Complexity and Algorithms. 57-69 - Macdonald Morris, Gabriel A. Schachtel, Samuel Karlin:
Exact Formulas for Multitype Run Statistic in a Random Ordering. 70-86 - Huishan Zhou:
Characterization of the Homomorphic Preimages of Certain Oriented Cycles. 87-99 - E. Rodney Canfield:
Matchings in the Partition Lattice. 100-109 - Fan R. K. Chung, Prasad Tetali:
Communication Complexity and Quasi Randomness. 110-123 - Daniel M. Gordon:
Discrete Logarithms in GF(P) Using the Number Field Sieve. 124-138 - Paolo Nobili, Antonio Sassano:
Polyhedral Properties of Clutter Amalgam. 139-151 - Frank Ruskey, Carla D. Savage:
Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn. 152-166 - Michael J. Todd, Levent Tunçel:
A New Triangulation for Simplicial Algorithms. 167-180
Volume 6, Number 2, May 1993
- Hans L. Bodlaender, Rolf H. Möhring:
The Pathwidth and Treewidth of Cographs. 181-188 - Odile Favaron, Pedro Mago, Consuelo Maulino, Oscar Ordaz:
Hamiltonian Properties of Bipartite Graphs and Digraphs with Bipartite Independence 2. 189-196 - Bonita Rais, Philippe Jacquet, Wojciech Szpankowski:
Limiting Distribution for the Depth in Patricia Tries. 197-213 - Graham R. Brightwell, Edward R. Scheinerman:
Representations of Planar Graphs. 214-229 - Graham R. Brightwell, William T. Trotter:
The Order Dimension of Convex Polytopes. 230-245 - Peter Gritzmann, Bernd Sturmfels:
Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Basis. 246-269 - Gregory Z. Gutin:
Finding a Longest Path in a Complete Multipartite Digraph. 270-273 - Paul Helman, Bernard M. E. Moret, Henry D. Shapiro:
An Exact Characterization of Greedy Structures. 274-283 - Mihály Hujter, Zsolt Tuza:
The Number of Maximal Independent Sets in Triangle-Free Graphs. 284-288 - Ramana M. Idury, Alejandro A. Schäffer:
Triangulating Three-Colored Graphs in Linear Time and Linear Space. 289-293 - Jonathan Jedwab:
Barker Arrays I: Even Number of Elements. 294-308 - Jonathan Jedwab, Sheelagh Lloyd, Miranda Mowbray:
Barker Arrays II: ODD Numer of Elements. 309-328 - Kenneth R. Vollmar, Yanjun Zhang:
On the Enumeration of Steiner-Tree Topologies for the Points on a Circle. 329-333
Volume 6, Number 3, August 1993
- Jiazhen Cai:
Counting Embeddings of Planar Graphs Using DFS Trees. 335-352 - William Y. C. Chen:
Induced Cycle Structures of the Hyperoctahedral Group. 353-362 - Don Coppersmith, Prasad Tetali, Peter Winkler:
Collisions Among Random Walks on a Graph. 363-374 - Joseph Douglas Horton, Kyriakos Kilakos:
Minimum Edge Dominating Sets. 375-387 - Arnold Knopfmacher, J. N. Ridley:
Reciprocal Sums over Partitions and Compositions. 388-399 - Dieter Kratsch, Lorna Stewart:
Domination on Cocomparability Graphs. 400-417 - Rachid Saad:
Complexity of the Forwarding Index Problem. 418-427 - Cun-Quan Zhang:
Parity Subgraph, Shortest Cycle Cover and Postman Tour. 428-431 - Joan Feigenbaum, Jeremy A. Kahn, Carsten Lund:
Complexity Results for Pomset Languages. 432-442 - Mark K. Goldberg, Thomas H. Spencer:
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size. 443-459 - Ming-Yang Kao, Dan Gusfield:
Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test. 460-476 - Samir Khuller, Joseph Naor, Philip N. Klein:
The Lattice Structure of Flow in Planar Graphs. 477-490 - Jenö Töröcsik:
n+1 Segments Beat n. 491-500 - Andrew Vince:
Replicating Tessellations. 501-521
Volume 6, Number 4, August 1993
- Elias Dahlhaus:
Fast Parallel Recognition of Ultrametrics and Tree Metrics. 523-532 - Frank K. Hwang, Uriel G. Rothblum, Larry A. Shepp:
Monotone Optimal Multipartitions Using Schur Convexity with Respect to Partial Orders. 533-547 - Alon Orlitsky:
Interactive Communication of Balanced Distributions and of Correlated Files. 548-564 - S. Ueno, Anindo Bagchi, S. Louis Hakimi, Edward F. Schmeichel:
On Minimum Fault-Tolerant Networks. 565-574 - Gerhard J. Woeginger:
Improved Space for Bounded-Space, On-Line Bin-Packing. 575-581 - Jonathan J. Ashley, Brian H. Marcus, Dominique Perrin, Selim Tuncel:
Surjective Extensions of Sliding-Block Codes. 582-611 - Sylvia C. Boyd, Tianbao Hao:
An Integer Polytope Related to the Design of Survivable Communication Networks. 612-630 - Dominique de Werra, Nadimpalli V. R. Mahadev, Uri N. Peled:
Edge-Chromatic Scheduling with Simultaneity Constraints. 631-641 - Bojana Obrenic:
Embedding de Bruijn and Schuffle-Exchange Graphs in Five Pages. 642-654 - K. Wendy Tang, Bruce W. Arden:
Representations of Borel Cayley Graphs. 655-676 - Eric Goles Ch., Servet Martínez A.:
Errata: Lyapunov Functionals for Automata Networks Defined by Cyclically Monotone Functions. 677
a service of 
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 2023-09-20 21:32 CEST 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:
