| 000 -LEADER |
|---|
| fixed length control field |
04131nam a22005295i 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20140310144055.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
|---|
| fixed length control field |
cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
101203s2010 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783642174933 |
|
978-3-642-17493-3 |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA76.9.A43 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.1 |
| Edition number |
23 |
| 264 #1 - |
|---|
| -- |
Berlin, Heidelberg : |
| -- |
Springer Berlin Heidelberg, |
| -- |
2010. |
| 912 ## - |
|---|
| -- |
ZDB-2-SCS |
|
|---|
| -- |
ZDB-2-LNC |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Raman, Venkatesh. |
| Relator term |
editor. |
| 245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
|---|
| Title |
Parameterized and Exact Computation |
| Medium |
[electronic resource] : |
| Remainder of title |
5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings / |
| Statement of responsibility, etc |
edited by Venkatesh Raman, Saket Saurabh. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
X, 239p. |
| Other physical details |
online resource. |
| 440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE |
|---|
| Title |
Lecture Notes in Computer Science, |
| International Standard Serial Number |
0302-9743 ; |
| Volume number/sequential designation |
6478 |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
The Complexity of Satisfaction on Sparse Graphs -- Protrusions in Graphs and Their Applications -- Parameterized Complexity Results in Symmetry Breaking -- On the Kernelization Complexity of Colorful Motifs -- Partial Kernelization for Rank Aggregation: Theory and Experiments -- Enumerate and Measure: Improving Parameter Budget Management -- On the Exact Complexity of Evaluating Quantified k-CNF -- Cluster Editing: Kernelization Based on Edge Cuts -- Computing the Deficiency of Housing Markets with Duplicate Houses -- A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application -- An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion -- Multivariate Complexity Analysis of Swap Bribery -- Parameterizing by the Number of Numbers -- Are There Any Good Digraph Width Measures? -- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems -- Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming -- On the Grundy Number of a Graph -- Exponential Time Complexity of Weighted Counting of Independent Sets -- The Exponential Time Complexity of Computing the Probability That a Graph Is Connected -- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting -- Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier -- Proper Interval Vertex Deletion. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
This book constitutes the refereed best selected papers of the 5th International Symposium on Parameterized and Exact Computation, IPEC 2010, held in Chennai, India, in December 2010. The 19 revised full papers presented were carefully reviewed and selected from 32 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact algorithms; parameterized complexity theory; relationship between parameterized complexity and traditional complexity classifications; applications of parameterized and exact computation; implementation issues of parameterized and exact algorithms; fixed-parameter approximation; fast approximation in exponential time; kernelization lower and upper bounds. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer science. |
|
|---|
| Topical term or geographic name as entry element |
Information theory. |
|
|---|
| Topical term or geographic name as entry element |
Computer software. |
|
|---|
| Topical term or geographic name as entry element |
Computational complexity. |
|
|---|
| Topical term or geographic name as entry element |
Algebra |
| General subdivision |
Data processing. |
|
|---|
| Topical term or geographic name as entry element |
Algorithms. |
|
|---|
| Topical term or geographic name as entry element |
Computer Science. |
|
|---|
| Topical term or geographic name as entry element |
Algorithm Analysis and Problem Complexity. |
|
|---|
| Topical term or geographic name as entry element |
Algorithms. |
|
|---|
| Topical term or geographic name as entry element |
Discrete Mathematics in Computer Science. |
|
|---|
| Topical term or geographic name as entry element |
Theory of Computation. |
|
|---|
| Topical term or geographic name as entry element |
Symbolic and Algebraic Manipulation. |
|
|---|
| Topical term or geographic name as entry element |
Computation by Abstract Devices. |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Saurabh, Saket. |
| Relator term |
editor. |
| 710 2# - ADDED ENTRY--CORPORATE NAME |
|---|
| Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY |
|---|
| Title |
Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
|---|
| Display text |
Printed edition: |
| International Standard Book Number |
9783642174926 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-3-642-17493-3 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
E-Book |
