1 / 431
文档名称:

Springer - [LNCS 6460] Combinatorial Algorithms (Apr 2011).pdf

格式:pdf   页数:431
下载后只包含 1 个 PDF 格式的文档,没有任何的图纸或源代码,查看文件列表

如果您已付费下载过本站文档,您可以点这里二次下载

Springer - [LNCS 6460] Combinatorial Algorithms (Apr 2011).pdf

上传人:bolee65 2014/1/28 文件大小:0 KB

下载得到文件列表

Springer - [LNCS 6460] Combinatorial Algorithms (Apr 2011).pdf

文档介绍

文档介绍:Lecture Notes puter Science 6460
Commenced Publication in 1973
Founding and Former Series Editors:
Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board
David Hutchison
Lancaster University, UK
Takeo Kanade
Carnegie Mellon University, Pittsburgh, PA, USA
Josef Kittler
University of Surrey, Guildford, UK
Jon M. Kleinberg
Cornell University, Ithaca, NY, USA
Alfred Kobsa
University of California, Irvine, CA, USA
Friedemann Mattern
ETH Zurich, Switzerland
John C. Mitchell
Stanford University, CA, USA
Moni Naor
Weizmann Institute of Science, Rehovot, Israel
Oscar Nierstrasz
University of Bern, Switzerland
C. Pandu Rangan
Indian Institute of Technology, Madras, India
Bernhard Steffen
TU Dortmund University, Germany
Madhu Sudan
Microsoft Research, Cambridge, MA, USA
Demetri Terzopoulos
University of California, Los Angeles, CA, USA
Doug Tygar
University of California, Berkeley, CA, USA
Gerhard Weikum
Max Planck Institute for Informatics, Saarbruecken, Germany
Costas S. Iliopoulos William F. Smyth (Eds.)
Combinatorial
Algorithms
21st International Workshop, IWOCA 2010
London, UK, July 26-28, 2010
Revised Selected Papers
13
Volume Editors
Costas S. Iliopoulos
University of London, King’s College
Department puter Science
The Strand, London, WC2R 2LS, UK
E-mail: ******@
William F. Smyth
McMaster University, Department puting and Software
1280 Main Street West, Hamilton, ON L8S 4K1, Canada
E-mail: ******@
ISSN 0302-9743 e-ISSN 1611-3349
ISBN 978-3-642-19221-0 e-ISBN 978-3-642-19222-7
DOI -3-642-19222-7
Springer Heidelberg Dordrecht London New York
Library of Congress Control Number: 2011920712
CR Subject Classification (1998): , , , , , ,
LNCS Sublibrary: SL 1 – puter Science and General Issues
© Springer-Verlag Berlin Heidelberg 2011
This work is subject to copyright. All rights are reserved, whether the whole or part of th