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

TOTAL DOCUMENTS

(FIVE YEARS 44)

H-INDEX

(FIVE YEARS 1)

Published By Springer International Publishing

9783030677305, 9783030677312

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Clusters of Repetition Roots: Single Chains

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

10.1007/978-3-030-67731-2_29 ◽

2021 ◽

pp. 400-409

Author(s):

Szilárd Zsolt Fazekas ◽

Robert Mercaş

Download Full-text

Drawing Two Posets

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

10.1007/978-3-030-67731-2_30 ◽

2021 ◽

pp. 410-420

Author(s):

Guido Brückner ◽

Vera Chekan

Download Full-text

Invited Talk: Resilient Distributed Algorithms

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

10.1007/978-3-030-67731-2_3 ◽

2021 ◽

pp. 28-42

Author(s):

Merav Parter

Keyword(s):

Distributed Algorithms

Download Full-text

On the Terminal Connection Problem

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

10.1007/978-3-030-67731-2_20 ◽

2021 ◽

pp. 278-292

Author(s):

Alexsander A. de Melo ◽

Celina M. H. de Figueiredo ◽

Uéverton S. Souza

Keyword(s):

Connection Problem

Download Full-text

Hierarchical b-Matching

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

10.1007/978-3-030-67731-2_14 ◽

2021 ◽

pp. 189-202

Author(s):

Yuval Emek ◽

Shay Kutten ◽

Mordechai Shalom ◽

Shmuel Zaks

Download Full-text

The Multiple Traveling Salesman Problem on Spiders

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

10.1007/978-3-030-67731-2_24 ◽

2021 ◽

pp. 337-348

Author(s):

Pedro Pérez-Escalona ◽

Ivan Rapaport ◽

José Soto ◽

Ian Vidal

Keyword(s):

Traveling Salesman Problem ◽

Traveling Salesman ◽

Multiple Traveling Salesman Problem

Download Full-text

Parameterizing Role Coloring on Forests

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

10.1007/978-3-030-67731-2_22 ◽

2021 ◽

pp. 308-321

Author(s):

Sukanya Pandey ◽

Venkatesh Raman ◽

Vibha Sahlot

Download Full-text

Metadata Management on Data Processing in Data Lakes

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

10.1007/978-3-030-67731-2_40 ◽

2021 ◽

pp. 553-562

Author(s):

Imen Megdiche ◽

Franck Ravat ◽

Yan Zhao

Keyword(s):

Data Processing ◽

Metadata Management

Download Full-text

The Complexity of Flow Expansion and Electrical Flow Expansion

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

10.1007/978-3-030-67731-2_32 ◽

2021 ◽

pp. 431-441

Author(s):

Dorothea Wagner ◽

Matthias Wolf

Download Full-text

Concatenation Operations and Restricted Variants of Two-Dimensional Automata

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

10.1007/978-3-030-67731-2_11 ◽

2021 ◽

pp. 147-158

Author(s):

Taylor J. Smith ◽

Kai Salomaa

Keyword(s):

Two Dimensional

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Clusters of Repetition Roots: Single Chains

Drawing Two Posets

Invited Talk: Resilient Distributed Algorithms

On the Terminal Connection Problem

Hierarchical b-Matching

The Multiple Traveling Salesman Problem on Spiders

Parameterizing Role Coloring on Forests

Metadata Management on Data Processing in Data Lakes

The Complexity of Flow Expansion and Electrical Flow Expansion

Concatenation Operations and Restricted Variants of Two-Dimensional Automata

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