Sciweavers

    1421 search results - page 8 / 285
    » Algorithms for subsequence combinatorics
    Sort
    View
    CPM
    2008
    Springer
    170views Combinatorics» more  CPM 2008»
    Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
    14 years 11 months ago
    Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
    Download  www.cs.ucr.edu
    Nadja Betzler, Michael R. Fellows, Christian Komus...
    claim paper
    Read More »
    CPM
    2008
    Springer
    129views Combinatorics» more  CPM 2008»
    Fast Algorithms for Computing Tree LCS
    14 years 11 months ago
    Fast Algorithms for Computing Tree LCS
    Download  www.cs.bgu.ac.il
    Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-U...
    claim paper
    Read More »
    COMBINATORICS
    2004
    81views more  COMBINATORICS 2004»
    A Card Shuffling Analysis of Deformations of the Plancherel Measure of the Symmetric Group
    14 years 9 months ago
    A Card Shuffling Analysis of Deformations of the Plancherel Measure of the Symmetric Group
    Download  www.combinatorics.org
    This paper finds and analyzes a formula for the total variation distance between iterations of riffle shuffles and iterations of "cut and then riffle shuffle". This allo...
    Jason E. Fulman
    claim paper
    Read More »
    CPM
    2001
    Springer
    108views Combinatorics» more  CPM 2001»
    A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
    15 years 1 months ago
    A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
    Download  www.ic.unicamp.br
    In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
    Anne Bergeron
    claim paper
    Read More »
    COCOON
    2007
    Springer
    87views Combinatorics» more  COCOON 2007»
    Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
    15 years 3 months ago
    Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
    Download  www.cs.tau.ac.il
    Noga Alon, Shai Gutner
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2025, USA.