Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540439967, 9783540456551

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Sharpening Occam’s Razor

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-45655-4_44 ◽

2002 ◽

pp. 411-419 ◽

Cited By ~ 1

Author(s):

Ming Li ◽

John Tromp ◽

Paul Vitányi

Keyword(s):

Occam’S Razor ◽

Occam's Razor

Download Full-text

On the Connected Domination Number of Random Regular Graphs

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-45655-4_24 ◽

2002 ◽

pp. 210-219 ◽

Cited By ~ 1

Author(s):

William Duckworth ◽

Bernard Mans

Keyword(s):

Domination Number ◽

Regular Graphs ◽

Connected Domination Number

Download Full-text

On-Line Maximizing the Number of Items Packed in Variable-Sized Bins

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-45655-4_50 ◽

2002 ◽

pp. 467-475 ◽

Cited By ~ 1

Author(s):

Leah Epstein ◽

Lene M. Favrholdt

Keyword(s):

On Line

Download Full-text

New Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-45655-4_28 ◽

2002 ◽

pp. 249-258 ◽

Cited By ~ 4

Author(s):

Amitava Datta ◽

Albert Y. Zomaya

Keyword(s):

Routing Protocol ◽

Energy Efficient ◽

Radio Networks ◽

New Energy ◽

Permutation Routing

Download Full-text

Maximum Flows and Critical Vertices in AND/OR Graphs

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-45655-4_27 ◽

2002 ◽

pp. 238-248 ◽

Cited By ~ 3

Author(s):

Yvo Desmedt ◽

Yongge Wang

Keyword(s):

Maximum Flows

Download Full-text

Broadcasting in Generalized de Bruijn Digraphs

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-45655-4_23 ◽

2002 ◽

pp. 200-209 ◽

Cited By ~ 1

Author(s):

Yosuke Kikuchi ◽

Shingo Osawa ◽

Yukio Shibata

Keyword(s):

De Bruijn ◽

De Bruijn Digraphs

Download Full-text

Co-orthogonal Codes

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-45655-4_17 ◽

2002 ◽

pp. 144-152

Author(s):

Vince Grolmusz

Keyword(s):

Orthogonal Codes

Download Full-text

Extending the Accommodating Function

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-45655-4_11 ◽

2002 ◽

pp. 87-96 ◽

Cited By ~ 2

Author(s):

Joan Boyar ◽

Lene M. Favrholdt ◽

Kim S. Larsen ◽

Morten N. Nielsen

Download Full-text

New Architecture and Algorithms for Degradable VLSI/WSI Arrays

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-45655-4_21 ◽

2002 ◽

pp. 181-190 ◽

Cited By ~ 1

Author(s):

Wu Jigang ◽

Heiko Schröder ◽

Srikanthan Thambipillai

Download Full-text

On the Number of Minimum Cuts in a Graph

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/3-540-45655-4_25 ◽

2002 ◽

pp. 220-229

Author(s):

L. Sunil Chandran ◽

L. Shankar Ram

Keyword(s):

Minimum Cuts

Download Full-text

Lecture Notes in Computer Science - Computing and CombinatoricsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Sharpening Occam’s Razor

On the Connected Domination Number of Random Regular Graphs

On-Line Maximizing the Number of Items Packed in Variable-Sized Bins

New Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks

Maximum Flows and Critical Vertices in AND/OR Graphs

Broadcasting in Generalized de Bruijn Digraphs

Co-orthogonal Codes

Extending the Accommodating Function

New Architecture and Algorithms for Degradable VLSI/WSI Arrays

On the Number of Minimum Cuts in a Graph

Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications