FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540770497, 9783540770503

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Covering Graphs with Few Complete Bipartite Subgraphs

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77050-3_28 ◽

2007 ◽

pp. 340-351 ◽

Cited By ~ 2

Author(s):

Herbert Fleischner ◽

Egbert Mujuni ◽

Daniel Paulusma ◽

Stefan Szeider

Download Full-text

On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77050-3_9 ◽

2007 ◽

pp. 108-120 ◽

Cited By ~ 3

Author(s):

Michael Backes ◽

Markus Dürmuth ◽

Ralf Küsters

Download Full-text

A Formal Investigation of Diff3

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77050-3_40 ◽

2007 ◽

pp. 485-496 ◽

Cited By ~ 17

Author(s):

Sanjeev Khanna ◽

Keshav Kunal ◽

Benjamin C. Pierce

Download Full-text

Undirected Graphs of Entanglement 2

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77050-3_42 ◽

2007 ◽

pp. 508-519 ◽

Cited By ~ 1

Author(s):

Walid Belkhir ◽

Luigi Santocanale

Keyword(s):

Undirected Graphs

Download Full-text

“Rent-or-Buy” Scheduling and Cost Coloring Problems

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77050-3_7 ◽

2007 ◽

pp. 84-95 ◽

Cited By ~ 3

Author(s):

Takuro Fukunaga ◽

Magnús M. Halldórsson ◽

Hiroshi Nagamochi

Keyword(s):

Rent Or Buy

Download Full-text

Reductions to Graph Isomorphism

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77050-3_13 ◽

2007 ◽

pp. 158-167

Author(s):

Jacobo Torán

Keyword(s):

Graph Isomorphism

Download Full-text

Better Algorithms and Bounds for Directed Maximum Leaf Problems

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77050-3_26 ◽

2007 ◽

pp. 316-327 ◽

Cited By ~ 6

Author(s):

Noga Alon ◽

Fedor V. Fomin ◽

Gregory Gutin ◽

Michael Krivelevich ◽

Saket Saurabh

Download Full-text

Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77050-3_35 ◽

2007 ◽

pp. 424-435 ◽

Cited By ~ 4

Author(s):

Jesper Jansson ◽

Kunihiko Sadakane ◽

Wing-Kin Sung

Keyword(s):

Time And Space

Download Full-text

Strong Reductions and Isomorphism of Complete Sets

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77050-3_14 ◽

2007 ◽

pp. 168-178 ◽

Cited By ~ 1

Author(s):

Ryan C. Harkins ◽

John M. Hitchcock ◽

A. Pavan

Keyword(s):

Complete Sets

Download Full-text

Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77050-3_18 ◽

2007 ◽

pp. 216-227 ◽

Cited By ~ 7

Author(s):

Andreas Jakoby ◽

Till Tantau

Keyword(s):

In Series ◽

Longest Paths

Download Full-text

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Covering Graphs with Few Complete Bipartite Subgraphs

On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography

A Formal Investigation of Diff3

Undirected Graphs of Entanglement 2

“Rent-or-Buy” Scheduling and Cost Coloring Problems

Reductions to Graph Isomorphism

Better Algorithms and Bounds for Directed Maximum Leaf Problems

Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space

Strong Reductions and Isomorphism of Complete Sets

Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science
Latest Publications