Vor Ort
Merkzettel Warenkorb
  • Produktbild: Combinatorial Algorithms
  • Produktbild: Combinatorial Algorithms
Band 11638

Combinatorial Algorithms 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings

Aus der Reihe Theoretical Computer Science and General Issues

73,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

11.07.2019

Herausgeber

Charles J. Colbourn + weitere

Verlag

Springer

Seitenzahl

456

Maße (L/B/H)

23,5/15,5/2,6 cm

Gewicht

715 g

Auflage

1st ed. 2019

Sprache

Englisch

ISBN

978-3-030-25004-1

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

11.07.2019

Herausgeber

Verlag

Springer

Seitenzahl

456

Maße (L/B/H)

23,5/15,5/2,6 cm

Gewicht

715 g

Auflage

1st ed. 2019

Sprache

Englisch

ISBN

978-3-030-25004-1

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Combinatorial Algorithms
  • Produktbild: Combinatorial Algorithms
  • A note on handicap incomplete tournaments.- Computing the k-Crossing Visibility Region of a Point in a Polygon.- An Improved Scheme in the Two Query Adaptive Bitprobe Model.- On Erdős‒Szekeres-type problems for k-convex point sets.- Algorithms and Hardness results on Liar's Dominating Set and k-tuple Dominating Set.- Fixed-parameter tractability of (n-k) List Coloring.- Finding Periods in Cartesian Tree Matching.- Parameterized Complexity of Min-Power Asymmetric Connectivity.- Solving Group Interval Scheduling Efficiently.- Call Admission on Trees with Advice (Extended Abstract).- Power Edge Set and Zero Forcing Set remain difficult in cubic graphs.- Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs.- Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs.- Dual Domination.- Reaching 3-Connectivity via Edge-edge Additions.- Cops and robber on some families of oriented graphs.- Disjoint clustering in combinatorial circuits.- The hull number in the convexity of induced paths of order 3.- Supermagic graphs with many odd degrees.- Incremental algorithm for minimum cut and edge connectivity in Hypergraph.- A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications.- Shortest-Path-Preserving Rounding.- Complexity and Algorithms for Semipaired Domination in Graphs.- Computing the Rooted Triplet Distance between Phylogenetic Networks.- Parameterized Algorithms for Graph Burning Problem.- Extension and its price for the connected vertex cover problem.- An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number.- An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs.- Complexity of fall coloring for restricted graph classes.- Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling under Precedence Constraints.- Maximum clique exhaustive search in circulant k-hypergraphs.- Burrows-Wheeler transform of words defined by morphisms.- Stable Noncrossing Matchings.- On the Average Case of MergeInsertion.- Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings.- A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber.