Result 1 to 20 of 39 total
Studies in computational aspects of voting. A parameterized complexity perspective. (English)
Bodlaender, Hans L. (ed.) et al., The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). Lecture Notes in Computer Science 7370, 318-363 (2012).
1
On bounded-degree vertex deletion parameterized by treewidth. (English)
Discrete Appl. Math. 160, No. 1-2, 53-60 (2012).
2
Average parameterization and partial kernelization for computing medians. (English)
J. Comput. Syst. Sci. 77, No. 4, 774-789 (2011).
3
On making a distinguished vertex minimum degree by vertex deletion. (English)
Černá, Ivana (ed.) et al., SOFSEM 2011: Theory and practice of computer science. 37th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 22‒28, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-18380-5/pbk). Lecture Notes in Computer Science 6543, 123-134 (2011).
4
Parameterized algorithmics for finding connected motifs in biological networks (English)
IEEE/ACM Trans. Comput. Biology Bioinform. 8, No. 5, 1296-1308 (2011).
5
Unweighted coalitional manipulation under the borda rule is NP-hard (English)
IJCAI, 55-60 (2011).
6
On making a distinguished vertex minimum degree by vertex deletion (English)
SOFSEM, 123-134 (2011).
7
Separator-based data reduction for signed graph balancing. (English)
J. Comb. Optim. 20, No. 4, 335-360 (2010).
8
Partial kernelization for rank aggregation: theory and experiments. (English)
Raman, Venkatesh (ed.) et al., Parameterized and exact computation. 5th international symposium, IPEC 2010, Chennai, India, December 13‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17492-6/pbk). Lecture Notes in Computer Science 6478, 26-37 (2010).
9
Towards a dichotomy for the possible winner problem in elections based on scoring rules. (English)
J. Comput. Syst. Sci. 76, No. 8, 812-836 (2010).
10
On problem kernels for possible winner determination under the $k$-approval protocol. (English)
Hliněný, Petr (ed.) et al., Mathematical foundations of computer science 2010. 35th international symposium, MFCS 2010, Brno, Czech Republic, August 23‒27, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15154-5/pbk). Lecture Notes in Computer Science 6281, 114-125 (2010).
11
Average parameterization and partial kernelization for computing medians. (English)
López-Ortiz, Alejandro (ed.), LATIN 2010: Theoretical informatics. 9th Latin American symposium, Oaxaca, Mexico, April 19‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12199-9/pbk). Lecture Notes in Computer Science 6034, 60-71 (2010).
12
Parameterized computational complexity of Dodgson and Young elections. (English)
Inf. Comput. 208, No. 2, 165-177 (2010).
13
On problem kernels for possible winner determination under the $k$-approval protocol (English)
MFCS, 114-125 (2010).
14
Average parameterization and partial kernelization for computing medians (English)
LATIN, 60-71 (2010).
15
Partial kernelization for rank aggregation: theory and experiments (English)
IPEC, 26-37 (2010).
16
Probabilistic possible winner determination (English)
AAAI (2010).
17
Towards a dichotomy of finding possible winners in elections based on scoring rules. (English)
Comput. Res. Repos. 2009, Article No. 0911.3492 (2009).
18
Parameterized complexity of candidate control in elections and related digraph problems. (English)
Theor. Comput. Sci. 410, No. 52, 5425-5442 (2009).
19
Fixed-parameter algorithms for Kemeny rankings. (English)
Theor. Comput. Sci. 410, No. 45, 4554-4570 (2009).
20
Result 1 to 20 of 39 total
Start
Contact
Print
General Help
