Result 1 to 20 of 24 total
Multivariate complexity analysis of Swap Bribery. (English)
Algorithmica 64, No. 1, 126-151 (2012).
1
Obtaining a planar graph by vertex deletion. (English)
Algorithmica 62, No. 3-4, 807-822 (2012).
2
Stable assignment with couples: parameterized complexity and local search. (English)
Discrete Optim. 8, No. 1, 25-40 (2011).
3
Parameterized complexity of Eulerian deletion problems. (English)
Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21‒24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 131-142 (2011).
4
Parameterized complexity of Eulerian deletion problems (English)
WG, 131-142 (2011).
5
Campaign management under approval-driven voting rules (English)
AAAI (2011).
6
Multivariate complexity analysis of swap bribery. (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, 107-122 (2010).
7
Computing the deficiency of housing markets with duplicate houses. (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, 72-83 (2010).
8
Parameterized complexity of the arc-preserving subsequence problem. (English)
Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28‒30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 244-255 (2010).
9
Parameterized complexity and local search approaches for the stable marriage problem with ties. (English)
Algorithmica 58, No. 1, 170-187 (2010).
10
Cleaning interval graphs. (English)
Comput. Res. Repos. 2010, Article No. 1003.1260 (2010).
11
Bin packing with fixed number of bins revisited. (English)
Kaplan, Haim (ed.), Algorithm theory ‒ SWAT 2010. 12th Scandinavian symposium and workshops on algorithm theory, Bergen, Norway, June 21‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13730-3/pbk). Lecture Notes in Computer Science 6139, 260-272 (2010).
12
Parameterized complexity of the arc-preserving subsequence problem (English)
WG, 244-255 (2010).
13
Computing the deficiency of housing markets with duplicate houses (English)
IPEC, 72-83 (2010).
14
Multivariate complexity analysis of swap bribery (English)
IPEC, 107-122 (2010).
15
Bin packing with fixed number of bins revisited (English)
SWAT, 260-272 (2010).
16
Parameterized graph cleaning problems. (English)
Discrete Appl. Math. 157, No. 15, 3258-3267 (2009).
17
Stable assignment with couples: Parameterized complexity and local search. (English)
Chen, Jianer (ed.) et al., Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10‒11, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11268-3/pbk). Lecture Notes in Computer Science 5917, 300-311 (2009).
18
Stable assignment with couples: parameterized complexity and local search (English)
IWPEC, 300-311 (2009).
19
Obtaining a planar graph by vertex deletion. (English)
Comput. Res. Repos. 2008, Article No. 0812.4919 (2008).
20
Result 1 to 20 of 24 total
Start
Contact
Print
General Help
