2004 Combinatorics, Graph Theory
and Computing Conference
Monday
Tuesday
Wednesday
Thursday
Friday
Main Page
Click here for
Advanced Search
001: Atif Abueida, R. Sritharan,
Cycle Extendability and Hamilton Cycles in Chordal Graph Classes
, Mon 11:00 AM
002: Heiko Harborth,
Vertex Turïan Numbers for Cube Graphs
, Mon 11:00 AM
003: Gary Chartrand, Ping Zhang, David Erwin, Donald VaderJagt,
γ-labelings of Graphs
, Mon 11:00 AM
004: H. Tapia-Recillas,
Some Partial Difference Sets over the Galois Ring GR(p
3
,m)
, Mon 11:00 AM
005: David A. Pike, Yubo Zou,
Decycling of Cartesian Product of Cycles
, Mon 11:20 AM
006: Maheswara Kasinadhuni, Michael L. Gargano, Joseph DeCicco,
Multiple Genomic Representations that Self Adapt a Genetic Algorithm
, Mon 11:20 AM
007: Anupama Raju, Wasim El-Hajj, Dionysios Kountanis,
Computational Complexity of k-stratified Graph Construction
, Mon 11:20 AM
008: Marco Buratti, Lucia Gionfriddo,
Strong Difference Families over Arbitrary Graphs
, Mon 11:20 AM
009: A. Gregory Starling, Gordon Beavers,
Mixed Modulus Torus Connected n-Cycle Graphs
, Mon 11:40 AM
010: Fawzi Emad, William Gasarch, James Glenn, Tasha Inniss,
Finding Large Sets without Arithmetic Progressions of Length Three
, Mon 11:40 AM
011: Gary Chartrand, Ping Zhang, Donald W. VanderJagt,
Homogeneous Embeddings of Stratified 5-Cycles
, Mon 11:40 AM
012: Omar A. Abu Ghneim,
On Nonabelian McFarland Difference Sets
, Mon 11:40 AM
013: Pak Ching Li,
A Parallel Implementation of an Algorithm for Computing Covering Numbers
, Mon 3:20 PM
014: Eddie Cheng, Ray Kleinberg, Will Lindsey, Dan Steffey, Marc J. Lipman,
Extended Fault-diameter of Star Graphs
, Mon 3:20 PM
015: Gloria Rinaldi,
Nilpotent One-factorization of the Complete Graph
, Mon 3:20 PM
016: D.R. MacIntyre, F.G. Wolff,
Exploiting "Unused" States to Efficiently Encode Canonical Huffman Decode Trees
, Mon 3:20 PM
017: Daniela Genova,
Forbidding-enforcing Families of Languages
, Mon 3:40 PM
018: Arthur M. Farley,
Betweenness Centers of Trees and Unicyclic Graphs
, Mon 3:40 PM
019: Dalibor Froncek, Tereza Kovarova, Michael Kubesa,
Factorizations of Complete graphs into Short Caterpillars
, Mon 3:40 PM
020: Dionysios Kountanis, Wasim El-Hajj, Anupama Raju,
Minimum Steiner Tree Approximation using Binary Image Skeletons
, Mon 3:40 PM
021: Shmuel Friedland, Uri N. Peled,
Computation of Entropy in Statistical Mechanics and Information Theory
, Mon 4:00 PM
022: Stacey Butler, Mike Plantholt, Shailesh Tipnis,
An Improved Well-spread Halving of Multigraphs
, Mon 4:00 PM
023: Tereza Kovářová,
New Techniques for Decomposition of Complete Graphs into Isomorphic Spanning Trees
, Mon 4:00 PM
024: Isak Taksa,
The Number of Subqueries required by an Underlying Search Engine
, Mon 4:00 PM
025: Hiroaki Uehara,
A Positive Clone Detecting Algorithm for DNA Library Screening
, Mon 4:20 PM
026: Sean C. Martin, Bei Yuan, Judith R. Fredrickson, Frederick C. Harris, Jr.,
A Low-cost Parallel Queuing System for Computationally Intensive Problems
, Mon 4:20 PM
027: Edward C. Carr, Joseph B. Klerlein, A. Gregory Starling,
Hamilton Cycles in C
n
× C
m
- T
k
, Mon 4:20 PM
028 Wasim El-Hajj, Anupama Raju, Dionysios Kountanis,
Network Congestion Measurement and Control
, Mon 4:20 PM
029: David E. Kephart, Jeff LeFevre,
CodeGen: The Generation and Testing of DNA Codewords
, Mon 4:40 PM
030: Tomoko Adachi,
Constructions of wrapped Δ-labelings Leading to Cluttered Orderings for the Complete Bipartite Graph
, Mon 4:40 PM
031: Heather Gavlas, D.G. Hoffman,
An f-factor theorem for Signed Graphs
, Mon 4:40 PM
032: Andrew C. Lee,
Empirical Tests for Pseudorandom Number Generators
, Mon 4:40 PM
033: Jo Ellis-Monaghan,
The Generalized Transition Polynomial, Cycle Double Cover Conjecture, and Biomolecular Computing
, Mon 5:00 PM
034: Gary Chartrand, Henry Escuadro, Ping Zhang,
Detour Distance in Graphs
, Mon 5:00 PM
035: Erin Mitzer,
Randomly Decomposable Graphs in K
m
P
e
, Mon 5:00 PM
036: Nobuko Miyamoto, Satoshi Shinohara,
Mutually M-intersecting (k,d)-arcs and Optical Orthogonal Codes
, Mon 5:00 PM
037: Michael L. Gargano, Louis V. Quintas, Eric M. Wahl,
Angiogenesis as a Random Graph Process
, Tue 8:20 AM
038: J. Richard Lundgren, Dustin J. Stewart,
Fully Indecomposable Tournament Matrices
, Tue 8:20 AM
039: John P. Georges, David W. Mauro,
On the L(j,k)-number of Prisms and Related Graphs
, Tue 8:20 AM
040: Sin-Min Lee, Medei Kitagaki, Joseph Young,
Some New Families of Edge-Magic Cubic Graphs
, Tue 8:20 AM
041: Michael L. Gargano, Joseph F. Melerba, Marty Lewinter,
Paintable Graphs - II
, Tue 8:40 AM
042: Vince Grolmusz,
Defying Dimensions Modulo 6
, Tue 8:40 AM
043: James D. Factor,
Internal chords of Pdom(U
n
+
) and the Arcs that Produce Them
, Tue 8:40 AM
044: Melanie A. Albert, Timothy A. Fargus, Elizabeth W. McMahon, Jaren A. Smith,
Color-consistent Automorphisms of Cayley Graphs
, Tue 8:40 AM
045: William T. Trotter,
Hamiltonian Cycles and Symmetric Chain Partitions
, Tue 11:30 AM
046: Robert A. Sulanke,
Generalizing Narayana and Schröder Numbers to Higher Dimensions
, Tue 11:30 AM
047: Amit S. Arora, Kim A.S. Factor,
Domination and Network Stability: An Application
, Tue 11:30 AM
048: Arnfried Kemnitz,
Circular Chromatic Numbers if Certain Planar Graphs
, Tue 11:30 AM
049: Art Finbow, Robert Jamison,
Tree Tolerance Representation of K
2,n
, Tue 11:50 AM
050: A. Nkwanta,
A Note on Riordan Matrices and Combinatorial Sums
, Tue 11:50 AM
051: Ralucca Gera, Ping Zhang,
On F-domination in Stratified Graphs
, Tue 11:50 AM
052: Michael O. Albertson, Bojan Mohar,
Coloring Vertices and Faces of Embedded Graphs
, Tue 11:50 AM
053: Garth Isaak,
Staircase Graphs and t-split Interval Orders
, Tue 12:10 PM
054: D.V. Chopra, R. Dios,
On the Nonexistence of Some Orthogonal Arrays
, Tue 12:10 PM
055: J. Villalpando, R. Laskar,
Parameters Concerning Cycle-domination
, Tue 12:10 PM
056: Suk J. Seo, Peter J. Slater,
Colored Problem for Graphs
, Tue 12:10 PM
057: Martin Charles Goumbic, Marina Lipshteyn, Michael Stern,
The k-edge Intersection Graphs of Paths in a Tree
, Tue 3:20 PM
058: Nicolas J. Cavanagh, G.H.J. van Rees, Diane Donovan,
A Note on the Completion of Partial Latin Squares
, Tue 3:20 PM
059: Jean R.S. Blair, Steve Horton, Pinar Heggernes, Fredrik Manne,
Broadcast Domination Algorithms for Interval graphs, Series-parallel Graphs, and Trees
, Tue 3:20 PM
060: Hemant Balakrishnan, Narsingh Deo,
Implementation and Analysis of a Parallel Algorithm for Radiocoloring
, Tue 3:20 PM
061: Seog-Jin Kim, Kittikorn Nakprasit,
Coloring the Complements of Intersection Graphs of Geometric Figures
, Tue 3:40 PM
062: Daluss J. Siewert,
Matrix Ranks of the Reduced Adjacency Matrices of Trees
, Tue 3:40 PM
063: Spencer P. Hurd, Dinesh G. Sarvate,
Pair-resolvability and Tight Embeddings for Path Designs
, Tue 3:40 PM
064: Khurram Shafique, Ronald D. Dutton,
On X-free Covers
, Tue 3:40 PM
065: Anne Berry, Martin Charles Golumbic, Marina Lipshteyn,
Cycle-bicolorable Graphs and Triangulating Chordal Probe Graphs
, Tue 4:00 PM
066: Peter J. Slater, Yan Wang,
The Competition-acquisition Number of a Graph
, Tue 4:00 PM
067: M. Greig, P.C. Li, G.H.J. van Rees,
(v,k,2)-covering Designs
, Tue 4:00 PM
068: Sin-Min Lee, Kuo-Jye Chen, Jack Yung-Chin Wang,
On the Edge-graceful Spectra of the Cycles with one Chord and Dumpbell Graphs
, Tue 4:00 PM
069: David E. Brown, J. Richard Lundgren,
Bipartite Probe Interval Graphs
, Tue 4:20 PM
070: John J. Watkins,
A Miscellany of Chessboard Problems: An Update
, Tue 4:20 PM
071: Rudolf Mathon, Anne Penfold Street, Greg Gamble,
Classification of Partitions of All Triples on Ten Points into Copies of Fano and Affine Planes
, Tue 4:20 PM
072: Sin-Min Lee, Elo Leung,
On Super Vertex-graceful Trees
, Tue 4:20 PM
073: Ephraim Korach, Michael Stern,
The Stars-clustering-optimization-problem
, Tue 4:40 PM
074: Jason Albertson, Audene Harris, Larry Langley, Sarah Mertz,
Directed Trees Satisfying a Gallai-type Domination Theorem
, Tue 4:40 PM
075: Kathryn L. DeLamar, D.G. Hoffman,
The Intersection Problem for Bipartite Star Designs
, Tue 4:40 PM
076: Sin-Min Lee, Farrokh Saba,
On the Integer-Magic Spectra of the Graphs that are Two-vertex sum of Trees
, Tue 4:40 PM
077: David E. Brown and J. Richard Lundgen,
Interval Tournaments
, Tue 5:00 PM
078: Charles Wallis, Renu Laskar,
Domination in the Graph of the T
3
Association Scheme and Related Chessboard Graphs
, Tue 5:00 PM
079: Michael N. Ferencak, Anthony J.W. Hilton,
Outline and Amalgamated Transitive Triple Systems: The Case When Two Vertices are Amalgamated
, Tue 5:00 PM
080: Sin-Min Lee, Edward Chen, Emmanuel R. Yera, Ling Wang,
On Super Edge-graceful (p,p+1)-graphs
, Tue 5:00 PM
081: Gary Chartrand, Ping Zhang, Ladislav Nebeský,
Hamiltonian Colorings of Graphs
, Tue 5:20 PM
082: E. Cheng, R. Kleinberg, S. Kruk, W. Lindsey, D. Steffy,
University Examination Timetabling Problem
, Tue 5:20 PM
083: Aurel Cami, Narsingh Deo, Bruce Litow,
Compression of Vertex Transitive Graphs
, Tue 5:20 PM
084: David S. Herscovici,
Generalization of Graham's Pebbling Conjecture
, Tue 5:20 PM
085:
, Wed 8:20 AM
086:
, Wed 8:20 AM
087:
, Wed 8:20 AM
088:
, Wed 8:20 AM
089: Douglas B. West,
Total Interval Number: A Survey
, Wed 8:40 AM
090: Darryn Bryant, David Leach, Chris Rodger,
Hamiltonian Decompositions of K
n,n
with n odd and a 2-factor removed
, Wed 8:40 AM
091: V. Voloshin,
Coloring Mixed Hypergraphs: A Survey
, Wed 8:40 AM
092: Victor Kostyuk, Darren A. Narayan,
Minimal Rankings of Cycles
, Wed 8:40 AM
093: Stephen C. Flink,
Interval Homorphisms, Interval k-graphs and Related Partial Orders
,Wed 9:00 AM
094: Daphne Liu, Melanie Xie,
The Radio Numbers for Square Paths and Square Cycles
, Wed 9:00 AM
095: Jonathan Cutler, Balász Montágh,
Ramsey-like Theorems for Balanced Colorings
, Wed 9:00 AM
096: Lisa Fischer Macon,
GraphML: An XML Representation for Graphs Rendered in SVG Using the W3C DOM
, Wed 9:00 AM
097: Ken Bogart, Stephen Ryan,
Triangle Graphs and Triangle Orders
, Wed 9:20 AM
098: Robert C. Brigham, Ronald D. Dutton, Steven T. Hedetniemi,
A Sharp Lower Bound on the Powerful Alliance Number of C
m
× C
n
, Wed 9:20 AM
099: Ebrahim Salehi, Sin-Min Lee, Mahdad Khatirinejad,
On IC-coloring and IC-indices of Graphs
, Wed 9:20 AM
100: Debra Boutin,
Graphs Embedded with All Symmetries Displayed
, Wed 9:20 AM
101: Barry Balof, Ken Bogart,
Unit and Non-unit Free Triangle Graphs
, Wed 9:40 AM
102: Jana Šiagiová, Mark E. Watkins,
Covalences of Infinite Planar Vertex-transitive and Cayley Maps
, Wed 9:40 AM
103: Peter Johnson,
The Hall Ratio, the Fractional Chromatic Number, and the Lexicographic Product
, Wed 9:40 AM
104: Larry J. Langley,
Alliances in Directed Graphs
, Wed 9:40 AM
105: Ken Smith, Sivaram Narayan, Josh Whitney, Raj Doshi, Janae Eustice,
On Graph Summability
, Wed 3:20 PM
106: Roger B. Eggleton, Peter Adams, James A. MacDougall,
The Structure of the Graph Posets of Orders 4 to 8
, Wed 3:20 PM
107: Varaporn Saenpholphat, Ping Zhang,
On Resolvability in Graphs
, Wed 3:20 PM
108: M.R. Emamy-K.,
Projective Functionals and a Geometric Connection to Threshold Logic
, Wed 3:20 PM
109: Peter Che Bor Lam, Guohua Gu,
On Distance Two Labelling Characterization of Chordal Graphs
, Wed 3:40 PM
110: Joe Anderson, Haidong Wu,
An Extremal Problem for Contractible Edges in 3-connected Graphs
, Wed 3:40 PM
111: Bing Wei,
Every Connected, Locally-connected, Claw-free graph is Path Extendable
, Wed 3:40 PM
112: L. Uribe, M.R. Emamy-K.,
An Improvement on a Computer-free Proof for the Cut Number of the 5-cube
, Wed 3:40 PM
113: Arthur H. Busch,
A Characterization of Triangle-free Tolerance Graphs
, Wed 4:00 PM
114: Judith R. Fredrickson, Bei Yuan, Frederick C. Harris, Jr.,
A Time Saving Region Restriction for Calculating the Minimum Crossing Number of K
n
, Wed 4:00 PM
115: Klas Markström,
Extremal Graphs for Some Problems on Cycles in Graphs
, Wed 4:00 PM
116: K. Ogawa, M. Tsuchiya,
Note on Transformation of Posets with the Same Upper Bound Graphs
, Wed 4:00 PM
117: Jan Hutchison, Josh Laison,
Bar k-visibility Graphs
, Wed 4:20 PM
118: Dara Moazzami,
Construction of Graphs with Maximum Graphical Structure and Tenacity T
, Wed 4:20 PM
119: Sarah Holliday, Matt Walsh,
Nonseparable Hamilton Decomposition
, Wed 4:20 PM
120: Ralph D. Kopperman, John L. Pfaltz,
Jordan Surfaces in Discrete Topologies
, Wed 4:20 PM
121: Jan Kratochvil,
Intersection Graphs of Convex Sets: A Brief Survey
, Wed 4:40 PM
122: Maria Axenovich, André Kézdy, Ryan Martin,
Editing Distance of a Graph
, Wed 4:40 PM
123: Marietjie Frick,
An Asymptotic Result for the Path Partition Conjecture
, Wed 4:40 PM
124: Ralph Grimaldi,
Ternary Strings that Avoid the Pattern 21
, Wed 4:40 PM
125:
, Wed 5:00 PM
126: Daniela Ferrero,
Path and Cycles in Path Graphs
, Wed 5:00 PM
127: Mahmoud El-Hashash,
Almost the Largest Possible Cycle on the Subgraph, of Two Consecutive Levels, of the Hypercube
, Wed 5:00 PM
128: Phyllis Chinn, Heinrich Niederhausen,
Compositions into Powers of 2
, Wed 5:00 PM
129:
, Wed 5:20 PM
130:
, Wed 5:20 PM
131:
, Wed 5:20 PM
132:
, Wed 5:20 PM
133:
, Thu 8:20 AM
134:
, Thu 8:20 AM
135:
, Thu 8:20 AM
136:
, Thu 8:20 AM
137: Taishi Nishida, Etsuro Moriya,
The Subgraph Connecting Problem - Its Variants and Their Computational Complexity
, Thu 8:40 AM
138: Joan P. Hitchison, Emily H. Moore,
Distance Constraints in Graph Color Extensions
, Thu 8:40 AM
139: Xue Lin, John C. Wierman,
Cycles as Constraint Graphs in Multi-type Percolation
, Thu 8:40 AM
140: R. Craigen,
Some Classes of Circulant Orthogonal Matrices
, Thu 8:40 AM
141: B. Hartnell, N. Hunter, V. LeBlanc, K. Patterson, G. Reid, A. Spanik,
Falling Stars: A Game on a Graph
, Thu 10:50 AM
142:
, Thu 10:50 AM
143: Alexander Soifer, Saharon Shelah,
Axiom of Choice and Chromatic Number of Distance Graphs: Examples on the Plane and R
n
, Thu 10:50 AM
144:
, Thu 10:50 AM
145: Alice M. Dean, Ellen Gethner, Joan P. Hutchinson,
Necessary Conditions for Unit Bar-visibility Layout of Triangulated Polygons
, Thu 11:10 AM
146: Zemin Jin, Xiaoyan Zhang, Xueliang Li,
Partitioning an Edge-colored Graph into Multicolored Subgraphs
, Thu 11:10 AM
147: Sergio De Agostino,
A Conjecture on Biconnected Graphs and Regular 3-cell Complexes
, Thu 11:10 AM
148: Marco Buratti, Norman J. Finizio,
Pseudo Z-cyclic Whist Designs
, Thu 11:10 AM
149: Ellen Gethner,
A Unit Bar-visibility Layout Algorithm for Outerplanar Near Triangulations
, Thu 11:30 AM
150: V. Rödl, M. Siggers,
Color Critical Hypergraphs with Many Edges
, Thu 11:30 AM
151: Peter Johnson, Ken Roblee,
Extremal Families of Nearly Strongly Regular Graphs
, Thu 11:30 AM
152: David R. Berman, Nolan B. McMurray, Douglas D. Smith,
Some New Latin Triangles
, Thu 11:30 AM
153: Anthony B. Evans,
Representations of Disjoint Unions of Complete Graphs
, Thu 11:50 AM
154: Linda Eroh,
List-coloring Certain Complete n-partite Graphs
, Thu 11:50 AM
155: Richard J. Lipton, Nisheeth K. Vishnoi, Zeke Zalcstein,
A Generalization of the Characteristic Polynomial of a Graph
, Thu 11:50 AM
156: Béla Bajnok,
A Generalization of Sum-free Sets in Abelian Groups and Constructions of Spherical Designs
, Thu 11:50 AM
157: Terry McKee,
Clique Representations of Graphs
, Thu 12:10 PM
158: Vadim E. Levit, Eugen Mandrescu,
Very Well-covered Graphs with Log-concave Independence Polynomials
, Thu 12:10 PM
159: G. Bullington, L. Eroh, J. Koker, K. McDougal, H. Maghadam, S. Winters, S. Stalder,
The Touring Number of a Graph
, Thu 12:10 PM
160: Marge M. Coahran, Charles J. Colbourn,
Maximum and Average Access Cost in Double Erasure RAID Disk Arrays
, Thu 12:10 PM
161: Adam Krzyzak, Stan Klasa,
Chernoff Bound on Classification Error for Multivariate Parametric and Nonparametric Classes
, Thu 2:00 PM
162: M. Bartha,
The Berge Formula for Maximum Internal Matchings in a Graph
, Thu 2:00 PM
163: Dan McQuillan, Katy Smith,
A Spectrum Problem for Odd Complete Graphs
, Thu 2:00 PM
164: Katherine Humphreys, Heinrich Niederhausen,
Counting Infinite Step Set Lattice Paths using Umbral Calculus
, Thu 2:00 PM
165: Michael Gargano, Lorraine Lurie,
Hybrid Model for Classification
, Thu 2:20 PM
166: Emine Sule Yazici,
The Triangle Intersection Problem for Kite Systems
, Thu 2:20 PM
167: Brenda Clemens, Romain Coulibaly, Jennifer Garvens, Jennifer Gonnering, Jeff Lucas, Steven J. Winters,
Some New Classes of Graceful Graphs
, Thu 2:20 PM
168: Simona Bonvicini,
Starters: Doubling Constructions
, Thu 2:20 PM
169: Ziya Arnavut,
A Fast and Efficient Algorithm for Transforming Between Permutations and Lehmer-inversion Tables
, Thu 2:40 PM
170: John Holliday, Peter Johnson,
Counterexample to a Conjecture on Optimal Shields-Harary Weightings
, Thu 2:40 PM
171: James Urick, Darren Narayan,
On the Representation Number of a Split Graph
, Thu 2:40 PM
172: A.J.W. Hilton,
Amalgamations of Partial Latin Squares
, Thu 2:40 PM
173: John Chambers, William Kocay, Wendy Myrvold,
On Filotti's Algorithm for Embedding 3-regular Graphs on the Torus
, Thu 3:00 PM
174: Ermelinda DeLaVina, Bill Waller,
On Some Conjectures of Graffiti.pc Concerning the Bipartite Number and Path Number of a Graph
, Thu 3:00 PM
175: W.C. Shiu, P.C.B. Lam, P.K. Sun,
Constructions of A-magic Graphs and Some A-magic Graphs with A of Even Order
, Thu 3:00 PM
176: Jaromy Kuhl,
Completing Partial Latin Squares
, Thu 3:00 PM
177: A.A. Kooshesh, B. Ravikumar,
Approximate Computation of Exponential Function and Related Problems
, Thu 3:40 PM
178: Ali A. Ali, Salar Alsadary,
New Edge Neighborhood Graphs
, Thu 3:40 PM
179: Kourosh Eshghi, Parham Azimi,
An Integer Programming Model for the Graceful Labeling Problem
, Thu 3:40 PM
180: Andrea C. Burgess, David A. Pike,
Invariants for Even Cycle Systems
, Thu 3:40 PM
181: K. Gopalakrishnan,
On Removing Randomness from Probabilistic Algorithms
, Thu 4:00 PM
182: Paul Balister, Béla Bollobás, Amites Sarkar, Mark Walters,
Connectivity of Random Geometric Graphs
, Thu 4:00 PM
183: Petr Kovář,
Vertex Magic Total Labeling of Products of Regular VMT Graphs and Regular Class 1 Supermagic Graphs
, Thu 4:00 PM
184: Spyros S. Magliveras, Wandi Wei, Dale Mesner,
On the Number of Latin Rectangles and Generalized Latin Squares
, Thu 4:00 PM
185: Joan M. Lucas,
Localized Rotation Distance in Binary Trees
, Thu 4:20 PM
186: Leonado Silva de Lima, Nair Maria Maia de Abreu, Patricia Erthal de Moraes, Christine Sertã,
Some Properties of Graphs in (a,b)-linear Classes
, Thu 4:20 PM
187: Sin-Min Lee, Richard M. Low, Yong-Song Ho,
On the Integer-magic Spectra of Maximal Outerplanar Graphs
, Thu 4:20 PM
188: Kazuhiro Ozawa, Miwako Mishima, Shinji Kuriki, Masakazu Jimbo,
Constructions of Rectangular Designs
, Thu 4:20 PM
189: L. William Kazmierczak, Charles Suffel,
Realizability Results Involving Two Connectivity Parameters
, Thu 4:40 PM
190: Michael Ferrara, Ron Gould, John Schmitt,
On a Problem of Erdös, Jacobson and Lehel,
, Thu 4:40 PM
191: Michelle DeDeo,
Symplectic Maps and Generalizations of the Toda Lattice
, Thu 4:40 PM
192: Reinhard Laue,
Resolvable t-designs
, Thu 4:40 PM
193: Gregory Dufore, Darren A. Narayan,
When Bad Things Happen to Good Rankings; ILP Methods for Finding Minimum Feedback Arc Sets
, Thu 5:00 PM
194: Henry Liu, Robert Morris,
Another Ramsey Type Problem
, Thu 5:00 PM
195: Lan Wang,
Complement of Fibonacci Cube in Hypercube
, Thu 5:00 PM
196: Barbara Tankersley,
A Combinatorial Interpetation of the Motzkin Triangle
, Thu 5:00 PM
197:
, Thu 5:20 PM
198:
, Thu 5:20 PM
199:
, Thu 5:20 PM
200:
, Thu 5:20 PM
201: Petr Lisonek,
Binary Caps with Many Free Pairs of Points
, Fri 8:20 AM
202: Arthur M. Hobbs, James G. Oxley,
William T. Tutte, 1917-2002
, Fri 8:20 AM
203: Jirapha Limbupasiriporn,
Codes of Paley Graphs
, Fri 8:20 AM
204: Frank Hadlock, Frederick Hoffman,
Manhattan Graphs
, Fri 8:20 AM
205: Michael Reid,
Tiling with Polyominoes and Boundary Words
, Fri 8:40 AM
206: A. Hubenko,
On a Cyclic Property of Directed Graphs
, Fri 8:40 AM
207: Frank Ruskey, C. Robert Miers,
Counting Strings over Z
4
with Given Symmetric Function Evaluations
, Fri 8:40 AM
208: W.D. Wallis,
Overlarge Sets of One-factors
, Fri 8:40 AM
209: George Lam, Matthew Lad, Sajod Moradi, Brian Yagoda, John Wierman,
Non-inclusions of Archimedean, Laves, and 2-uniform Infinite Lattices
, Fri 9:00 AM
210: Robert Jamison, Peter Johnson, Lisa Markus, Evan Morgan,
Strong (t,r)-regularity
, Fri 9:00 AM
211: Yoshihiro Kaneko,
On Locating Sources of Optimal File Transfer Problem
, Fri 9:00 AM
212: Isidori Gitler, Feliú Sagols,
A New Proof of the Δ↔Y Reducibility of Three Terminal Planar Graphs
, Fri 9:00 AM
213: Spyros S. Magliveras, Tanya E. Seidel, Michal Sramka,
Ovals in the Projective Plane of Order 25
, Fri 10:50 AM
214: Jens-P. Bode,
Minimum Regular Rectilinear Plane Graph Drawings with Fixed Numbers of Edge Lengths
, Fri 10:50 AM
215: Julian Abel, Marco Buratti,
Optimal Optical Orthogonal Codes and Difference Families of Block Size 4
, Fri 10:50 AM
216: Dora P. Naor, John C. Wierman,
Improving Universal Formulas for Percolation Thresholds
, Fri 10:50 AM
217: Neil P. Carnes,
Some Antiautomorphisms of Mendelsohn Triple Systems
, Fri 11:10 AM
218: G.S. Domke, J.H. Hattingh, L.R. Markus,
On Weakly Connected Domination in Graphs II
, Fri 11:10 AM
219: Larry Cummings,
Systematic Comma-free Codes
, Fri 11:10 AM
220: Sajod Moradi, George Lam, Matthew Lad, Brian Yagoda, John Wierman,
Inclusions of Archimedean, Laves, and 2-uniform Infinite Lattices
, Fri 11:10 AM
221: Naiomi T. Cameron, Asomoah Nkwanta,
Elements of (Pseudo) Order Two in the Riordan Group
, Fri 11:30 AM
222: Peter D. Johnson, Jr., Robert Rubalcaba, Matt Walsh,
Domination Null and Packing Null Vertices of a Graph
, Fri 11:30 AM
223: Junichiro Fukuyama,
Some New Facts about the Hamming Space
, Fri 11:30 AM
224: John C. Wierman, Rulian Cheng,
Estimating Percolation Thresholds Using the Substitution Method
, Fri 11:30 AM
225: Silvia Heubach, Toufik Mansour,
Counting Rises, Levels and Drops in Compositions with Parts in a Set A
, Fri 11:50 AM
226: Nancy E. Clarke,
A Game of Cops and Robber Played with Partial Information
, Fri 11:50 AM
227: Robert Morris,
Results on Frankl's Conjecture
, Fri 11:50 AM
228: Werner Gründlingh,
The Lottery Problem: A Graph Theoretic and Computational Approach
, Fri 11:50 AM
229: Puhua Guan,
Minimal Critical Squarefree Subgraphs of Hypercube
, Fri 12:10 PM
230: LeRoy B. Beasley,
Tournaments, Primitivity and Preservers
, Fri 12:10 PM
231: Hanno Lefmann,
Triangles of Large Minimum Area in the d-dimensional Unit-cube
, Fri 12:10 PM
232: Sanjeeb Nanda, Narsingh Deo,
An Algorithm for a 2-disk Fault-tolerant Array with (Prime - 1) Disks
, Fri 12:10 PM
Top
Last modified March 8, 2004. Please send your comments to
meyerowi@fau.edu