|
|
|
|
| LEADER |
03766nam a22005895i 4500 |
| 001 |
978-3-540-28639-4 |
| 003 |
DE-He213 |
| 005 |
20151204150841.0 |
| 007 |
cr nn 008mamaa |
| 008 |
121227s2004 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540286394
|9 978-3-540-28639-4
|
| 024 |
7 |
|
|a 10.1007/b100584
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.A43
|
| 072 |
|
7 |
|a UMB
|2 bicssc
|
| 072 |
|
7 |
|a COM051300
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1
|2 23
|
| 245 |
1 |
0 |
|a Parameterized and Exact Computation
|h [electronic resource] :
|b First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004. Proceedings /
|c edited by Rod Downey, Michael Fellows, Frank Dehne.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2004.
|
| 300 |
|
|
|a X, 298 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3162
|
| 505 |
0 |
|
|a Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction -- Online Problems, Pathwidth, and Persistence -- Chordless Paths Through Three Vertices -- Computing Small Search Numbers in Linear Time -- Bounded Fixed-Parameter Tractability: The Case 2poly( k) -- Refined Memorisation for Vertex Cover -- Parameterized Graph Separation Problems -- Parameterized Coloring Problems on Chordal Graphs -- On Decidability of MSO Theories of Representable Matroids -- On Miniaturized Problems in Parameterized Complexity Theory -- Smaller Kernels for Hitting Set Problems of Constant Arity -- Packing Edge Disjoint Triangles: A Parameterized View -- Looking at the Stars -- Moving Policies in Cyclic Assembly-Line Scheduling -- A Structural View on Parameterizing Problems: Distance from Triviality -- Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable -- Simplifying the Weft Hierarchy -- The Minimum Weight Triangulation Problem with Few Inner Points -- A Direct Algorithm for the Parameterized Face Cover Problem -- On Finding Short Resolution Refutations and Small Unsatisfiable Subsets -- Parameterized Algorithms for Feedback Vertex Set -- Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms -- Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments -- Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover -- Space and Time Complexity of Exact Algorithms: Some Open Problems -- Practical FPT Implementations and Applications.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Application software.
|
| 650 |
|
0 |
|a Probabilities.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Probability Theory and Stochastic Processes.
|
| 650 |
2 |
4 |
|a Computer Applications.
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|
| 650 |
2 |
4 |
|a Data Structures.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 700 |
1 |
|
|a Downey, Rod.
|e editor.
|
| 700 |
1 |
|
|a Fellows, Michael.
|e editor.
|
| 700 |
1 |
|
|a Dehne, Frank.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540230717
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3162
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/b100584
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 912 |
|
|
|a ZDB-2-BAE
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
