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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642358425, 9783642358432

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Refinement Inference for Sequence Diagrams

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

10.1007/978-3-642-35843-2_37 ◽

2013 ◽

pp. 432-444

Author(s):

Lunjin Lu ◽

Dae-Kyoo Kim

Keyword(s):

Sequence Diagrams

Download Full-text

Mixed Hypergraphs for Linear-Time Construction of Denser Hashing-Based Data Structures

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

10.1007/978-3-642-35843-2_31 ◽

2013 ◽

pp. 356-368 ◽

Cited By ~ 2

Author(s):

Michael Rink

Keyword(s):

Data Structures ◽

Linear Time

Download Full-text

Incomplete Transition Complexity of Some Basic Operations

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

10.1007/978-3-642-35843-2_28 ◽

2013 ◽

pp. 319-331 ◽

Cited By ~ 3

Author(s):

Eva Maia ◽

Nelma Moreira ◽

Rogério Reis

Download Full-text

Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs

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

10.1007/978-3-642-35843-2_24 ◽

2013 ◽

pp. 268-279 ◽

Cited By ~ 6

Author(s):

Mamadou Moustapha Kanté ◽

Lhouari Nourine

Keyword(s):

Polynomial Time ◽

Chordal Graphs ◽

Polynomial Time Algorithms

Download Full-text

Software Components in Computer Assisted Living?

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

10.1007/978-3-642-35843-2_2 ◽

2013 ◽

pp. 28-28

Author(s):

Frantisek Plasil ◽

Tomas Bures

Keyword(s):

Assisted Living ◽

Computer Assisted ◽

Software Components

Download Full-text

A Model of the Commit Size Distribution of Open Source

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

10.1007/978-3-642-35843-2_6 ◽

2013 ◽

pp. 52-66 ◽

Cited By ~ 7

Author(s):

Carsten Kolassa ◽

Dirk Riehle ◽

Michel A. Salim

Keyword(s):

Open Source ◽

Size Distribution

Download Full-text

Improved Approximations for Ordered TSP on Near-Metric Graphs,

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

10.1007/978-3-642-35843-2_15 ◽

2013 ◽

pp. 157-168 ◽

Cited By ~ 1

Author(s):

Hans-Joachim Böckenhauer ◽

Monika Steinová

Keyword(s):

Metric Graphs

Download Full-text

Weak Arithmetic Completeness of Object-Oriented First-Order Assertion Networks

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

10.1007/978-3-642-35843-2_19 ◽

2013 ◽

pp. 207-219 ◽

Cited By ~ 2

Author(s):

Stijn de Gouw ◽

Frank de Boer ◽

Wolfgang Ahrendt ◽

Richard Bubel

Keyword(s):

Object Oriented ◽

First Order

Download Full-text

Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs

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

10.1007/978-3-642-35843-2_29 ◽

2013 ◽

pp. 332-343 ◽

Cited By ~ 2

Author(s):

George B. Mertzios ◽

Paul G. Spirakis

Keyword(s):

Small Diameter

Download Full-text

Logic Characterization of Invisibly Structured Languages: The Case of Floyd Languages

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

10.1007/978-3-642-35843-2_27 ◽

2013 ◽

pp. 307-318 ◽

Cited By ~ 2

Author(s):

Violetta Lonati ◽

Dino Mandrioli ◽

Matteo Pradella

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Refinement Inference for Sequence Diagrams

Mixed Hypergraphs for Linear-Time Construction of Denser Hashing-Based Data Structures

Incomplete Transition Complexity of Some Basic Operations

Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs

Software Components in Computer Assisted Living?

A Model of the Commit Size Distribution of Open Source

Improved Approximations for Ordered TSP on Near-Metric Graphs,

Weak Arithmetic Completeness of Object-Oriented First-Order Assertion Networks

Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs

Logic Characterization of Invisibly Structured Languages: The Case of Floyd Languages

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