Fete of combinatorics and computer science
Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and m...
Enregistré dans:
| 主要作者: | |
|---|---|
| 其他作者: | , |
| 格式: | Livre numérique |
| 語言: | Anglais |
| 出版: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| 叢編: | Bolyai Society Mathematical Studies
20 |
| 在線閱讀: | Accès sur la plateforme de l'éditeur Accès sur la plateforme de l'éditeur (Springer) Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 提示: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Fete of combinatorics and computer science, Gyula O. H. Katona, Alexander Schrijver, Tamás Szőnyi, Gábor Sági (Eds.), 2010, Berlin, Springer, János Bolyai mathematical society, 1 vol. (365 p.), Bolyai Society Mathematical Studies, 978-3-642-13579-8 • Fete of Combinatorics and Computer Science, Texte imprimé, 9783642135811 • Fete of Combinatorics and Computer Science, Texte imprimé, 9783662506424 |
| LEADER | 03951nam a22003737a 4500 | ||
|---|---|---|---|
| 001 | 943649 | ||
| 008 | 110415q2000 xx ||| |||| 00| 0 eng d | ||
| 009 | PPN151583080 | ||
| 020 | |a 9783642135804 | ||
| 041 | 0 | |a eng | |
| 082 | |a 511.1 | ||
| 100 | 1 | |a Katona, Gyula O.H. | |
| 245 | 1 | 0 | |a Fete of combinatorics and computer science |c edited by Gyula O. H. Katona, Alexander Schrijver, Tamás Szőnyi, Gábor Sági. |
| 260 | |a Berlin, Heidelberg : |b Springer Berlin Heidelberg. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Bolyai Society Mathematical Studies |v 20 |x 2947-9460 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a High Degree Graphs Contain Large-Star Factors -- Iterated Triangle Partitions -- PageRank and Random Walks on Graphs -- Solution of Peter Winkler s Pizza Problem* -- Tight Bounds for Embedding Bounded Degree Trees -- Betti Numbers are Testable* -- Rigid and Globally Rigid Graphs with Pinned Vertices -- Noise Sensitivity and Chaos in Social Choice Theory -- Coloring Uniform Hypergraphs with Small Edge Degrees -- Extremal Graphs and Multigraphs with Two Weighted Colours -- Regularity Lemmas for Graphs -- Edge Coloring Models as Singular Vertex Coloring Models -- List Total Weighting of Graphs -- Open Problems. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is László Lovász, whose outstanding scientific work has defined and shaped many research directions in the past 40 years. A number of friends and colleagues, all top authorities in their fields of expertise gathered at the two conferences in August 2008 in Hungary, celebrating Lovász' 60th birthday. It was a real fete of combinatorics and computer science. Some of these plenary speakers submitted their research or survey papers prior to the conferences. These are included in the volume "Building Bridges". The other speakers were able to finish their contribution only later, these are collected in the present volume. | ||
| 700 | 1 | |a Schrijver, Alexander. |4 pbd | |
| 700 | 1 | |a Szönyi, Tamás. |4 pbd | |
| 776 | 0 | |0 258469749 |t Fete of combinatorics and computer science |f Gyula O. H. Katona, Alexander Schrijver, Tamás Szőnyi, Gábor Sági (Eds.) |d 2010 |c Berlin |n Springer |n János Bolyai mathematical society |p 1 vol. (365 p.) |s Bolyai Society Mathematical Studies |z 978-3-642-13579-8 | |
| 776 | 0 | |t Fete of Combinatorics and Computer Science |b Texte imprimé |z 9783642135811 | |
| 776 | 0 | |t Fete of Combinatorics and Computer Science |b Texte imprimé |z 9783662506424 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-3-642-13580-4 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://doi.org/10.1007/978-3-642-13580-4 |z Accès sur la plateforme de l'éditeur (Springer) | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-VDKWN5QV-F |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747823022 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/978-3-642-13580-4 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750839961 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/978-3-642-13580-4 |z Accès INSA CVL | |
| 997 | |0 943649 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||