Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDIMACS Workshop: Contemporary Trends in Discrete Mathematics 1997
- Ronald L. Graham, Jan Kratochvíl, Jaroslav Nesetril, Fred S. Roberts
:
Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, Proceedings of a DIMACS Workshop, Stirín Castle, Czech Republic, May 19-25, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 49, DIMACS/AMS 1999, ISBN 0-8218-0963-6 - Forword. Contemporary Trends in Discrete Mathematics 1997: ix-
- Preface. Contemporary Trends in Discrete Mathematics 1997: xi-
- Pierre Boiron, Éric Sopena, Laurence Vignal:
Acyclic improper colourings of graphs with bounded degree. 1-9 - Patrice Ossona de Mendez, Hubert de Fraysseix:
Intersection graphs of Jordan arcs. 11-28 - Josep Díaz, Maria J. Serna, Paul G. Spirakis:
Linear and nonlinear systems: A survey. 29-47 - Rodney G. Downey, Michael R. Fellows, Ulrike Stege:
Parameterized complexity: A framework for systematically confronting computational intractability. 49-99 - György Elekes:
On the structure of large homothetic subsets. 101-111 - Sándor P. Fekete, Winfried Hochstättler, Stephan Kromberg, Christoph Moll:
The complexity of an inverse shortest paths problem. 113-127 - András Frank:
Finding minimum weighted generators of a path system. 129-138 - Jerrold R. Griggs, Günter Rote:
On the distribution of sums of vectors in general position. 139-142 - Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer:
The generalized matching problem on partial $k$-trees. 143-158 - Winfried Hochstättler, Martin Loebl:
Bases of cocycle lattices and submatrices of a Hadamard matrix. 159-168 - Martin Klazar:
On the maximum lengths of Davenport-Schinzel sequences. 169-178 - Alexandr V. Kostochka, Tomasz Luczak, Gábor Simonyi, Éric Sopena:
On the minimum number of edges giving maximum oriented chromatic number. 179-182 - Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
New trends in the theory of graph colorings: Choosability and list coloring. 183-197 - Wolfgang Mader:
Topological minors in graphs of minimum degree n. 199-211 - Peter Mihók:
Reducible properties and uniquely partitionable graphs. 213-218 - Jaroslav Nesetril, József Solymosi, Pavel Valtr:
Induced monochromatic subconfigurations. 219-227 - Jaroslav Nesetril, Claude Tardif:
Density. 229-235 - Petr Pancoska, Vít Janota, Jaroslav Nesetril:
Spectra, graphs, and proteins. Towards understanding of protein folding. 237-255 - Fred S. Roberts:
Meaningless statements. 257-274 - Moshe Rosenfeld:
Graceful matchings in finite fields, the factor-difference sets of integers, and integers of the form a2 + kb2. 275-281 - Miklós Simonovits:
How to solve a Turán type extremal graph problem? (Linear decomposition). 283-305 - Attila Sali, Gábor Simonyi:
Oriented list colouring of undirected graphs. 307-316 - Joel Spencer, Lubos Thoma:
On the limit values of probabilities for the first order properties of graphs. 317-336 - William T. Trotter:
Ramsey theory and partially ordered sets. 337-347 - Pavel Valtr:
Generalizations of Davenport-Schinzel sequences. 349-389
a service of 
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 2024-04-22 21:10 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:
