default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDIMACS Workshop: Graphs and Discovery 2001
- Siemion Fajtlowicz, Patrick W. Fowler, Pierre Hansen, Melvin F. Janowitz, Fred S. Roberts:
Graphs and Discovery, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 12-16, 2001. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 69, DIMACS/AMS 2005, ISBN 978-0-8218-4380-2
Contents
- Forward. Graphs and Discovery 2001: v-
- Preface. Graphs and Discovery 2001: vii-
- Jonathan W. Berry:
Considerations for Future Designers of General Purpose Graph Software. 1-6 - Eric Breimer, Mark K. Goldberg, David L. Hollinger, Darren T. Lim:
Discovering Optimization Algorithms Through Automated Learning. 7-26 - Gunnar Brinkmann, Olaf Delgado-Friedrichs, Ulrike von Nathusius:
Numbers of Faces and Boundary Encodings of Patches. 27-38 - Dragos M. Cvetkovic, Slobodan K. Simic:
Graph Theoretical Results Obtained by the Support of the Expert System "Graph" - An Extended Survey. 39-70 - Ermelinda DeLaViña:
Graffiti.pc: A Variant of Graffiti. 71-79 - Ermelinda DeLaViña:
Some History of the Development of Graffiti. 81-118 - Ermelinda DeLaViña, Siemion Fajtlowicz, William Waller:
On Some Conjectures of Griggs and Graffiti. 119-125 - Siemion Fajtlowicz:
On The Representation and Characterization of Fullerene C60. 127-135 - Jack E. Graver:
The Structure of Fullerene Signatures. 137-165 - Jack E. Graver:
Catalog of All Fullerenes with Ten or More Symmetries. 167-188 - Pierre Hansen:
How Far Is, Should and Could Be Conjecture-Making in Graph Theory an Automated Process? 189-229 - Pierre Hansen, Mustapha Aouchiche
, Gilles Caporossi, Hadrien Mélot, Dragan Stevanovic:
What Forms Do Interesting Conjectures Have in Graph Theory? 231-251 - Pierre Hansen, Hadrien Mélot:
Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph. 253-264 - Summer M. Husband, Christopher P. Husband, Nathaniel Dean, James M. Tour:
Mathematics for the Nanocell Approach to Molecular Electronics. 265-286 - Robert J. Kingan, Sandra R. Kingan:
A Software System for Matroids. 287-295 - Craig E. Larson:
A Survey of Research in Automated Mathematical Conjecture-Making. 297-318 - Reinhard Laue, Thomas Grüner, Markus Meringer, Adalbert Kerber:
Constrained Generation of Molecular Graphs. 319-331 - Wendy J. Myrvold, Tania Prsa, Neil Walker:
A Dynamic Programming Approach for Timing and Designing Clique Algorithms. 333-340 - Ryan D. Pepper:
On New Didactics of Mathematics: Learning Graph Theory via Graffiti. 341-349 - Tomaz Pisanski, Marko Boben, Arjana Zitnik:
Interactive Conjecturing with Vega. 351-364 - Dragan Stevanovic, Gilles Caporossi:
On the (1, 2)-Spectral Spread of Fullerenes. 365-370
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-05-18 00:06 CEST 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:
