Combinatorial Algorithms
- Kauf auf Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
- Branching Systems
- Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology
- Succinct Representations of Trees
- Kt Minors in Large t-Connected Graphs
- Intractability in Graph Drawing and Geometry: FPT Approaches
- Contributed Talks
- Evaluation of Recoverable-Robust Timetables on Tree Networks
- Weighted LCS
- Integrality Properties of Certain Special Balanceable Families
- Forbidden Subgraph Colorings and the Oriented Chromatic Number
- Polynomial Kernels for 3-Leaf Power Graph Modification Problems
- Approximating the Max Edge-Coloring Problem
- Three Complexity Results on Coloring P k -Free Graphs
- Fully Decomposable Split Graphs
- Feedback Vertex Set on Graphs of Low Cliquewidth
- Note on Decomposition of K n,n into (0,j)-prisms
- Edge-Simple Circuits through 10 Ordered Vertices in Square Grids
- Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search
- LPF Computation Revisited
- Limiting Distribution for Distances in k-Trees
- Gray Code Compression
- Embedded Trees and the Support of the ISE
- Combinatorial Models for Cooperation Networks
- Polar Permutation Graphs
- A New Algorithm for Efficient Pattern Matching with Swaps
- The Height and Range of Watermelons without Wall
- Fast Convolutions and Their Applications in Approximate String Matching
- Better Polynomial Algorithms on Graphs of Bounded Rank-Width
- Minimax Trees in Linear Time with Applications
- Planar Biconnectivity Augmentation with Fixed Embedding
- Trivially-Perfect Width
- Lightweight Parameterized Suffix Array Construction
- On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices
- Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees
- On the Maximal Number of Cubic Subwords in a String
- Solution of Peter Winkler's Pizza Problem
- An O(n)-Time Algorithm for the Paired-Domination Problem
- Simpler Parameterized Algorithm for OCT
- Bipartite Graphs of Large Clique-Width
- Kernel in Oriented Circulant Graphs
- Randomized Postoptimization of Covering Arrays
- New Word-Based Adaptive Dense Compressors
- Rainbow Connection in Graphs with Minimum Degree Three
- The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree
- Computability of Width of Submodular Partition Functions
- The Guarding Problem - Complexity and Approximation
- Antibandwidth of d-Dimensional Meshes
- 2009, 2009, XII, 480 Seiten, mit Abbildungen, Maße: 15,5 x 23,5 cm, Kartoniert (TB), Englisch
- Herausgegeben von Fiala, Jiri; Kratochvil, Jan; Miller, Mirka
- Verlag: Springer
- ISBN-10: 3642102166
- ISBN-13: 9783642102165
- Erscheinungsdatum: 09.11.2009
Selected Areas in Cryptography
Elena Andreeva, Mihir Bellare, Orr Dunkelman, Dengguo Feng, Shai Halevi, Florian Mendel
76.99 €
82.49 €
Quantum Computing verstehen
Matthias Homeister
35.97 €
Datenstrukturen und Algorithmen
Ralf Hartmut Güting, Stefan Dieker
35.97 €
76.99 €
Contemporary Cryptology
Dario Catalano, Ivan Damgard, Giovanni Di Crescenzo, David Pointcheval, Tsuyoshi Takagi, Ronald Cramer
43.95 €
Keine Kommentare vorhanden
Jetzt bewertenSchreiben Sie den ersten Kommentar zu "Combinatorial Algorithms".
Kommentar verfassen