default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 241
Volume 241, Number 1-3, October 2001
- Douglas G. Rogers:
Helge Tverberg A celebration of a life in mathematics. 1-6 - Helge Tverberg:
A combinatorial mathematician in Norway: some personal reflections. 11-22 - Andrei Asinowski
, Andreas F. Holmsen, Meir Katchalski:
The triples of geometric permutations for families of disjoint translates. 23-32 - David Avis, Kiyoshi Hosono, Masatsugu Urabe:
On the existence of a point subset with a specified number of interior points. 33-40 - Imre Bárány, Zoltán Füredi:
On the lattice diameter of a convex polygon. 41-50 - Angela I. Barbero, Øyvind Ytrehus:
On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels. 51-63 - Elena Barcucci, Sara Brunetti, Alberto Del Lungo, Maurice Nivat:
Reconstruction of lattice sets from their horizontal, vertical and diagonal X-rays. 65-78 - J. A. Barker, David G. Larman:
Determination of convex bodies by certain sets of sectional volumes. 79-96 - András Bezdek, Ferenc Fodor, István Talata:
Sylvester-type theorems for unit circles. 97-101 - Tibor Bisztriczky, Károly J. Böröczky:
On periodically-cyclic Gale 4-polytopes. 103-118 - Uri Blass, Iiro S. Honkala, Simon Litsyn:
Bounds on identifying codes. 119-128 - Alexis Bonnecaze, Patrick Solé, Parampalli Udaya:
Tricolore 3-designs in Type III codes. 129-138 - Martin W. Bunder, Keith P. Tognetti:
On the self matching properties of [j tau]. 139-151 - Beifang Chen, Shing-Tung Yau, Yeong-Nan Yeh:
Graph homotopy and Graham homotopy. 153-170 - Wende Chen, Torleiv Kløve:
On the second greedy weight for linear codes of dimension 3. 171-187 - Amir Daneshgar, Anthony J. W. Hilton, Peter D. Johnson Jr.:
Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs. 189-199 - David E. Daykin:
On deleting coordinates from integer vectors. 201-206 - Mark de Longueville:
Notes on the topological Tverberg theorem. 207-233 - Emeric Deutsch:
A bijective proof of the equation linking the Schro"der numbers, large and small. 235-240 - Emeric Deutsch, Louis W. Shapiro:
A survey of the Fine numbers. 241-265 - Jürgen Eckhoff:
A partition theorem of Tverberg-type for boxes in R3. 267-288 - Henrik Eriksson, Kimmo Eriksson, Johan Karlander, Lars J. Svensson, Johan Wästlund:
Sorting a bridge hand. 289-300 - Stefan Felsner, Günter M. Ziegler:
Zonotopes associated with higher Bruhat orders. 301-312 - Branko Grünbaum, Geoffrey C. Shephard:
Isohedra with dart-shaped faces. 313-332 - Branko Grünbaum, Joseph Zaks:
Convexification of polygons by flips and by flipturns. 333-342 - Anthony J. W. Hilton, Fred C. Holroyd, Cheng Zhao:
The Overfull Conjecture and the Conformability Conjecture. 343-361 - Audun Holme:
A combinatorial proof of the duality defect conjecture in codimension 2. 363-378 - Oddvar Iden:
On subplanes of free planes. 379-385 - David Pokrass Jacobs, Robert E. Jamison:
A note on equal unions in families of sets. 387-393 - Christoph Kirfel, Øystein J. Rødseth:
On the primality of 2h*3n+1. 395-406 - Horst Martini, Anita Schöbel:
Median and center hyperplanes in Minkowski spaces--a unified approach. 407-426 - János Pach, Gábor Tardos:
Separating convex sets by straight lines. 427-433 - Elisa Pergola:
Two bijections for the area of Dyck paths. 435-447 - Hans Georg Schaathun:
Upper bounds on weight hierarchies of extremal non-chain codes. 449-469 - Seunghyun Seo:
A pairing of the vertices of ordered trees. 471-477 - Dong-Joon Shin, P. Vijay Kumar, Tor Helleseth:
5-Designs from the lifted Golay code over Z4 via an Assmus-Mattson type approach. 479-487
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-12-05 22:25 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:
