Sciweavers

    359 search results - page 6 / 72
    » The Parameterized Complexity of Counting Problems
    Sort
    View
    IWPEC
    2004
    Springer
    113views Applied Computing» more  IWPEC 2004»
    On Miniaturized Problems in Parameterized Complexity Theory
    15 years 11 months ago
    On Miniaturized Problems in Parameterized Complexity Theory
    Download  www2.informatik.hu-berlin.de
    Abstract. We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of t...
    Yijia Chen, Jörg Flum
    claim paper
    Read More »
    203
    Voted
    TAMC
    2007
    Springer
    183views Applied Computing» more  TAMC 2007»
    Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
    16 years 14 days ago
    Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
    Download  theinf1.informatik.uni-jena.de
    Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
    Michael Dom, Jiong Guo, Rolf Niedermeier
    claim paper
    Read More »
    148
    Voted
    ISAAC
    2007
    Springer
    113views Algorithms» more  ISAAC 2007»
    The Parameterized Complexity of the Unique Coverage Problem
    16 years 15 days ago
    The Parameterized Complexity of the Unique Coverage Problem
    Download  www.imsc.res.in
    Hannes Moser, Venkatesh Raman, Somnath Sikdar
    claim paper
    Read More »
    CPM
    2010
    Springer
    134views Combinatorics» more  CPM 2010»
    On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs
    15 years 11 months ago
    On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs
    Download  cs.nyu.edu
    Minghui Jiang
    claim paper
    Read More »
    ICALP
    2001
    Springer
    86views Programming Languages» more  ICALP 2001»
    Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
    15 years 11 months ago
    Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
    Download  theinf1.informatik.uni-jena.de
    Jochen Alber, Henning Fernau, Rolf Niedermeier
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.