Notice
There is currently an issue with the citation download feature. Learn more

Tsinghua Science and Technology

Issue 4 • Aug. 2014

Filter Results

Displaying Results 1 - 11 of 11
  • [Front cover]

    Publication Year: 2014, Page(s): c1
    IEEE is not the copyright holder of this material | PDF file iconPDF (300 KB)
    Freely Available from IEEE
  • Contents

    Publication Year: 2014, Page(s): 1
    IEEE is not the copyright holder of this material | PDF file iconPDF (30 KB)
    Freely Available from IEEE
  • SPECIAL ISSUE ON PARAMETERIZED COMPLEXITY 
  • Guest editorial: Special issue on parameterized complexity

    Publication Year: 2014, Page(s):323 - 324
    IEEE is not the copyright holder of this material | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • Some open problems in parameterized complexity related to the work of Jianer Chen

    Publication Year: 2014, Page(s):325 - 328
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (586 KB)

    This short paper highlights some open problems related to the work of Jianer Chen in the area of parameterized/multivariate algorithmics. View full abstract»

    Open Access
  • Dynamic dominating set and turbo-charging greedy heuristics

    Publication Year: 2014, Page(s):329 - 337
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1015 KB)

    The main purpose of this paper is to exposit two very different, but very general, motivational schemes in the art of parameterization and a concrete example connecting them. We introduce a dynamic version of the DOMINATING SET problem and prove that it is fixed-parameter tractable (FPT). The problem is motivated by settings where problem instances evolve. It also arises in the quest to improve a ... View full abstract»

    Open Access
  • Kernelization in parameterized computation: A survey

    Publication Year: 2014, Page(s):338 - 345
    IEEE is not the copyright holder of this material | PDF file iconPDF (241 KB)
    Freely Available from IEEE
  • An overview of kernelization algorithms for graph modification problems

    Publication Year: 2014, Page(s):346 - 357
    IEEE is not the copyright holder of this material | PDF file iconPDF (1558 KB)
    Freely Available from IEEE
  • Parameterized algorithmics for computational social choice: Nine research challenges

    Publication Year: 2014, Page(s):358 - 373
    Cited by:  Papers (3)
    IEEE is not the copyright holder of this material | PDF file iconPDF (356 KB)
    Freely Available from IEEE
  • Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems

    Publication Year: 2014, Page(s):374 - 386
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (394 KB)

    We analyze a common feature of p-Kemeny AGGregation (p-KAGG) and p-One-Sided Crossing Minimization (p-OSCM) to provide new insights and findings of interest to both the graph drawing community and the social choice community. We obtain parameterized subexponential-time algorithms for p-KAGG-a problem in V social choice theory-and for p-OSCM-a problem in graph drawing. These algorithms run in time ... View full abstract»

    Open Access
  • Parameter ecology for Feedback Vertex Set

    Publication Year: 2014, Page(s):387 - 409
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (4521 KB)

    This paper deals with the FEEDBACK VERTEX SET problem on undirected graphs, which asks for the existence of a vertex set of bounded size that intersects all cycles. Due it is theoretical and practical importance, the problem has been the subject of intensive study. Motivated by the parameter ecology program we attempt to classify the parameterized and kernelization complexity of FEEDBACK VERTEX SE... View full abstract»

    Open Access
  • Counting problems in parameterized complexity

    Publication Year: 2014, Page(s):410 - 420
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (263 KB)

    Parameterized complexity is a multivariate theory for the analysis of computational problems. It leads to practically efficient algorithms for many NP-hard problems and also provides a much finer complexity classification for other intractable problems. Although the theory is mostly on decision problems, parameterized complexity naturally extends to counting problems as well. The purpose of this a... View full abstract»

    Open Access

Aims & Scope

Tsinghua Science and Technology (Tsinghua Sci Technol) aims to highlight scientific achievements in computer science, electronic engineering, and other IT fields. Contributions all over the world are welcome.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Professor Jiaguang Sun
School of Software
Tsinghua University
Beijing  100084 China
journal@tsinghua.edu.cn
Phone:86-10-62771385