Nešetřil, Jaroslav
Overview
Works:  234 works in 620 publications in 4 languages and 8,510 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Editor, Author, Other, Creator, Artist, Honoree, Dedicatee 
Publication Timeline
.
Most widely held works about
Jaroslav Nešetřil
 Topics in discrete mathematics : dedicated to Jarik Nešetřil on the occasion of his 60th birthday by Martin Klazar( Book )
Most widely held works by
Jaroslav Nešetřil
Invitation to discrete mathematics by
Jiří Matoušek(
Book
)
44 editions published between 1998 and 2011 in English and Undetermined and held by 722 WorldCat member libraries worldwide
"This second edition of Invitation to Discrete Mathematics is a clear and selfcontained introduction to discrete mathematics. Aimed mainly at undergraduate and early graduate students of mathematics and computer science, it is written with the goal of stimulating interest in mathematics and an active, problemsolving approach to the presented material. The reader is led to an understanding of the basic principles and methods of actually doing mathematics (and having fun at that). By focussing on a more selective range of topics than many discrete mathematics textbooks, allowing greater depth of treatment using a number of different approaches, the book reflects the conviction of the authors, active and internationally renowned mathematicians, that the most important gain from studying mathematics is the cultivation of clear and logical thinking and habits useful for attacking new problems. More than 400 enclosed exercises with a wide range of difficulty, many of them accompanied by hints for solution, support this approach to teaching."Jacket
44 editions published between 1998 and 2011 in English and Undetermined and held by 722 WorldCat member libraries worldwide
"This second edition of Invitation to Discrete Mathematics is a clear and selfcontained introduction to discrete mathematics. Aimed mainly at undergraduate and early graduate students of mathematics and computer science, it is written with the goal of stimulating interest in mathematics and an active, problemsolving approach to the presented material. The reader is led to an understanding of the basic principles and methods of actually doing mathematics (and having fun at that). By focussing on a more selective range of topics than many discrete mathematics textbooks, allowing greater depth of treatment using a number of different approaches, the book reflects the conviction of the authors, active and internationally renowned mathematicians, that the most important gain from studying mathematics is the cultivation of clear and logical thinking and habits useful for attacking new problems. More than 400 enclosed exercises with a wide range of difficulty, many of them accompanied by hints for solution, support this approach to teaching."Jacket
Graphs and homomorphisms by
Pavol Hell(
Book
)
22 editions published between 2004 and 2008 in English and held by 330 WorldCat member libraries worldwide
Based on the authors' lecture notes, this book is concerned with an aspect of graph theory that has broad applications to complexity theory, graph colourings, channel assignment and statistical physics. It contains exercises, hints and references
22 editions published between 2004 and 2008 in English and held by 330 WorldCat member libraries worldwide
Based on the authors' lecture notes, this book is concerned with an aspect of graph theory that has broad applications to complexity theory, graph colourings, channel assignment and statistical physics. It contains exercises, hints and references
Mathematics of Ramsey theory by
Jaroslav Nešetřil(
Book
)
12 editions published in 1990 in English and held by 295 WorldCat member libraries worldwide
One of the important areas of contemporary combinatorics is Ramsey theory. Ramsey theory is basically the study of structure preserved under partitions. The general philosophy is reflected by its interdisciplinary character. The ideas of Ramsey theory are shared by logicians, set theorists and combinatorists, and have been successfully applied in other branches of mathematics. The whole subject is quickly developing and has some new and unexpected applications in areas as remote as functional analysis and theoretical computer science. This book is a homogeneous collection of research and survey articles by leading specialists. It surveys recent activity in this diverse subject and brings the reader up to the boundary of present knowledge. It covers virtually all main approaches to the subject and suggests various problems for individual research
12 editions published in 1990 in English and held by 295 WorldCat member libraries worldwide
One of the important areas of contemporary combinatorics is Ramsey theory. Ramsey theory is basically the study of structure preserved under partitions. The general philosophy is reflected by its interdisciplinary character. The ideas of Ramsey theory are shared by logicians, set theorists and combinatorists, and have been successfully applied in other branches of mathematics. The whole subject is quickly developing and has some new and unexpected applications in areas as remote as functional analysis and theoretical computer science. This book is a homogeneous collection of research and survey articles by leading specialists. It surveys recent activity in this diverse subject and brings the reader up to the boundary of present knowledge. It covers virtually all main approaches to the subject and suggests various problems for individual research
The mathematics of Paul Erdös by
Ronald L Graham(
Book
)
27 editions published between 1996 and 2013 in English and held by 292 WorldCat member libraries worldwide
This is the most comprehensive survey of the mathematical life of the legendary Paul Erdős (19131996), one of the most versatile and prolific mathematicians of our time. For the first time, all the main areas of Erdős' research are covered in a single project. Because of overwhelming response from the mathematical community, the project now occupies over 1000 pages, arranged into two volumes. These volumes contain both high level research articles as well as key articles that survey some of the cornerstones of Erdős' work, each written by a leading world specialist in the field. A special chapter "Early Days", rare photographs, and art related to Erdős complement this striking collection. A unique contribution is the bibliography on Erdős' publications: the most comprehensive ever published. This new edition, dedicated to the 100th anniversary of Paul Erdős' birth, contains updates on many of the articles from the two volumes of the first edition, several new articles from prominent mathematicians, a new introduction, more biographical information about Paul Erdős, and an updated list of publications. The first volume contains the unique chapter "Early Days", which features personal memories of Paul Erdős by a number of his colleagues. The other three chapters cover number theory, random methods, and geometry. All of these chapters are essentially updated, most notably the geometry chapter that covers the recent solution of the problem on the number of distinct distances in finite planar sets, which was the most popular of Erdős' favorite geometry problems
27 editions published between 1996 and 2013 in English and held by 292 WorldCat member libraries worldwide
This is the most comprehensive survey of the mathematical life of the legendary Paul Erdős (19131996), one of the most versatile and prolific mathematicians of our time. For the first time, all the main areas of Erdős' research are covered in a single project. Because of overwhelming response from the mathematical community, the project now occupies over 1000 pages, arranged into two volumes. These volumes contain both high level research articles as well as key articles that survey some of the cornerstones of Erdős' work, each written by a leading world specialist in the field. A special chapter "Early Days", rare photographs, and art related to Erdős complement this striking collection. A unique contribution is the bibliography on Erdős' publications: the most comprehensive ever published. This new edition, dedicated to the 100th anniversary of Paul Erdős' birth, contains updates on many of the articles from the two volumes of the first edition, several new articles from prominent mathematicians, a new introduction, more biographical information about Paul Erdős, and an updated list of publications. The first volume contains the unique chapter "Early Days", which features personal memories of Paul Erdős by a number of his colleagues. The other three chapters cover number theory, random methods, and geometry. All of these chapters are essentially updated, most notably the geometry chapter that covers the recent solution of the problem on the number of distinct distances in finite planar sets, which was the most popular of Erdős' favorite geometry problems
Algorithms  ESA '99 : 7th annual European symposium, Prague, Czech Republic, July 1618, 1999 : proceedings by
Jaroslav Nešetřil(
Book
)
26 editions published in 1999 in English and held by 245 WorldCat member libraries worldwide
The 7th Annual European Symposium on Algorithms (ESA ’99) is held in Prague, Czech Republic, July 1618, 1999. This continued the tradition of the meetings which were held in – 1993 Bad Honnef (Germany) – 1994 Utrecht (Netherlands) – 1995 Corfu (Greece) – 1996 Barcelona (Spain) – 1997 Graz (Austria) – 1998 Venice (Italy) (The proceedingsof previousESA meetings were publishedas Springer LNCS v umes 726, 855, 979, 1136, 1284, 1461.) In the short time of its history ESA (like its sister meeting SODA) has become a popular and respected meeting. The call for papers stated that the “Symposium covers research in the use, design, and analysis of ef?cient algorithms and data structures as it is carried out in c puter science, discrete applied mathematics and mathematical programming. Papers are solicited describing original results in all areas of algorithmic research, including but not limited to: Approximation Algorithms; Combinatorial Optimization; Compu tional Biology; Computational Geometry; Databases and Information Retrieval; Graph and Network Algorithms; Machine Learning; Number Theory and Computer Algebra; Online Algorithms; Pattern Matching and Data Compression; Symbolic Computation
26 editions published in 1999 in English and held by 245 WorldCat member libraries worldwide
The 7th Annual European Symposium on Algorithms (ESA ’99) is held in Prague, Czech Republic, July 1618, 1999. This continued the tradition of the meetings which were held in – 1993 Bad Honnef (Germany) – 1994 Utrecht (Netherlands) – 1995 Corfu (Greece) – 1996 Barcelona (Spain) – 1997 Graz (Austria) – 1998 Venice (Italy) (The proceedingsof previousESA meetings were publishedas Springer LNCS v umes 726, 855, 979, 1136, 1284, 1461.) In the short time of its history ESA (like its sister meeting SODA) has become a popular and respected meeting. The call for papers stated that the “Symposium covers research in the use, design, and analysis of ef?cient algorithms and data structures as it is carried out in c puter science, discrete applied mathematics and mathematical programming. Papers are solicited describing original results in all areas of algorithmic research, including but not limited to: Approximation Algorithms; Combinatorial Optimization; Compu tional Biology; Computational Geometry; Databases and Information Retrieval; Graph and Network Algorithms; Machine Learning; Number Theory and Computer Algebra; Online Algorithms; Pattern Matching and Data Compression; Symbolic Computation
Diskrete Mathematik : eine Entdeckungsreise by
Jiří Matoušek(
Book
)
10 editions published between 2002 and 2007 in German and held by 152 WorldCat member libraries worldwide
Dieses Buch ist [...] eine hervorragende Einführung in Kombinatorik und Graphentheorie für Studienanfänger in Mathematik (und Informatik). [...] das Buch ist wegen des ungewöhnlichen und sehr attraktiven Stiles der Darstellung bemerkenswert. [...] Die Sprachform ist vorwiegend die eines Gespräches mit dem Leser, der dadurch in die Gedankengänge und Überlegungen des Autors hineingeführt und hineingezogen wird. Zum Beispiel werden bei einem Beweis zuerst die Grundidee oder die Zielsetzung genannt und erläutert, und auch im weiteren Verlauf wird immer wieder durch alternative Formulierungen das Verständnis vertieft oder ermöglicht. Dadurch werden im Leser adäquate Vorstellungen zu den formalen Schritten erzeugt, die dann wieder eigenständiges und kreatives Denken ermöglichen. Die Lektüre ist also anregend und sehr motivierend! Die Aufgaben sind dagegen ziemlich anspruchsvoll, werden aber ausführlich erläutert. [..] W. Dörfler (Klagenfurt), Internationale Mathematische Nachrichten, 2003, Vol 57, Issue 192, S. 4647 [Die Bereiche Kombinatorik und Graphentehorie] werden in all ihren Ausprägungen, reizvollen Einzelergebnissen und vielfältigen Anwendungen [...] ausführlich dargestellt. In gemächlicher Breite behandeln die Autoren ihre Themen, beweisen Kernsätze mehrfach auf unterschiedliche Weise und motivieren wichtige Theorien sehr anregend. Ihr selbstgestelltes Ziel, Freude und Genuss an mathematischem Denken zu vermitteln, dürften sie erreicht haben. Eine Vielzahl inhaltlich sehr reizvoller Aufgaben bereichern den Text; für die schwierigeren findet man in einem Schlusskapitel Lösungshilfen. In weiten Teilen reichen Schulkenntnisse für ein Verständnis aus. Der sehr gehaltvolle Band kann neben Studierenden daher auch bereits Schülern empfohlen werden. Wolfgang Grölz, ekzInformationsdienst, ID 44/2002  BA 12/2002
10 editions published between 2002 and 2007 in German and held by 152 WorldCat member libraries worldwide
Dieses Buch ist [...] eine hervorragende Einführung in Kombinatorik und Graphentheorie für Studienanfänger in Mathematik (und Informatik). [...] das Buch ist wegen des ungewöhnlichen und sehr attraktiven Stiles der Darstellung bemerkenswert. [...] Die Sprachform ist vorwiegend die eines Gespräches mit dem Leser, der dadurch in die Gedankengänge und Überlegungen des Autors hineingeführt und hineingezogen wird. Zum Beispiel werden bei einem Beweis zuerst die Grundidee oder die Zielsetzung genannt und erläutert, und auch im weiteren Verlauf wird immer wieder durch alternative Formulierungen das Verständnis vertieft oder ermöglicht. Dadurch werden im Leser adäquate Vorstellungen zu den formalen Schritten erzeugt, die dann wieder eigenständiges und kreatives Denken ermöglichen. Die Lektüre ist also anregend und sehr motivierend! Die Aufgaben sind dagegen ziemlich anspruchsvoll, werden aber ausführlich erläutert. [..] W. Dörfler (Klagenfurt), Internationale Mathematische Nachrichten, 2003, Vol 57, Issue 192, S. 4647 [Die Bereiche Kombinatorik und Graphentehorie] werden in all ihren Ausprägungen, reizvollen Einzelergebnissen und vielfältigen Anwendungen [...] ausführlich dargestellt. In gemächlicher Breite behandeln die Autoren ihre Themen, beweisen Kernsätze mehrfach auf unterschiedliche Weise und motivieren wichtige Theorien sehr anregend. Ihr selbstgestelltes Ziel, Freude und Genuss an mathematischem Denken zu vermitteln, dürften sie erreicht haben. Eine Vielzahl inhaltlich sehr reizvoller Aufgaben bereichern den Text; für die schwierigeren findet man in einem Schlusskapitel Lösungshilfen. In weiten Teilen reichen Schulkenntnisse für ein Verständnis aus. Der sehr gehaltvolle Band kann neben Studierenden daher auch bereits Schülern empfohlen werden. Wolfgang Grölz, ekzInformationsdienst, ID 44/2002  BA 12/2002
Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity by
Jaroslav Nešetřil(
Book
)
12 editions published in 1992 in English and held by 134 WorldCat member libraries worldwide
This volume in the Annals of Discrete Mathematics brings together contributions by renowned researchers in combinatorics, graphs and complexity. The conference on which this book is based was the fourth in a series which began in 1963, which was the first time specialists from East and West were able to come together. The 1990 meeting attracted 170 mathematicians and computer scientists from around the world, so this book represents an international, detailed view of recent research
12 editions published in 1992 in English and held by 134 WorldCat member libraries worldwide
This volume in the Annals of Discrete Mathematics brings together contributions by renowned researchers in combinatorics, graphs and complexity. The conference on which this book is based was the fourth in a series which began in 1963, which was the first time specialists from East and West were able to come together. The 1990 meeting attracted 170 mathematicians and computer scientists from around the world, so this book represents an international, detailed view of recent research
Topics in discrete mathematics : dedicated to Jarik Nešetřil on the occasion of his 60th birthday by
Martin Klazar(
Book
)
7 editions published in 2006 in English and held by 127 WorldCat member libraries worldwide
The book offers the readers a collection of high quality papers in selected topics of Discrete Mathematics, to celebrate the 60th birthday of Professor Jarik Nešetril. Leading experts have contributed survey and research papers in the areas of Algebraic Combinatorics, Combinatorial Number Theory, Game theory, Ramsey Theory, Graphs and Hypergraphs, Homomorphisms, Graph Colorings and Graph Embeddings
7 editions published in 2006 in English and held by 127 WorldCat member libraries worldwide
The book offers the readers a collection of high quality papers in selected topics of Discrete Mathematics, to celebrate the 60th birthday of Professor Jarik Nešetril. Leading experts have contributed survey and research papers in the areas of Algebraic Combinatorics, Combinatorial Number Theory, Game theory, Ramsey Theory, Graphs and Hypergraphs, Homomorphisms, Graph Colorings and Graph Embeddings
Graphs, morphisms, and statistical physics : DIMACS Workshop Graphs, Morphisms and Statistical Physics, March 1921, 2001,
DIMACS Center by
J Nešetřil(
Book
)
9 editions published between 2003 and 2004 in English and held by 125 WorldCat member libraries worldwide
The intersection of combinatorics and statistical physics has experienced great activity in recent years. This flurry of activity has been fertilized by an exchange not only of techniques, but also of objectives. Computer scientists interested in approximation algorithms have helped statistical physicists and discrete mathematicians overcome language problems. They have found a wealth of common ground in probabilistic combinatorics. Close connections between percolation and random graphs, graph morphisms and hardconstraint models, and slow mixing and phase transition have led to new results a
9 editions published between 2003 and 2004 in English and held by 125 WorldCat member libraries worldwide
The intersection of combinatorics and statistical physics has experienced great activity in recent years. This flurry of activity has been fertilized by an exchange not only of techniques, but also of objectives. Computer scientists interested in approximation algorithms have helped statistical physicists and discrete mathematicians overcome language problems. They have found a wealth of common ground in probabilistic combinatorics. Close connections between percolation and random graphs, graph morphisms and hardconstraint models, and slow mixing and phase transition have led to new results a
Introduction aux mathématiques discrètes by
Jiří Matoušek(
Book
)
6 editions published between 2004 and 2008 in French and held by 104 WorldCat member libraries worldwide
6 editions published between 2004 and 2008 in French and held by 104 WorldCat member libraries worldwide
Sparsity : graphs, structures, and algorithms by
Jaroslav Nešetřil(
Book
)
19 editions published between 2012 and 2014 in English and Undetermined and held by 91 WorldCat member libraries worldwide
"This is the first book devoted to the systematic study of sparse graphs and sparse finite structures"Back cover
19 editions published between 2012 and 2014 in English and Undetermined and held by 91 WorldCat member libraries worldwide
"This is the first book devoted to the systematic study of sparse graphs and sparse finite structures"Back cover
Physics and theoretical computer science : from numbers and languages to (quantum) cryptography by NATO Advanced Study Institute on Emerging Computer Security Technologies(
Book
)
9 editions published in 2007 in English and held by 74 WorldCat member libraries worldwide
9 editions published in 2007 in English and held by 74 WorldCat member libraries worldwide
The mathematics of Paul Erdös(
Book
)
6 editions published between 1997 and 2013 in English and held by 47 WorldCat member libraries worldwide
6 editions published between 1997 and 2013 in English and held by 47 WorldCat member libraries worldwide
Topological, algebraical, and combinatorial structures : Frolík's memorial volume(
Book
)
10 editions published in 1992 in English and held by 42 WorldCat member libraries worldwide
10 editions published in 1992 in English and held by 42 WorldCat member libraries worldwide
The mathematics of Paul Erdös by
Ronald L Graham(
Book
)
19 editions published between 1997 and 2013 in English and held by 26 WorldCat member libraries worldwide
This is the most comprehensive survey of the mathematical life of the legendary Paul Erdős (19131996), one of the most versatile and prolific mathematicians of our time. For the first time, all the main areas of Erdős' research are covered in a single project. Because of overwhelming response from the mathematical community, the project now occupies over 1000 pages, arranged into two volumes. These volumes contain both high level research articles as well as key articles that survey some of the cornerstones of Erdős' work, each written by a leading world specialist in the field. A special chapter "Early Days", rare photographs, and art related to Erdős complement this striking collection. A unique contribution is the bibliography on Erdős' publications: the most comprehensive ever published. This new edition, dedicated to the 100th anniversary of Paul Erdős' birth, contains updates on many of the articles from the two volumes of the first edition, several new articles from prominent mathematicians, a new introduction, and more biographical information about Paul Erdős with an updated list of publications. The second volume contains chapters on graph theory and combinatorics, extremal and Ramsey theory, and a section on infinity that covers Erdős' research on set theory. All of these chapters are essentially updated, particularly the extremal theory chapter that contains a survey of flag algebras, a new technique for solving extremal problems
19 editions published between 1997 and 2013 in English and held by 26 WorldCat member libraries worldwide
This is the most comprehensive survey of the mathematical life of the legendary Paul Erdős (19131996), one of the most versatile and prolific mathematicians of our time. For the first time, all the main areas of Erdős' research are covered in a single project. Because of overwhelming response from the mathematical community, the project now occupies over 1000 pages, arranged into two volumes. These volumes contain both high level research articles as well as key articles that survey some of the cornerstones of Erdős' work, each written by a leading world specialist in the field. A special chapter "Early Days", rare photographs, and art related to Erdős complement this striking collection. A unique contribution is the bibliography on Erdős' publications: the most comprehensive ever published. This new edition, dedicated to the 100th anniversary of Paul Erdős' birth, contains updates on many of the articles from the two volumes of the first edition, several new articles from prominent mathematicians, a new introduction, and more biographical information about Paul Erdős with an updated list of publications. The second volume contains chapters on graph theory and combinatorics, extremal and Ramsey theory, and a section on infinity that covers Erdős' research on set theory. All of these chapters are essentially updated, particularly the extremal theory chapter that contains a survey of flag algebras, a new technique for solving extremal problems
The seventh European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2013 by
Jaroslav Nešetřil(
Book
)
16 editions published between 2013 and 2014 in English and held by 26 WorldCat member libraries worldwide
In the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague), EuroComb'05 (Berlin), Eurocomb'07 (Seville), Eurocomb'09 (Bordeaux), and Eurocomb'11 (Budapest), this volume covers recent advances in combinatorics and graph theory including applications in other areas of mathematics, computer science and engineering. Topics include, but are not limited to: Algebraic combinatorics, combinatorial geometry, combinatorial number theory, combinatorial optimization, designs and configurations, enumerative combinatorics, extremal combinatorics, ordered sets, random methods, topological combinatorics
16 editions published between 2013 and 2014 in English and held by 26 WorldCat member libraries worldwide
In the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague), EuroComb'05 (Berlin), Eurocomb'07 (Seville), Eurocomb'09 (Bordeaux), and Eurocomb'11 (Budapest), this volume covers recent advances in combinatorics and graph theory including applications in other areas of mathematics, computer science and engineering. Topics include, but are not limited to: Algebraic combinatorics, combinatorial geometry, combinatorial number theory, combinatorial optimization, designs and configurations, enumerative combinatorics, extremal combinatorics, ordered sets, random methods, topological combinatorics
Geometry, structure and randomness in combinatorics by
Jiří Matoušek(
Book
)
13 editions published between 2014 and 2015 in English and held by 20 WorldCat member libraries worldwide
Theorem 8.1.Theorem 8.2.; Open question 8.3.; 9 Tverberg's theorem with tolerance; Theorem 9.1.; Lemma 9.2.; Open question 9.3.; References; Cliques and stable setsin undirected graphs; 1 Introduction; 2 Heroes without direction; Conjecture 2.1.; Conjecture 2.2.; Theorem 2.3.; 3 Cographs; Theorem 3.1.; 4 Excluding pairs of graphs; Theorem 4.1.; Theorem 4.2.; Theorem 4.3.; Theorem 4.4.; Theorem 4.5.; 5 Back to tournaments; Theorem 5.1.; Theorem 5.2.; Theorem 5.3.; References; A taste of nonstandard methodsin combinatorics of numbers; Introduction; 1 The hypernumbers of nonstandard analysis
13 editions published between 2014 and 2015 in English and held by 20 WorldCat member libraries worldwide
Theorem 8.1.Theorem 8.2.; Open question 8.3.; 9 Tverberg's theorem with tolerance; Theorem 9.1.; Lemma 9.2.; Open question 9.3.; References; Cliques and stable setsin undirected graphs; 1 Introduction; 2 Heroes without direction; Conjecture 2.1.; Conjecture 2.2.; Theorem 2.3.; 3 Cographs; Theorem 3.1.; 4 Excluding pairs of graphs; Theorem 4.1.; Theorem 4.2.; Theorem 4.3.; Theorem 4.4.; Theorem 4.5.; 5 Back to tournaments; Theorem 5.1.; Theorem 5.2.; Theorem 5.3.; References; A taste of nonstandard methodsin combinatorics of numbers; Introduction; 1 The hypernumbers of nonstandard analysis
Invitación a la matemática discreta by
Jiří Matoušek(
Book
)
2 editions published in 2008 in Spanish and held by 19 WorldCat member libraries worldwide
2 editions published in 2008 in Spanish and held by 19 WorldCat member libraries worldwide
Simple tournaments and sharply transitive groups by
Wilfried Imrich(
Book
)
10 editions published between 1990 and 1991 in English and German and held by 19 WorldCat member libraries worldwide
10 editions published between 1990 and 1991 in English and German and held by 19 WorldCat member libraries worldwide
Mathematical and engineering methods in computer science : Antonín Kučera ... (eds.). 8th International Doctoral Workshop,
MEMICS 2012, Znojmo, Czech Republic, October 2528, 2012, Revised Selected Papers by
Antonín Kučera(
Book
)
7 editions published in 2013 in English and held by 15 WorldCat member libraries worldwide
This volume contains the postproceedings of the 8th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2012, held in Znojmo, Czech Republic, in October, 2012. The 13 thoroughly revised papers were carefully selected out of 31 submissions and are presented together with 6 invited papers. The topics covered by the papers include: computeraided analysis and verification, applications of game theory in computer science, networks and security, modern trends of graph theory in computer science, electronic systems design and testing, and quantum information processing
7 editions published in 2013 in English and held by 15 WorldCat member libraries worldwide
This volume contains the postproceedings of the 8th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2012, held in Znojmo, Czech Republic, in October, 2012. The 13 thoroughly revised papers were carefully selected out of 31 submissions and are presented together with 6 invited papers. The topics covered by the papers include: computeraided analysis and verification, applications of game theory in computer science, networks and security, modern trends of graph theory in computer science, electronic systems design and testing, and quantum information processing
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Rovan, B. (Branislav) Editor
 Gazeau, JeanPierre Editor
 Matoušek, Jiří 1963 Author Editor
 Graham, Ronald L. 1935 Other Author Editor
 Erdős, Paul 19131996 Author
 Matoušek, Jiří Author
 Butler, Steve Editor
 Hell, Pavol Author Editor
 Pellegrini, Marco Editor
 Klazar, Martin Author Editor
Useful Links
Associated Subjects
Algebra Algorithms Combinatorial analysis Computational complexity Computer algorithms Computer science Computer scienceMathematics Computer software Convex geometry Cryptography Data structures (Computer science) Discrete geometry Discrete groups Distribution (Probability theory) Economics Economics, Mathematical Electronic data processing Erdős, Paul, Geometry Graph theory Homomorphisms (Mathematics) Logic, Symbolic and mathematical Mathematics Morphisms (Mathematics) Nešetřil, Jaroslav Number theory Physics Ramsey theory Software engineering Sparse matrices Statistical physics Statistics Topology
Alternative Names
Jaroslav Nešetřil český matematik, vysokoškolský pedagog a výtvarník
Jaroslav Nešetřil czech mathematician, university educator and artist
Jaroslav Nešetřil tschechischer Mathematiker
Jaroslav Nešetřil wiskundige uit Tsjechië
Nešetřil, J.
Nesetril, J. 1946
Nešetřil, J. (Jaroslav)
Nešetřil, Jarik
Nešetřil, Jarik 1946
Nesetril, Jaroslav 1946
ネシェトリル, J
雅羅斯拉夫·內舍特日爾
Languages
Covers