Algorithm Theory – SWAT 2006 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

39

(FIVE YEARS 0)

H-INDEX

9

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540357537, 9783540357551

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On Guarding Rectilinear Domains

Algorithm Theory – SWAT 2006 - Lecture Notes in Computer Science ◽

10.1007/11785293_22 ◽

2006 ◽

pp. 220-231 ◽

Author(s):

Matthew J. Katz ◽

Gabriel S. Roisman

Download Full-text

Sorting by Merging or Merging by Sorting?

Algorithm Theory – SWAT 2006 - Lecture Notes in Computer Science ◽

10.1007/11785293_10 ◽

2006 ◽

pp. 77-89

Author(s):

Gianni Franceschini

Download Full-text

A Simpler Linear-Time Recognition of Circular-Arc Graphs

Algorithm Theory – SWAT 2006 - Lecture Notes in Computer Science ◽

10.1007/11785293_7 ◽

2006 ◽

pp. 41-52 ◽

Author(s):

Haim Kaplan ◽

Yahav Nussbaum

Keyword(s):

Linear Time ◽

Circular Arc ◽

Circular Arc Graphs

Download Full-text

Triangles, 4-Cycles and Parameterized (In-)Tractability

Algorithm Theory – SWAT 2006 - Lecture Notes in Computer Science ◽

10.1007/11785293_29 ◽

2006 ◽

pp. 304-315 ◽

Author(s):

Venkatesh Raman ◽

Saket Saurabh

Download Full-text

Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes

Algorithm Theory – SWAT 2006 - Lecture Notes in Computer Science ◽

10.1007/11785293_16 ◽

2006 ◽

pp. 148-159 ◽

Author(s):

Serge Gaspers ◽

Dieter Kratsch ◽

Mathieu Liedloff

Keyword(s):

Dominating Set ◽

Exponential Time ◽

Minimum Dominating Set ◽

Graph Classes ◽

Exponential Time Algorithms ◽

Dominating Set Problem

Download Full-text

Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily)

Algorithm Theory – SWAT 2006 - Lecture Notes in Computer Science ◽

10.1007/11785293_1 ◽

2006 ◽

pp. 1-1

Author(s):

Raimund Seidel

Keyword(s):

Download Full-text

Generalized Powers of Graphs and Their Algorithmic Use

Algorithm Theory – SWAT 2006 - Lecture Notes in Computer Science ◽

10.1007/11785293_39 ◽

2006 ◽

pp. 423-434 ◽

Author(s):

Andreas Brandstädt ◽

Feodor F. Dragan ◽

Yang Xiang ◽

Chenyu Yan

Download Full-text

On Spanners of Geometric Graphs

Algorithm Theory – SWAT 2006 - Lecture Notes in Computer Science ◽

10.1007/11785293_36 ◽

2006 ◽

pp. 388-399 ◽

Author(s):

Joachim Gudmundsson ◽

Michiel Smid

Keyword(s):

Geometric Graphs

Download Full-text

Finding the Position of the k-Mismatch and Approximate Tandem Repeats

Algorithm Theory – SWAT 2006 - Lecture Notes in Computer Science ◽

10.1007/11785293_11 ◽

2006 ◽

pp. 90-101 ◽

Author(s):

Haim Kaplan ◽

Ely Porat ◽

Nira Shafrir

Keyword(s):

Download Full-text

Scheduling Jobs on Grid Processors

Algorithm Theory – SWAT 2006 - Lecture Notes in Computer Science ◽

10.1007/11785293_5 ◽

2006 ◽

pp. 17-28 ◽

Author(s):

Joan Boyar ◽

Lene M. Favrholdt

Download Full-text