default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Discrete Mathematics, Volume 16
Volume 16, Number 1, 2002
- Eric Rémila:
On the Structure of Some Spaces of Tilings. 1-19 - Michal Parnas
, Dana Ron, Alex Samorodnitsky:
Testing Basic Boolean Formulae. 20-46 - Nicholas Pippenger:
Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs. 47-64 - Edgar M. Palmer, Ronald C. Read, Robert W. Robinson:
Counting Claw-Free Cubic Graphs. 65-73 - Karen L. Collins, Benjamin Shemmer:
Constructions of 3-Colorable Cores. 74-80 - Oliver Schirokauer:
The Special Function Field Sieve. 81-98 - Oleg Pikhurko:
Asymptotic Size Ramsey Results for Bipartite Graphs. 99-113 - Vasken Bohossian, Jehoshua Bruck:
Algebraic Techniques for Constructing Minimal Weight Threshold Functions. 114-126 - Lázaro Cánovas, Mercedes Landete, Alfredo Marín:
Facet Obtaining Procedures for Set Packing Problems. 127-155 - Klaus Dohmen:
Improved Inclusion-Exclusion Identities and Bonferroni Inequalities with Reliability Applications. 156-171
Volume 16, Number 2, 2003
- Yukiyasu Mutoh, Toshio Morihara, Masakazu Jimbo, Hung-Lin Fu:
The Existence of 2x4 Grid-Block Designs and Their Applications. 173-178 - Graeme Kemkes, Chiu Fan Lee, Donatella Merlini, L. Bruce Richmond:
Stirling Numbers for Complex Arguments: Asymptotics and Identities. 179-191 - Dorit S. Hochbaum, Maurice Queyranne:
Minimizing a Convex Cost Closure Set. 192-207 - Jean-Michel Autebert, Sylviane R. Schwer:
On Generalized Delannoy Paths. 208-223 - Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Douglas R. Stinson:
Contrast Optimal Threshold Visual Cryptography Schemes. 224-261 - Luke Pebody, A. J. Radcliffe, Alex D. Scott:
Finite Subsets of the Plane are 18-Reconstructible. 262-275 - Richard P. Brent, Shuhong Gao, Alan G. B. Lauder:
Random Krylov Spaces over Finite Fields. 276-287 - Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko:
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. 288-300 - Konrad Engel, Sven Guttmann:
Testing Bandwidth k for k-Connected Graphs. 301-312 - Maxim Sviridenko:
Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme. 313-322 - Hans-Jürgen Bandelt, Victor Chepoi:
1-Hyperbolic Graphs. 323-334 - Jørgen Bang-Jensen, Jing Huang, Anders Yeo:
Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs. 335-343
Volume 16, Number 3, 2003
- Brian Lucena:
A New Lower Bound for Tree-Width Using Maximum Cardinality Search. 345-353 - Jung Hee Cheon, Seongtaek Chee:
Nonlinearity of Boolean Functions and Hyperelliptic Curves. 354-365 - L. Sunil Chandran:
A High Girth Graph Construction. 366-370 - Svante Linusson, John Shareshian:
Complexes of t-Colorable Graphs. 371-389 - Ari Trachtenberg, Alexander Vardy:
Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist. 390-392 - Noga Alon, Seannie Dar, Michal Parnas, Dana Ron:
Testing of Clustering. 393-417 - Francesc Comellas, Margarida Mitjana:
The Spectra of Cycle Prefix Digraphs. 418-421 - Ravi Kumar, D. Sivakumar:
On Polynomial-Factor Approximations to the Shortest Lattice Vector Length. 422-425 - Daniel Král, Riste Skrekovski:
A Theorem about the Channel Assignment Problem. 426-437 - Yury Metelsky, Regina Tyshkevich:
Line Graphs of Helly Hypergraphs. 438-448 - Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani:
List Partitions. 449-478 - Xiangwei Liu, Gilbert Strang, Susan Ott:
Localized Eigenvectors from Widely Spaced Matrix Modifications. 479-498 - Simon R. Blackburn:
Frameproof Codes. 499-510 - Dion Gijswijt, Alexander Schrijver:
On the b-Stable Set Polytope of Graphs without Bad K4. 511-516
Volume 16, Number 4, 2003
- C. W. Ko, F. Bruce Shepherd:
Bipartite Domination and Simultaneous Matroid Covers. 517-523 - Raphael Yuster:
Equitable Coloring of k-Uniform Hypergraphs. 524-532 - Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Amortizing Randomness in Private Multiparty Computations. 533-544 - Fabio Scarabotti:
Fourier Analysis of a Class of Finite Radon Transforms. 545-554 - Brady Hunsaker, Anton J. Kleywegt, Martin W. P. Savelsbergh, Craig A. Tovey:
Optimal Online Algorithms for Minimax Resource Scheduling. 555-590 - Jon-Lark Kim, Keith E. Mellinger, Vera Pless:
Projections of Binary Linear Codes onto Larger Fields. 591-603 - Ioana Dumitriu, Prasad Tetali, Peter Winkler:
On Playing Golf with Two Balls. 604-615 - Sean Curran, Xingxing Yu:
Nonseparating Cycles in 4-Connected Graphs. 616-629 - Michael R. Capalbo:
An Explicit Construction of Lower-Diameter Cubic Graphs. 630-634 - Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel:
Graph Subcolorings: Complexity and Algorithms. 635-650 - Geir Agnarsson, Magnús M. Halldórsson:
Coloring Powers of Planar Graphs. 651-662 - Ian H. Dinwoodie, Edward Mosteig:
Statistical Inference for Internal Network Reliability with Spatial Dependence. 663-674
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-11-28 23:54 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:
