SOFSEM 2010: Theory and Practice of Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642112652, 9783642112669

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Research Issues in the Automated Testing of Ajax Applications

SOFSEM 2010: Theory and Practice of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-642-11266-9_2 ◽

2010 ◽

pp. 16-28 ◽

Cited By ~ 5

Author(s):

Arie van Deursen ◽

Ali Mesbah

Keyword(s):

Automated Testing ◽

Research Issues

Download Full-text

A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks

SOFSEM 2010: Theory and Practice of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-642-11266-9_14 ◽

2010 ◽

pp. 165-175

Author(s):

Maxim A. Babenko ◽

Ignat I. Kolesnichenko ◽

Ilya P. Razenshteyn

Keyword(s):

Linear Time ◽

Time Algorithm ◽

Disjoint Paths ◽

Linear Time Algorithm ◽

Edge Disjoint

Download Full-text

Design Patterns Instantiation Based on Semantics and Model Transformations

SOFSEM 2010: Theory and Practice of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-642-11266-9_45 ◽

2010 ◽

pp. 540-551 ◽

Cited By ~ 7

Author(s):

Peter Kajsa ◽

L’ubomír Majtás

Keyword(s):

Design Patterns ◽

Model Transformations

Download Full-text

Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup

SOFSEM 2010: Theory and Practice of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-642-11266-9_55 ◽

2010 ◽

pp. 663-671

Author(s):

Jakub Radoszewski ◽

Wojciech Rytter

Keyword(s):

Idempotent Semigroup

Download Full-text

On Contracting Graphs to Fixed Pattern Graphs

SOFSEM 2010: Theory and Practice of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-642-11266-9_42 ◽

2010 ◽

pp. 503-514 ◽

Cited By ~ 4

Author(s):

Pim van ’t Hof ◽

Marcin Kamiński ◽

Daniël Paulusma ◽

Stefan Szeider ◽

Dimitrios M. Thilikos

Download Full-text

Optimum Broadcasting in Complete Weighted-Vertex Graphs

SOFSEM 2010: Theory and Practice of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-642-11266-9_41 ◽

2010 ◽

pp. 489-502 ◽

Cited By ~ 1

Author(s):

Hovhannes Harutyunyan ◽

Shahin Kamali

Keyword(s):

Weighted Vertex

Download Full-text

Destructive Rule-Based Properties and First-Order Logic

SOFSEM 2010: Theory and Practice of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-642-11266-9_28 ◽

2010 ◽

pp. 334-345

Author(s):

David Duris

Keyword(s):

Order Logic ◽

First Order Logic ◽

Rule Based ◽

First Order

Download Full-text

A Kernel for Convex Recoloring of Weighted Forests

SOFSEM 2010: Theory and Practice of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-642-11266-9_18 ◽

2010 ◽

pp. 212-223

Author(s):

Hans L. Bodlaender ◽

Marc Comas

Download Full-text

Approximability of Edge Matching Puzzles

SOFSEM 2010: Theory and Practice of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-642-11266-9_13 ◽

2010 ◽

pp. 153-164 ◽

Cited By ~ 3

Author(s):

Antonios Antoniadis ◽

Andrzej Lingas

Keyword(s):

Edge Matching ◽

Edge Matching Puzzles

Download Full-text

Mixing Coverability and Reachability to Analyze VASS with One Zero-Test

SOFSEM 2010: Theory and Practice of Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-642-11266-9_33 ◽

2010 ◽

pp. 394-406 ◽

Cited By ~ 5

Author(s):

Alain Finkel ◽

Arnaud Sangnier

Keyword(s):

Zero Test

Download Full-text

SOFSEM 2010: Theory and Practice of Computer Science - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Research Issues in the Automated Testing of Ajax Applications

A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks

Design Patterns Instantiation Based on Semantics and Model Transformations

Efficient Testing of Equivalence of Words in a Free Idempotent Semigroup

On Contracting Graphs to Fixed Pattern Graphs

Optimum Broadcasting in Complete Weighted-Vertex Graphs

Destructive Rule-Based Properties and First-Order Logic

A Kernel for Convex Recoloring of Weighted Forests

Approximability of Edge Matching Puzzles

Mixing Coverability and Reachability to Analyze VASS with One Zero-Test

SOFSEM 2010: Theory and Practice of Computer Science - Lecture Notes in Computer Science
Latest Publications