PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Alber, Jochen"

Author of the publication

copydeleteadd this publication to your clipboard
Computing the similarity of two sequences with nested arc annotations.

, , , and . Theor. Comput. Sci., 312 (2-3): 337-358 (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dr. -Ing. Stefan Alber University of Stuttgart

Dr. Jochen Seidel University of Stuttgart

apl. Prof. Dr. Hans-Jürgen Albers University of Stuttgart

Hon. -Prof. Dr. Jochen Mannhart University of Stuttgart

Jochen Wiedemann University of Stuttgart

 

Other publications of authors with the same name

Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs., , , , and . Algorithmica, 33 (4): 461-493 (2002)Parameterized complexity: exponential speed-up for planar graph problems., , and . J. Algorithms, 52 (1): 26-56 (2004)Refined Search Tree Technique for DOMINATING SET on Planar Graphs., , , , , , and . MFCS, volume 2136 of Lecture Notes in Computer Science, page 111-122. Springer, (2001)Experiments on data reduction for optimal domination in networks., , and . Annals OR, 146 (1): 105-117 (2006)Faster exact algorithms for hard problems: A parameterized point of view., , and . Discrete Mathematics, 229 (1-3): 3-27 (2001)A refined search tree technique for Dominating Set on planar graphs., , , , , , and . J. Comput. Syst. Sci., 71 (4): 385-405 (2005)Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs., and . IFIP TCS, volume 223 of IFIP Conference Proceedings, page 26-37. Kluwer, (2002)Exact algorithms for NP hard problems on networks: design, analysis and implementation.. University of Tübingen, Germany, (2002)Avoiding Forbidden Submatrices by Row Deletions., , , , and . SOFSEM, volume 2932 of Lecture Notes in Computer Science, page 349-360. Springer, (2004)Graph separators: a parameterized view., , and . J. Comput. Syst. Sci., 67 (4): 808-832 (2003)