---
_id: '48893'
abstract:
- lang: eng
text: Computing diverse sets of high-quality solutions has gained increasing attention
among the evolutionary computation community in recent years. It allows practitioners
to choose from a set of high-quality alternatives. In this paper, we employ a
population diversity measure, called the high-order entropy measure, in an evolutionary
algorithm to compute a diverse set of high-quality solutions for the Traveling
Salesperson Problem. In contrast to previous studies, our approach allows diversifying
segments of tours containing several edges based on the entropy measure. We examine
the resulting evolutionary diversity optimisation approach precisely in terms
of the final set of solutions and theoretical properties. Experimental results
show significant improvements compared to a recently proposed edge-based diversity
optimisation approach when working with a large population of solutions or long
segments.
author:
- first_name: Adel
full_name: Nikfarjam, Adel
last_name: Nikfarjam
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Nikfarjam A, Bossek J, Neumann A, Neumann F. Entropy-Based Evolutionary Diversity
Optimisation for the Traveling Salesperson Problem. In: Proceedings of the
Genetic and Evolutionary Computation Conference. GECCO’21. Association for
Computing Machinery; 2021:600–608. doi:10.1145/3449639.3459384'
apa: Nikfarjam, A., Bossek, J., Neumann, A., & Neumann, F. (2021). Entropy-Based
Evolutionary Diversity Optimisation for the Traveling Salesperson Problem. Proceedings
of the Genetic and Evolutionary Computation Conference, 600–608. https://doi.org/10.1145/3449639.3459384
bibtex: '@inproceedings{Nikfarjam_Bossek_Neumann_Neumann_2021, place={New York,
NY, USA}, series={GECCO’21}, title={Entropy-Based Evolutionary Diversity Optimisation
for the Traveling Salesperson Problem}, DOI={10.1145/3449639.3459384},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Nikfarjam, Adel and Bossek,
Jakob and Neumann, Aneta and Neumann, Frank}, year={2021}, pages={600–608}, collection={GECCO’21}
}'
chicago: 'Nikfarjam, Adel, Jakob Bossek, Aneta Neumann, and Frank Neumann. “Entropy-Based
Evolutionary Diversity Optimisation for the Traveling Salesperson Problem.” In
Proceedings of the Genetic and Evolutionary Computation Conference, 600–608.
GECCO’21. New York, NY, USA: Association for Computing Machinery, 2021. https://doi.org/10.1145/3449639.3459384.'
ieee: 'A. Nikfarjam, J. Bossek, A. Neumann, and F. Neumann, “Entropy-Based Evolutionary
Diversity Optimisation for the Traveling Salesperson Problem,” in Proceedings
of the Genetic and Evolutionary Computation Conference, 2021, pp. 600–608,
doi: 10.1145/3449639.3459384.'
mla: Nikfarjam, Adel, et al. “Entropy-Based Evolutionary Diversity Optimisation
for the Traveling Salesperson Problem.” Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, 2021, pp. 600–608,
doi:10.1145/3449639.3459384.
short: 'A. Nikfarjam, J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the
Genetic and Evolutionary Computation Conference, Association for Computing Machinery,
New York, NY, USA, 2021, pp. 600–608.'
date_created: 2023-11-14T15:59:00Z
date_updated: 2023-12-13T10:50:06Z
department:
- _id: '819'
doi: 10.1145/3449639.3459384
extern: '1'
keyword:
- evolutionary algorithms
- evolutionary diversity optimisation
- high-order entropy
- traveling salesperson problem
language:
- iso: eng
page: 600–608
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-8350-9
publisher: Association for Computing Machinery
series_title: GECCO’21
status: public
title: Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson
Problem
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48891'
abstract:
- lang: eng
text: Submodular functions allow to model many real-world optimisation problems.
This paper introduces approaches for computing diverse sets of high quality solutions
for submodular optimisation problems with uniform and knapsack constraints. We
first present diversifying greedy sampling approaches and analyse them with respect
to the diversity measured by entropy and the approximation quality of the obtained
solutions. Afterwards, we introduce an evolutionary diversity optimisation (EDO)
approach to further improve diversity of the set of solutions. We carry out experimental
investigations on popular submodular benchmark problems and analyse trade-offs
in terms of solution quality and diversity of the resulting solution sets.
author:
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Neumann A, Bossek J, Neumann F. Diversifying Greedy Sampling and Evolutionary
Diversity Optimisation for Constrained Monotone Submodular Functions. In: Proceedings
of the Genetic and Evolutionary Computation Conference. GECCO’21. Association
for Computing Machinery; 2021:261–269. doi:10.1145/3449639.3459385'
apa: Neumann, A., Bossek, J., & Neumann, F. (2021). Diversifying Greedy Sampling
and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions.
Proceedings of the Genetic and Evolutionary Computation Conference, 261–269.
https://doi.org/10.1145/3449639.3459385
bibtex: '@inproceedings{Neumann_Bossek_Neumann_2021, place={New York, NY, USA},
series={GECCO’21}, title={Diversifying Greedy Sampling and Evolutionary Diversity
Optimisation for Constrained Monotone Submodular Functions}, DOI={10.1145/3449639.3459385},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Neumann, Aneta and Bossek,
Jakob and Neumann, Frank}, year={2021}, pages={261–269}, collection={GECCO’21}
}'
chicago: 'Neumann, Aneta, Jakob Bossek, and Frank Neumann. “Diversifying Greedy
Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular
Functions.” In Proceedings of the Genetic and Evolutionary Computation Conference,
261–269. GECCO’21. New York, NY, USA: Association for Computing Machinery, 2021.
https://doi.org/10.1145/3449639.3459385.'
ieee: 'A. Neumann, J. Bossek, and F. Neumann, “Diversifying Greedy Sampling and
Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions,”
in Proceedings of the Genetic and Evolutionary Computation Conference,
2021, pp. 261–269, doi: 10.1145/3449639.3459385.'
mla: Neumann, Aneta, et al. “Diversifying Greedy Sampling and Evolutionary Diversity
Optimisation for Constrained Monotone Submodular Functions.” Proceedings of
the Genetic and Evolutionary Computation Conference, Association for Computing
Machinery, 2021, pp. 261–269, doi:10.1145/3449639.3459385.
short: 'A. Neumann, J. Bossek, F. Neumann, in: Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, New York, NY, USA,
2021, pp. 261–269.'
date_created: 2023-11-14T15:58:59Z
date_updated: 2023-12-13T10:49:25Z
department:
- _id: '819'
doi: 10.1145/3449639.3459385
extern: '1'
keyword:
- evolutionary algorithms
- evolutionary diversity optimisation
- sub-modular functions
language:
- iso: eng
page: 261–269
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-8350-9
publisher: Association for Computing Machinery
series_title: GECCO’21
status: public
title: Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained
Monotone Submodular Functions
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48892'
abstract:
- lang: eng
text: Evolutionary algorithms based on edge assembly crossover (EAX) constitute
some of the best performing incomplete solvers for the well-known traveling salesperson
problem (TSP). Often, it is desirable to compute not just a single solution for
a given problem, but a diverse set of high quality solutions from which a decision
maker can choose one for implementation. Currently, there are only a few approaches
for computing a diverse solution set for the TSP. Furthermore, almost all of them
assume that the optimal solution is known. In this paper, we introduce evolutionary
diversity optimisation (EDO) approaches for the TSP that find a diverse set of
tours when the optimal tour is known or unknown. We show how to adopt EAX to not
only find a high-quality solution but also to maximise the diversity of the population.
The resulting EAX-based EDO approach, termed EAX-EDO is capable of obtaining diverse
high-quality tours when the optimal solution for the TSP is known or unknown.
A comparison to existing approaches shows that they are clearly outperformed by
EAX-EDO.
author:
- first_name: Adel
full_name: Nikfarjam, Adel
last_name: Nikfarjam
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Nikfarjam A, Bossek J, Neumann A, Neumann F. Computing Diverse Sets of High
Quality TSP Tours by EAX-based Evolutionary Diversity Optimisation. In: Proceedings
of the 16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms. Association
for Computing Machinery; 2021:1–11.'
apa: Nikfarjam, A., Bossek, J., Neumann, A., & Neumann, F. (2021). Computing
Diverse Sets of High Quality TSP Tours by EAX-based Evolutionary Diversity Optimisation.
In Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic
Algorithms (pp. 1–11). Association for Computing Machinery.
bibtex: '@inbook{Nikfarjam_Bossek_Neumann_Neumann_2021, place={New York, NY, USA},
title={Computing Diverse Sets of High Quality TSP Tours by EAX-based Evolutionary
Diversity Optimisation}, booktitle={Proceedings of the 16th ACM}/SIGEVO Conference
on Foundations of Genetic Algorithms}, publisher={Association for Computing Machinery},
author={Nikfarjam, Adel and Bossek, Jakob and Neumann, Aneta and Neumann, Frank},
year={2021}, pages={1–11} }'
chicago: 'Nikfarjam, Adel, Jakob Bossek, Aneta Neumann, and Frank Neumann. “Computing
Diverse Sets of High Quality TSP Tours by EAX-Based Evolutionary Diversity Optimisation.”
In Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic
Algorithms, 1–11. New York, NY, USA: Association for Computing Machinery,
2021.'
ieee: 'A. Nikfarjam, J. Bossek, A. Neumann, and F. Neumann, “Computing Diverse Sets
of High Quality TSP Tours by EAX-based Evolutionary Diversity Optimisation,” in
Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms,
New York, NY, USA: Association for Computing Machinery, 2021, pp. 1–11.'
mla: Nikfarjam, Adel, et al. “Computing Diverse Sets of High Quality TSP Tours by
EAX-Based Evolutionary Diversity Optimisation.” Proceedings of the 16th ACM}/SIGEVO
Conference on Foundations of Genetic Algorithms, Association for Computing
Machinery, 2021, pp. 1–11.
short: 'A. Nikfarjam, J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the
16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms, Association
for Computing Machinery, New York, NY, USA, 2021, pp. 1–11.'
date_created: 2023-11-14T15:59:00Z
date_updated: 2023-12-13T10:49:59Z
department:
- _id: '819'
extern: '1'
keyword:
- edge assembly crossover (EAX)
- evolutionary algorithms
- evolutionary diversity optimisation (EDO)
- traveling salesperson problem (TSP)
language:
- iso: eng
page: 1–11
place: New York, NY, USA
publication: Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic
Algorithms
publication_identifier:
isbn:
- 978-1-4503-8352-3
publisher: Association for Computing Machinery
status: public
title: Computing Diverse Sets of High Quality TSP Tours by EAX-based Evolutionary
Diversity Optimisation
type: book_chapter
user_id: '102979'
year: '2021'
...
---
_id: '48854'
abstract:
- lang: eng
text: We contribute to the theoretical understanding of randomized search heuristics
for dynamic problems. We consider the classical vertex coloring problem on graphs
and investigate the dynamic setting where edges are added to the current graph.
We then analyze the expected time for randomized search heuristics to recompute
high quality solutions. The (1+1) Evolutionary Algorithm and RLS operate in a
setting where the number of colors is bounded and we are minimizing the number
of conflicts. Iterated local search algorithms use an unbounded color palette
and aim to use the smallest colors and, consequently, the smallest number of colors.
We identify classes of bipartite graphs where reoptimization is as hard as or
even harder than optimization from scratch, i.e., starting with a random initialization.
Even adding a single edge can lead to hard symmetry problems. However, graph classes
that are hard for one algorithm turn out to be easy for others. In most cases
our bounds show that reoptimization is faster than optimizing from scratch. We
further show that tailoring mutation operators to parts of the graph where changes
have occurred can significantly reduce the expected reoptimization time. In most
settings the expected reoptimization time for such tailored algorithms is linear
in the number of added edges. However, tailored algorithms cannot prevent exponential
times in settings where the original algorithm is inefficient.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
- first_name: Pan
full_name: Peng, Pan
last_name: Peng
- first_name: Dirk
full_name: Sudholt, Dirk
last_name: Sudholt
citation:
ama: Bossek J, Neumann F, Peng P, Sudholt D. Time Complexity Analysis of Randomized
Search Heuristics for the Dynamic Graph Coloring Problem. Algorithmica.
2021;83(10):3148–3179. doi:10.1007/s00453-021-00838-3
apa: Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2021). Time Complexity
Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.
Algorithmica, 83(10), 3148–3179. https://doi.org/10.1007/s00453-021-00838-3
bibtex: '@article{Bossek_Neumann_Peng_Sudholt_2021, title={Time Complexity Analysis
of Randomized Search Heuristics for the Dynamic Graph Coloring Problem}, volume={83},
DOI={10.1007/s00453-021-00838-3},
number={10}, journal={Algorithmica}, author={Bossek, Jakob and Neumann, Frank
and Peng, Pan and Sudholt, Dirk}, year={2021}, pages={3148–3179} }'
chicago: 'Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Time Complexity
Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.”
Algorithmica 83, no. 10 (2021): 3148–3179. https://doi.org/10.1007/s00453-021-00838-3.'
ieee: 'J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Time Complexity Analysis
of Randomized Search Heuristics for the Dynamic Graph Coloring Problem,” Algorithmica,
vol. 83, no. 10, pp. 3148–3179, 2021, doi: 10.1007/s00453-021-00838-3.'
mla: Bossek, Jakob, et al. “Time Complexity Analysis of Randomized Search Heuristics
for the Dynamic Graph Coloring Problem.” Algorithmica, vol. 83, no. 10,
2021, pp. 3148–3179, doi:10.1007/s00453-021-00838-3.
short: J. Bossek, F. Neumann, P. Peng, D. Sudholt, Algorithmica 83 (2021) 3148–3179.
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:51:34Z
department:
- _id: '819'
doi: 10.1007/s00453-021-00838-3
intvolume: ' 83'
issue: '10'
keyword:
- Dynamic optimization
- Evolutionary algorithms
- Running time analysis
language:
- iso: eng
page: 3148–3179
publication: Algorithmica
publication_identifier:
issn:
- 0178-4617
status: public
title: Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph
Coloring Problem
type: journal_article
user_id: '102979'
volume: 83
year: '2021'
...
---
_id: '22218'
author:
- first_name: Stefan
full_name: Krauter, Stefan
id: '28836'
last_name: Krauter
orcid: 0000-0002-3594-260X
- first_name: Joachim
full_name: Böcker, Joachim
id: '66'
last_name: Böcker
orcid: 0000-0002-8480-7295
- first_name: Christine
full_name: Freitag, Christine
id: '20560'
last_name: Freitag
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
- first_name: Ulrich
full_name: Hilleringmann, Ulrich
id: '20179'
last_name: Hilleringmann
- first_name: Katrin
full_name: Temmen, Katrin
id: '30086'
last_name: Temmen
- first_name: Tobias
full_name: Klaus, Tobias
last_name: Klaus
- first_name: Nicolaus
full_name: Rohrer, Nicolaus
last_name: Rohrer
- first_name: Sven
full_name: Lehmann, Sven
last_name: Lehmann
citation:
ama: 'Krauter S, Böcker J, Freitag C, et al. Projekt Art-D Grids: Nachhaltige und
stabile Microgrids in Afrika - eine Plattform für Forschung und Lehre für die
Entwicklung. In: Tagungsband des 36. PV-Symposiums, 18.-26 Mai 2021. Conexio;
2021:305-309.'
apa: 'Krauter, S., Böcker, J., Freitag, C., Hehenkamp, B., Hilleringmann, U., Temmen,
K., Klaus, T., Rohrer, N., & Lehmann, S. (2021). Projekt Art-D Grids: Nachhaltige
und stabile Microgrids in Afrika - eine Plattform für Forschung und Lehre für
die Entwicklung. Tagungsband des 36. PV-Symposiums, 18.-26 Mai 2021, 305–309.'
bibtex: '@inproceedings{Krauter_Böcker_Freitag_Hehenkamp_Hilleringmann_Temmen_Klaus_Rohrer_Lehmann_2021,
place={Pforzheim}, title={Projekt Art-D Grids: Nachhaltige und stabile Microgrids
in Afrika - eine Plattform für Forschung und Lehre für die Entwicklung}, booktitle={Tagungsband
des 36. PV-Symposiums, 18.-26 Mai 2021}, publisher={Conexio}, author={Krauter,
Stefan and Böcker, Joachim and Freitag, Christine and Hehenkamp, Burkhard and
Hilleringmann, Ulrich and Temmen, Katrin and Klaus, Tobias and Rohrer, Nicolaus
and Lehmann, Sven}, year={2021}, pages={305–309} }'
chicago: 'Krauter, Stefan, Joachim Böcker, Christine Freitag, Burkhard Hehenkamp,
Ulrich Hilleringmann, Katrin Temmen, Tobias Klaus, Nicolaus Rohrer, and Sven Lehmann.
“Projekt Art-D Grids: Nachhaltige und stabile Microgrids in Afrika - eine Plattform
für Forschung und Lehre für die Entwicklung.” In Tagungsband des 36. PV-Symposiums,
18.-26 Mai 2021, 305–9. Pforzheim: Conexio, 2021.'
ieee: 'S. Krauter et al., “Projekt Art-D Grids: Nachhaltige und stabile Microgrids
in Afrika - eine Plattform für Forschung und Lehre für die Entwicklung,” in Tagungsband
des 36. PV-Symposiums, 18.-26 Mai 2021, Staffelstein / online, 2021, pp. 305–309.'
mla: 'Krauter, Stefan, et al. “Projekt Art-D Grids: Nachhaltige und stabile Microgrids
in Afrika - eine Plattform für Forschung und Lehre für die Entwicklung.” Tagungsband
des 36. PV-Symposiums, 18.-26 Mai 2021, Conexio, 2021, pp. 305–09.'
short: 'S. Krauter, J. Böcker, C. Freitag, B. Hehenkamp, U. Hilleringmann, K. Temmen,
T. Klaus, N. Rohrer, S. Lehmann, in: Tagungsband des 36. PV-Symposiums, 18.-26
Mai 2021, Conexio, Pforzheim, 2021, pp. 305–309.'
conference:
end_date: 2021-05-26
location: Staffelstein / online
name: 36. PV-Symposium
start_date: 2021-05-18
date_created: 2021-05-20T09:58:43Z
date_updated: 2024-01-19T16:43:56Z
ddc:
- '620'
department:
- _id: '53'
- _id: '475'
- _id: '52'
- _id: '453'
- _id: '59'
- _id: '300'
file:
- access_level: closed
content_type: application/pdf
creator: krauter
date_created: 2022-01-06T11:49:19Z
date_updated: 2022-01-06T11:49:19Z
file_id: '29170'
file_name: Staffelstein 2021 ART-D S.305-309.pdf
file_size: 5128404
relation: main_file
success: 1
file_date_updated: 2022-01-06T11:49:19Z
has_accepted_license: '1'
keyword:
- Art-D
- Afrika
- Resilienz
- Resilience
- Grid stability
- robustness
- microgrids
language:
- iso: ger
page: 305-309
place: Pforzheim
publication: Tagungsband des 36. PV-Symposiums, 18.-26 Mai 2021
publication_identifier:
isbn:
- 978-3-948176-14-3
publication_status: published
publisher: Conexio
quality_controlled: '1'
status: public
title: 'Projekt Art-D Grids: Nachhaltige und stabile Microgrids in Afrika - eine Plattform
für Forschung und Lehre für die Entwicklung'
type: conference
user_id: '66'
year: '2021'
...
---
_id: '29937'
author:
- first_name: Martin
full_name: Karp, Martin
last_name: Karp
- first_name: Artur
full_name: Podobas, Artur
last_name: Podobas
- first_name: Niclas
full_name: Jansson, Niclas
last_name: Jansson
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Philipp
full_name: Schlatter, Philipp
last_name: Schlatter
- first_name: Stefano
full_name: Markidis, Stefano
last_name: Markidis
citation:
ama: 'Karp M, Podobas A, Jansson N, et al. High-Performance Spectral Element Methods
on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection.
In: 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS).
IEEE; 2021. doi:10.1109/ipdps49936.2021.00116'
apa: 'Karp, M., Podobas, A., Jansson, N., Kenter, T., Plessl, C., Schlatter, P.,
& Markidis, S. (2021). High-Performance Spectral Element Methods on Field-Programmable
Gate Arrays : Implementation, Evaluation, and Future Projection. 2021 IEEE
International Parallel and Distributed Processing Symposium (IPDPS). https://doi.org/10.1109/ipdps49936.2021.00116'
bibtex: '@inproceedings{Karp_Podobas_Jansson_Kenter_Plessl_Schlatter_Markidis_2021,
title={High-Performance Spectral Element Methods on Field-Programmable Gate Arrays :
Implementation, Evaluation, and Future Projection}, DOI={10.1109/ipdps49936.2021.00116},
booktitle={2021 IEEE International Parallel and Distributed Processing Symposium
(IPDPS)}, publisher={IEEE}, author={Karp, Martin and Podobas, Artur and Jansson,
Niclas and Kenter, Tobias and Plessl, Christian and Schlatter, Philipp and Markidis,
Stefano}, year={2021} }'
chicago: 'Karp, Martin, Artur Podobas, Niclas Jansson, Tobias Kenter, Christian
Plessl, Philipp Schlatter, and Stefano Markidis. “High-Performance Spectral Element
Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future
Projection.” In 2021 IEEE International Parallel and Distributed Processing
Symposium (IPDPS). IEEE, 2021. https://doi.org/10.1109/ipdps49936.2021.00116.'
ieee: 'M. Karp et al., “High-Performance Spectral Element Methods on Field-Programmable
Gate Arrays : Implementation, Evaluation, and Future Projection,” 2021, doi: 10.1109/ipdps49936.2021.00116.'
mla: 'Karp, Martin, et al. “High-Performance Spectral Element Methods on Field-Programmable
Gate Arrays : Implementation, Evaluation, and Future Projection.” 2021 IEEE
International Parallel and Distributed Processing Symposium (IPDPS), IEEE,
2021, doi:10.1109/ipdps49936.2021.00116.'
short: 'M. Karp, A. Podobas, N. Jansson, T. Kenter, C. Plessl, P. Schlatter, S.
Markidis, in: 2021 IEEE International Parallel and Distributed Processing Symposium
(IPDPS), IEEE, 2021.'
date_created: 2022-02-21T14:26:37Z
date_updated: 2024-01-22T09:59:13Z
department:
- _id: '27'
- _id: '518'
doi: 10.1109/ipdps49936.2021.00116
language:
- iso: eng
project:
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: 2021 IEEE International Parallel and Distributed Processing Symposium
(IPDPS)
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: 'High-Performance Spectral Element Methods on Field-Programmable Gate Arrays
: Implementation, Evaluation, and Future Projection'
type: conference
user_id: '3145'
year: '2021'
...
---
_id: '31263'
author:
- first_name: Colin
full_name: Guillarmou, Colin
last_name: Guillarmou
- first_name: Joachim
full_name: Hilgert, Joachim
id: '220'
last_name: Hilgert
- first_name: Tobias
full_name: Weich, Tobias
id: '49178'
last_name: Weich
orcid: 0000-0002-9648-6919
citation:
ama: Guillarmou C, Hilgert J, Weich T. High frequency limits for invariant Ruelle
densities. Annales Henri Lebesgue. 2021;4:81-119. doi:10.5802/ahl.67
apa: Guillarmou, C., Hilgert, J., & Weich, T. (2021). High frequency limits
for invariant Ruelle densities. Annales Henri Lebesgue, 4, 81–119.
https://doi.org/10.5802/ahl.67
bibtex: '@article{Guillarmou_Hilgert_Weich_2021, title={High frequency limits for
invariant Ruelle densities}, volume={4}, DOI={10.5802/ahl.67},
journal={Annales Henri Lebesgue}, publisher={Cellule MathDoc/CEDRAM}, author={Guillarmou,
Colin and Hilgert, Joachim and Weich, Tobias}, year={2021}, pages={81–119} }'
chicago: 'Guillarmou, Colin, Joachim Hilgert, and Tobias Weich. “High Frequency
Limits for Invariant Ruelle Densities.” Annales Henri Lebesgue 4 (2021):
81–119. https://doi.org/10.5802/ahl.67.'
ieee: 'C. Guillarmou, J. Hilgert, and T. Weich, “High frequency limits for invariant
Ruelle densities,” Annales Henri Lebesgue, vol. 4, pp. 81–119, 2021, doi:
10.5802/ahl.67.'
mla: Guillarmou, Colin, et al. “High Frequency Limits for Invariant Ruelle Densities.”
Annales Henri Lebesgue, vol. 4, Cellule MathDoc/CEDRAM, 2021, pp. 81–119,
doi:10.5802/ahl.67.
short: C. Guillarmou, J. Hilgert, T. Weich, Annales Henri Lebesgue 4 (2021) 81–119.
date_created: 2022-05-17T12:05:17Z
date_updated: 2024-02-19T06:27:43Z
department:
- _id: '10'
- _id: '623'
- _id: '548'
- _id: '91'
doi: 10.5802/ahl.67
external_id:
arxiv:
- '1803.06717'
intvolume: ' 4'
language:
- iso: eng
page: 81-119
publication: Annales Henri Lebesgue
publication_identifier:
issn:
- 2644-9463
publication_status: published
publisher: Cellule MathDoc/CEDRAM
status: public
title: High frequency limits for invariant Ruelle densities
type: journal_article
user_id: '49063'
volume: 4
year: '2021'
...
---
_id: '36271'
author:
- first_name: Dominik
full_name: Brennecken, Dominik
id: '55911'
last_name: Brennecken
- first_name: Joachim
full_name: Hilgert, Joachim
id: '220'
last_name: Hilgert
- first_name: Lorenzo
full_name: Ciardo, Lorenzo
last_name: Ciardo
citation:
ama: Brennecken D, Hilgert J, Ciardo L. Algebraically Independent Generators for
the Algebra of Invariant Differential Operators on SLn(R)/SOn(R). Journal of
Lie Theory. 2021;31(2):459--468. doi:10.48550/arXiv.2008.07479
apa: Brennecken, D., Hilgert, J., & Ciardo, L. (2021). Algebraically Independent
Generators for the Algebra of Invariant Differential Operators on SLn(R)/SOn(R).
Journal of Lie Theory, 31(2), 459--468. https://doi.org/10.48550/arXiv.2008.07479
bibtex: '@article{Brennecken_Hilgert_Ciardo_2021, title={Algebraically Independent
Generators for the Algebra of Invariant Differential Operators on SLn(R)/SOn(R)},
volume={31}, DOI={10.48550/arXiv.2008.07479},
number={2}, journal={Journal of Lie Theory}, publisher={Heldermann Verlag}, author={Brennecken,
Dominik and Hilgert, Joachim and Ciardo, Lorenzo}, year={2021}, pages={459--468}
}'
chicago: 'Brennecken, Dominik, Joachim Hilgert, and Lorenzo Ciardo. “Algebraically
Independent Generators for the Algebra of Invariant Differential Operators on
SLn(R)/SOn(R).” Journal of Lie Theory 31, no. 2 (2021): 459--468. https://doi.org/10.48550/arXiv.2008.07479.'
ieee: 'D. Brennecken, J. Hilgert, and L. Ciardo, “Algebraically Independent Generators
for the Algebra of Invariant Differential Operators on SLn(R)/SOn(R),” Journal
of Lie Theory, vol. 31, no. 2, pp. 459--468, 2021, doi: 10.48550/arXiv.2008.07479.'
mla: Brennecken, Dominik, et al. “Algebraically Independent Generators for the Algebra
of Invariant Differential Operators on SLn(R)/SOn(R).” Journal of Lie Theory,
vol. 31, no. 2, Heldermann Verlag, 2021, pp. 459--468, doi:10.48550/arXiv.2008.07479.
short: D. Brennecken, J. Hilgert, L. Ciardo, Journal of Lie Theory 31 (2021) 459--468.
date_created: 2023-01-12T08:23:28Z
date_updated: 2024-02-19T06:27:09Z
department:
- _id: '555'
- _id: '91'
doi: 10.48550/arXiv.2008.07479
intvolume: ' 31'
issue: '2'
language:
- iso: eng
page: 459--468
publication: Journal of Lie Theory
publication_status: published
publisher: Heldermann Verlag
status: public
title: Algebraically Independent Generators for the Algebra of Invariant Differential
Operators on SLn(R)/SOn(R)
type: journal_article
user_id: '49063'
volume: 31
year: '2021'
...
---
_id: '51556'
author:
- first_name: Joachim
full_name: Hilgert, Joachim
id: '220'
last_name: Hilgert
citation:
ama: 'Hilgert J. Philip Ording: 99 Variations on a Proof. Princeton University Press
2019. Mathematische Semesterberichte. 2021;68:171–173. doi:10.1007/s00591-021-00295-7'
apa: 'Hilgert, J. (2021). Philip Ording: 99 Variations on a Proof. Princeton University
Press 2019. In Mathematische Semesterberichte (Vol. 68, pp. 171–173). https://doi.org/10.1007/s00591-021-00295-7'
bibtex: '@article{Hilgert_2021, title={Philip Ording: 99 Variations on a Proof.
Princeton University Press 2019}, volume={68}, DOI={10.1007/s00591-021-00295-7},
journal={Mathematische Semesterberichte}, author={Hilgert, Joachim}, year={2021},
pages={171–173} }'
chicago: 'Hilgert, Joachim. “Philip Ording: 99 Variations on a Proof. Princeton
University Press 2019.” Mathematische Semesterberichte, 2021. https://doi.org/10.1007/s00591-021-00295-7.'
ieee: 'J. Hilgert, “Philip Ording: 99 Variations on a Proof. Princeton University
Press 2019,” Mathematische Semesterberichte, vol. 68. pp. 171–173, 2021,
doi: 10.1007/s00591-021-00295-7.'
mla: 'Hilgert, Joachim. “Philip Ording: 99 Variations on a Proof. Princeton University
Press 2019.” Mathematische Semesterberichte, vol. 68, 2021, pp. 171–173,
doi:10.1007/s00591-021-00295-7.'
short: J. Hilgert, Mathematische Semesterberichte 68 (2021) 171–173.
date_created: 2024-02-20T09:52:08Z
date_updated: 2024-02-20T10:03:43Z
department:
- _id: '91'
doi: 10.1007/s00591-021-00295-7
intvolume: ' 68'
language:
- iso: eng
page: 171–173
publication: Mathematische Semesterberichte
publication_status: published
status: public
title: 'Philip Ording: 99 Variations on a Proof. Princeton University Press 2019'
type: review
user_id: '49063'
volume: 68
year: '2021'
...
---
_id: '51555'
author:
- first_name: Joachim
full_name: Hilgert, Joachim
id: '220'
last_name: Hilgert
citation:
ama: 'Hilgert J. Georg Glaeser (Hrsg.): 77-mal Mathematik für zwischendurch – Unterhaltsame
Kuriositäten und unorthodoxe Anwendungen. Springer Spektrum 2020. Mathematische
Semesterberichte. 2021;68:175–177. doi:10.1007/s00591-021-00296-6'
apa: 'Hilgert, J. (2021). Georg Glaeser (Hrsg.): 77-mal Mathematik für zwischendurch
– Unterhaltsame Kuriositäten und unorthodoxe Anwendungen. Springer Spektrum 2020.
In Mathematische Semesterberichte (Vol. 68, pp. 175–177). https://doi.org/10.1007/s00591-021-00296-6'
bibtex: '@article{Hilgert_2021, title={Georg Glaeser (Hrsg.): 77-mal Mathematik
für zwischendurch – Unterhaltsame Kuriositäten und unorthodoxe Anwendungen. Springer
Spektrum 2020}, volume={68}, DOI={10.1007/s00591-021-00296-6},
journal={Mathematische Semesterberichte}, author={Hilgert, Joachim}, year={2021},
pages={175–177} }'
chicago: 'Hilgert, Joachim. “Georg Glaeser (Hrsg.): 77-mal Mathematik für zwischendurch
– Unterhaltsame Kuriositäten und unorthodoxe Anwendungen. Springer Spektrum 2020.”
Mathematische Semesterberichte, 2021. https://doi.org/10.1007/s00591-021-00296-6.'
ieee: 'J. Hilgert, “Georg Glaeser (Hrsg.): 77-mal Mathematik für zwischendurch –
Unterhaltsame Kuriositäten und unorthodoxe Anwendungen. Springer Spektrum 2020,”
Mathematische Semesterberichte, vol. 68. pp. 175–177, 2021, doi: 10.1007/s00591-021-00296-6.'
mla: 'Hilgert, Joachim. “Georg Glaeser (Hrsg.): 77-mal Mathematik für zwischendurch
– Unterhaltsame Kuriositäten und unorthodoxe Anwendungen. Springer Spektrum 2020.”
Mathematische Semesterberichte, vol. 68, 2021, pp. 175–177, doi:10.1007/s00591-021-00296-6.'
short: J. Hilgert, Mathematische Semesterberichte 68 (2021) 175–177.
date_created: 2024-02-20T09:50:31Z
date_updated: 2024-02-20T10:14:56Z
department:
- _id: '91'
doi: 10.1007/s00591-021-00296-6
intvolume: ' 68'
language:
- iso: ger
page: 175–177
publication: Mathematische Semesterberichte
publication_status: published
status: public
title: 'Georg Glaeser (Hrsg.): 77-mal Mathematik für zwischendurch – Unterhaltsame
Kuriositäten und unorthodoxe Anwendungen. Springer Spektrum 2020'
type: review
user_id: '49063'
volume: 68
year: '2021'
...
---
_id: '52927'
author:
- first_name: Oliver Fernández
full_name: Gil, Oliver Fernández
last_name: Gil
- first_name: Anni-Yasmin
full_name: Turhan, Anni-Yasmin
id: '104470'
last_name: Turhan
citation:
ama: 'Gil OF, Turhan A-Y. Answering Regular Path Queries Under Approximate Semantics
in Lightweight Description Logics. In: Thirty-Fifth AAAI Conference on Artificial
Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of
Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances
in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021.
AAAI Press; 2021:6340–6348. doi:10.1609/AAAI.V35I7.16787'
apa: Gil, O. F., & Turhan, A.-Y. (2021). Answering Regular Path Queries Under
Approximate Semantics in Lightweight Description Logics. Thirty-Fifth AAAI
Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative
Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on
Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February
2-9, 2021, 6340–6348. https://doi.org/10.1609/AAAI.V35I7.16787
bibtex: '@inproceedings{Gil_Turhan_2021, title={Answering Regular Path Queries Under
Approximate Semantics in Lightweight Description Logics}, DOI={10.1609/AAAI.V35I7.16787},
booktitle={Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021,
Thirty-Third Conference on Innovative Applications of Artificial Intelligence,
IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence,
EAAI 2021, Virtual Event, February 2-9, 2021}, publisher={AAAI Press}, author={Gil,
Oliver Fernández and Turhan, Anni-Yasmin}, year={2021}, pages={6340–6348} }'
chicago: Gil, Oliver Fernández, and Anni-Yasmin Turhan. “Answering Regular Path
Queries Under Approximate Semantics in Lightweight Description Logics.” In Thirty-Fifth
AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference
on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh
Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual
Event, February 2-9, 2021, 6340–6348. AAAI Press, 2021. https://doi.org/10.1609/AAAI.V35I7.16787.
ieee: 'O. F. Gil and A.-Y. Turhan, “Answering Regular Path Queries Under Approximate
Semantics in Lightweight Description Logics,” in Thirty-Fifth AAAI Conference
on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications
of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances
in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021,
2021, pp. 6340–6348, doi: 10.1609/AAAI.V35I7.16787.'
mla: Gil, Oliver Fernández, and Anni-Yasmin Turhan. “Answering Regular Path Queries
Under Approximate Semantics in Lightweight Description Logics.” Thirty-Fifth
AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference
on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh
Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual
Event, February 2-9, 2021, AAAI Press, 2021, pp. 6340–6348, doi:10.1609/AAAI.V35I7.16787.
short: 'O.F. Gil, A.-Y. Turhan, in: Thirty-Fifth AAAI Conference on Artificial Intelligence,
AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence,
IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence,
EAAI 2021, Virtual Event, February 2-9, 2021, AAAI Press, 2021, pp. 6340–6348.'
date_created: 2024-03-26T10:55:06Z
date_updated: 2024-03-26T10:56:06Z
department:
- _id: '888'
doi: 10.1609/AAAI.V35I7.16787
language:
- iso: eng
page: 6340–6348
publication: Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third
Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The
Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021,
Virtual Event, February 2-9, 2021
publisher: AAAI Press
status: public
title: Answering Regular Path Queries Under Approximate Semantics in Lightweight Description
Logics
type: conference
user_id: '9503'
year: '2021'
...
---
_id: '52926'
author:
- first_name: Clemens
full_name: Dubslaff, Clemens
last_name: Dubslaff
- first_name: Patrick
full_name: Koopmann, Patrick
last_name: Koopmann
- first_name: Anni-Yasmin
full_name: Turhan, Anni-Yasmin
id: '104470'
last_name: Turhan
citation:
ama: Dubslaff C, Koopmann P, Turhan A-Y. Enhancing Probabilistic Model Checking
with Ontologies. Formal Aspects Comput. 2021;33(6):885–921. doi:10.1007/S00165-021-00549-0
apa: Dubslaff, C., Koopmann, P., & Turhan, A.-Y. (2021). Enhancing Probabilistic
Model Checking with Ontologies. Formal Aspects Comput., 33(6), 885–921.
https://doi.org/10.1007/S00165-021-00549-0
bibtex: '@article{Dubslaff_Koopmann_Turhan_2021, title={Enhancing Probabilistic
Model Checking with Ontologies}, volume={33}, DOI={10.1007/S00165-021-00549-0},
number={6}, journal={Formal Aspects Comput.}, author={Dubslaff, Clemens and Koopmann,
Patrick and Turhan, Anni-Yasmin}, year={2021}, pages={885–921} }'
chicago: 'Dubslaff, Clemens, Patrick Koopmann, and Anni-Yasmin Turhan. “Enhancing
Probabilistic Model Checking with Ontologies.” Formal Aspects Comput. 33,
no. 6 (2021): 885–921. https://doi.org/10.1007/S00165-021-00549-0.'
ieee: 'C. Dubslaff, P. Koopmann, and A.-Y. Turhan, “Enhancing Probabilistic Model
Checking with Ontologies,” Formal Aspects Comput., vol. 33, no. 6, pp.
885–921, 2021, doi: 10.1007/S00165-021-00549-0.'
mla: Dubslaff, Clemens, et al. “Enhancing Probabilistic Model Checking with Ontologies.”
Formal Aspects Comput., vol. 33, no. 6, 2021, pp. 885–921, doi:10.1007/S00165-021-00549-0.
short: C. Dubslaff, P. Koopmann, A.-Y. Turhan, Formal Aspects Comput. 33 (2021)
885–921.
date_created: 2024-03-26T10:54:48Z
date_updated: 2024-03-26T10:56:09Z
department:
- _id: '888'
doi: 10.1007/S00165-021-00549-0
intvolume: ' 33'
issue: '6'
language:
- iso: eng
page: 885–921
publication: Formal Aspects Comput.
status: public
title: Enhancing Probabilistic Model Checking with Ontologies
type: journal_article
user_id: '9503'
volume: 33
year: '2021'
...
---
_id: '52849'
author:
- first_name: Susanne
full_name: Podworny, Susanne
last_name: Podworny
- first_name: Yannik
full_name: Fleischer, Yannik
last_name: Fleischer
- first_name: Sven
full_name: Hüsing, Sven
last_name: Hüsing
- first_name: Rolf
full_name: Biehler, Rolf
last_name: Biehler
- first_name: Daniel
full_name: Frischemeier, Daniel
last_name: Frischemeier
- first_name: Lukas
full_name: Höper, Lukas
last_name: Höper
- first_name: Carsten
full_name: Schulte, Carsten
last_name: Schulte
citation:
ama: 'Podworny S, Fleischer Y, Hüsing S, et al. Using data cards for teaching data
based decision trees in middle school. In: Proceedings of the 21st Koli Calling
International Conference on Computing Education Research. ACM; 2021. doi:10.1145/3488042.3489966'
apa: Podworny, S., Fleischer, Y., Hüsing, S., Biehler, R., Frischemeier, D., Höper,
L., & Schulte, C. (2021). Using data cards for teaching data based decision
trees in middle school. Proceedings of the 21st Koli Calling International
Conference on Computing Education Research. https://doi.org/10.1145/3488042.3489966
bibtex: '@inproceedings{Podworny_Fleischer_Hüsing_Biehler_Frischemeier_Höper_Schulte_2021,
title={Using data cards for teaching data based decision trees in middle school},
DOI={10.1145/3488042.3489966},
booktitle={Proceedings of the 21st Koli Calling International Conference on Computing
Education Research}, publisher={ACM}, author={Podworny, Susanne and Fleischer,
Yannik and Hüsing, Sven and Biehler, Rolf and Frischemeier, Daniel and Höper,
Lukas and Schulte, Carsten}, year={2021} }'
chicago: Podworny, Susanne, Yannik Fleischer, Sven Hüsing, Rolf Biehler, Daniel
Frischemeier, Lukas Höper, and Carsten Schulte. “Using Data Cards for Teaching
Data Based Decision Trees in Middle School.” In Proceedings of the 21st Koli
Calling International Conference on Computing Education Research. ACM, 2021.
https://doi.org/10.1145/3488042.3489966.
ieee: 'S. Podworny et al., “Using data cards for teaching data based decision
trees in middle school,” 2021, doi: 10.1145/3488042.3489966.'
mla: Podworny, Susanne, et al. “Using Data Cards for Teaching Data Based Decision
Trees in Middle School.” Proceedings of the 21st Koli Calling International
Conference on Computing Education Research, ACM, 2021, doi:10.1145/3488042.3489966.
short: 'S. Podworny, Y. Fleischer, S. Hüsing, R. Biehler, D. Frischemeier, L. Höper,
C. Schulte, in: Proceedings of the 21st Koli Calling International Conference
on Computing Education Research, ACM, 2021.'
date_created: 2024-03-25T12:16:47Z
date_updated: 2024-03-28T08:39:16Z
department:
- _id: '34'
doi: 10.1145/3488042.3489966
language:
- iso: eng
publication: Proceedings of the 21st Koli Calling International Conference on Computing
Education Research
publication_status: published
publisher: ACM
status: public
title: Using data cards for teaching data based decision trees in middle school
type: conference
user_id: '42660'
year: '2021'
...
---
_id: '22285'
author:
- first_name: Kai
full_name: Biermeier, Kai
id: '55908'
last_name: Biermeier
orcid: 0000-0002-2879-2359
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
- first_name: Nils
full_name: Weidmann, Nils
id: '53103'
last_name: Weidmann
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Biermeier K, Yigitbas E, Weidmann N, Engels G. Ensuring User Interface Adaptation
Consistency through Triple Graph Grammers. In: Proceedings of the International
Workshop on Human-Centered Software Engineering for Changing Contexts of Use .
; 2021.'
apa: Biermeier, K., Yigitbas, E., Weidmann, N., & Engels, G. (2021). Ensuring
User Interface Adaptation Consistency through Triple Graph Grammers. Proceedings
of the International Workshop on Human-Centered Software Engineering for Changing
Contexts of Use .
bibtex: '@inproceedings{Biermeier_Yigitbas_Weidmann_Engels_2021, title={Ensuring
User Interface Adaptation Consistency through Triple Graph Grammers}, booktitle={Proceedings
of the International Workshop on Human-Centered Software Engineering for Changing
Contexts of Use }, author={Biermeier, Kai and Yigitbas, Enes and Weidmann, Nils
and Engels, Gregor}, year={2021} }'
chicago: Biermeier, Kai, Enes Yigitbas, Nils Weidmann, and Gregor Engels. “Ensuring
User Interface Adaptation Consistency through Triple Graph Grammers.” In Proceedings
of the International Workshop on Human-Centered Software Engineering for Changing
Contexts of Use , 2021.
ieee: K. Biermeier, E. Yigitbas, N. Weidmann, and G. Engels, “Ensuring User Interface
Adaptation Consistency through Triple Graph Grammers,” 2021.
mla: Biermeier, Kai, et al. “Ensuring User Interface Adaptation Consistency through
Triple Graph Grammers.” Proceedings of the International Workshop on Human-Centered
Software Engineering for Changing Contexts of Use , 2021.
short: 'K. Biermeier, E. Yigitbas, N. Weidmann, G. Engels, in: Proceedings of the
International Workshop on Human-Centered Software Engineering for Changing Contexts
of Use , 2021.'
date_created: 2021-06-07T07:32:40Z
date_updated: 2024-04-02T09:39:05Z
department:
- _id: '66'
- _id: '534'
language:
- iso: eng
publication: 'Proceedings of the International Workshop on Human-Centered Software
Engineering for Changing Contexts of Use '
status: public
title: Ensuring User Interface Adaptation Consistency through Triple Graph Grammers
type: conference
user_id: '8447'
year: '2021'
...
---
_id: '45967'
author:
- first_name: Tim
full_name: Binz, Tim
last_name: Binz
- first_name: Balázs
full_name: Kovács, Balázs
id: '100441'
last_name: Kovács
orcid: 0000-0001-9872-3474
citation:
ama: Binz T, Kovács B. A convergent finite element algorithm for mean curvature
flow in higher codimension. arXiv. Published online 2021.
apa: Binz, T., & Kovács, B. (2021). A convergent finite element algorithm for
mean curvature flow in higher codimension. ArXiv.
bibtex: '@article{Binz_Kovács_2021, title={A convergent finite element algorithm
for mean curvature flow in higher codimension}, journal={arXiv}, author={Binz,
Tim and Kovács, Balázs}, year={2021} }'
chicago: Binz, Tim, and Balázs Kovács. “A Convergent Finite Element Algorithm for
Mean Curvature Flow in Higher Codimension.” ArXiv, 2021.
ieee: T. Binz and B. Kovács, “A convergent finite element algorithm for mean curvature
flow in higher codimension,” arXiv, 2021.
mla: Binz, Tim, and Balázs Kovács. “A Convergent Finite Element Algorithm for Mean
Curvature Flow in Higher Codimension.” ArXiv, 2021.
short: T. Binz, B. Kovács, ArXiv (2021).
date_created: 2023-07-10T11:46:16Z
date_updated: 2024-04-03T09:16:19Z
department:
- _id: '841'
language:
- iso: eng
publication: arXiv
status: public
title: A convergent finite element algorithm for mean curvature flow in higher codimension
type: journal_article
user_id: '100441'
year: '2021'
...
---
_id: '45962'
abstract:
- lang: eng
text: "Abstract\r\n An algorithm
is proposed for generalized mean curvature flow of closed two-dimensional surfaces,
which include inverse mean curvature flow and powers of mean and inverse mean
curvature flow. Error estimates are proved for semidiscretizations and full discretizations
for the generalized flow. The algorithm proposed and studied here combines evolving
surface finite elements, whose nodes determine the discrete surface, and linearly
implicit backward difference formulae for time integration. The numerical method
is based on a system coupling the surface evolution to nonlinear second-order
parabolic evolution equations for the normal velocity and normal vector. A convergence
proof is presented in the case of finite elements of polynomial degree at least
2 and backward difference formulae of orders 2 to 5. The error analysis combines
stability estimates and consistency estimates to yield optimal-order $H^1$-norm
error bounds for the computed surface position, velocity, normal vector, normal
velocity and therefore for the mean curvature. The stability analysis is performed
in the matrix–vector formulation and is independent of geometric arguments, which
only enter the consistency analysis. Numerical experiments are presented to illustrate
the convergence results and also to report on monotone quantities, e.g. Hawking
mass for inverse mean curvature flow, and complemented by experiments for nonconvex
surfaces."
author:
- first_name: Tim
full_name: Binz, Tim
last_name: Binz
- first_name: Balázs
full_name: Kovács, Balázs
id: '100441'
last_name: Kovács
orcid: 0000-0001-9872-3474
citation:
ama: Binz T, Kovács B. A convergent finite element algorithm for generalized mean
curvature flows of closed surfaces. IMA Journal of Numerical Analysis.
2021;42(3):2545-2588. doi:10.1093/imanum/drab043
apa: Binz, T., & Kovács, B. (2021). A convergent finite element algorithm for
generalized mean curvature flows of closed surfaces. IMA Journal of Numerical
Analysis, 42(3), 2545–2588. https://doi.org/10.1093/imanum/drab043
bibtex: '@article{Binz_Kovács_2021, title={A convergent finite element algorithm
for generalized mean curvature flows of closed surfaces}, volume={42}, DOI={10.1093/imanum/drab043}, number={3},
journal={IMA Journal of Numerical Analysis}, publisher={Oxford University Press
(OUP)}, author={Binz, Tim and Kovács, Balázs}, year={2021}, pages={2545–2588}
}'
chicago: 'Binz, Tim, and Balázs Kovács. “A Convergent Finite Element Algorithm for
Generalized Mean Curvature Flows of Closed Surfaces.” IMA Journal of Numerical
Analysis 42, no. 3 (2021): 2545–88. https://doi.org/10.1093/imanum/drab043.'
ieee: 'T. Binz and B. Kovács, “A convergent finite element algorithm for generalized
mean curvature flows of closed surfaces,” IMA Journal of Numerical Analysis,
vol. 42, no. 3, pp. 2545–2588, 2021, doi: 10.1093/imanum/drab043.'
mla: Binz, Tim, and Balázs Kovács. “A Convergent Finite Element Algorithm for Generalized
Mean Curvature Flows of Closed Surfaces.” IMA Journal of Numerical Analysis,
vol. 42, no. 3, Oxford University Press (OUP), 2021, pp. 2545–88, doi:10.1093/imanum/drab043.
short: T. Binz, B. Kovács, IMA Journal of Numerical Analysis 42 (2021) 2545–2588.
date_created: 2023-07-10T11:44:41Z
date_updated: 2024-04-03T09:18:40Z
department:
- _id: '841'
doi: 10.1093/imanum/drab043
intvolume: ' 42'
issue: '3'
keyword:
- Applied Mathematics
- Computational Mathematics
- General Mathematics
language:
- iso: eng
page: 2545-2588
publication: IMA Journal of Numerical Analysis
publication_identifier:
issn:
- 0272-4979
- 1464-3642
publication_status: published
publisher: Oxford University Press (OUP)
status: public
title: A convergent finite element algorithm for generalized mean curvature flows
of closed surfaces
type: journal_article
user_id: '100441'
volume: 42
year: '2021'
...
---
_id: '45957'
abstract:
- lang: eng
text: AbstractA proof of convergence is given for
a bulk–surface finite element semidiscretisation of the Cahn–Hilliard equation
with Cahn–Hilliard-type dynamic boundary conditions in a smooth domain. The semidiscretisation
is studied in an abstract weak formulation as a second-order system. Optimal-order
uniform-in-time error estimates are shown in the $L^2$- and $H^1$-norms. The error
estimates are based on a consistency and stability analysis. The proof of stability
is performed in an abstract framework, based on energy estimates exploiting the
anti-symmetric structure of the second-order system. Numerical experiments illustrate
the theoretical results.
author:
- first_name: Paula
full_name: Harder, Paula
last_name: Harder
- first_name: Balázs
full_name: Kovács, Balázs
id: '100441'
last_name: Kovács
orcid: 0000-0001-9872-3474
citation:
ama: Harder P, Kovács B. Error estimates for the Cahn–Hilliard equation with dynamic
boundary conditions. IMA Journal of Numerical Analysis. 2021;42(3):2589-2620.
doi:10.1093/imanum/drab045
apa: Harder, P., & Kovács, B. (2021). Error estimates for the Cahn–Hilliard
equation with dynamic boundary conditions. IMA Journal of Numerical Analysis,
42(3), 2589–2620. https://doi.org/10.1093/imanum/drab045
bibtex: '@article{Harder_Kovács_2021, title={Error estimates for the Cahn–Hilliard
equation with dynamic boundary conditions}, volume={42}, DOI={10.1093/imanum/drab045},
number={3}, journal={IMA Journal of Numerical Analysis}, publisher={Oxford University
Press (OUP)}, author={Harder, Paula and Kovács, Balázs}, year={2021}, pages={2589–2620}
}'
chicago: 'Harder, Paula, and Balázs Kovács. “Error Estimates for the Cahn–Hilliard
Equation with Dynamic Boundary Conditions.” IMA Journal of Numerical Analysis
42, no. 3 (2021): 2589–2620. https://doi.org/10.1093/imanum/drab045.'
ieee: 'P. Harder and B. Kovács, “Error estimates for the Cahn–Hilliard equation
with dynamic boundary conditions,” IMA Journal of Numerical Analysis, vol.
42, no. 3, pp. 2589–2620, 2021, doi: 10.1093/imanum/drab045.'
mla: Harder, Paula, and Balázs Kovács. “Error Estimates for the Cahn–Hilliard Equation
with Dynamic Boundary Conditions.” IMA Journal of Numerical Analysis, vol.
42, no. 3, Oxford University Press (OUP), 2021, pp. 2589–620, doi:10.1093/imanum/drab045.
short: P. Harder, B. Kovács, IMA Journal of Numerical Analysis 42 (2021) 2589–2620.
date_created: 2023-07-10T11:43:28Z
date_updated: 2024-04-03T09:20:15Z
department:
- _id: '841'
doi: 10.1093/imanum/drab045
intvolume: ' 42'
issue: '3'
keyword:
- Applied Mathematics
- Computational Mathematics
- General Mathematics
language:
- iso: eng
page: 2589-2620
publication: IMA Journal of Numerical Analysis
publication_identifier:
issn:
- 0272-4979
- 1464-3642
publication_status: published
publisher: Oxford University Press (OUP)
status: public
title: Error estimates for the Cahn–Hilliard equation with dynamic boundary conditions
type: journal_article
user_id: '100441'
volume: 42
year: '2021'
...
---
_id: '45961'
author:
- first_name: Jörg
full_name: Nick, Jörg
last_name: Nick
- first_name: Balázs
full_name: Kovács, Balázs
id: '100441'
last_name: Kovács
orcid: 0000-0001-9872-3474
- first_name: Christian
full_name: Lubich, Christian
last_name: Lubich
citation:
ama: 'Nick J, Kovács B, Lubich C. Correction to: Stable and convergent fully discrete
interior–exterior coupling of Maxwell’s equations. Numerische Mathematik.
2021;147(4):997-1000. doi:10.1007/s00211-021-01196-6'
apa: 'Nick, J., Kovács, B., & Lubich, C. (2021). Correction to: Stable and convergent
fully discrete interior–exterior coupling of Maxwell’s equations. Numerische
Mathematik, 147(4), 997–1000. https://doi.org/10.1007/s00211-021-01196-6'
bibtex: '@article{Nick_Kovács_Lubich_2021, title={Correction to: Stable and convergent
fully discrete interior–exterior coupling of Maxwell’s equations}, volume={147},
DOI={10.1007/s00211-021-01196-6},
number={4}, journal={Numerische Mathematik}, publisher={Springer Science and Business
Media LLC}, author={Nick, Jörg and Kovács, Balázs and Lubich, Christian}, year={2021},
pages={997–1000} }'
chicago: 'Nick, Jörg, Balázs Kovács, and Christian Lubich. “Correction to: Stable
and Convergent Fully Discrete Interior–Exterior Coupling of Maxwell’s Equations.”
Numerische Mathematik 147, no. 4 (2021): 997–1000. https://doi.org/10.1007/s00211-021-01196-6.'
ieee: 'J. Nick, B. Kovács, and C. Lubich, “Correction to: Stable and convergent
fully discrete interior–exterior coupling of Maxwell’s equations,” Numerische
Mathematik, vol. 147, no. 4, pp. 997–1000, 2021, doi: 10.1007/s00211-021-01196-6.'
mla: 'Nick, Jörg, et al. “Correction to: Stable and Convergent Fully Discrete Interior–Exterior
Coupling of Maxwell’s Equations.” Numerische Mathematik, vol. 147, no.
4, Springer Science and Business Media LLC, 2021, pp. 997–1000, doi:10.1007/s00211-021-01196-6.'
short: J. Nick, B. Kovács, C. Lubich, Numerische Mathematik 147 (2021) 997–1000.
date_created: 2023-07-10T11:44:25Z
date_updated: 2024-04-03T09:18:52Z
department:
- _id: '841'
doi: 10.1007/s00211-021-01196-6
intvolume: ' 147'
issue: '4'
keyword:
- Applied Mathematics
- Computational Mathematics
language:
- iso: eng
page: 997-1000
publication: Numerische Mathematik
publication_identifier:
issn:
- 0029-599X
- 0945-3245
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: 'Correction to: Stable and convergent fully discrete interior–exterior coupling
of Maxwell’s equations'
type: journal_article
user_id: '100441'
volume: 147
year: '2021'
...
---
_id: '45959'
author:
- first_name: Balázs
full_name: Kovács, Balázs
last_name: Kovács
- first_name: Buyang
full_name: Li, Buyang
last_name: Li
- first_name: Christian
full_name: Lubich, Christian
last_name: Lubich
citation:
ama: Kovács B, Li B, Lubich C. A convergent evolving finite element algorithm for
Willmore flow of closed surfaces. Numerische Mathematik. 2021;149(3):595-643.
doi:10.1007/s00211-021-01238-z
apa: Kovács, B., Li, B., & Lubich, C. (2021). A convergent evolving finite element
algorithm for Willmore flow of closed surfaces. Numerische Mathematik,
149(3), 595–643. https://doi.org/10.1007/s00211-021-01238-z
bibtex: '@article{Kovács_Li_Lubich_2021, title={A convergent evolving finite element
algorithm for Willmore flow of closed surfaces}, volume={149}, DOI={10.1007/s00211-021-01238-z},
number={3}, journal={Numerische Mathematik}, publisher={Springer Science and Business
Media LLC}, author={Kovács, Balázs and Li, Buyang and Lubich, Christian}, year={2021},
pages={595–643} }'
chicago: 'Kovács, Balázs, Buyang Li, and Christian Lubich. “A Convergent Evolving
Finite Element Algorithm for Willmore Flow of Closed Surfaces.” Numerische
Mathematik 149, no. 3 (2021): 595–643. https://doi.org/10.1007/s00211-021-01238-z.'
ieee: 'B. Kovács, B. Li, and C. Lubich, “A convergent evolving finite element algorithm
for Willmore flow of closed surfaces,” Numerische Mathematik, vol. 149,
no. 3, pp. 595–643, 2021, doi: 10.1007/s00211-021-01238-z.'
mla: Kovács, Balázs, et al. “A Convergent Evolving Finite Element Algorithm for
Willmore Flow of Closed Surfaces.” Numerische Mathematik, vol. 149, no.
3, Springer Science and Business Media LLC, 2021, pp. 595–643, doi:10.1007/s00211-021-01238-z.
short: B. Kovács, B. Li, C. Lubich, Numerische Mathematik 149 (2021) 595–643.
date_created: 2023-07-10T11:43:59Z
date_updated: 2024-04-03T09:19:20Z
department:
- _id: '841'
doi: 10.1007/s00211-021-01238-z
intvolume: ' 149'
issue: '3'
keyword:
- Applied Mathematics
- Computational Mathematics
language:
- iso: eng
page: 595-643
publication: Numerische Mathematik
publication_identifier:
issn:
- 0029-599X
- 0945-3245
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: A convergent evolving finite element algorithm for Willmore flow of closed
surfaces
type: journal_article
user_id: '100441'
volume: 149
year: '2021'
...
---
_id: '34629'
article_number: '113061'
author:
- first_name: Kerstin
full_name: Hesse, Kerstin
id: '42608'
last_name: Hesse
orcid: 0000-0003-4125-1941
- first_name: Ian H.
full_name: Sloan, Ian H.
last_name: Sloan
- first_name: Robert S.
full_name: Womersley, Robert S.
last_name: Womersley
citation:
ama: Hesse K, Sloan IH, Womersley RS. Local RBF-based penalized least-squares approximation
on the sphere with noisy scattered data. Journal of Computational and Applied
Mathematics. 2021;382. doi:10.1016/j.cam.2020.113061
apa: Hesse, K., Sloan, I. H., & Womersley, R. S. (2021). Local RBF-based penalized
least-squares approximation on the sphere with noisy scattered data. Journal
of Computational and Applied Mathematics, 382, Article 113061. https://doi.org/10.1016/j.cam.2020.113061
bibtex: '@article{Hesse_Sloan_Womersley_2021, title={Local RBF-based penalized least-squares
approximation on the sphere with noisy scattered data}, volume={382}, DOI={10.1016/j.cam.2020.113061},
number={113061}, journal={Journal of Computational and Applied Mathematics}, publisher={Elsevier
BV}, author={Hesse, Kerstin and Sloan, Ian H. and Womersley, Robert S.}, year={2021}
}'
chicago: Hesse, Kerstin, Ian H. Sloan, and Robert S. Womersley. “Local RBF-Based
Penalized Least-Squares Approximation on the Sphere with Noisy Scattered Data.”
Journal of Computational and Applied Mathematics 382 (2021). https://doi.org/10.1016/j.cam.2020.113061.
ieee: 'K. Hesse, I. H. Sloan, and R. S. Womersley, “Local RBF-based penalized least-squares
approximation on the sphere with noisy scattered data,” Journal of Computational
and Applied Mathematics, vol. 382, Art. no. 113061, 2021, doi: 10.1016/j.cam.2020.113061.'
mla: Hesse, Kerstin, et al. “Local RBF-Based Penalized Least-Squares Approximation
on the Sphere with Noisy Scattered Data.” Journal of Computational and Applied
Mathematics, vol. 382, 113061, Elsevier BV, 2021, doi:10.1016/j.cam.2020.113061.
short: K. Hesse, I.H. Sloan, R.S. Womersley, Journal of Computational and Applied
Mathematics 382 (2021).
date_created: 2022-12-20T17:26:44Z
date_updated: 2024-04-03T11:04:23Z
department:
- _id: '10'
doi: 10.1016/j.cam.2020.113061
intvolume: ' 382'
keyword:
- Applied Mathematics
- Computational Mathematics
language:
- iso: eng
publication: Journal of Computational and Applied Mathematics
publication_identifier:
issn:
- 0377-0427
publication_status: published
publisher: Elsevier BV
status: public
title: Local RBF-based penalized least-squares approximation on the sphere with noisy
scattered data
type: journal_article
user_id: '49063'
volume: 382
year: '2021'
...