Inapproximability results for guarding polygons and terrains. Zbl 0980.68140
Eidenbenz, S.; Stamm, C.; Widmayer, P. |
|
2001
|
On the complexity of variations of equal sum subsets. Zbl 1187.68248
Cieliebak, Mark; Eidenbenz, Stephan; Pagourtzis, Aris T.; Schlude, Konrad |
|
2008
|
Measurement errors make the partial digest problem NP-hard. Zbl 1196.68100
Cieliebak, Mark; Eidenbenz, Stephan |
|
2004
|
Approximation algorithms for terrain guarding. Zbl 1052.68130
Eidenbenz, Stephan |
|
2002
|
Composing equipotent teams. Zbl 1278.68104
Cieliebak, Mark; Eidenbenz, Stephan; Pagourtzis, Aris |
|
2003
|
Deterministic preparation of Dicke states. Zbl 1534.68070
Bärtschi, Andreas; Eidenbenz, Stephan |
|
2019
|
Inapproximability of finding maximum hidden sets on polygons and terrains. Zbl 0998.68190
Eidenbenz, Stephan |
|
2002
|
Online dominating set. Zbl 1421.68239
Boyar, Joan; Eidenbenz, Stephan J.; Favrholdt, Lene M.; Kotrbčík, Michal; Larsen, Kim S. |
|
2019
|
Partial digest is hard to solve for erroneous input data. Zbl 1086.68053
Cieliebak, Mark; Eidenbenz, Stephan; Penna, Paolo |
|
2005
|
Maximum Clique and Minimum Clique Partition in visibility graphs. Zbl 0998.68091
Eidenbenz, Stephan; Stamm, Christoph |
|
2000
|
Online dominating set. Zbl 1378.68196
Boyar, Joan; Eidenbenz, Stephan J.; Favrholdt, Lene M.; Kotrbcik, Michal; Larsen, Kim S. |
|
2016
|
Double digest revisited: complexity and approximability in the presence of noisy data. Zbl 1276.92084
Cieliebak, Mark; Eidenbenz, Stephan; Woeginger, Gerhard J. |
|
2003
|
Flexible train rostering. Zbl 1205.90120
Eidenbenz, Stephan; Pagourtzis, Aris; Widmayer, Peter |
|
2003
|
An approximation algorithm for minimum convex cover with logarithmic performance guarantee. Zbl 1053.68106
Eidenbenz, Stephan J.; Widmayer, Peter |
|
2003
|
Automata, languages and programming. 29th international colloquium, ICALP 2002, Málaga, Spain, July 8–13, 2002. Proceedings. Zbl 0993.00041
|
|
2002
|
Optimum inapproximability results for finding minimum hidden guard sets in polygons and terrains. Zbl 1078.68799
Eidenbenz, Stephan |
|
2002
|
How many people can hide in a terrain? Zbl 0964.68139
Eidenbenz, Stephan |
|
1999
|
Criticality analysis of internet infrastructure. Zbl 1202.68065
Yan, Guanhua; Eidenbenz, Stephan; Thulasidasan, Sunil; Datta, Pallab; Ramaswamy, Venkatesh |
|
2010
|
Deterministic preparation of Dicke states. Zbl 1534.68070
Bärtschi, Andreas; Eidenbenz, Stephan |
|
2019
|
Online dominating set. Zbl 1421.68239
Boyar, Joan; Eidenbenz, Stephan J.; Favrholdt, Lene M.; Kotrbčík, Michal; Larsen, Kim S. |
|
2019
|
Online dominating set. Zbl 1378.68196
Boyar, Joan; Eidenbenz, Stephan J.; Favrholdt, Lene M.; Kotrbcik, Michal; Larsen, Kim S. |
|
2016
|
Criticality analysis of internet infrastructure. Zbl 1202.68065
Yan, Guanhua; Eidenbenz, Stephan; Thulasidasan, Sunil; Datta, Pallab; Ramaswamy, Venkatesh |
|
2010
|
On the complexity of variations of equal sum subsets. Zbl 1187.68248
Cieliebak, Mark; Eidenbenz, Stephan; Pagourtzis, Aris T.; Schlude, Konrad |
|
2008
|
Partial digest is hard to solve for erroneous input data. Zbl 1086.68053
Cieliebak, Mark; Eidenbenz, Stephan; Penna, Paolo |
|
2005
|
Measurement errors make the partial digest problem NP-hard. Zbl 1196.68100
Cieliebak, Mark; Eidenbenz, Stephan |
|
2004
|
Composing equipotent teams. Zbl 1278.68104
Cieliebak, Mark; Eidenbenz, Stephan; Pagourtzis, Aris |
|
2003
|
Double digest revisited: complexity and approximability in the presence of noisy data. Zbl 1276.92084
Cieliebak, Mark; Eidenbenz, Stephan; Woeginger, Gerhard J. |
|
2003
|
Flexible train rostering. Zbl 1205.90120
Eidenbenz, Stephan; Pagourtzis, Aris; Widmayer, Peter |
|
2003
|
An approximation algorithm for minimum convex cover with logarithmic performance guarantee. Zbl 1053.68106
Eidenbenz, Stephan J.; Widmayer, Peter |
|
2003
|
Approximation algorithms for terrain guarding. Zbl 1052.68130
Eidenbenz, Stephan |
|
2002
|
Inapproximability of finding maximum hidden sets on polygons and terrains. Zbl 0998.68190
Eidenbenz, Stephan |
|
2002
|
Automata, languages and programming. 29th international colloquium, ICALP 2002, Málaga, Spain, July 8–13, 2002. Proceedings. Zbl 0993.00041
|
|
2002
|
Optimum inapproximability results for finding minimum hidden guard sets in polygons and terrains. Zbl 1078.68799
Eidenbenz, Stephan |
|
2002
|
Inapproximability results for guarding polygons and terrains. Zbl 0980.68140
Eidenbenz, S.; Stamm, C.; Widmayer, P. |
|
2001
|
Maximum Clique and Minimum Clique Partition in visibility graphs. Zbl 0998.68091
Eidenbenz, Stephan; Stamm, Christoph |
|
2000
|
How many people can hide in a terrain? Zbl 0964.68139
Eidenbenz, Stephan |
|
1999
|