Home | Survey | Payment| Talks & Presentations | Job Opportunities
Journals   A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Tsinghua Science and Technology
1007-0214
2014 Issue 4
Guest Editorial: Special Issue on Parameterized Complexity
Liming Cai;Iyad Kanj;Frances A.Rosamond;Institute of Bioinformatics;University of Georgia;Athens;GA 30602-7229;USA;College of Computing and Digital Media;DePaul University;Chicago;IL 60604;USA;School of Engineering and Information Technology;Charles Darwin University;Darwin;NT 0909;Australia;
..............page:323-324
Some Open Problems in Parameterized Complexity Related to the Work of Jianer Chen
Michael Ralph Fellows;Engineering and IT;Charles Darwin University;Darwin 0909;Northern Territory;Australia;
..............page:325-328
Dynamic Dominating Set and Turbo-Charging Greedy Heuristics
Rodney G.Downey;Judith Egan;Michael R.Fellows;Frances A.Rosamond;Peter Shaw;School of Mathematics;Statistics and Operations Research;Victoria University of Wellington;Wellington 600;New Zealand;School of Engineering and Information Technology;Charles Darwin University;Darwin;NT 0909;Australia;
..............page:329-337
Kernelization in Parameterized Computation: A Survey
Qilong Feng;Qian Zhou;Wenjun Li;Jianxin Wang;the School of Information Science and Engineering;Central South University;
..............page:338-345
An Overview of Kernelization Algorithms for Graph Modification Problems
Yunlong Liu;Jianxin Wang;Jiong Guo;School of Information Science and Engineering;Central South University;College of Mathematics and Computer Science;Key Laboratory of High Performance Computing and Stochastic Information Processing;Hunan Normal University;Universitt des Saarlandes;Campus E 1.7;D-66123 Saarbrcken;Germany;
..............page:346-357
Parameterized Algorithmics for Computational Social Choice:Nine Research Challenges
Robert Bredereck;Jiehua Chen;Piotr Faliszewski;Jiong Guo;Rolf Niedermeier;Gerhard J.Woeginger;the Institut fr Softwaretechnik und Theoretische Informatik;TU Berlin;Berlin;Germany;AGH University of Science and Technology;Kraków;Poland;the Cluster of Excellence Multimodal Computing and Interaction;Universitt des Saarlandes;Saarbrcken;Germany;the Department of Mathematics and Computer Science;TU Eindhoven;Eindhoven;The Netherlands;
..............page:358-373
Social Choice Meets Graph Drawing: How to Get Subexponential Time Algorithms for Ranking and Drawing Problems
Henning Fernau;Fedor V.Fomin;Daniel Lokshtanov;Matthias Mnich;Geevarghese Philip;Saket Saurabh;FB 4—Abteilung Informatikwissenschaften;Universitt Trier;D-54286 Trier;Germany;the Department of Informatics;University of Bergen;N-5020 Bergen;Norway;Max-Planck-Institut fr Informatik;D-66123 Saarbrcken;Germany;the Institute of Mathematical Sciences;Chennai - 600113;India;
..............page:374-386
Parameter Ecology for Feedback Vertex Set
Bart M.P.Jansen;Venkatesh Raman;Martin Vatshelle;the Department of Informatics;University of Bergen;5005 Bergen;Norway;the Institute of Mathematical Sciences;Chennai;India;
..............page:387-409
Counting Problems in Parameterized Complexity
Chihao Zhang;Yijia Chen;the Department of Computer Science and Engineering;Shanghai Jiao Tong University;
..............page:410-420
Information for Contributors
..............page:421