Editors:
State-of-the-art research
Fast-track conference proceedings
Unique visibility
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 7288)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Conference series link(s): FUN: International Conference on Fun with Algorithms
Conference proceedings info: FUN 2012.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsThis is a preview of subscription content, access via your institution.
Table of contents (37 papers)
-
Front Matter
About this book
Keywords
- combinatorics
- complexity
- extremal graph theory
- intruder detection
- sensor network
- algorithm analysis and problem complexity
- data structures
Editors and Affiliations
-
School of Computer Science, Carleton University, Ottawa, Canada
Evangelos Kranakis
-
Department of Mathematics and Computer Science, Wesleyan University, Middleton, USA
Danny Krizanc
-
Dipartimento di Scienze Ambientali, Informatica e Statistica, Università Ca’ Foscari, Mestre (Ve), Italy
Flaminia Luccio
Bibliographic Information
Book Title: Fun with Algorithms
Book Subtitle: 6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012, Proceedings
Editors: Evangelos Kranakis, Danny Krizanc, Flaminia Luccio
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-30347-0
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2012
Softcover ISBN: 978-3-642-30346-3Published: 11 May 2012
eBook ISBN: 978-3-642-30347-0Published: 31 May 2012
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XI, 397
Number of Illustrations: 148 b/w illustrations
Topics: Algorithms, Discrete Mathematics in Computer Science, Computer Communication Networks, Artificial Intelligence, Data Science, Theory of Computation