default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 13
Volume 13, Number 1, 2000
- Tao Jiang, Dhruv Mubayi, Aditya Shastri, Douglas B. West:
Correction to Edge-Bandwidth of Graphs. 1 - Jaikumar Radhakrishnan, Amnon Ta-Shma
:
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators. 2-24 - Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Brendan D. McKay:
Nonhamiltonian 3-Connected Cubic Planar Graphs. 25-32 - John Ginsburg, Bill Sands:
Completely Disconnecting the Complete Graph. 33-47 - Chính T. Hoàng, Van Bang Le:
Recognizing Perfect 2-Split Graphs. 48-55 - Han Hoogeveen, Arjen P. A. Vestjens:
A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine. 56-63 - Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jirí Sgall, Leen Stougie:
Multiprocessor Scheduling with Rejection. 64-78 - Angela I. Barbero, Carlos Munuera:
The Weight Hierarchy of Hermitian Codes. 79-104 - Anne Canteaut, Pascale Charpin, Hans Dobbertin:
Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences. 105-138 - Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra, Ralph Tindell:
On Isoperimetric Connectivity in Vertex-Transitive Graphs. 139-144
Volume 13, Number 2, 2000
- Lisa Fleischer, James B. Orlin:
Optimal Rounding of Instantaneous Fractional Flows Over Time. 145-153 - Gerald J. Janusz:
Overlap and Covering Polynomials with Applications to Designs and Self-Dual Codes. 154-178 - Jørgen Bang-Jensen, Jing Huang, Anders Yeo:
Convex-Round and Concave-Round Graphs. 179-193 - Rodney W. Forcade, Jack Lamoreaux:
Lattice-Simplex Coverings and the 84-Shape. 194-201 - Yair Caro, Douglas B. West, Raphael Yuster:
Connected Domination and Spanning Trees with Many Leaves. 202-211 - Endre Boros, Yves Crama, Oya Ekin, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan:
Boolean Normal Forms, Shellability, and Reliability Computations. 212-226 - Satoshi Fujita, Masafumi Yamashita, Tiko Kameda:
A Study on r-Configurations - A Resource Assignment Problem on Graphs. 227-254 - Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin:
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. 255-267 - Fred S. Annexstein, Kenneth A. Berman:
Directional Routing via Generalized st-Numberings. 268-279
Volume 13, Number 3, 2000
- Michel X. Goemans, David P. Williamson:
Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler. 281-294 - Martín Cera, Ana Diánez, Alberto Márquez:
The Size of a Graph Without Topological Complete Subgraphs. 295-301 - Peter L. Hammer, Alexander Kogan, Uriel G. Rothblum:
Evaluation, Strength, and Relevance of Variables of Boolean Functions. 302-312 - Till Nierhoff:
A Tight Bound on the Irregularity Strength of Graphs. 313-323 - Amos Beimel, Mike Burmester, Yvo Desmedt, Eyal Kushilevitz:
Computing Functions of a Shared Secret. 324-345 - Ljiljana Brankovic, Peter Horák, Mirka Miller:
An Optimization Problem in Statistical Databases. 346-353 - Michael Naatz:
The Graph of Linear Extensions Revisited. 354-369 - Bala Kalyanasundaram, Kirk Pruhs:
The Online Transportation Problem. 370-383 - Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis:
Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings. 384-402 - Samir Khuller, Yoram J. Sussmann:
The Capacitated K-Center Problem. 403-418
Volume 13, Number 4, 2000
- George Steiner, Paul Stephenson:
Subset-Restricted Interchange for Dynamic Min-Max Scheduling Problems. 419-435 - Boaz Patt-Shamir, Yiannis Tsiounis, Yair Frankel:
Exact Analysis of Exact Change: The k-Payment Problem. 436-453 - Fedor V. Fomin, Petr A. Golovach:
Graph Searching and Interval Completion. 454-464 - Andreas Birkendorf, Andreas Böker, Hans Ulrich Simon:
Learning Deterministic Finite Automata from Smallest Counterexamples. 465-491 - Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor:
Bounds for Codes Identifying Vertices in the Hexagonal Grid. 492-504 - Lisa Fleischer:
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. 505-520 - Jeffrey C. Lagarias:
Well-Spaced Labelings of Points in Rectangular Grids. 521-534 - Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan:
Learning Polynomials with Queries: The Highly Noisy Case. 535-570 - Hegang Chen, Ching-Shui Cheng:
Uniqueness of Some Resolution IV Two-Level Regular Fractional Factorial Designs. 571-575
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-01-09 19:20 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:
