Publications
Search

Publications :: Search

Show venue

On this page you see the details of the selected venue.

    Conference
    Name: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013
    URL: http://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=13002
    DBLP: db/conf/stacs/stacs2013.html
    Bookmark:

    Below you find the publications assigned to this venue.

    Show item 1 to 10 of 60  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Andreas Björklund, Petteri Kaski, Lukasz Kowalik.
    Probably Optimal Graph Motifs.
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Conference paper
    Meghana Nasre.
    Popular Matchings: Structure and Cheating Strategies.
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Conference paper
    Kurt Mehlhorn.
    Physarum Computations (Invited talk).
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Conference paper
    Artur Jez.
    Recompression: a simple and powerful technique for word equations.
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Conference paper
    Konstantin Kutzkov.
    Deterministic algorithms for skewed matrix products.
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Conference paper
    Magnus Wahlström.
    Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem.
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Conference paper
    Jisu Jeong, O-joung Kwon, Sang-il Oum.
    Excluded vertex-minors for graphs of linear rank-width at most k..
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Conference paper
    Julien Clément, Thu Hien Nguyen Thi, Brigitte Vallée.
    A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms.
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Conference paper
    Martin Huschenbett.
    The Rank of Tree-Automatic Linear Orderings.
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Conference paper
    Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider.
    Model Counting for CNF Formulas of Bounded Modular Treewidth.
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Show item 1 to 10 of 60  

    Your query returned 60 matches in the database.