default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 17
Volume 17, Number 1, 2003
- Amy N. Myers, Herbert S. Wilf:
Some New Aspects of the Coupon Collector's Problem. 1-17 - Walid Ben-Ameur, Éric Gourdin:
Internet Routing and Related Topology Issues. 18-49 - Eric Gottlieb
:
On the Homology of the h, k-Equal Dowling Lattice. 50-71 - Tibor Jordán, Zoltán Szigeti:
Detachments Preserving Local Edge-Connectivity of Graphs. 72-87 - Tibor Jordán:
Constrained Edge-Splitting Problems. 88-102 - Horacio Tapia-Recillas, Gerardo Vega:
On Z2k-Linear and Quaternary Codes. 103-113 - Benoît Larose, László Zádori:
The Complexity of the Extendibility Problem for Finite Posets. 114-121 - Jesús Mario Bilbao:
Cooperative Games under Augmenting Systems. 122-133 - Ronald Fagin, Ravi Kumar, D. Sivakumar:
Comparing Top k Lists. 134-160 - Tomás Feder, Pavol Hell, Bojan Mohar:
Acyclic Homomorphisms and Circular Colorings of Digraphs. 161-169
Volume 17, Number 2, 2003
- Gitit Ruckenstein, Ron M. Roth:
Bounds on the List-Decoding Radius of Reed-Solomon Codes. 171-195 - Luo Yuan, Wende Chen, A. J. Han Vinck:
The Determination of the Chain Good Weight Hierarchies with High Dimension. 196-209 - Xueliang Li, Lusheng Wang:
Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids. 210-218 - M. Cemil Azizouglu, Ömer Eugeciouglu:
Extremal Sets Minimizing Dimension-Normalized Boundary in Hamming Graphs. 219-236 - Moshe Lewenstein, Maxim Sviridenko:
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP. 237-248 - Shmuel Onn:
Convex Matroid Optimization. 249-253 - André Barbé, Fritz von Haeseler:
Symmetric Codes over Rings. 254-263 - Wei-Fan Wang, Ko-Wei Lih:
Labeling Planar Graphs with Conditions on Girth and Distance Two. 264-275 - Navin Kashyap, Paul H. Siegel:
Equalities among Capacities of (d, k)-Constrained Systems. 276-297 - Navin Kashyap:
Maximizing the Shannon Capacity of Constrained Systems with Two Constraints. 298-319 - John P. Georges, David W. Mauro:
On Regular Graphs Optimally Labeled with a Condition at Distance Two. 320-331
Volume 17, Number 3, 2004
- Andreas Brandstädt, Van Bang Le:
Split-Perfect Graphs: Characterizations and Algorithmic Use. 341-360 - Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö:
Coloring the Maximal Cliques of Graphs. 361-376 - William D. Banks, Alessandro Conflitti, Igor E. Shparlinski:
Number Theoretic Designs for Directed Regular Graphs of Small Diameter. 377-383 - Christine T. Cheng:
Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings. 384-402 - Stefanie Gerke, Colin McDiarmid:
Graph Imperfection with a Co-Site Constraint. 403-425 - Alexander Barg, Gilles Zémor:
Error Exponents of Expander Codes under Linear-Complexity Decoding. 426-445 - W. R. Chen, Frank K. Hwang, Xuding Zhu:
Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks. 446-452 - Andrei A. Krokhin, Peter Jeavons, Peter Jonsson:
Constraint Satisfaction Problems on Intervals and Length. 453-477 - Randall Dougherty, Vance Faber:
The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case. 478-519
Volume 17, Number 4, 2004
- Michele Flammini, Stéphane Pérennes:
Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols. 521-540 - Luca Trevisan:
On Local Versus Global Satisfiability. 541-547 - Vu Dong Tô, Reihaneh Safavi-Naini:
On the Maximal Codes of Length 3 with the 2-Identifiable Parent Property. 548-570 - Hal A. Kierstead, Yingxian Zhu:
Radius Three Trees in Graphs with Large Chromatic Number. 571-581 - Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins:
Minimizing Wirelength in Zero and Bounded Skew Clock Trees. 582-595 - Jack E. Graver:
Encoding Fullerenes and Geodesic Domes. 596-614 - Erik Ordentlich, Ron M. Roth:
Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints. 615-623 - Guy Kindler, Dan Romik:
On Distributions Computable by Random Walks on Graphs. 624-633 - Nabil H. Mustafa, Aleksandar Sasa Pekec:
Listen to Your Neighbors: How (Not) to Reach a Consensus. 634-660 - Francisco Barahona:
Fractional Packing of T-Joins. 661-669 - Valentino Crespi:
Exact Formulae for the Lova'sz Theta Function of Sparse Circulant Graphs. 670-674 - C. Robert Miers, Frank Ruskey:
Counting Strings with Given Elementary Symmetric Function Evaluations I: Strings over Zp with p Prime. 675-685
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 2026-01-29 02:09 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:
