---
_id: '15004'
author:
- first_name: Mohsen
full_name: Ahmadi Fahandar, Mohsen
id: '59547'
last_name: Ahmadi Fahandar
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Ahmadi Fahandar M, Hüllermeier E. Feature Selection for Analogy-Based Learning
to Rank. In: Discovery Science. Cham; 2019. doi:10.1007/978-3-030-33778-0_22'
apa: Ahmadi Fahandar, M., & Hüllermeier, E. (2019). Feature Selection for Analogy-Based
Learning to Rank. In Discovery Science. Cham. https://doi.org/10.1007/978-3-030-33778-0_22
bibtex: '@inbook{Ahmadi Fahandar_Hüllermeier_2019, place={Cham}, title={Feature
Selection for Analogy-Based Learning to Rank}, DOI={10.1007/978-3-030-33778-0_22},
booktitle={Discovery Science}, author={Ahmadi Fahandar, Mohsen and Hüllermeier,
Eyke}, year={2019} }'
chicago: Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Feature Selection for Analogy-Based
Learning to Rank.” In Discovery Science. Cham, 2019. https://doi.org/10.1007/978-3-030-33778-0_22.
ieee: M. Ahmadi Fahandar and E. Hüllermeier, “Feature Selection for Analogy-Based
Learning to Rank,” in Discovery Science, Cham, 2019.
mla: Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Feature Selection for Analogy-Based
Learning to Rank.” Discovery Science, 2019, doi:10.1007/978-3-030-33778-0_22.
short: 'M. Ahmadi Fahandar, E. Hüllermeier, in: Discovery Science, Cham, 2019.'
date_created: 2019-11-15T10:24:45Z
date_updated: 2022-01-06T06:52:14Z
department:
- _id: '34'
- _id: '355'
doi: 10.1007/978-3-030-33778-0_22
language:
- iso: eng
place: Cham
publication: Discovery Science
publication_identifier:
isbn:
- '9783030337773'
- '9783030337780'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Feature Selection for Analogy-Based Learning to Rank
type: book_chapter
user_id: '315'
year: '2019'
...
---
_id: '15005'
author:
- first_name: Mohsen
full_name: Ahmadi Fahandar, Mohsen
id: '59547'
last_name: Ahmadi Fahandar
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Ahmadi Fahandar M, Hüllermeier E. Analogy-Based Preference Learning with Kernels.
In: KI 2019: Advances in Artificial Intelligence. Cham; 2019. doi:10.1007/978-3-030-30179-8_3'
apa: 'Ahmadi Fahandar, M., & Hüllermeier, E. (2019). Analogy-Based Preference
Learning with Kernels. In KI 2019: Advances in Artificial Intelligence.
Cham. https://doi.org/10.1007/978-3-030-30179-8_3'
bibtex: '@inbook{Ahmadi Fahandar_Hüllermeier_2019, place={Cham}, title={Analogy-Based
Preference Learning with Kernels}, DOI={10.1007/978-3-030-30179-8_3},
booktitle={KI 2019: Advances in Artificial Intelligence}, author={Ahmadi Fahandar,
Mohsen and Hüllermeier, Eyke}, year={2019} }'
chicago: 'Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Analogy-Based Preference
Learning with Kernels.” In KI 2019: Advances in Artificial Intelligence.
Cham, 2019. https://doi.org/10.1007/978-3-030-30179-8_3.'
ieee: 'M. Ahmadi Fahandar and E. Hüllermeier, “Analogy-Based Preference Learning
with Kernels,” in KI 2019: Advances in Artificial Intelligence, Cham, 2019.'
mla: 'Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Analogy-Based Preference Learning
with Kernels.” KI 2019: Advances in Artificial Intelligence, 2019, doi:10.1007/978-3-030-30179-8_3.'
short: 'M. Ahmadi Fahandar, E. Hüllermeier, in: KI 2019: Advances in Artificial
Intelligence, Cham, 2019.'
date_created: 2019-11-15T10:30:10Z
date_updated: 2022-01-06T06:52:14Z
department:
- _id: '34'
- _id: '355'
doi: 10.1007/978-3-030-30179-8_3
language:
- iso: eng
place: Cham
publication: 'KI 2019: Advances in Artificial Intelligence'
publication_identifier:
isbn:
- '9783030301781'
- '9783030301798'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Analogy-Based Preference Learning with Kernels
type: book_chapter
user_id: '315'
year: '2019'
...
---
_id: '15006'
author:
- first_name: Vu-Linh
full_name: Nguyen, Vu-Linh
last_name: Nguyen
- first_name: Sébastien
full_name: Destercke, Sébastien
last_name: Destercke
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Nguyen V-L, Destercke S, Hüllermeier E. Epistemic Uncertainty Sampling. In:
Discovery Science. Cham; 2019. doi:10.1007/978-3-030-33778-0_7'
apa: Nguyen, V.-L., Destercke, S., & Hüllermeier, E. (2019). Epistemic Uncertainty
Sampling. In Discovery Science. Cham. https://doi.org/10.1007/978-3-030-33778-0_7
bibtex: '@inbook{Nguyen_Destercke_Hüllermeier_2019, place={Cham}, title={Epistemic
Uncertainty Sampling}, DOI={10.1007/978-3-030-33778-0_7},
booktitle={Discovery Science}, author={Nguyen, Vu-Linh and Destercke, Sébastien
and Hüllermeier, Eyke}, year={2019} }'
chicago: Nguyen, Vu-Linh, Sébastien Destercke, and Eyke Hüllermeier. “Epistemic
Uncertainty Sampling.” In Discovery Science. Cham, 2019. https://doi.org/10.1007/978-3-030-33778-0_7.
ieee: V.-L. Nguyen, S. Destercke, and E. Hüllermeier, “Epistemic Uncertainty Sampling,”
in Discovery Science, Cham, 2019.
mla: Nguyen, Vu-Linh, et al. “Epistemic Uncertainty Sampling.” Discovery Science,
2019, doi:10.1007/978-3-030-33778-0_7.
short: 'V.-L. Nguyen, S. Destercke, E. Hüllermeier, in: Discovery Science, Cham,
2019.'
date_created: 2019-11-15T10:35:08Z
date_updated: 2022-01-06T06:52:14Z
department:
- _id: '34'
- _id: '355'
doi: 10.1007/978-3-030-33778-0_7
language:
- iso: eng
place: Cham
publication: Discovery Science
publication_identifier:
isbn:
- '9783030337773'
- '9783030337780'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Epistemic Uncertainty Sampling
type: book_chapter
user_id: '49109'
year: '2019'
...
---
_id: '15080'
author:
- first_name: Rita
full_name: Hartel, Rita
id: '14961'
last_name: Hartel
- first_name: Alexander
full_name: Dunst, Alexander
last_name: Dunst
citation:
ama: 'Hartel R, Dunst A. How Good Is Good Enough? Establishing Quality Thresholds
for the Automatic Text Analysis of Retro-Digitized Comics. In: International
Conference on Multimedia Modeling, MMM. Springer; 2019:662-671. doi:10.1007/978-3-030-05716-9_59'
apa: 'Hartel, R., & Dunst, A. (2019). How Good Is Good Enough? Establishing
Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics.
In International Conference on Multimedia Modeling, MMM (pp. 662–671).
Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-030-05716-9_59'
bibtex: '@inproceedings{Hartel_Dunst_2019, title={How Good Is Good Enough? Establishing
Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics},
DOI={10.1007/978-3-030-05716-9_59},
booktitle={International Conference on Multimedia Modeling, MMM}, publisher={Springer},
author={Hartel, Rita and Dunst, Alexander}, year={2019}, pages={662–671} }'
chicago: Hartel, Rita, and Alexander Dunst. “How Good Is Good Enough? Establishing
Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics.”
In International Conference on Multimedia Modeling, MMM, 662–71. Springer,
2019. https://doi.org/10.1007/978-3-030-05716-9_59.
ieee: R. Hartel and A. Dunst, “How Good Is Good Enough? Establishing Quality Thresholds
for the Automatic Text Analysis of Retro-Digitized Comics,” in International
Conference on Multimedia Modeling, MMM, Thessaloniki, Greece, 2019, pp. 662–671.
mla: Hartel, Rita, and Alexander Dunst. “How Good Is Good Enough? Establishing Quality
Thresholds for the Automatic Text Analysis of Retro-Digitized Comics.” International
Conference on Multimedia Modeling, MMM, Springer, 2019, pp. 662–71, doi:10.1007/978-3-030-05716-9_59.
short: 'R. Hartel, A. Dunst, in: International Conference on Multimedia Modeling,
MMM, Springer, 2019, pp. 662–671.'
conference:
location: Thessaloniki, Greece
date_created: 2019-11-21T14:42:25Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-030-05716-9_59
language:
- iso: eng
page: 662-671
publication: International Conference on Multimedia Modeling, MMM
publication_identifier:
isbn:
- '9783030057152'
- '9783030057169'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: How Good Is Good Enough? Establishing Quality Thresholds for the Automatic
Text Analysis of Retro-Digitized Comics
type: conference
user_id: '14961'
year: '2019'
...
---
_id: '13872'
author:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
citation:
ama: 'Beyer D, Jakobs M-C. CoVeriTest: Cooperative Verifier-Based Testing. In: Fundamental
Approaches to Software Engineering. Cham; 2019. doi:10.1007/978-3-030-16722-6_23'
apa: 'Beyer, D., & Jakobs, M.-C. (2019). CoVeriTest: Cooperative Verifier-Based
Testing. In Fundamental Approaches to Software Engineering. Cham. https://doi.org/10.1007/978-3-030-16722-6_23'
bibtex: '@inbook{Beyer_Jakobs_2019, place={Cham}, title={CoVeriTest: Cooperative
Verifier-Based Testing}, DOI={10.1007/978-3-030-16722-6_23},
booktitle={Fundamental Approaches to Software Engineering}, author={Beyer, Dirk
and Jakobs, Marie-Christine}, year={2019} }'
chicago: 'Beyer, Dirk, and Marie-Christine Jakobs. “CoVeriTest: Cooperative Verifier-Based
Testing.” In Fundamental Approaches to Software Engineering. Cham, 2019.
https://doi.org/10.1007/978-3-030-16722-6_23.'
ieee: 'D. Beyer and M.-C. Jakobs, “CoVeriTest: Cooperative Verifier-Based Testing,”
in Fundamental Approaches to Software Engineering, Cham, 2019.'
mla: 'Beyer, Dirk, and Marie-Christine Jakobs. “CoVeriTest: Cooperative Verifier-Based
Testing.” Fundamental Approaches to Software Engineering, 2019, doi:10.1007/978-3-030-16722-6_23.'
short: 'D. Beyer, M.-C. Jakobs, in: Fundamental Approaches to Software Engineering,
Cham, 2019.'
date_created: 2019-10-16T06:39:51Z
date_updated: 2022-01-06T06:51:45Z
department:
- _id: '77'
doi: 10.1007/978-3-030-16722-6_23
language:
- iso: eng
place: Cham
project:
- _id: '85'
name: Kooperative Softwareverifikation
publication: Fundamental Approaches to Software Engineering
publication_identifier:
isbn:
- '9783030167219'
- '9783030167226'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'CoVeriTest: Cooperative Verifier-Based Testing'
type: book_chapter
user_id: '44413'
year: '2019'
...
---
_id: '56579'
abstract:
- lang: eng
text: Question answering engines have become one of the most popular type of applications
driven by Semantic Web technologies. Consequently, the provision of means to quantify
the performance of current question answering approaches on current datasets has
become ever more important. However, a large percentage of the queries found in
popular question answering benchmarks cannot be executed on current versions of
their reference dataset. There is a consequently a clear need to curate question
answering benchmarks periodically. However, the manual alteration of question
answering benchmarks is often error-prone. We alleviate this problem by presenting
QUANT, a novel framework for the creation and curation of question answering benchmarks.
QUANT sup-ports the curation of benchmarks by generating smart edit suggestions
for question-query pair and for the corresponding metadata. In addition, our framework
supports the creation of new benchmark entries by pro-viding predefined quality
checks for queries. We evaluate QUANT on 653questions obtained from QALD-1 to
QALD-8 with 10 users. Our results show that our framework generates reliable suggestions
and can reduce the curation effort for QA benchmarks by up to 91%.
author:
- first_name: Ria Hari
full_name: Gusmita, Ria Hari
id: '71039'
last_name: Gusmita
- first_name: Rricha
full_name: Jalota, Rricha
last_name: Jalota
- first_name: Daniel
full_name: Vollmers, Daniel
last_name: Vollmers
- first_name: Jan
full_name: Reineke, Jan
last_name: Reineke
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
- first_name: Ricardo
full_name: Usbeck, Ricardo
last_name: Usbeck
citation:
ama: 'Gusmita RH, Jalota R, Vollmers D, Reineke J, Ngonga Ngomo A-C, Usbeck R. QUANT
- Question Answering Benchmark Curator. In: Acosta M, Cudr{\’e}-Mauroux P, Maleshkova
M, Pellegrini T, Sack H, Sure-Vetter Y, eds. Semantic Systems. The Power of
AI and Knowledge Graphs. Springer International Publishing; 2019:343--358.
doi:10.1007/978-3-030-33220-4_25'
apa: Gusmita, R. H., Jalota, R., Vollmers, D., Reineke, J., Ngonga Ngomo, A.-C.,
& Usbeck, R. (2019). QUANT - Question Answering Benchmark Curator. In M. Acosta,
P. Cudr{\’e}-Mauroux, M. Maleshkova, T. Pellegrini, H. Sack, & Y. Sure-Vetter
(Eds.), Semantic Systems. The Power of AI and Knowledge Graphs (pp. 343--358).
Springer International Publishing. https://doi.org/10.1007/978-3-030-33220-4_25
bibtex: '@inbook{Gusmita_Jalota_Vollmers_Reineke_Ngonga Ngomo_Usbeck_2019, place={Cham},
title={QUANT - Question Answering Benchmark Curator}, DOI={10.1007/978-3-030-33220-4_25},
booktitle={Semantic Systems. The Power of AI and Knowledge Graphs}, publisher={Springer
International Publishing}, author={Gusmita, Ria Hari and Jalota, Rricha and Vollmers,
Daniel and Reineke, Jan and Ngonga Ngomo, Axel-Cyrille and Usbeck, Ricardo}, editor={Acosta,
Maribel and Cudr{\’e}-Mauroux, Philippe and Maleshkova, Maria and Pellegrini,
Tassilo and Sack, Harald and Sure-Vetter, York}, year={2019}, pages={343--358}
}'
chicago: 'Gusmita, Ria Hari, Rricha Jalota, Daniel Vollmers, Jan Reineke, Axel-Cyrille
Ngonga Ngomo, and Ricardo Usbeck. “QUANT - Question Answering Benchmark Curator.”
In Semantic Systems. The Power of AI and Knowledge Graphs, edited by Maribel
Acosta, Philippe Cudr{\’e}-Mauroux, Maria Maleshkova, Tassilo Pellegrini, Harald
Sack, and York Sure-Vetter, 343--358. Cham: Springer International Publishing,
2019. https://doi.org/10.1007/978-3-030-33220-4_25.'
ieee: 'R. H. Gusmita, R. Jalota, D. Vollmers, J. Reineke, A.-C. Ngonga Ngomo, and
R. Usbeck, “QUANT - Question Answering Benchmark Curator,” in Semantic Systems.
The Power of AI and Knowledge Graphs, M. Acosta, P. Cudr{\’e}-Mauroux, M.
Maleshkova, T. Pellegrini, H. Sack, and Y. Sure-Vetter, Eds. Cham: Springer International
Publishing, 2019, pp. 343--358.'
mla: Gusmita, Ria Hari, et al. “QUANT - Question Answering Benchmark Curator.” Semantic
Systems. The Power of AI and Knowledge Graphs, edited by Maribel Acosta et
al., Springer International Publishing, 2019, pp. 343--358, doi:10.1007/978-3-030-33220-4_25.
short: 'R.H. Gusmita, R. Jalota, D. Vollmers, J. Reineke, A.-C. Ngonga Ngomo, R.
Usbeck, in: M. Acosta, P. Cudr{\’e}-Mauroux, M. Maleshkova, T. Pellegrini, H.
Sack, Y. Sure-Vetter (Eds.), Semantic Systems. The Power of AI and Knowledge Graphs,
Springer International Publishing, Cham, 2019, pp. 343--358.'
conference:
end_date: 2019-09-12
location: Karlsruhe, Germany
name: SEMANTiCS 2019
start_date: 2019-09-09
date_created: 2024-10-10T14:25:00Z
date_updated: 2024-11-19T15:34:24Z
ddc:
- '004'
doi: 10.1007/978-3-030-33220-4_25
editor:
- first_name: Maribel
full_name: Acosta, Maribel
last_name: Acosta
- first_name: Philippe
full_name: Cudr{\'e}-Mauroux, Philippe
last_name: Cudr{\'e}-Mauroux
- first_name: Maria
full_name: Maleshkova, Maria
last_name: Maleshkova
- first_name: Tassilo
full_name: Pellegrini, Tassilo
last_name: Pellegrini
- first_name: Harald
full_name: Sack, Harald
last_name: Sack
- first_name: York
full_name: Sure-Vetter, York
last_name: Sure-Vetter
file:
- access_level: closed
content_type: application/pdf
creator: gusmita
date_created: 2024-11-19T15:28:45Z
date_updated: 2024-11-19T15:28:45Z
file_id: '57244'
file_name: Gusmita_et_al-2019-Semantic_Systems._The_Power_of_AI_and_Knowledge_Graphs,_15th_International....pdf
file_size: 1179910
relation: main_file
success: 1
file_date_updated: 2024-11-19T15:28:45Z
has_accepted_license: '1'
keyword:
- Benchmark
- Question answering
- Knowledge base
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://rdcu.be/d0KJc
oa: '1'
page: 343--358
place: Cham
publication: Semantic Systems. The Power of AI and Knowledge Graphs
publication_identifier:
eisbn:
- 978-3-030-33220-4
isbn:
- 978-3-030-33219-8
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: QUANT - Question Answering Benchmark Curator
type: book_chapter
user_id: '71039'
year: '2019'
...
---
_id: '2862'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
- first_name: Jakob
full_name: Juhnke, Jakob
id: '48090'
last_name: Juhnke
citation:
ama: 'Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable
Universally-Composable Reputation Systems. In: Topics in Cryptology - {CT-RSA}
2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings.
Cham: Springer International Publishing; 2018:470-490. doi:10.1007/978-3-319-76953-0_25'
apa: 'Blömer, J., Eidens, F., & Juhnke, J. (2018). Practical, Anonymous, and
Publicly Linkable Universally-Composable Reputation Systems. In Topics in Cryptology
- {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings
(pp. 470–490). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-76953-0_25'
bibtex: '@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical,
Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={10.1007/978-3-319-76953-0_25},
booktitle={Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at
the {RSA} Conference 2018, Proceedings}, publisher={Springer International Publishing},
author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={470–490}
}'
chicago: 'Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous,
and Publicly Linkable Universally-Composable Reputation Systems.” In Topics
in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference
2018, Proceedings, 470–90. Cham: Springer International Publishing, 2018.
https://doi.org/10.1007/978-3-319-76953-0_25.'
ieee: J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable
Universally-Composable Reputation Systems,” in Topics in Cryptology - {CT-RSA}
2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings,
San Francisco, CA, USA, 2018, pp. 470–490.
mla: Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable
Reputation Systems.” Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’
Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing,
2018, pp. 470–90, doi:10.1007/978-3-319-76953-0_25.
short: 'J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018
- The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer
International Publishing, Cham, 2018, pp. 470–490.'
conference:
end_date: 2018-04-20
location: San Francisco, CA, USA
name: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA}
Conference 2018
start_date: 2018-04-16
date_created: 2018-05-24T11:14:02Z
date_updated: 2022-01-06T06:58:12Z
ddc:
- '004'
department:
- _id: '7'
- _id: '64'
doi: 10.1007/978-3-319-76953-0_25
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:45:40Z
date_updated: 2018-11-02T13:45:40Z
file_id: '5253'
file_name: PracticalAnonymousAndPubliclyL.pdf
file_size: 3371773
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:45:40Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/029
oa: '1'
page: 470-490
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the
{RSA} Conference 2018, Proceedings
publication_identifier:
isbn:
- '9783319769523'
- '9783319769530'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation
Systems
type: conference
user_id: '477'
year: '2018'
...
---
_id: '24396'
abstract:
- lang: eng
text: 'We study the Online Prize-collecting Node-weighted Steiner Forest problem
(OPC-NWSF) in which we are given an undirected graph \(G=(V, E)\) with \(|V| =
n\) and node-weight function \(w: V \rightarrow \mathcal {R}^+\). A sequence of
k pairs of nodes of G, each associated with a penalty, arrives online. OPC-NWSF
asks to construct a subgraph H such that each pair \(\{s, t\}\) is either connected
(there is a path between s and t in H) or its associated penalty is paid. The
goal is to minimize the weight of H and the total penalties paid. The current
best result for OPC-NWSF is a randomized \(\mathcal {O}(\log ^4 n)\)-competitive
algorithm due to Hajiaghayi et al. (ICALP 2014). We improve this by proposing
a randomized \(\mathcal {O}(\log n \log k)\)-competitive algorithm for OPC-NWSF,
which is optimal up to constant factor since OPC-NWSF has a randomized lower bound
of \(\varOmega (\log ^2 n)\) due to Korman [11]. Moreover, our result also implies
an improvement for two special cases of OPC-NWSF, the Online Prize-collecting
Node-weighted Steiner Tree problem (OPC-NWST) and the Online Node-weighted Steiner
Forest problem (ONWSF). In OPC-NWST, there is a distinguished node which is one
of the nodes in each pair. In ONWSF, all penalties are set to infinity. The currently
best known results for OPC-NWST and ONWSF are a randomized \(\mathcal {O}(\log
^3 n)\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014) and a randomized
\(\mathcal {O}(\log n \log ^2 k)\)-competitive algorithm due to Hajiaghayi et
al. (FOCS 2013), respectively.'
author:
- first_name: Christine
full_name: Markarian, Christine
last_name: Markarian
citation:
ama: 'Markarian C. An Optimal Algorithm for Online Prize-Collecting Node-Weighted
Steiner Forest. In: International Workshop on Combinatorial Algorithms (IWOCA).
; 2018. doi:10.1007/978-3-319-94667-2_18'
apa: Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted
Steiner Forest. International Workshop on Combinatorial Algorithms (IWOCA).
https://doi.org/10.1007/978-3-319-94667-2_18
bibtex: '@inproceedings{Markarian_2018, place={Cham}, title={An Optimal Algorithm
for Online Prize-Collecting Node-Weighted Steiner Forest}, DOI={10.1007/978-3-319-94667-2_18},
booktitle={International Workshop on Combinatorial Algorithms (IWOCA)}, author={Markarian,
Christine}, year={2018} }'
chicago: Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting
Node-Weighted Steiner Forest.” In International Workshop on Combinatorial Algorithms
(IWOCA). Cham, 2018. https://doi.org/10.1007/978-3-319-94667-2_18.
ieee: 'C. Markarian, “An Optimal Algorithm for Online Prize-Collecting Node-Weighted
Steiner Forest,” 2018, doi: 10.1007/978-3-319-94667-2_18.'
mla: Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted
Steiner Forest.” International Workshop on Combinatorial Algorithms (IWOCA),
2018, doi:10.1007/978-3-319-94667-2_18.
short: 'C. Markarian, in: International Workshop on Combinatorial Algorithms (IWOCA),
Cham, 2018.'
date_created: 2021-09-14T12:23:29Z
date_updated: 2022-01-06T06:56:19Z
department:
- _id: '63'
doi: 10.1007/978-3-319-94667-2_18
language:
- iso: eng
place: Cham
publication: International Workshop on Combinatorial Algorithms (IWOCA)
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest
type: conference
user_id: '15415'
year: '2018'
...
---
_id: '3362'
abstract:
- lang: eng
text: Profiling applications on a heterogeneous compute node is challenging since
the way to retrieve data from the resources and interpret them varies between
resource types and manufacturers. This holds especially true for measuring the
energy consumption. In this paper we present Ampehre, a novel open source measurement
framework that allows developers to gather comparable measurements from heterogeneous
compute nodes, e.g., nodes comprising CPU, GPU, and FPGA. We explain the architecture
of Ampehre and detail the measurement process on the example of energy measurements
on CPU and GPU. To characterize the probing effect, we quantitatively analyze
the trade-off between the accuracy of measurements and the CPU load imposed by
Ampehre. Based on this analysis, we are able to specify reasonable combinations
of sampling periods for the different resource types of a compute node.
author:
- first_name: Achim
full_name: Lösch, Achim
id: '43646'
last_name: Lösch
- first_name: Alex
full_name: Wiens, Alex
last_name: Wiens
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Lösch A, Wiens A, Platzner M. Ampehre: An Open Source Measurement Framework
for Heterogeneous Compute Nodes. In: Proceedings of the International Conference
on Architecture of Computing Systems (ARCS). Vol 10793. Lecture Notes in Computer
Science. Cham: Springer International Publishing; 2018:73-84. doi:10.1007/978-3-319-77610-1_6'
apa: 'Lösch, A., Wiens, A., & Platzner, M. (2018). Ampehre: An Open Source Measurement
Framework for Heterogeneous Compute Nodes. In Proceedings of the International
Conference on Architecture of Computing Systems (ARCS) (Vol. 10793, pp. 73–84).
Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-77610-1_6'
bibtex: '@inproceedings{Lösch_Wiens_Platzner_2018, place={Cham}, series={Lecture
Notes in Computer Science}, title={Ampehre: An Open Source Measurement Framework
for Heterogeneous Compute Nodes}, volume={10793}, DOI={10.1007/978-3-319-77610-1_6},
booktitle={Proceedings of the International Conference on Architecture of Computing
Systems (ARCS)}, publisher={Springer International Publishing}, author={Lösch,
Achim and Wiens, Alex and Platzner, Marco}, year={2018}, pages={73–84}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Lösch, Achim, Alex Wiens, and Marco Platzner. “Ampehre: An Open Source
Measurement Framework for Heterogeneous Compute Nodes.” In Proceedings of the
International Conference on Architecture of Computing Systems (ARCS), 10793:73–84.
Lecture Notes in Computer Science. Cham: Springer International Publishing, 2018.
https://doi.org/10.1007/978-3-319-77610-1_6.'
ieee: 'A. Lösch, A. Wiens, and M. Platzner, “Ampehre: An Open Source Measurement
Framework for Heterogeneous Compute Nodes,” in Proceedings of the International
Conference on Architecture of Computing Systems (ARCS), 2018, vol. 10793,
pp. 73–84.'
mla: 'Lösch, Achim, et al. “Ampehre: An Open Source Measurement Framework for Heterogeneous
Compute Nodes.” Proceedings of the International Conference on Architecture
of Computing Systems (ARCS), vol. 10793, Springer International Publishing,
2018, pp. 73–84, doi:10.1007/978-3-319-77610-1_6.'
short: 'A. Lösch, A. Wiens, M. Platzner, in: Proceedings of the International Conference
on Architecture of Computing Systems (ARCS), Springer International Publishing,
Cham, 2018, pp. 73–84.'
date_created: 2018-06-26T13:47:52Z
date_updated: 2022-01-06T06:59:13Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1007/978-3-319-77610-1_6
file:
- access_level: closed
content_type: application/pdf
creator: aloesch
date_created: 2018-06-26T13:58:28Z
date_updated: 2018-06-26T13:58:28Z
file_id: '3363'
file_name: loesch2017_arcs.pdf
file_size: 1114026
relation: main_file
success: 1
file_date_updated: 2018-06-26T13:58:28Z
has_accepted_license: '1'
intvolume: ' 10793'
page: 73-84
place: Cham
project:
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
publication: Proceedings of the International Conference on Architecture of Computing
Systems (ARCS)
publication_identifier:
isbn:
- '9783319776095'
- '9783319776101'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: 'Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes'
type: conference
user_id: '477'
volume: 10793
year: '2018'
...
---
_id: '3373'
abstract:
- lang: eng
text: Modern Boolean satisfiability solvers can emit proofs of unsatisfiability.
There is substantial interest in being able to verify such proofs and also in
using them for further computations. In this paper, we present an FPGA accelerator
for checking resolution proofs, a popular proof format. Our accelerator exploits
parallelism at the low level by implementing the basic resolution step in hardware,
and at the high level by instantiating a number of parallel modules for proof
checking. Since proof checking involves highly irregular memory accesses, we employ
Hybrid Memory Cube technology for accelerator memory. The results show that while
the accelerator is scalable and achieves speedups for all benchmark proofs, performance
improvements are currently limited by the overhead of transitioning the proof
into the accelerator memory.
author:
- first_name: Tim
full_name: Hansmeier, Tim
id: '49992'
last_name: Hansmeier
orcid: 0000-0003-1377-3339
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: David
full_name: Andrews, David
last_name: Andrews
citation:
ama: 'Hansmeier T, Platzner M, Andrews D. An FPGA/HMC-Based Accelerator for Resolution
Proof Checking. In: ARC 2018: Applied Reconfigurable Computing. Architectures,
Tools, and Applications. Vol 10824. Lecture Notes in Computer Science. Springer
International Publishing; 2018:153-165. doi:10.1007/978-3-319-78890-6_13'
apa: 'Hansmeier, T., Platzner, M., & Andrews, D. (2018). An FPGA/HMC-Based Accelerator
for Resolution Proof Checking. In ARC 2018: Applied Reconfigurable Computing.
Architectures, Tools, and Applications (Vol. 10824, pp. 153–165). Santorini,
Greece: Springer International Publishing. https://doi.org/10.1007/978-3-319-78890-6_13'
bibtex: '@inproceedings{Hansmeier_Platzner_Andrews_2018, series={Lecture Notes in
Computer Science}, title={An FPGA/HMC-Based Accelerator for Resolution Proof Checking},
volume={10824}, DOI={10.1007/978-3-319-78890-6_13},
booktitle={ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and
Applications}, publisher={Springer International Publishing}, author={Hansmeier,
Tim and Platzner, Marco and Andrews, David}, year={2018}, pages={153–165}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Hansmeier, Tim, Marco Platzner, and David Andrews. “An FPGA/HMC-Based
Accelerator for Resolution Proof Checking.” In ARC 2018: Applied Reconfigurable
Computing. Architectures, Tools, and Applications, 10824:153–65. Lecture Notes
in Computer Science. Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-78890-6_13.'
ieee: 'T. Hansmeier, M. Platzner, and D. Andrews, “An FPGA/HMC-Based Accelerator
for Resolution Proof Checking,” in ARC 2018: Applied Reconfigurable Computing.
Architectures, Tools, and Applications, Santorini, Greece, 2018, vol. 10824,
pp. 153–165.'
mla: 'Hansmeier, Tim, et al. “An FPGA/HMC-Based Accelerator for Resolution Proof
Checking.” ARC 2018: Applied Reconfigurable Computing. Architectures, Tools,
and Applications, vol. 10824, Springer International Publishing, 2018, pp.
153–65, doi:10.1007/978-3-319-78890-6_13.'
short: 'T. Hansmeier, M. Platzner, D. Andrews, in: ARC 2018: Applied Reconfigurable
Computing. Architectures, Tools, and Applications, Springer International Publishing,
2018, pp. 153–165.'
conference:
end_date: 2018-05-04
location: Santorini, Greece
name: 'ARC: International Symposium on Applied Reconfigurable Computing'
start_date: 2018-05-02
date_created: 2018-06-27T09:30:24Z
date_updated: 2022-01-06T06:59:13Z
ddc:
- '000'
department:
- _id: '78'
doi: 10.1007/978-3-319-78890-6_13
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:55:07Z
date_updated: 2018-11-02T13:55:07Z
file_id: '5257'
file_name: AnFPGAHMC-BasedAcceleratorForR.pdf
file_size: 612367
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:55:07Z
has_accepted_license: '1'
intvolume: ' 10824'
language:
- iso: eng
page: 153-165
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
publication: 'ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and
Applications'
publication_identifier:
isbn:
- '9783319788890'
- '9783319788906'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: An FPGA/HMC-Based Accelerator for Resolution Proof Checking
type: conference
user_id: '3118'
volume: 10824
year: '2018'
...
---
_id: '3536'
author:
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Monika
full_name: Wedel, Monika
last_name: Wedel
- first_name: Oleg
full_name: Travkin, Oleg
last_name: Travkin
- first_name: Jürgen
full_name: König, Jürgen
id: '22358'
last_name: König
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Schellhorn G, Wedel M, Travkin O, König J, Wehrheim H. FastLane Is Opaque
– a Case Study in Mechanized Proofs of Opacity. In: Software Engineering and
Formal Methods. Cham: Springer International Publishing; 2018:105-120. doi:10.1007/978-3-319-92970-5_7'
apa: 'Schellhorn, G., Wedel, M., Travkin, O., König, J., & Wehrheim, H. (2018).
FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In Software
Engineering and Formal Methods (pp. 105–120). Cham: Springer International
Publishing. https://doi.org/10.1007/978-3-319-92970-5_7'
bibtex: '@inbook{Schellhorn_Wedel_Travkin_König_Wehrheim_2018, place={Cham}, title={FastLane
Is Opaque – a Case Study in Mechanized Proofs of Opacity}, DOI={10.1007/978-3-319-92970-5_7},
booktitle={Software Engineering and Formal Methods}, publisher={Springer International
Publishing}, author={Schellhorn, Gerhard and Wedel, Monika and Travkin, Oleg and
König, Jürgen and Wehrheim, Heike}, year={2018}, pages={105–120} }'
chicago: 'Schellhorn, Gerhard, Monika Wedel, Oleg Travkin, Jürgen König, and Heike
Wehrheim. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.”
In Software Engineering and Formal Methods, 105–20. Cham: Springer International
Publishing, 2018. https://doi.org/10.1007/978-3-319-92970-5_7.'
ieee: 'G. Schellhorn, M. Wedel, O. Travkin, J. König, and H. Wehrheim, “FastLane
Is Opaque – a Case Study in Mechanized Proofs of Opacity,” in Software Engineering
and Formal Methods, Cham: Springer International Publishing, 2018, pp. 105–120.'
mla: Schellhorn, Gerhard, et al. “FastLane Is Opaque – a Case Study in Mechanized
Proofs of Opacity.” Software Engineering and Formal Methods, Springer International
Publishing, 2018, pp. 105–20, doi:10.1007/978-3-319-92970-5_7.
short: 'G. Schellhorn, M. Wedel, O. Travkin, J. König, H. Wehrheim, in: Software
Engineering and Formal Methods, Springer International Publishing, Cham, 2018,
pp. 105–120.'
date_created: 2018-07-11T06:19:58Z
date_updated: 2022-01-06T06:59:22Z
department:
- _id: '77'
doi: 10.1007/978-3-319-92970-5_7
page: 105-120
place: Cham
project:
- _id: '78'
name: Validation of Software Transactional Memory
publication: Software Engineering and Formal Methods
publication_identifier:
isbn:
- '9783319929699'
- '9783319929705'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity
type: book_chapter
user_id: '29719'
year: '2018'
...
---
_id: '5774'
abstract:
- lang: eng
text: Information flow analysis investigates the flow of data in applications, checking
in particular for flows from private sources to public sinks. Flow- and path-sensitive
analyses are, however, often too costly to be performed every time a security-critical
application is run. In this paper, we propose a variant of proof carrying code
for information flow security. To this end, we develop information flow (IF) certificates
which get attached to programs as well as a method for IF certificate validation.
We prove soundness of our technique, i.e., show it to be tamper-free. The technique
is implemented within the program analysis tool CPAchecker. Our experiments confirm
that the use of certificates pays off for costly analysis runs.
author:
- first_name: Manuel
full_name: Töws, Manuel
id: '11315'
last_name: Töws
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Töws M, Wehrheim H. Information Flow Certificates. In: Theoretical Aspects
of Computing – ICTAC 2018. Cham: Springer International Publishing; 2018:435-454.
doi:10.1007/978-3-030-02508-3_23'
apa: 'Töws, M., & Wehrheim, H. (2018). Information Flow Certificates. In Theoretical
Aspects of Computing – ICTAC 2018 (pp. 435–454). Cham: Springer International
Publishing. https://doi.org/10.1007/978-3-030-02508-3_23'
bibtex: '@inproceedings{Töws_Wehrheim_2018, place={Cham}, title={Information Flow
Certificates}, DOI={10.1007/978-3-030-02508-3_23},
booktitle={Theoretical Aspects of Computing – ICTAC 2018}, publisher={Springer
International Publishing}, author={Töws, Manuel and Wehrheim, Heike}, year={2018},
pages={435–454} }'
chicago: 'Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” In
Theoretical Aspects of Computing – ICTAC 2018, 435–54. Cham: Springer International
Publishing, 2018. https://doi.org/10.1007/978-3-030-02508-3_23.'
ieee: M. Töws and H. Wehrheim, “Information Flow Certificates,” in Theoretical
Aspects of Computing – ICTAC 2018, 2018, pp. 435–454.
mla: Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” Theoretical
Aspects of Computing – ICTAC 2018, Springer International Publishing, 2018,
pp. 435–54, doi:10.1007/978-3-030-02508-3_23.
short: 'M. Töws, H. Wehrheim, in: Theoretical Aspects of Computing – ICTAC 2018,
Springer International Publishing, Cham, 2018, pp. 435–454.'
date_created: 2018-11-21T09:51:37Z
date_updated: 2022-01-06T07:02:40Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1007/978-3-030-02508-3_23
file:
- access_level: closed
content_type: application/pdf
creator: mtoews
date_created: 2018-11-26T15:11:32Z
date_updated: 2018-11-26T15:11:32Z
file_id: '5837'
file_name: Töws-Wehrheim2018_Chapter_InformationFlowCertificates.pdf
file_size: 518016
relation: main_file
success: 1
file_date_updated: 2018-11-26T15:11:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 435-454
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: Theoretical Aspects of Computing – ICTAC 2018
publication_identifier:
isbn:
- '9783030025076'
- '9783030025083'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Information Flow Certificates
type: conference
user_id: '477'
year: '2018'
...
---
_id: '6253'
author:
- first_name: Björn
full_name: Senft, Björn
id: '9109'
last_name: Senft
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
- first_name: Simon
full_name: Oberthür, Simon
id: '383'
last_name: Oberthür
- first_name: Nitish
full_name: Patkar, Nitish
last_name: Patkar
citation:
ama: 'Senft B, Fischer HG, Oberthür S, Patkar N. Assist Users to Straightaway Suggest
and Describe Experienced Problems. In: Design, User Experience, and Usability:
Theory and Practice. Vol 10918. Lecture Notes in Computer Science. Cham: Springer
International Publishing; 2018:758-770. doi:10.1007/978-3-319-91797-9_52'
apa: 'Senft, B., Fischer, H. G., Oberthür, S., & Patkar, N. (2018). Assist Users
to Straightaway Suggest and Describe Experienced Problems. In Design, User
Experience, and Usability: Theory and Practice (Vol. 10918, pp. 758–770).
Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-91797-9_52'
bibtex: '@inbook{Senft_Fischer_Oberthür_Patkar_2018, place={Cham}, series={Lecture
Notes in Computer Science}, title={Assist Users to Straightaway Suggest and Describe
Experienced Problems}, volume={10918}, DOI={10.1007/978-3-319-91797-9_52},
booktitle={Design, User Experience, and Usability: Theory and Practice}, publisher={Springer
International Publishing}, author={Senft, Björn and Fischer, Holger Gerhard and
Oberthür, Simon and Patkar, Nitish}, year={2018}, pages={758–770}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Senft, Björn, Holger Gerhard Fischer, Simon Oberthür, and Nitish Patkar.
“Assist Users to Straightaway Suggest and Describe Experienced Problems.” In Design,
User Experience, and Usability: Theory and Practice, 10918:758–70. Lecture
Notes in Computer Science. Cham: Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-91797-9_52.'
ieee: 'B. Senft, H. G. Fischer, S. Oberthür, and N. Patkar, “Assist Users to Straightaway
Suggest and Describe Experienced Problems,” in Design, User Experience, and
Usability: Theory and Practice, vol. 10918, Cham: Springer International Publishing,
2018, pp. 758–770.'
mla: 'Senft, Björn, et al. “Assist Users to Straightaway Suggest and Describe Experienced
Problems.” Design, User Experience, and Usability: Theory and Practice,
vol. 10918, Springer International Publishing, 2018, pp. 758–70, doi:10.1007/978-3-319-91797-9_52.'
short: 'B. Senft, H.G. Fischer, S. Oberthür, N. Patkar, in: Design, User Experience,
and Usability: Theory and Practice, Springer International Publishing, Cham, 2018,
pp. 758–770.'
conference:
end_date: 2018-07-20
location: Las Vegas, USA
name: International Conference of Design, User Experience, and Usability (DUXU)
as part of HCI International 2018
start_date: 2018-07-15
date_created: 2018-12-18T10:37:41Z
date_updated: 2022-01-06T07:02:58Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.1007/978-3-319-91797-9_52
intvolume: ' 10918'
language:
- iso: eng
page: 758-770
place: Cham
publication: 'Design, User Experience, and Usability: Theory and Practice'
publication_identifier:
isbn:
- '9783319917962'
- '9783319917979'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Assist Users to Straightaway Suggest and Describe Experienced Problems
type: book_chapter
user_id: '30457'
volume: 10918
year: '2018'
...
---
_id: '6254'
author:
- first_name: Holger Gerhard
full_name: Fischer, Holger Gerhard
id: '30457'
last_name: Fischer
- first_name: Björn
full_name: Senft, Björn
id: '9109'
last_name: Senft
- first_name: Florian
full_name: Rittmeier, Florian
id: '5281'
last_name: Rittmeier
- first_name: Stefan
full_name: Sauer, Stefan
id: '447'
last_name: Sauer
citation:
ama: 'Fischer HG, Senft B, Rittmeier F, Sauer S. A Canvas Method to Foster Interdisciplinary
Discussions on Digital Assistance Systems. In: Marcus A, Wang W, eds. Design,
User Experience, and Usability: Theory and Practice. Proceedings of the 20th International
Conference on Human-Computer Interaktion (HCI International 2018). Vol 10918.
Lecture Notes in Computer Science. Cham: Springer International Publishing; 2018:711-724.
doi:10.1007/978-3-319-91797-9_49'
apa: 'Fischer, H. G., Senft, B., Rittmeier, F., & Sauer, S. (2018). A Canvas
Method to Foster Interdisciplinary Discussions on Digital Assistance Systems.
In A. Marcus & W. Wang (Eds.), Design, User Experience, and Usability:
Theory and Practice. Proceedings of the 20th International Conference on Human-Computer
Interaktion (HCI International 2018) (Vol. 10918, pp. 711–724). Cham: Springer
International Publishing. https://doi.org/10.1007/978-3-319-91797-9_49'
bibtex: '@inbook{Fischer_Senft_Rittmeier_Sauer_2018, place={Cham}, series={Lecture
Notes in Computer Science}, title={A Canvas Method to Foster Interdisciplinary
Discussions on Digital Assistance Systems}, volume={10918}, DOI={10.1007/978-3-319-91797-9_49},
booktitle={Design, User Experience, and Usability: Theory and Practice. Proceedings
of the 20th International Conference on Human-Computer Interaktion (HCI International
2018)}, publisher={Springer International Publishing}, author={Fischer, Holger
Gerhard and Senft, Björn and Rittmeier, Florian and Sauer, Stefan}, editor={Marcus,
Aaron and Wang, WentaoEditors}, year={2018}, pages={711–724}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Fischer, Holger Gerhard, Björn Senft, Florian Rittmeier, and Stefan Sauer.
“A Canvas Method to Foster Interdisciplinary Discussions on Digital Assistance
Systems.” In Design, User Experience, and Usability: Theory and Practice. Proceedings
of the 20th International Conference on Human-Computer Interaktion (HCI International
2018), edited by Aaron Marcus and Wentao Wang, 10918:711–24. Lecture Notes
in Computer Science. Cham: Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-91797-9_49.'
ieee: 'H. G. Fischer, B. Senft, F. Rittmeier, and S. Sauer, “A Canvas Method to
Foster Interdisciplinary Discussions on Digital Assistance Systems,” in Design,
User Experience, and Usability: Theory and Practice. Proceedings of the 20th International
Conference on Human-Computer Interaktion (HCI International 2018), vol. 10918,
A. Marcus and W. Wang, Eds. Cham: Springer International Publishing, 2018, pp.
711–724.'
mla: 'Fischer, Holger Gerhard, et al. “A Canvas Method to Foster Interdisciplinary
Discussions on Digital Assistance Systems.” Design, User Experience, and Usability:
Theory and Practice. Proceedings of the 20th International Conference on Human-Computer
Interaktion (HCI International 2018), edited by Aaron Marcus and Wentao Wang,
vol. 10918, Springer International Publishing, 2018, pp. 711–24, doi:10.1007/978-3-319-91797-9_49.'
short: 'H.G. Fischer, B. Senft, F. Rittmeier, S. Sauer, in: A. Marcus, W. Wang (Eds.),
Design, User Experience, and Usability: Theory and Practice. Proceedings of the
20th International Conference on Human-Computer Interaktion (HCI International
2018), Springer International Publishing, Cham, 2018, pp. 711–724.'
conference:
end_date: 2018-07-20
location: Las Vegas, USA
name: International Conference of Design, User Experience, and Usability (DUXU)
as part of HCI International 2018
start_date: 2018-07-15
date_created: 2018-12-18T10:42:39Z
date_updated: 2022-01-06T07:02:58Z
department:
- _id: '66'
- _id: '534'
- _id: '221'
doi: 10.1007/978-3-319-91797-9_49
editor:
- first_name: Aaron
full_name: Marcus, Aaron
last_name: Marcus
- first_name: Wentao
full_name: Wang, Wentao
last_name: Wang
intvolume: ' 10918'
language:
- iso: eng
page: 711-724
place: Cham
publication: 'Design, User Experience, and Usability: Theory and Practice. Proceedings
of the 20th International Conference on Human-Computer Interaktion (HCI International
2018)'
publication_identifier:
isbn:
- '9783319917962'
- '9783319917979'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: A Canvas Method to Foster Interdisciplinary Discussions on Digital Assistance
Systems
type: book_chapter
user_id: '30457'
volume: 10918
year: '2018'
...
---
_id: '6423'
author:
- first_name: Dirk
full_name: Schäfer, Dirk
last_name: Schäfer
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Schäfer D, Hüllermeier E. Preference-Based Reinforcement Learning Using Dyad
Ranking. In: Discovery Science. Cham: Springer International Publishing;
2018:161-175. doi:10.1007/978-3-030-01771-2_11'
apa: 'Schäfer, D., & Hüllermeier, E. (2018). Preference-Based Reinforcement
Learning Using Dyad Ranking. In Discovery Science (pp. 161–175). Cham:
Springer International Publishing. https://doi.org/10.1007/978-3-030-01771-2_11'
bibtex: '@inbook{Schäfer_Hüllermeier_2018, place={Cham}, title={Preference-Based
Reinforcement Learning Using Dyad Ranking}, DOI={10.1007/978-3-030-01771-2_11},
booktitle={Discovery Science}, publisher={Springer International Publishing},
author={Schäfer, Dirk and Hüllermeier, Eyke}, year={2018}, pages={161–175} }'
chicago: 'Schäfer, Dirk, and Eyke Hüllermeier. “Preference-Based Reinforcement Learning
Using Dyad Ranking.” In Discovery Science, 161–75. Cham: Springer International
Publishing, 2018. https://doi.org/10.1007/978-3-030-01771-2_11.'
ieee: 'D. Schäfer and E. Hüllermeier, “Preference-Based Reinforcement Learning Using
Dyad Ranking,” in Discovery Science, Cham: Springer International Publishing,
2018, pp. 161–175.'
mla: Schäfer, Dirk, and Eyke Hüllermeier. “Preference-Based Reinforcement Learning
Using Dyad Ranking.” Discovery Science, Springer International Publishing,
2018, pp. 161–75, doi:10.1007/978-3-030-01771-2_11.
short: 'D. Schäfer, E. Hüllermeier, in: Discovery Science, Springer International
Publishing, Cham, 2018, pp. 161–175.'
date_created: 2018-12-20T15:52:03Z
date_updated: 2022-01-06T07:03:04Z
ddc:
- '000'
department:
- _id: '355'
doi: 10.1007/978-3-030-01771-2_11
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-01-11T11:03:50Z
date_updated: 2019-01-11T11:03:50Z
file_id: '6623'
file_name: Schäfer-Hüllermeier2018_Chapter_Preference-BasedReinforcementL.pdf
file_size: 458972
relation: main_file
success: 1
file_date_updated: 2019-01-11T11:03:50Z
has_accepted_license: '1'
language:
- iso: eng
page: 161-175
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: Discovery Science
publication_identifier:
isbn:
- '9783030017705'
- '9783030017712'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Preference-Based Reinforcement Learning Using Dyad Ranking
type: book_chapter
user_id: '49109'
year: '2018'
...
---
_id: '16392'
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Feldkord B, Malatyali M, Meyer auf der Heide F. A Dynamic Distributed Data
Structure for Top-k and k-Select Queries. In: Progress in Pattern Recognition,
Image Analysis, Computer Vision, and Applications. Cham; 2018. doi:10.1007/978-3-319-98355-4_18'
apa: Feldkord, B., Malatyali, M., & Meyer auf der Heide, F. (2018). A Dynamic
Distributed Data Structure for Top-k and k-Select Queries. In Progress in Pattern
Recognition, Image Analysis, Computer Vision, and Applications. Cham. https://doi.org/10.1007/978-3-319-98355-4_18
bibtex: '@inbook{Feldkord_Malatyali_Meyer auf der Heide_2018, place={Cham}, title={A
Dynamic Distributed Data Structure for Top-k and k-Select Queries}, DOI={10.1007/978-3-319-98355-4_18},
booktitle={Progress in Pattern Recognition, Image Analysis, Computer Vision, and
Applications}, author={Feldkord, Björn and Malatyali, Manuel and Meyer auf der
Heide, Friedhelm}, year={2018} }'
chicago: Feldkord, Björn, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “A
Dynamic Distributed Data Structure for Top-k and k-Select Queries.” In Progress
in Pattern Recognition, Image Analysis, Computer Vision, and Applications.
Cham, 2018. https://doi.org/10.1007/978-3-319-98355-4_18.
ieee: B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Dynamic Distributed
Data Structure for Top-k and k-Select Queries,” in Progress in Pattern Recognition,
Image Analysis, Computer Vision, and Applications, Cham, 2018.
mla: Feldkord, Björn, et al. “A Dynamic Distributed Data Structure for Top-k and
k-Select Queries.” Progress in Pattern Recognition, Image Analysis, Computer
Vision, and Applications, 2018, doi:10.1007/978-3-319-98355-4_18.
short: 'B. Feldkord, M. Malatyali, F. Meyer auf der Heide, in: Progress in Pattern
Recognition, Image Analysis, Computer Vision, and Applications, Cham, 2018.'
date_created: 2020-04-03T07:04:59Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-319-98355-4_18
language:
- iso: eng
place: Cham
publication: Progress in Pattern Recognition, Image Analysis, Computer Vision, and
Applications
publication_identifier:
isbn:
- '9783319125671'
- '9783319125688'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A Dynamic Distributed Data Structure for Top-k and k-Select Queries
type: book_chapter
user_id: '15415'
year: '2018'
...
---
_id: '24398'
abstract:
- lang: eng
text: 'Through this study, we introduce the idea of applying scheduling techniques
to allocate spatial resources that are shared among multiple robots moving in
a static environment and having temporal constraints on the arrival time to destinations.
To illustrate this idea, we present an exemplified algorithm that plans and assigns
a motion path to each robot. The considered problem is particularly challenging
because: (i) the robots share the same environment and thus the planner must take
into account overlapping paths which cannot happen at the same time; (ii) there
are time deadlines thus the planner must deal with temporal constraints; (iii)
new requests arrive without a priori knowledge thus the planner must be able to
add new paths online and adjust old plans; (iv) the robot motion is subject to
noise thus the planner must be reactive to adapt to online changes. We showcase
the functioning of the proposed algorithm through a set of agent-based simulations.'
author:
- first_name: Yara
full_name: Khaluf, Yara
last_name: Khaluf
- first_name: Christine
full_name: Markarian, Christine
last_name: Markarian
- first_name: Pieter
full_name: Simoens, Pieter
last_name: Simoens
- first_name: Andreagiovanni
full_name: Reina, Andreagiovanni
last_name: Reina
citation:
ama: 'Khaluf Y, Markarian C, Simoens P, Reina A. Scheduling Access to Shared Space
in Multi-robot Systems. In: International Conference on Practical Applications
of Agents and Multi-Agent Systems (PAAMS 2017). ; 2017. doi:10.1007/978-3-319-59930-4_12'
apa: Khaluf, Y., Markarian, C., Simoens, P., & Reina, A. (2017). Scheduling
Access to Shared Space in Multi-robot Systems. International Conference on
Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017). https://doi.org/10.1007/978-3-319-59930-4_12
bibtex: '@inproceedings{Khaluf_Markarian_Simoens_Reina_2017, place={Cham}, title={Scheduling
Access to Shared Space in Multi-robot Systems}, DOI={10.1007/978-3-319-59930-4_12},
booktitle={International Conference on Practical Applications of Agents and Multi-Agent
Systems (PAAMS 2017)}, author={Khaluf, Yara and Markarian, Christine and Simoens,
Pieter and Reina, Andreagiovanni}, year={2017} }'
chicago: Khaluf, Yara, Christine Markarian, Pieter Simoens, and Andreagiovanni Reina.
“Scheduling Access to Shared Space in Multi-Robot Systems.” In International
Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS
2017). Cham, 2017. https://doi.org/10.1007/978-3-319-59930-4_12.
ieee: 'Y. Khaluf, C. Markarian, P. Simoens, and A. Reina, “Scheduling Access to
Shared Space in Multi-robot Systems,” 2017, doi: 10.1007/978-3-319-59930-4_12.'
mla: Khaluf, Yara, et al. “Scheduling Access to Shared Space in Multi-Robot Systems.”
International Conference on Practical Applications of Agents and Multi-Agent
Systems (PAAMS 2017), 2017, doi:10.1007/978-3-319-59930-4_12.
short: 'Y. Khaluf, C. Markarian, P. Simoens, A. Reina, in: International Conference
on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017), Cham,
2017.'
date_created: 2021-09-14T12:41:58Z
date_updated: 2022-01-06T06:56:19Z
department:
- _id: '63'
doi: 10.1007/978-3-319-59930-4_12
language:
- iso: eng
place: Cham
publication: International Conference on Practical Applications of Agents and Multi-Agent
Systems (PAAMS 2017)
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Scheduling Access to Shared Space in Multi-robot Systems
type: conference
user_id: '15415'
year: '2017'
...
---
_id: '2967'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Gennadij
full_name: Liske, Gennadij
last_name: Liske
citation:
ama: 'Blömer J, Liske G. Subtleties in Security Definitions for Predicate Encryption
with Public Index. In: Proceedings of the International Conference of Mathematical
Aspects of Computer and Information Sciences (MACIS). Vol 10693. Lecture Notes
in Computer Science. Cham: Springer International Publishing; 2017:438-453. doi:10.1007/978-3-319-72453-9_35'
apa: 'Blömer, J., & Liske, G. (2017). Subtleties in Security Definitions for
Predicate Encryption with Public Index. In Proceedings of the International
Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)
(Vol. 10693, pp. 438–453). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-72453-9_35'
bibtex: '@inproceedings{Blömer_Liske_2017, place={Cham}, series={Lecture Notes in
Computer Science}, title={Subtleties in Security Definitions for Predicate Encryption
with Public Index}, volume={10693}, DOI={10.1007/978-3-319-72453-9_35},
booktitle={Proceedings of the International Conference of Mathematical Aspects
of Computer and Information Sciences (MACIS)}, publisher={Springer International
Publishing}, author={Blömer, Johannes and Liske, Gennadij}, year={2017}, pages={438–453},
collection={Lecture Notes in Computer Science} }'
chicago: 'Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions
for Predicate Encryption with Public Index.” In Proceedings of the International
Conference of Mathematical Aspects of Computer and Information Sciences (MACIS),
10693:438–53. Lecture Notes in Computer Science. Cham: Springer International
Publishing, 2017. https://doi.org/10.1007/978-3-319-72453-9_35.'
ieee: J. Blömer and G. Liske, “Subtleties in Security Definitions for Predicate
Encryption with Public Index,” in Proceedings of the International Conference
of Mathematical Aspects of Computer and Information Sciences (MACIS), 2017,
vol. 10693, pp. 438–453.
mla: Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for
Predicate Encryption with Public Index.” Proceedings of the International Conference
of Mathematical Aspects of Computer and Information Sciences (MACIS), vol.
10693, Springer International Publishing, 2017, pp. 438–53, doi:10.1007/978-3-319-72453-9_35.
short: 'J. Blömer, G. Liske, in: Proceedings of the International Conference of
Mathematical Aspects of Computer and Information Sciences (MACIS), Springer International
Publishing, Cham, 2017, pp. 438–453.'
date_created: 2018-06-04T12:17:48Z
date_updated: 2022-01-06T06:58:49Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-319-72453-9_35
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:52:10Z
date_updated: 2018-11-02T14:52:10Z
file_id: '5286'
file_name: SubtletiesInSecurityDefinition.pdf
file_size: 463904
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:52:10Z
has_accepted_license: '1'
intvolume: ' 10693'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2017/453.pdf
oa: '1'
page: 438-453
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the International Conference of Mathematical Aspects of
Computer and Information Sciences (MACIS)
publication_identifier:
isbn:
- '9783319724522'
- '9783319724539'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Subtleties in Security Definitions for Predicate Encryption with Public Index
type: conference
user_id: '477'
volume: 10693
year: '2017'
...
---
_id: '2344'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Peter
full_name: Günther, Peter
last_name: Günther
- first_name: Volker
full_name: Krummel, Volker
last_name: Krummel
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: 'Blömer J, Günther P, Krummel V, Löken N. Attribute-Based Encryption as a Service
for Access Control in Large-Scale Organizations. In: Foundations and Practice
of Security. Cham: Springer International Publishing; 2017:3-17. doi:10.1007/978-3-319-75650-9_1'
apa: 'Blömer, J., Günther, P., Krummel, V., & Löken, N. (2017). Attribute-Based
Encryption as a Service for Access Control in Large-Scale Organizations. In Foundations
and Practice of Security (pp. 3–17). Cham: Springer International Publishing.
https://doi.org/10.1007/978-3-319-75650-9_1'
bibtex: '@inproceedings{Blömer_Günther_Krummel_Löken_2017, place={Cham}, title={Attribute-Based
Encryption as a Service for Access Control in Large-Scale Organizations}, DOI={10.1007/978-3-319-75650-9_1},
booktitle={Foundations and Practice of Security}, publisher={Springer International
Publishing}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker and
Löken, Nils}, year={2017}, pages={3–17} }'
chicago: 'Blömer, Johannes, Peter Günther, Volker Krummel, and Nils Löken. “Attribute-Based
Encryption as a Service for Access Control in Large-Scale Organizations.” In Foundations
and Practice of Security, 3–17. Cham: Springer International Publishing, 2017.
https://doi.org/10.1007/978-3-319-75650-9_1.'
ieee: J. Blömer, P. Günther, V. Krummel, and N. Löken, “Attribute-Based Encryption
as a Service for Access Control in Large-Scale Organizations,” in Foundations
and Practice of Security, 2017, pp. 3–17.
mla: Blömer, Johannes, et al. “Attribute-Based Encryption as a Service for Access
Control in Large-Scale Organizations.” Foundations and Practice of Security,
Springer International Publishing, 2017, pp. 3–17, doi:10.1007/978-3-319-75650-9_1.
short: 'J. Blömer, P. Günther, V. Krummel, N. Löken, in: Foundations and Practice
of Security, Springer International Publishing, Cham, 2017, pp. 3–17.'
date_created: 2018-04-13T11:40:48Z
date_updated: 2022-01-06T06:55:55Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-319-75650-9_1
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:04:13Z
date_updated: 2018-11-02T15:04:13Z
file_id: '5292'
file_name: Attribute-BasedEncryptionAsASe.pdf
file_size: 634736
relation: main_file
success: 1
- access_level: open_access
content_type: application/pdf
creator: nilo
date_created: 2018-11-08T09:53:34Z
date_updated: 2018-11-08T09:53:34Z
file_id: '5425'
file_name: abe_aas.pdf
file_size: 522516
relation: main_file
file_date_updated: 2018-11-08T09:53:34Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 3-17
place: Cham
project:
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
- _id: '43'
name: Securing the Financial Cloud
publication: Foundations and Practice of Security
publication_identifier:
isbn:
- '9783319756493'
- '9783319756509'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations
type: conference
user_id: '13703'
year: '2017'
...
---
_id: '2381'
abstract:
- lang: eng
text: Metric facility location and K-means are well-known problems of combinatorial
optimization. Both admit a fairly simple heuristic called single-swap, which adds,
drops or swaps open facilities until it reaches a local optimum. For both problems,
it is known that this algorithm produces a solution that is at most a constant
factor worse than the respective global optimum. In this paper, we show that single-swap
applied to the weighted metric uncapacitated facility location and weighted discrete
K-means problem is tightly PLS-complete and hence has exponential worst-case running
time.
author:
- first_name: Sascha
full_name: Brauer, Sascha
id: '13291'
last_name: Brauer
citation:
ama: 'Brauer S. Complexity of Single-Swap Heuristics for Metric Facility Location
and Related Problems. In: Fotakis D, Pagourtzis A, Paschos VT, eds. Lecture
Notes in Computer Science. Vol 10236. Cham: Springer International Publishing;
2017:116-127. doi:10.1007/978-3-319-57586-5_11'
apa: 'Brauer, S. (2017). Complexity of Single-Swap Heuristics for Metric Facility
Location and Related Problems. In D. Fotakis, A. Pagourtzis, & V. T. Paschos
(Eds.), Lecture Notes in Computer Science (Vol. 10236, pp. 116–127). Cham:
Springer International Publishing. https://doi.org/10.1007/978-3-319-57586-5_11'
bibtex: '@inbook{Brauer_2017, place={Cham}, title={Complexity of Single-Swap Heuristics
for Metric Facility Location and Related Problems}, volume={10236}, DOI={10.1007/978-3-319-57586-5_11},
booktitle={Lecture Notes in Computer Science}, publisher={Springer International
Publishing}, author={Brauer, Sascha}, editor={Fotakis, Dimitris and Pagourtzis,
Aris and Paschos, Vangelis Th.Editors}, year={2017}, pages={116–127} }'
chicago: 'Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility
Location and Related Problems.” In Lecture Notes in Computer Science, edited
by Dimitris Fotakis, Aris Pagourtzis, and Vangelis Th. Paschos, 10236:116–27.
Cham: Springer International Publishing, 2017. https://doi.org/10.1007/978-3-319-57586-5_11.'
ieee: 'S. Brauer, “Complexity of Single-Swap Heuristics for Metric Facility Location
and Related Problems,” in Lecture Notes in Computer Science, vol. 10236,
D. Fotakis, A. Pagourtzis, and V. T. Paschos, Eds. Cham: Springer International
Publishing, 2017, pp. 116–127.'
mla: Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location
and Related Problems.” Lecture Notes in Computer Science, edited by Dimitris
Fotakis et al., vol. 10236, Springer International Publishing, 2017, pp. 116–27,
doi:10.1007/978-3-319-57586-5_11.
short: 'S. Brauer, in: D. Fotakis, A. Pagourtzis, V.T. Paschos (Eds.), Lecture Notes
in Computer Science, Springer International Publishing, Cham, 2017, pp. 116–127.'
conference:
end_date: 2017-05-26
location: Athens, Greece
name: 10th International Conference on Algorithms and Complexity
start_date: 2017-05-24
date_created: 2018-04-17T12:20:53Z
date_updated: 2022-01-06T06:56:00Z
department:
- _id: '64'
doi: 10.1007/978-3-319-57586-5_11
editor:
- first_name: Dimitris
full_name: Fotakis, Dimitris
last_name: Fotakis
- first_name: Aris
full_name: Pagourtzis, Aris
last_name: Pagourtzis
- first_name: Vangelis Th.
full_name: Paschos, Vangelis Th.
last_name: Paschos
intvolume: ' 10236'
language:
- iso: eng
page: 116-127
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783319575858'
- '9783319575865'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Complexity of Single-Swap Heuristics for Metric Facility Location and Related
Problems
type: book_chapter
user_id: '13291'
volume: 10236
year: '2017'
...