default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 14
Volume 14, Number 1, 2001
- Miklós Ajtai, Nimrod Megiddo, Orli Waarts:
Improved Algorithms and Analysis for Secretary Problems and Generalizations. 1-27 - John P. Georges, David W. Mauro, Melanie I. Stein:
Labeling Products of Complete Graphs with a Condition at Distance Two. 28-35 - Mike A. Steel
:
Sufficient Conditions for Two Tree Reconstruction Techniques to Succeed on Sufficiently Long Sequences. 36-48 - David Hartvigsen:
Compact Representations of Cuts. 49-66 - Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk:
Better Approximation Guarantees for Job-Shop Scheduling. 67-92 - Nicholas Pippenger:
Enumeration of Equicolorable Trees. 93-115 - Michael Naatz:
A Note on a Question of C. D. Savage. 116-120 - Hikoe Enomoto, Mirko Hornák, Stanislav Jendrol':
Cyclic Chromatic Number of 3-Connected Plane Graphs. 121-137 - Michel X. Goemans:
Approximate Edge Splitting. 138-141
Volume 14, Number 2, 2001
- Jesús A. De Loera, Francisco Santos, Fumihiko Takeuchi:
Extremal Properties for Dissections of Convex 3-Polytopes. 143-161 - John B. Friedlander, Igor E. Shparlinski:
On the Distribution of Diffie-Hellman Triples with Sparse Exponents. 162-169 - Joseph Cheriyan, András Sebö, Zoltán Szigeti:
Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph. 170-180 - János Körner, Angelo Monti:
Compact Representations of the Intersection Structure of Families of Finite Sets. 181-192 - David A. Christie, Robert W. Irving:
Sorting Strings by Reversals and by Transpositions. 193-206 - Leszek Gasieniec, Andrzej Pelc, David Peleg:
The Wakeup Problem in Synchronous Broadcast Systems. 207-222 - Kevin D. Wayne:
A New Property and a Faster Algorithm for Baseball Elimination. 223-229 - Gill Barequet:
A Lower Bound for Heilbronn's Triangle Problem in d Dimensions. 230-236 - Chi-Jen Lu, Shi-Chun Tsai:
A Note on Iterating an alpha-ary Gray Code. 237-239 - Frank Ruskey, C. Robert Miers, Joe Sawada:
The Number of Irreducible Polynomials and Lyndon Words with Given Trace. 240-245 - Alexander A. Ageev, Refael Hassin, Maxim Sviridenko:
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts. 246-255 - Ryoh Fuji-Hara, Ying Miao, Jianxing Yin:
Optimal (9v, 4, 1) Optical Orthogonal Codes. 256-266 - Michele Flammini, Stephane Perennes:
On the Optimality of General Lower Bounds for Broadcasting and Gossiping. 267-282
Volume 14, Number 3, 2001
- Tim Boykett:
Construction of Ferrero Pairs of All Possible Orders. 283-285 - Krzysztof Brys, Zbigniew Lonc:
Monochromatic Partitions of Complete Uniform Hypergraphs. 286-290 - Young-Soo Myung:
An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting. 291-298 - Dorit Dor, Johan Håstad, Staffan Ulfberg, Uri Zwick:
On Lower Bounds for Selecting the Median. 299-311 - Dorit Dor, Uri Zwick:
Median Selection Requires (2+epsilon)n Comparisons. 312-325 - Thomas Erlebach, Klaus Jansen:
The Maximum Edge-Disjoint Paths Problem in Bidirected Trees. 326-355 - Gregory L. Smith:
Partitions and (m and n) Sums of Products - Two Cell Partition. 356-369 - Gerard J. Chang, Justie Su-tzu Juan, Daphne Der-Fen Liu:
Minimum Span of No-Hole (r+1)-Distant Colorings. 370-380 - Kazuhisa Makino, Tiko Kameda:
Transformations on Regular Nondominated Coteries and Their Applications. 381-407 - Guy Kortsarz, Robert Krauthgamer:
On Approximating the Achromatic Number. 408-422 - Alexander Barg, Gérard D. Cohen, Sylvia B. Encheva, Gregory A. Kabatiansky, Gilles Zémor:
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents. 423-431
Volume 14, Number 4, 2001
- Amir Daneshgar:
Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs. 433-445 - Lynn Margaret Batten, Jeremy M. Dover:
Blocking Semiovals of Type (1, m+1, n+1). 446-457 - Steven S. Seiden:
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing. 458-470 - Tomás Feder:
Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability. 471-480 - Noga Alon, Charles J. Colbourn, Alan C. H. Ling, Martin Tompa:
Equireplicate Balanced Binary Codes for Oligo Arrays. 481-497 - Rainer E. Burkard, Helidon Dollani, Yixun Lin, Günter Rote:
The Obnoxious Center Problem on a Tree. 498-509 - Weiping Shi, Douglas B. West:
Structural Diagnosis of Wiring Networks: Finding Connected Components of Unknown Subgraphs. 510-523 - Graham R. Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd:
Reserving Resilient Capacity in a Network. 524-539 - S. H. Huang, Frank K. Hwang:
When is Individual Testing Optimal for Nonadaptive Group Testing? 540-548 - Po-Ning Chen, Yunghsiang S. Han:
Asymptotic Minimum Covering Radius of Block Codes. 549-564
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-12-29 01:15 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:
