Lecture Notes in Computer Science - Combinatorial Algorithms
Latest Publications

TOTAL DOCUMENTS

30

(FIVE YEARS 0)

H-INDEX

3

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642250101, 9783642250118

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The Rand and Block Distances of Pairs of Set Partitions

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-25011-8_23 ◽

2011 ◽

pp. 287-299

Author(s):

Frank Ruskey ◽

Jennifer Woodcock

Keyword(s):

Download Full-text

Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-25011-8_15 ◽

2011 ◽

pp. 182-194 ◽

Author(s):

Stephane Durocher ◽

Pak Ching Li ◽

Debajyoti Mondal ◽

Aaron Williams

Keyword(s):

Download Full-text

Hamilton Cycles in Restricted Rotator Graphs

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-25011-8_26 ◽

2011 ◽

pp. 324-336 ◽

Author(s):

Brett Stevens ◽

Aaron Williams

Keyword(s):

Hamilton Cycles

Download Full-text

Stable Sets of Threshold-Based Cascades on the Erdős-Rényi Random Graphs

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-25011-8_8 ◽

2011 ◽

pp. 96-105 ◽

Author(s):

Ching-Lueh Chang ◽

Yuh-Dauh Lyuu

Keyword(s):

Random Graphs ◽

Download Full-text

Complexity of the Cop and Robber Guarding Game

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-25011-8_29 ◽

2011 ◽

pp. 361-373

Author(s):

Robert Šámal ◽

Rudolf Stolař ◽

Tomas Valla

Download Full-text

Acyclic Colorings of Graph Subdivisions

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-25011-8_20 ◽

2011 ◽

pp. 247-260 ◽

Author(s):

Debajyoti Mondal ◽

Rahnuma Islam Nishat ◽

Sue Whitesides ◽

Md. Saidur Rahman

Download Full-text

Hamiltonian Orthogeodesic Alternating Paths

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-25011-8_14 ◽

2011 ◽

pp. 170-181 ◽

Author(s):

Emilio Di Giacomo ◽

Luca Grilli ◽

Marcus Krug ◽

Giuseppe Liotta ◽

Ignaz Rutter

Download Full-text

On Minimizing the Number of Label Transitions around a Vertex of a Planar Graph

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-25011-8_24 ◽

2011 ◽

pp. 300-309

Author(s):

Bojan Mohar ◽

Petr Škoda

Keyword(s):

Download Full-text

Quasi-Cyclic Codes over $\mathbb{F}_{13}$

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-25011-8_19 ◽

2011 ◽

pp. 236-246

Author(s):

T. Aaron Gulliver

Keyword(s):

Cyclic Codes ◽

Quasi Cyclic Codes

Download Full-text

A Unifying Property for Distribution-Sensitive Priority Queues

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-25011-8_17 ◽

2011 ◽

pp. 209-222 ◽

Author(s):

Amr Elmasry ◽

Arash Farzan ◽

John Iacono

Keyword(s):

Priority Queues

Download Full-text