---
_id: '63754'
abstract:
- lang: eng
text: Data spaces are receiving an emerging interest in Information Systems Research
and industry practice. They are central to many European research initiatives
and shape the data economy in Industry 4.0. Generally, they aim to create secure
environments for cross-organizational data management and sharing. Currently,
there is considerable interest in developing new data spaces in Industry 4.0,
also accelerated through regulatory changes. However, key questions about what
precisely characterizes a data space in Industry 4.0 remain unresolved. Against
this backdrop, we build a taxonomy of data spaces in the Industry 4.0 context.
We identified nine distinctive dimensions and 40 corresponding characteristics
among the 19 data spaces analyzed. The taxonomy enables clearer classification
and nomenclature of data spaces in this context. This short paper will ignite
planned further research on data spaces in Industry 4.0 and contribute to a conceptualization
of a taxonomic theory for interested researchers.
author:
- first_name: Oliver
full_name: Werth, Oliver
last_name: Werth
- first_name: Christian
full_name: Koldewey, Christian
id: '43136'
last_name: Koldewey
orcid: https://orcid.org/0000-0001-7992-6399
- first_name: Mathias
full_name: Uslar, Mathias
last_name: Uslar
- first_name: Julian
full_name: Zerbin, Julian
id: '51711'
last_name: Zerbin
citation:
ama: 'Werth O, Koldewey C, Uslar M, Zerbin J. What Characterizes Data Spaces in
Industry 4.0? Towards a Better Understanding. In: Lecture Notes in Business
Information Processing. Springer Nature Switzerland; 2026. doi:10.1007/978-3-032-14518-5_3'
apa: Werth, O., Koldewey, C., Uslar, M., & Zerbin, J. (2026). What Characterizes
Data Spaces in Industry 4.0? Towards a Better Understanding. Lecture Notes
in Business Information Processing. 16th International Conference on Software
Business (ICSOB 2025), Stuttgart, Germany. https://doi.org/10.1007/978-3-032-14518-5_3
bibtex: '@inproceedings{Werth_Koldewey_Uslar_Zerbin_2026, place={Cham}, title={What
Characterizes Data Spaces in Industry 4.0? Towards a Better Understanding}, DOI={10.1007/978-3-032-14518-5_3},
booktitle={Lecture Notes in Business Information Processing}, publisher={Springer
Nature Switzerland}, author={Werth, Oliver and Koldewey, Christian and Uslar,
Mathias and Zerbin, Julian}, year={2026} }'
chicago: 'Werth, Oliver, Christian Koldewey, Mathias Uslar, and Julian Zerbin. “What
Characterizes Data Spaces in Industry 4.0? Towards a Better Understanding.” In
Lecture Notes in Business Information Processing. Cham: Springer Nature
Switzerland, 2026. https://doi.org/10.1007/978-3-032-14518-5_3.'
ieee: 'O. Werth, C. Koldewey, M. Uslar, and J. Zerbin, “What Characterizes Data
Spaces in Industry 4.0? Towards a Better Understanding,” presented at the 16th
International Conference on Software Business (ICSOB 2025), Stuttgart, Germany,
2026, doi: 10.1007/978-3-032-14518-5_3.'
mla: Werth, Oliver, et al. “What Characterizes Data Spaces in Industry 4.0? Towards
a Better Understanding.” Lecture Notes in Business Information Processing,
Springer Nature Switzerland, 2026, doi:10.1007/978-3-032-14518-5_3.
short: 'O. Werth, C. Koldewey, M. Uslar, J. Zerbin, in: Lecture Notes in Business
Information Processing, Springer Nature Switzerland, Cham, 2026.'
conference:
end_date: 2025-11-26
location: Stuttgart, Germany
name: 16th International Conference on Software Business (ICSOB 2025)
start_date: 2025-11-24
date_created: 2026-01-27T11:56:10Z
date_updated: 2026-03-18T07:12:49Z
department:
- _id: '563'
doi: 10.1007/978-3-032-14518-5_3
keyword:
- Industry 4.0
- Taxonomy
- Data spaces
- Characterization
language:
- iso: eng
place: Cham
publication: Lecture Notes in Business Information Processing
publication_identifier:
isbn:
- '9783032145178'
- '9783032145185'
issn:
- 1865-1348
- 1865-1356
publication_status: published
publisher: Springer Nature Switzerland
quality_controlled: '1'
status: public
title: What Characterizes Data Spaces in Industry 4.0? Towards a Better Understanding
type: conference
user_id: '51711'
year: '2026'
...
---
_id: '65101'
abstract:
- lang: eng
text: Various methods to measure the dynamic behavior of particles require the calculation
of autocorrelation functions. For this purpose, fast multi-tau correlators have
been developed in dedicated hardware, in software, and on FPGAs. However, for
methods such as X-ray Photon Correlation Spectroscopy (XPCS), which requires to
calculate the autocorrelation function independently for hundreds of thousands
to millions of pixels from high-resolution detectors, current approaches rely
on offline processing after data acquisition. Moreover, the internal pipeline
state of so many independent correlators is far too large to keep it on-chip.
In this work, we propose a design approach on FPGAs, where pipeline contexts are
stored in off-chip HBM memory. Each compute unit iteratively loads the state for
a single pixel, processes a short time series for this pixel, and afterwards writes
back the context in a dataflow pipeline. We have implemented the required compute
kernels with Vitis HLS and analyze resulting designs on an Alveo U280 card. The
design achieves the expected performance and for the first time provides sufficient
throughput for current high-end detectors used in XPCS.
author:
- first_name: Abdul Rehman
full_name: Tareen, Abdul Rehman
id: '76938'
last_name: Tareen
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
citation:
ama: 'Tareen AR, Plessl C, Kenter T. Fast Multi-Tau Correlators on FPGA with Context
Switching From and to High- Bandwidth Memory. In: 2025 International Conference
on Field Programmable Technology (ICFPT). IEEE; 2026. doi:10.1109/icfpt67023.2025.00027'
apa: Tareen, A. R., Plessl, C., & Kenter, T. (2026). Fast Multi-Tau Correlators
on FPGA with Context Switching From and to High- Bandwidth Memory. 2025 International
Conference on Field Programmable Technology (ICFPT). https://doi.org/10.1109/icfpt67023.2025.00027
bibtex: '@inproceedings{Tareen_Plessl_Kenter_2026, title={Fast Multi-Tau Correlators
on FPGA with Context Switching From and to High- Bandwidth Memory}, DOI={10.1109/icfpt67023.2025.00027},
booktitle={2025 International Conference on Field Programmable Technology (ICFPT)},
publisher={IEEE}, author={Tareen, Abdul Rehman and Plessl, Christian and Kenter,
Tobias}, year={2026} }'
chicago: Tareen, Abdul Rehman, Christian Plessl, and Tobias Kenter. “Fast Multi-Tau
Correlators on FPGA with Context Switching From and to High- Bandwidth Memory.”
In 2025 International Conference on Field Programmable Technology (ICFPT).
IEEE, 2026. https://doi.org/10.1109/icfpt67023.2025.00027.
ieee: 'A. R. Tareen, C. Plessl, and T. Kenter, “Fast Multi-Tau Correlators on FPGA
with Context Switching From and to High- Bandwidth Memory,” 2026, doi: 10.1109/icfpt67023.2025.00027.'
mla: Tareen, Abdul Rehman, et al. “Fast Multi-Tau Correlators on FPGA with Context
Switching From and to High- Bandwidth Memory.” 2025 International Conference
on Field Programmable Technology (ICFPT), IEEE, 2026, doi:10.1109/icfpt67023.2025.00027.
short: 'A.R. Tareen, C. Plessl, T. Kenter, in: 2025 International Conference on
Field Programmable Technology (ICFPT), IEEE, 2026.'
date_created: 2026-03-24T09:02:22Z
date_updated: 2026-03-24T09:04:31Z
department:
- _id: '27'
- _id: '518'
doi: 10.1109/icfpt67023.2025.00027
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: 2025 International Conference on Field Programmable Technology (ICFPT)
publication_status: published
publisher: IEEE
status: public
title: Fast Multi-Tau Correlators on FPGA with Context Switching From and to High-
Bandwidth Memory
type: conference
user_id: '3145'
year: '2026'
...
---
_id: '65178'
abstract:
- lang: eng
text: "Large intermediate results can cause join queries to run unexpectedly long.
This problem is particularly common for analytical queries, which aggregate data
over many tables to produce a comparatively small final output, and queries on
graph data, where intermediate results blow up quickly. Recent work inspired by
Yannakakis’ algorithm approaches this by modifying the query engine to avoid materializing
unnecessary tuples. However, this requires significant changes to the core of
the system, which is not feasible in many situations such as cloud environments
or proprietary systems.\r\nIn this work, we propose a flexible approach for optimizing
long-running join queries from the outside of the DBMS. Rewriting-based realizations
of Yannakakis’ algorithm suffer from inherent overhead due to the creation of
intermediate tables. Thus, we present an approach for detecting and targeting
queries which would benefit from a Yannakakis-style optimization. We introduce
a new benchmark combining 5 standard benchmarks and augmenting them with additional
instances, which provides a sufficient size and diversity for a machine learning
based solution. On PostgreSQL, DuckDB and SparkSQL, slowdowns on queries where
the rewriting is counterproductive are mostly avoided, as opposed to a naïve application
of the rewriting, and we observe significant improvements in end-to-end runtimes
over standard query execution and unconditional rewriting."
author:
- first_name: Daniela
full_name: Böhm, Daniela
last_name: Böhm
- first_name: Georg
full_name: Gottlob, Georg
last_name: Gottlob
- first_name: Matthias
full_name: Lanzinger, Matthias
last_name: Lanzinger
- first_name: Davide Mario
full_name: Longo, Davide Mario
last_name: Longo
- first_name: Cem
full_name: Okulmus, Cem
id: '114410'
last_name: Okulmus
orcid: 0000-0002-7742-0439
- first_name: Reinhard
full_name: Pichler, Reinhard
last_name: Pichler
- first_name: Alexander
full_name: Selzer, Alexander
last_name: Selzer
citation:
ama: 'Böhm D, Gottlob G, Lanzinger M, et al. Selective Use of Yannakakis’ Algorithm
for Consistent Performance Gains. In: Proceedings of the 28th International
Workshop on Design, Optimization, Languages and Analytical Processing of Big Data
(DOLAP 2026). ; 2026.'
apa: Böhm, D., Gottlob, G., Lanzinger, M., Longo, D. M., Okulmus, C., Pichler, R.,
& Selzer, A. (2026). Selective Use of Yannakakis’ Algorithm for Consistent
Performance Gains. Proceedings of the 28th International Workshop on Design,
Optimization, Languages and Analytical Processing of Big Data (DOLAP 2026).
bibtex: '@inproceedings{Böhm_Gottlob_Lanzinger_Longo_Okulmus_Pichler_Selzer_2026,
place={Tampere, Finland}, title={Selective Use of Yannakakis’ Algorithm for Consistent
Performance Gains}, booktitle={Proceedings of the 28th International Workshop
on Design, Optimization, Languages and Analytical Processing of Big Data (DOLAP
2026)}, author={Böhm, Daniela and Gottlob, Georg and Lanzinger, Matthias and Longo,
Davide Mario and Okulmus, Cem and Pichler, Reinhard and Selzer, Alexander}, year={2026}
}'
chicago: Böhm, Daniela, Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem
Okulmus, Reinhard Pichler, and Alexander Selzer. “Selective Use of Yannakakis’
Algorithm for Consistent Performance Gains.” In Proceedings of the 28th International
Workshop on Design, Optimization, Languages and Analytical Processing of Big Data
(DOLAP 2026). Tampere, Finland, 2026.
ieee: D. Böhm et al., “Selective Use of Yannakakis’ Algorithm for Consistent
Performance Gains,” 2026.
mla: Böhm, Daniela, et al. “Selective Use of Yannakakis’ Algorithm for Consistent
Performance Gains.” Proceedings of the 28th International Workshop on Design,
Optimization, Languages and Analytical Processing of Big Data (DOLAP 2026),
2026.
short: 'D. Böhm, G. Gottlob, M. Lanzinger, D.M. Longo, C. Okulmus, R. Pichler, A.
Selzer, in: Proceedings of the 28th International Workshop on Design, Optimization,
Languages and Analytical Processing of Big Data (DOLAP 2026), Tampere, Finland,
2026.'
date_created: 2026-03-27T15:20:54Z
date_updated: 2026-03-27T15:22:01Z
department:
- _id: '888'
keyword:
- Join Queries
- Acyclic Queries
- Query Processing
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ceur-ws.org/Vol-4186/paper2.pdf
oa: '1'
place: Tampere, Finland
publication: Proceedings of the 28th International Workshop on Design, Optimization,
Languages and Analytical Processing of Big Data (DOLAP 2026)
status: public
title: Selective Use of Yannakakis’ Algorithm for Consistent Performance Gains
type: conference
user_id: '114410'
year: '2026'
...
---
_id: '63530'
abstract:
- lang: eng
text: 'The widespread deployment of 5G networks, together with the coexistence of
4G/LTE networks, provides mobile devices a diverse set of candidate cells to connect
to. However, associating mobile devices to cells to maximize overall network performance,
a.k.a. cell (re)selection, remains a key challenge for mobile operators. Today,
cell (re)selection parameters are typically configured manually based on operator
experience and rarely adapted to dynamic network conditions. In this work, we
ask: Can an agent automatically learn and adapt cell (re)selection parameters
to consistently improve network performance? We present a reinforcement learning
(RL)-based framework called CellPilot that adaptively tunes cell (re)selection
parameters by learning spatiotemporal patterns of mobile network dynamics. Our
study with real-world data demonstrates that even a lightweight RL agent can outperform
conventional heuristic reconfigurations by up to 167%, while generalizing effectively
across different network scenarios. These results indicate that data-driven approaches
can significantly improve cell (re)selection configurations and enhance mobile
network performance.'
author:
- first_name: Marvin
full_name: Illian, Marvin
id: '44169'
last_name: Illian
orcid: 0009-0007-2992-8346
- first_name: Ramin
full_name: Khalili, Ramin
last_name: Khalili
- first_name: Antonio A. de A.
full_name: Rocha, Antonio A. de A.
last_name: Rocha
- first_name: Lin
full_name: Wang, Lin
id: '102868'
last_name: Wang
orcid: 0000-0001-7181-6128
citation:
ama: 'Illian M, Khalili R, Rocha AA de A, Wang L. Cells on Autopilot: Adaptive Cell
(Re)Selection via Reinforcement Learning. arXiv:260104083. Published online
2026.'
apa: 'Illian, M., Khalili, R., Rocha, A. A. de A., & Wang, L. (2026). Cells
on Autopilot: Adaptive Cell (Re)Selection via Reinforcement Learning. In arXiv:2601.04083.'
bibtex: '@article{Illian_Khalili_Rocha_Wang_2026, title={Cells on Autopilot: Adaptive
Cell (Re)Selection via Reinforcement Learning}, journal={arXiv:2601.04083}, author={Illian,
Marvin and Khalili, Ramin and Rocha, Antonio A. de A. and Wang, Lin}, year={2026}
}'
chicago: 'Illian, Marvin, Ramin Khalili, Antonio A. de A. Rocha, and Lin Wang. “Cells
on Autopilot: Adaptive Cell (Re)Selection via Reinforcement Learning.” ArXiv:2601.04083,
2026.'
ieee: 'M. Illian, R. Khalili, A. A. de A. Rocha, and L. Wang, “Cells on Autopilot:
Adaptive Cell (Re)Selection via Reinforcement Learning,” arXiv:2601.04083.
2026.'
mla: 'Illian, Marvin, et al. “Cells on Autopilot: Adaptive Cell (Re)Selection via
Reinforcement Learning.” ArXiv:2601.04083, 2026.'
short: M. Illian, R. Khalili, A.A. de A. Rocha, L. Wang, ArXiv:2601.04083 (2026).
date_created: 2026-01-08T07:58:22Z
date_updated: 2026-03-31T06:44:22Z
department:
- _id: '75'
external_id:
arxiv:
- '2601.04083'
language:
- iso: eng
publication: arXiv:2601.04083
status: public
title: 'Cells on Autopilot: Adaptive Cell (Re)Selection via Reinforcement Learning'
type: preprint
user_id: '102868'
year: '2026'
...
---
_id: '65249'
author:
- first_name: Huzaifa
full_name: Shaaban KabakiboKabakibo, Huzaifa
last_name: Shaaban KabakiboKabakibo
- first_name: Animesh
full_name: Trivedi, Animesh
last_name: Trivedi
- first_name: Lin
full_name: Wang, Lin
id: '102868'
last_name: Wang
orcid: 0000-0001-7181-6128
citation:
ama: 'Shaaban KabakiboKabakibo H, Trivedi A, Wang L. Breaking the Ice: Analyzing
Cold Start Latency in vLLM. In: The 9th Annual Conference on Machine Learning
and Systems (MLSys). ; 2026.'
apa: 'Shaaban KabakiboKabakibo, H., Trivedi, A., & Wang, L. (2026). Breaking
the Ice: Analyzing Cold Start Latency in vLLM. The 9th Annual Conference on
Machine Learning and Systems (MLSys). The 9th Annual Conference on Machine
Learning and Systems (MLSys 2026) , Bellevue, WA.'
bibtex: '@inproceedings{Shaaban KabakiboKabakibo_Trivedi_Wang_2026, title={Breaking
the Ice: Analyzing Cold Start Latency in vLLM}, booktitle={The 9th Annual Conference
on Machine Learning and Systems (MLSys)}, author={Shaaban KabakiboKabakibo, Huzaifa
and Trivedi, Animesh and Wang, Lin}, year={2026} }'
chicago: 'Shaaban KabakiboKabakibo, Huzaifa, Animesh Trivedi, and Lin Wang. “Breaking
the Ice: Analyzing Cold Start Latency in VLLM.” In The 9th Annual Conference
on Machine Learning and Systems (MLSys), 2026.'
ieee: 'H. Shaaban KabakiboKabakibo, A. Trivedi, and L. Wang, “Breaking the Ice:
Analyzing Cold Start Latency in vLLM,” presented at the The 9th Annual Conference
on Machine Learning and Systems (MLSys 2026) , Bellevue, WA, 2026.'
mla: 'Shaaban KabakiboKabakibo, Huzaifa, et al. “Breaking the Ice: Analyzing Cold
Start Latency in VLLM.” The 9th Annual Conference on Machine Learning and Systems
(MLSys), 2026.'
short: 'H. Shaaban KabakiboKabakibo, A. Trivedi, L. Wang, in: The 9th Annual Conference
on Machine Learning and Systems (MLSys), 2026.'
conference:
end_date: 2026-05-22
location: Bellevue, WA
name: 'The 9th Annual Conference on Machine Learning and Systems (MLSys 2026) '
start_date: 2026-05-18
date_created: 2026-03-31T06:34:37Z
date_updated: 2026-03-31T06:41:10Z
department:
- _id: '34'
- _id: '7'
- _id: '75'
language:
- iso: eng
publication: The 9th Annual Conference on Machine Learning and Systems (MLSys)
status: public
title: 'Breaking the Ice: Analyzing Cold Start Latency in vLLM'
type: conference
user_id: '102868'
year: '2026'
...
---
_id: '65250'
author:
- first_name: Sepideh
full_name: Zohdi, Sepideh
last_name: Zohdi
- first_name: Lin
full_name: Wang, Lin
id: '102868'
last_name: Wang
orcid: 0000-0001-7181-6128
citation:
ama: 'Zohdi S, Wang L. Before the First Token: Benchmarking Data Preprocessing in
Vision-Language Models . In: The 6th Workshop on Machine Learning and Systems
(EuroMLSys). ; 2026.'
apa: 'Zohdi, S., & Wang, L. (2026). Before the First Token: Benchmarking Data
Preprocessing in Vision-Language Models . The 6th Workshop on Machine Learning
and Systems (EuroMLSys). The 6th Workshop on Machine Learning and Systems
(EuroMLSys), Edinburg.'
bibtex: '@inproceedings{Zohdi_Wang_2026, title={Before the First Token: Benchmarking
Data Preprocessing in Vision-Language Models }, booktitle={The 6th Workshop on
Machine Learning and Systems (EuroMLSys)}, author={Zohdi, Sepideh and Wang, Lin},
year={2026} }'
chicago: 'Zohdi, Sepideh, and Lin Wang. “Before the First Token: Benchmarking Data
Preprocessing in Vision-Language Models .” In The 6th Workshop on Machine Learning
and Systems (EuroMLSys), 2026.'
ieee: 'S. Zohdi and L. Wang, “Before the First Token: Benchmarking Data Preprocessing
in Vision-Language Models ,” presented at the The 6th Workshop on Machine Learning
and Systems (EuroMLSys), Edinburg, 2026.'
mla: 'Zohdi, Sepideh, and Lin Wang. “Before the First Token: Benchmarking Data Preprocessing
in Vision-Language Models .” The 6th Workshop on Machine Learning and Systems
(EuroMLSys), 2026.'
short: 'S. Zohdi, L. Wang, in: The 6th Workshop on Machine Learning and Systems
(EuroMLSys), 2026.'
conference:
end_date: 2026-04-27
location: Edinburg
name: The 6th Workshop on Machine Learning and Systems (EuroMLSys)
start_date: 2026-04-27
date_created: 2026-03-31T06:38:34Z
date_updated: 2026-03-31T06:39:41Z
department:
- _id: '34'
- _id: '7'
- _id: '75'
language:
- iso: eng
publication: The 6th Workshop on Machine Learning and Systems (EuroMLSys)
status: public
title: 'Before the First Token: Benchmarking Data Preprocessing in Vision-Language
Models '
type: conference
user_id: '102868'
year: '2026'
...
---
_id: '65440'
abstract:
- lang: eng
text: "Abstract\r\n We present
a novel algorithm for quantization and subsequent hexahedral mesh generation from
seamless volumetric maps. Quantization is the process of choosing integers that
represent the numbers of hexahedral elements to be placed in each region of the
volume, and transforming the seamless map into an integer‐grid map matching that
choice, inducing a hexahedral mesh. Previous work computes such quantizations
under the restriction of a fixed predetermined singularity graph. Our novel approach
allows for implicit modification and, in particular, simplification of the map's
singularity structure wherever that benefits the chosen objective, such as matching
target hexahedron sizes as closely as possible. It comes with two novel ingredients:
A feature‐focused distortion measure guiding the quantization, and constraints
ensuring map injectivity and structure preservation of geometric and topological
features, both without relying on a fixed singularity structure. We demonstrate
the benefit of the added flexibility offered by this approach: it allows for the
generation of hexahedral meshes that more accurately match a desired resolution
globally, as well as of meshes exhibiting a simpler block structure."
article_number: e70349
author:
- first_name: Hendrik
full_name: Brückler, Hendrik
last_name: Brückler
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
citation:
ama: Brückler H, Campen M. Volume Quantization with Flexible Singularities for Hexahedral
Meshing. Computer Graphics Forum. Published online 2026. doi:10.1111/cgf.70349
apa: Brückler, H., & Campen, M. (2026). Volume Quantization with Flexible Singularities
for Hexahedral Meshing. Computer Graphics Forum, Article e70349. https://doi.org/10.1111/cgf.70349
bibtex: '@article{Brückler_Campen_2026, title={Volume Quantization with Flexible
Singularities for Hexahedral Meshing}, DOI={10.1111/cgf.70349},
number={e70349}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Brückler,
Hendrik and Campen, Marcel}, year={2026} }'
chicago: Brückler, Hendrik, and Marcel Campen. “Volume Quantization with Flexible
Singularities for Hexahedral Meshing.” Computer Graphics Forum, 2026. https://doi.org/10.1111/cgf.70349.
ieee: 'H. Brückler and M. Campen, “Volume Quantization with Flexible Singularities
for Hexahedral Meshing,” Computer Graphics Forum, Art. no. e70349, 2026,
doi: 10.1111/cgf.70349.'
mla: Brückler, Hendrik, and Marcel Campen. “Volume Quantization with Flexible Singularities
for Hexahedral Meshing.” Computer Graphics Forum, e70349, Wiley, 2026,
doi:10.1111/cgf.70349.
short: H. Brückler, M. Campen, Computer Graphics Forum (2026).
date_created: 2026-04-15T07:32:52Z
date_updated: 2026-04-15T08:06:49Z
department:
- _id: '969'
doi: 10.1111/cgf.70349
language:
- iso: eng
publication: Computer Graphics Forum
publication_identifier:
issn:
- 0167-7055
- 1467-8659
publication_status: published
publisher: Wiley
status: public
title: Volume Quantization with Flexible Singularities for Hexahedral Meshing
type: journal_article
user_id: '117512'
year: '2026'
...
---
_id: '61922'
abstract:
- lang: eng
text: "We present an extremely simple polynomial-space exponential-time\r\n$(1-\\varepsilon)$-approximation
algorithm for MAX-k-SAT that is (slightly)\r\nfaster than the previous known polynomial-space
$(1-\\varepsilon)$-approximation\r\nalgorithms by Hirsch (Discrete Applied Mathematics,
2003) and Escoffier,\r\nPaschos and Tourniaire (Theoretical Computer Science,
2014). Our algorithm\r\nrepeatedly samples an assignment uniformly at random until
finding an\r\nassignment that satisfies a large enough fraction of clauses. Surprisingly,
we\r\ncan show the efficiency of this simpler approach by proving that in any\r\ninstance
of MAX-k-SAT (or more generally any instance of MAXCSP), an\r\nexponential number
of assignments satisfy a fraction of clauses close to the\r\noptimal value."
author:
- first_name: Harry
full_name: Buhrman, Harry
last_name: Buhrman
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Zeph
full_name: Landau, Zeph
last_name: Landau
- first_name: François Le
full_name: Gall, François Le
last_name: Gall
- first_name: Norbert
full_name: Schuch, Norbert
last_name: Schuch
- first_name: Suguru
full_name: Tamaki, Suguru
last_name: Tamaki
citation:
ama: 'Buhrman H, Gharibian S, Landau Z, Gall FL, Schuch N, Tamaki S. A Simpler Exponential-Time
Approximation Algorithm for MAX-k-SAT. In: SIAM Symposium on Simplicity in
Algorithms (SOSA). ; :247-253.'
apa: Buhrman, H., Gharibian, S., Landau, Z., Gall, F. L., Schuch, N., & Tamaki,
S. (n.d.). A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT. SIAM
Symposium on Simplicity in Algorithms (SOSA), 247–253.
bibtex: '@inproceedings{Buhrman_Gharibian_Landau_Gall_Schuch_Tamaki, title={A Simpler
Exponential-Time Approximation Algorithm for MAX-k-SAT}, booktitle={SIAM Symposium
on Simplicity in Algorithms (SOSA)}, author={Buhrman, Harry and Gharibian, Sevag
and Landau, Zeph and Gall, François Le and Schuch, Norbert and Tamaki, Suguru},
pages={247–253} }'
chicago: Buhrman, Harry, Sevag Gharibian, Zeph Landau, François Le Gall, Norbert
Schuch, and Suguru Tamaki. “A Simpler Exponential-Time Approximation Algorithm
for MAX-k-SAT.” In SIAM Symposium on Simplicity in Algorithms (SOSA), 247–53,
n.d.
ieee: H. Buhrman, S. Gharibian, Z. Landau, F. L. Gall, N. Schuch, and S. Tamaki,
“A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT,” in SIAM
Symposium on Simplicity in Algorithms (SOSA), pp. 247–253.
mla: Buhrman, Harry, et al. “A Simpler Exponential-Time Approximation Algorithm
for MAX-k-SAT.” SIAM Symposium on Simplicity in Algorithms (SOSA), pp.
247–53.
short: 'H. Buhrman, S. Gharibian, Z. Landau, F.L. Gall, N. Schuch, S. Tamaki, in:
SIAM Symposium on Simplicity in Algorithms (SOSA), n.d., pp. 247–253.'
date_created: 2025-10-22T09:33:22Z
date_updated: 2026-04-20T13:53:03Z
department:
- _id: '7'
- _id: '623'
external_id:
arxiv:
- '2510.18164'
language:
- iso: eng
page: 247-253
publication: SIAM Symposium on Simplicity in Algorithms (SOSA)
publication_status: inpress
status: public
title: A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
type: conference
user_id: '71541'
year: '2026'
...
---
_id: '65489'
author:
- first_name: Cem
full_name: Okulmus, Cem
id: '114410'
last_name: Okulmus
orcid: 0000-0002-7742-0439
- first_name: Shqiponja
full_name: Ahmetaj, Shqiponja
last_name: Ahmetaj
- first_name: 'Iovka '
full_name: 'Boneva, Iovka '
last_name: Boneva
- first_name: Jan
full_name: Hidders, Jan
last_name: Hidders
- first_name: 'Maxime '
full_name: 'Jakubowski, Maxime '
last_name: Jakubowski
- first_name: José Emilio
full_name: ' Labra Gayo, José Emilio'
last_name: ' Labra Gayo'
- first_name: Wim
full_name: Martens, Wim
last_name: Martens
- first_name: 'Fabio '
full_name: 'Mogavero, Fabio '
last_name: Mogavero
- first_name: 'Filip '
full_name: 'Murlak, Filip '
last_name: Murlak
- first_name: ' Ognjen '
full_name: 'Savković, Ognjen '
last_name: Savković
- first_name: 'Mantas '
full_name: 'Šimkus, Mantas '
last_name: Šimkus
- first_name: 'Dominik '
full_name: 'Tomaszuk, Dominik '
last_name: Tomaszuk
citation:
ama: 'Okulmus C, Ahmetaj S, Boneva I, et al. Common Foundations for Recursive Shape
Languages. In: Proceedings of the 23rd International Conference on Principles
of Knowledge Representation and Reasoning (KR 2026). ; 2026.'
apa: Okulmus, C., Ahmetaj, S., Boneva, I., Hidders, J., Jakubowski, M., Labra Gayo,
J. E., Martens, W., Mogavero, F., Murlak, F., Savković, Ognjen , Šimkus, M.,
& Tomaszuk, D. (2026). Common Foundations for Recursive Shape Languages. Proceedings
of the 23rd International Conference on Principles of Knowledge Representation
and Reasoning (KR 2026). 23rd International Conference on Principles of Knowledge
Representation and Reasoning (KR 2026), Lisbon, Portugal.
bibtex: '@inproceedings{Okulmus_Ahmetaj_Boneva_Hidders_Jakubowski_ Labra Gayo_Martens_Mogavero_Murlak_Savković_et
al._2026, title={Common Foundations for Recursive Shape Languages}, booktitle={Proceedings
of the 23rd International Conference on Principles of Knowledge Representation
and Reasoning (KR 2026)}, author={Okulmus, Cem and Ahmetaj, Shqiponja and Boneva,
Iovka and Hidders, Jan and Jakubowski, Maxime and Labra Gayo, José Emilio and
Martens, Wim and Mogavero, Fabio and Murlak, Filip and Savković, Ognjen and
et al.}, year={2026} }'
chicago: Okulmus, Cem, Shqiponja Ahmetaj, Iovka Boneva, Jan Hidders, Maxime Jakubowski,
José Emilio Labra Gayo, Wim Martens, et al. “Common Foundations for Recursive
Shape Languages.” In Proceedings of the 23rd International Conference on Principles
of Knowledge Representation and Reasoning (KR 2026), 2026.
ieee: C. Okulmus et al., “Common Foundations for Recursive Shape Languages,”
presented at the 23rd International Conference on Principles of Knowledge Representation
and Reasoning (KR 2026), Lisbon, Portugal, 2026.
mla: Okulmus, Cem, et al. “Common Foundations for Recursive Shape Languages.” Proceedings
of the 23rd International Conference on Principles of Knowledge Representation
and Reasoning (KR 2026), 2026.
short: 'C. Okulmus, S. Ahmetaj, I. Boneva, J. Hidders, M. Jakubowski, J.E. Labra
Gayo, W. Martens, F. Mogavero, F. Murlak, Ognjen Savković, M. Šimkus, D. Tomaszuk,
in: Proceedings of the 23rd International Conference on Principles of Knowledge
Representation and Reasoning (KR 2026), 2026.'
conference:
end_date: 2026-07-23
location: Lisbon, Portugal
name: 23rd International Conference on Principles of Knowledge Representation and
Reasoning (KR 2026)
start_date: 2026-07-20
date_created: 2026-04-22T14:16:58Z
date_updated: 2026-04-22T14:17:20Z
department:
- _id: '888'
language:
- iso: eng
publication: Proceedings of the 23rd International Conference on Principles of Knowledge
Representation and Reasoning (KR 2026)
status: public
title: Common Foundations for Recursive Shape Languages
type: conference
user_id: '114410'
year: '2026'
...
---
_id: '61152'
abstract:
- lang: eng
text: While neural network quantization effectively reduces the cost of matrix multiplications,
aggressive quantization can expose non-matrix-multiply operations as significant
performance and resource bottlenecks on embedded systems. Addressing such bottlenecks
requires a comprehensive approach to tailoring the precision across operations
in the inference computation. To this end, we introduce scaled-integer range analysis
(SIRA), a static analysis technique employing interval arithmetic to determine
the range, scale, and bias for tensors in quantized neural networks. We show how
this information can be exploited to reduce the resource footprint of FPGA dataflow
neural network accelerators via tailored bitwidth adaptation for accumulators
and downstream operations, aggregation of scales and biases, and conversion of
consecutive elementwise operations to thresholding operations. We integrate SIRA-driven
optimizations into the open-source FINN framework, then evaluate their effectiveness
across a range of quantized neural network workloads and compare implementation
alternatives for non-matrix-multiply operations. We demonstrate an average reduction
of 17\% for LUTs, 66\% for DSPs, and 22\% for accumulator bitwidths with SIRA
optimizations, providing detailed benchmark analysis and analytical models to
guide the implementation style for non-matrix layers. Finally, we open-source
SIRA to facilitate community exploration of its benefits across various applications
and hardware platforms.
author:
- first_name: Yaman
full_name: Umuroglu, Yaman
last_name: Umuroglu
- first_name: Christoph
full_name: Berganski, Christoph
id: '98854'
last_name: Berganski
- first_name: Felix
full_name: Jentzsch, Felix
id: '55631'
last_name: Jentzsch
orcid: 0000-0003-4987-5708
- first_name: Michal
full_name: Danilowicz, Michal
last_name: Danilowicz
- first_name: Tomasz
full_name: Kryjak, Tomasz
last_name: Kryjak
- first_name: Charalampos
full_name: Bezaitis, Charalampos
last_name: Bezaitis
- first_name: Magnus
full_name: Sjalander, Magnus
last_name: Sjalander
- first_name: Ian
full_name: Colbert, Ian
last_name: Colbert
- first_name: Thomas
full_name: Preusser, Thomas
last_name: Preusser
- first_name: Jakoba
full_name: Petri-Koenig, Jakoba
last_name: Petri-Koenig
- first_name: Michaela
full_name: Blott, Michaela
last_name: Blott
citation:
ama: 'Umuroglu Y, Berganski C, Jentzsch F, et al. SIRA: Scaled-Integer Range Analysis
for Optimizing FPGA Dataflow Neural Network Accelerators. ACM Transactions
on Reconfigurable Technology and Systems. doi:10.1145/3807510'
apa: 'Umuroglu, Y., Berganski, C., Jentzsch, F., Danilowicz, M., Kryjak, T., Bezaitis,
C., Sjalander, M., Colbert, I., Preusser, T., Petri-Koenig, J., & Blott, M.
(n.d.). SIRA: Scaled-Integer Range Analysis for Optimizing FPGA Dataflow Neural
Network Accelerators. ACM Transactions on Reconfigurable Technology and Systems.
https://doi.org/10.1145/3807510'
bibtex: '@article{Umuroglu_Berganski_Jentzsch_Danilowicz_Kryjak_Bezaitis_Sjalander_Colbert_Preusser_Petri-Koenig_et
al., title={SIRA: Scaled-Integer Range Analysis for Optimizing FPGA Dataflow Neural
Network Accelerators}, DOI={10.1145/3807510},
journal={ACM Transactions on Reconfigurable Technology and Systems}, author={Umuroglu,
Yaman and Berganski, Christoph and Jentzsch, Felix and Danilowicz, Michal and
Kryjak, Tomasz and Bezaitis, Charalampos and Sjalander, Magnus and Colbert, Ian
and Preusser, Thomas and Petri-Koenig, Jakoba and et al.} }'
chicago: 'Umuroglu, Yaman, Christoph Berganski, Felix Jentzsch, Michal Danilowicz,
Tomasz Kryjak, Charalampos Bezaitis, Magnus Sjalander, et al. “SIRA: Scaled-Integer
Range Analysis for Optimizing FPGA Dataflow Neural Network Accelerators.” ACM
Transactions on Reconfigurable Technology and Systems, n.d. https://doi.org/10.1145/3807510.'
ieee: 'Y. Umuroglu et al., “SIRA: Scaled-Integer Range Analysis for Optimizing
FPGA Dataflow Neural Network Accelerators,” ACM Transactions on Reconfigurable
Technology and Systems, doi: 10.1145/3807510.'
mla: 'Umuroglu, Yaman, et al. “SIRA: Scaled-Integer Range Analysis for Optimizing
FPGA Dataflow Neural Network Accelerators.” ACM Transactions on Reconfigurable
Technology and Systems, doi:10.1145/3807510.'
short: Y. Umuroglu, C. Berganski, F. Jentzsch, M. Danilowicz, T. Kryjak, C. Bezaitis,
M. Sjalander, I. Colbert, T. Preusser, J. Petri-Koenig, M. Blott, ACM Transactions
on Reconfigurable Technology and Systems (n.d.).
date_created: 2025-09-08T14:10:39Z
date_updated: 2026-04-27T14:13:50Z
department:
- _id: '78'
doi: 10.1145/3807510
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: ACM Transactions on Reconfigurable Technology and Systems
publication_identifier:
issn:
- 1936-7406
publication_status: submitted
status: public
title: 'SIRA: Scaled-Integer Range Analysis for Optimizing FPGA Dataflow Neural Network
Accelerators'
type: journal_article
user_id: '55631'
year: '2026'
...
---
_id: '65501'
author:
- first_name: Lukas
full_name: Stasytis, Lukas
last_name: Stasytis
- first_name: Felix
full_name: Jentzsch, Felix
id: '55631'
last_name: Jentzsch
orcid: 0000-0003-4987-5708
- first_name: Thomas
full_name: Preusser, Thomas
last_name: Preusser
- first_name: Yaman
full_name: Umuroglu, Yaman
last_name: Umuroglu
- first_name: Jakoba
full_name: Petri-Koenig, Jakoba
last_name: Petri-Koenig
- first_name: Zsolt
full_name: István, Zsolt
last_name: István
citation:
ama: 'Stasytis L, Jentzsch F, Preusser T, Umuroglu Y, Petri-Koenig J, István Z.
Heuristic & Expert-Guided Buffer Sizing for Neural Network Inference Applications
on FPGAs. In: 2025 International Conference on Field Programmable Technology
(ICFPT). IEEE; 2026. doi:10.1109/icfpt67023.2025.00032'
apa: Stasytis, L., Jentzsch, F., Preusser, T., Umuroglu, Y., Petri-Koenig, J., &
István, Z. (2026). Heuristic & Expert-Guided Buffer Sizing for Neural
Network Inference Applications on FPGAs. 2025 International Conference on Field
Programmable Technology (ICFPT). https://doi.org/10.1109/icfpt67023.2025.00032
bibtex: '@inproceedings{Stasytis_Jentzsch_Preusser_Umuroglu_Petri-Koenig_István_2026,
title={Heuristic & Expert-Guided Buffer Sizing for Neural Network Inference
Applications on FPGAs}, DOI={10.1109/icfpt67023.2025.00032},
booktitle={2025 International Conference on Field Programmable Technology (ICFPT)},
publisher={IEEE}, author={Stasytis, Lukas and Jentzsch, Felix and Preusser, Thomas
and Umuroglu, Yaman and Petri-Koenig, Jakoba and István, Zsolt}, year={2026} }'
chicago: Stasytis, Lukas, Felix Jentzsch, Thomas Preusser, Yaman Umuroglu, Jakoba
Petri-Koenig, and Zsolt István. “Heuristic & Expert-Guided Buffer Sizing
for Neural Network Inference Applications on FPGAs.” In 2025 International
Conference on Field Programmable Technology (ICFPT). IEEE, 2026. https://doi.org/10.1109/icfpt67023.2025.00032.
ieee: 'L. Stasytis, F. Jentzsch, T. Preusser, Y. Umuroglu, J. Petri-Koenig, and
Z. István, “Heuristic & Expert-Guided Buffer Sizing for Neural Network
Inference Applications on FPGAs,” 2026, doi: 10.1109/icfpt67023.2025.00032.'
mla: Stasytis, Lukas, et al. “Heuristic & Expert-Guided Buffer Sizing for
Neural Network Inference Applications on FPGAs.” 2025 International Conference
on Field Programmable Technology (ICFPT), IEEE, 2026, doi:10.1109/icfpt67023.2025.00032.
short: 'L. Stasytis, F. Jentzsch, T. Preusser, Y. Umuroglu, J. Petri-Koenig, Z.
István, in: 2025 International Conference on Field Programmable Technology (ICFPT),
IEEE, 2026.'
date_created: 2026-04-27T14:24:25Z
date_updated: 2026-04-27T14:25:51Z
department:
- _id: '78'
doi: 10.1109/icfpt67023.2025.00032
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: 2025 International Conference on Field Programmable Technology (ICFPT)
publication_status: published
publisher: IEEE
status: public
title: Heuristic & Expert-Guided Buffer Sizing for Neural Network Inference Applications
on FPGAs
type: conference
user_id: '55631'
year: '2026'
...
---
_id: '65500'
author:
- first_name: Felix
full_name: Jentzsch, Felix
id: '55631'
last_name: Jentzsch
orcid: 0000-0003-4987-5708
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Jentzsch F, Platzner M. Empirical QoR Estimation Flow for Fast Design Space
Exploration of DNN Dataflow Accelerators. In: 2025 International Conference
on Field Programmable Technology (ICFPT). IEEE; 2026. doi:10.1109/icfpt67023.2025.00044'
apa: Jentzsch, F., & Platzner, M. (2026). Empirical QoR Estimation Flow for
Fast Design Space Exploration of DNN Dataflow Accelerators. 2025 International
Conference on Field Programmable Technology (ICFPT). https://doi.org/10.1109/icfpt67023.2025.00044
bibtex: '@inproceedings{Jentzsch_Platzner_2026, title={Empirical QoR Estimation
Flow for Fast Design Space Exploration of DNN Dataflow Accelerators}, DOI={10.1109/icfpt67023.2025.00044},
booktitle={2025 International Conference on Field Programmable Technology (ICFPT)},
publisher={IEEE}, author={Jentzsch, Felix and Platzner, Marco}, year={2026} }'
chicago: Jentzsch, Felix, and Marco Platzner. “Empirical QoR Estimation Flow for
Fast Design Space Exploration of DNN Dataflow Accelerators.” In 2025 International
Conference on Field Programmable Technology (ICFPT). IEEE, 2026. https://doi.org/10.1109/icfpt67023.2025.00044.
ieee: 'F. Jentzsch and M. Platzner, “Empirical QoR Estimation Flow for Fast Design
Space Exploration of DNN Dataflow Accelerators,” 2026, doi: 10.1109/icfpt67023.2025.00044.'
mla: Jentzsch, Felix, and Marco Platzner. “Empirical QoR Estimation Flow for Fast
Design Space Exploration of DNN Dataflow Accelerators.” 2025 International
Conference on Field Programmable Technology (ICFPT), IEEE, 2026, doi:10.1109/icfpt67023.2025.00044.
short: 'F. Jentzsch, M. Platzner, in: 2025 International Conference on Field Programmable
Technology (ICFPT), IEEE, 2026.'
date_created: 2026-04-27T14:22:50Z
date_updated: 2026-04-27T14:26:01Z
department:
- _id: '78'
doi: 10.1109/icfpt67023.2025.00044
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: 2025 International Conference on Field Programmable Technology (ICFPT)
publication_status: published
publisher: IEEE
status: public
title: Empirical QoR Estimation Flow for Fast Design Space Exploration of DNN Dataflow
Accelerators
type: conference
user_id: '55631'
year: '2026'
...
---
_id: '65554'
abstract:
- lang: eng
text: "Abstract\r\n \r\n An
algorithm for cutting solid objects in a topology‐controlled manner is presented.
Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded
by the loop is constructed in the interior. In contrast to various previous approaches,
both disk topology and conformance to the prescribed loop are ensured by construction,
while supporting not only contractible but also incontractible loops on the boundaries
of manifold objects of higher genus and arbitrary non‐trivial topology. We describe
an implementation of this algorithm in the discrete setting, with triangle mesh
cut surfaces embedded in tetrahedral mesh objects. Making use of this novel cutting
algorithm, we describe a method for the reliable construction of bijective volumetric
maps between solid objects, demonstrating the algorithm's utility. This mapping
method overcomes restrictions of the state of the art to topological balls, extending
coverage to objects of arbitrary genus, specifically so‐called\r\n 1\r\n
\ ‐handlebodies.\r\n "
article_number: e70379
author:
- first_name: Steffen
full_name: Hinderink, Steffen
id: '116615'
last_name: Hinderink
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
citation:
ama: 'Hinderink S, Campen M. DiskScissors: Cutting Arbitrary‐Topology Solids for
Bijective Mapping. Computer Graphics Forum. Published online 2026. doi:10.1111/cgf.70379'
apa: 'Hinderink, S., & Campen, M. (2026). DiskScissors: Cutting Arbitrary‐Topology
Solids for Bijective Mapping. Computer Graphics Forum, Article e70379.
https://doi.org/10.1111/cgf.70379'
bibtex: '@article{Hinderink_Campen_2026, title={DiskScissors: Cutting Arbitrary‐Topology
Solids for Bijective Mapping}, DOI={10.1111/cgf.70379},
number={e70379}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Hinderink,
Steffen and Campen, Marcel}, year={2026} }'
chicago: 'Hinderink, Steffen, and Marcel Campen. “DiskScissors: Cutting Arbitrary‐Topology
Solids for Bijective Mapping.” Computer Graphics Forum, 2026. https://doi.org/10.1111/cgf.70379.'
ieee: 'S. Hinderink and M. Campen, “DiskScissors: Cutting Arbitrary‐Topology Solids
for Bijective Mapping,” Computer Graphics Forum, Art. no. e70379, 2026,
doi: 10.1111/cgf.70379.'
mla: 'Hinderink, Steffen, and Marcel Campen. “DiskScissors: Cutting Arbitrary‐Topology
Solids for Bijective Mapping.” Computer Graphics Forum, e70379, Wiley,
2026, doi:10.1111/cgf.70379.'
short: S. Hinderink, M. Campen, Computer Graphics Forum (2026).
date_created: 2026-05-05T08:15:52Z
date_updated: 2026-05-05T08:17:55Z
department:
- _id: '969'
doi: 10.1111/cgf.70379
language:
- iso: eng
publication: Computer Graphics Forum
publication_identifier:
issn:
- 0167-7055
- 1467-8659
publication_status: published
publisher: Wiley
status: public
title: 'DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping'
type: journal_article
user_id: '117512'
year: '2026'
...
---
_id: '65567'
abstract:
- lang: eng
text: "We introduce the notion of contrastive ABox explanations to answer
questions of the type “Why is a an instance of C, but b is not?”. While there
are various approaches for explaining positive entailments (why is C(a) entailed
by the knowledge base) as well as missing entailments (why is C(b) not entailed)
in isolation, contrastive explanations consider both at the same time, which allows
them to focus on the relevant commonalities and differences between a and b. We
develop an appropriate notion of contrastive explanations for the special case
of ABox reasoning with description logic ontologies, and analyze the computational
complexity for different variants under different optimality criteria, considering
lightweight as well as more expressive description logics. We\r\nimplemented a
first method for computing one variant of contrastive explanations, and evaluated
it on generated problems for realistic knowledge bases."
author:
- first_name: Patrick
full_name: Koopmann, Patrick
last_name: Koopmann
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
- first_name: Balram
full_name: Tiwari, Balram
last_name: Tiwari
citation:
ama: 'Koopmann P, Mahmood Y, Ngonga Ngomo A-C, Tiwari B. Can You Tell the Difference?
Contrastive Explanations for ABox Entailments. In: Proceedings of the AAAI
Conference on Artificial Intelligence. Vol 40. Association for the Advancement
of Artificial Intelligence (AAAI); 2026:19189-19197. doi:10.1609/aaai.v40i23.38993'
apa: Koopmann, P., Mahmood, Y., Ngonga Ngomo, A.-C., & Tiwari, B. (2026). Can
You Tell the Difference? Contrastive Explanations for ABox Entailments. Proceedings
of the AAAI Conference on Artificial Intelligence, 40(23), 19189–19197.
https://doi.org/10.1609/aaai.v40i23.38993
bibtex: '@inproceedings{Koopmann_Mahmood_Ngonga Ngomo_Tiwari_2026, title={Can You
Tell the Difference? Contrastive Explanations for ABox Entailments}, volume={40},
DOI={10.1609/aaai.v40i23.38993},
number={23}, booktitle={Proceedings of the AAAI Conference on Artificial Intelligence},
publisher={Association for the Advancement of Artificial Intelligence (AAAI)},
author={Koopmann, Patrick and Mahmood, Yasir and Ngonga Ngomo, Axel-Cyrille and
Tiwari, Balram}, year={2026}, pages={19189–19197} }'
chicago: Koopmann, Patrick, Yasir Mahmood, Axel-Cyrille Ngonga Ngomo, and Balram
Tiwari. “Can You Tell the Difference? Contrastive Explanations for ABox Entailments.”
In Proceedings of the AAAI Conference on Artificial Intelligence, 40:19189–97.
Association for the Advancement of Artificial Intelligence (AAAI), 2026. https://doi.org/10.1609/aaai.v40i23.38993.
ieee: 'P. Koopmann, Y. Mahmood, A.-C. Ngonga Ngomo, and B. Tiwari, “Can You Tell
the Difference? Contrastive Explanations for ABox Entailments,” in Proceedings
of the AAAI Conference on Artificial Intelligence, 2026, vol. 40, no. 23,
pp. 19189–19197, doi: 10.1609/aaai.v40i23.38993.'
mla: Koopmann, Patrick, et al. “Can You Tell the Difference? Contrastive Explanations
for ABox Entailments.” Proceedings of the AAAI Conference on Artificial Intelligence,
vol. 40, no. 23, Association for the Advancement of Artificial Intelligence (AAAI),
2026, pp. 19189–97, doi:10.1609/aaai.v40i23.38993.
short: 'P. Koopmann, Y. Mahmood, A.-C. Ngonga Ngomo, B. Tiwari, in: Proceedings
of the AAAI Conference on Artificial Intelligence, Association for the Advancement
of Artificial Intelligence (AAAI), 2026, pp. 19189–19197.'
date_created: 2026-05-05T15:15:49Z
date_updated: 2026-05-05T15:22:12Z
department:
- _id: '574'
doi: 10.1609/aaai.v40i23.38993
intvolume: ' 40'
issue: '23'
language:
- iso: eng
page: 19189-19197
project:
- _id: '117'
name: TRR 318 - Project Area C
publication: Proceedings of the AAAI Conference on Artificial Intelligence
publication_identifier:
issn:
- 2374-3468
- 2159-5399
publication_status: published
publisher: Association for the Advancement of Artificial Intelligence (AAAI)
status: public
title: Can You Tell the Difference? Contrastive Explanations for ABox Entailments
type: conference
user_id: '99353'
volume: 40
year: '2026'
...
---
_id: '57866'
abstract:
- lang: eng
text: "The theory of Total Function NP (TFNP) and its subclasses says that, even
if\r\none is promised an efficiently verifiable proof exists for a problem, finding\r\nthis
proof can be intractable. Despite the success of the theory at showing\r\nintractability
of problems such as computing Brouwer fixed points and Nash\r\nequilibria, subclasses
of TFNP remain arguably few and far between. In this\r\nwork, we define two new
subclasses of TFNP borne of the study of complex\r\npolynomial systems: Multi-homogeneous
Systems (MHS) and Sparse Fundamental\r\nTheorem of Algebra (SFTA). The first of
these is based on B\\'ezout's theorem\r\nfrom algebraic geometry, marking the
first TFNP subclass based on an algebraic\r\ngeometric principle. At the heart
of our study is the computational problem\r\nknown as Quantum SAT (QSAT) with
a System of Distinct Representatives (SDR),\r\nfirst studied by [Laumann, L\\\"auchli,
Moessner, Scardicchio, and Sondhi 2010].\r\nAmong other results, we show that
QSAT with SDR is MHS-complete, thus giving\r\nnot only the first link between
quantum complexity theory and TFNP, but also\r\nthe first TFNP problem whose classical
variant (SAT with SDR) is easy but whose\r\nquantum variant is hard. We also show
how to embed the roots of a sparse,\r\nhigh-degree, univariate polynomial into
QSAT with SDR, obtaining that SFTA is\r\ncontained in a zero-error version of
MHS. We conjecture this construction also\r\nworks in the low-error setting, which
would imply SFTA is contained in MHS."
author:
- first_name: Marco
full_name: Aldi, Marco
last_name: Aldi
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Dorian
full_name: Rudolph, Dorian
id: '57863'
last_name: Rudolph
citation:
ama: 'Aldi M, Gharibian S, Rudolph D. An unholy trinity: TFNP, polynomial systems,
and the quantum satisfiability problem. In: 17th Innovations in Theoretical
Computer Science Conference (ITCS 2026). Vol 362. ; 2026:7:1-7:24.'
apa: 'Aldi, M., Gharibian, S., & Rudolph, D. (2026). An unholy trinity: TFNP,
polynomial systems, and the quantum satisfiability problem. 17th Innovations
in Theoretical Computer Science Conference (ITCS 2026), 362, 7:1-7:24.'
bibtex: '@inproceedings{Aldi_Gharibian_Rudolph_2026, title={An unholy trinity: TFNP,
polynomial systems, and the quantum satisfiability problem}, volume={362}, booktitle={17th
Innovations in Theoretical Computer Science Conference (ITCS 2026)}, author={Aldi,
Marco and Gharibian, Sevag and Rudolph, Dorian}, year={2026}, pages={7:1-7:24}
}'
chicago: 'Aldi, Marco, Sevag Gharibian, and Dorian Rudolph. “An Unholy Trinity:
TFNP, Polynomial Systems, and the Quantum Satisfiability Problem.” In 17th
Innovations in Theoretical Computer Science Conference (ITCS 2026), 362:7:1-7:24,
2026.'
ieee: 'M. Aldi, S. Gharibian, and D. Rudolph, “An unholy trinity: TFNP, polynomial
systems, and the quantum satisfiability problem,” in 17th Innovations in Theoretical
Computer Science Conference (ITCS 2026), 2026, vol. 362, p. 7:1-7:24.'
mla: 'Aldi, Marco, et al. “An Unholy Trinity: TFNP, Polynomial Systems, and the
Quantum Satisfiability Problem.” 17th Innovations in Theoretical Computer
Science Conference (ITCS 2026), vol. 362, 2026, p. 7:1-7:24.'
short: 'M. Aldi, S. Gharibian, D. Rudolph, in: 17th Innovations in Theoretical Computer
Science Conference (ITCS 2026), 2026, p. 7:1-7:24.'
date_created: 2024-12-30T13:55:27Z
date_updated: 2026-05-15T08:40:28Z
department:
- _id: '7'
- _id: '623'
external_id:
arxiv:
- '2412.19623'
intvolume: ' 362'
language:
- iso: eng
page: 7:1-7:24
publication: 17th Innovations in Theoretical Computer Science Conference (ITCS 2026)
publication_status: published
status: public
title: 'An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability
problem'
type: conference
user_id: '71541'
volume: 362
year: '2026'
...
---
_id: '65013'
author:
- first_name: Marvin
full_name: Illian, Marvin
id: '44169'
last_name: Illian
orcid: 0009-0007-2992-8346
- first_name: Ramin
full_name: Khalili, Ramin
last_name: Khalili
- first_name: Antonio
full_name: A. de A. Rocha, Antonio
last_name: A. de A. Rocha
- first_name: Lin
full_name: Wang, Lin
id: '102868'
last_name: Wang
orcid: 0000-0001-7181-6128
citation:
ama: 'Illian M, Khalili R, A. de A. Rocha A, Wang L. Cells on Autopilot: Adaptive
Cell (Re)Selection via Reinforcement Learning. In: 2026 24th International
Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
(WiOpt). IFIP; 2026.'
apa: 'Illian, M., Khalili, R., A. de A. Rocha, A., & Wang, L. (2026). Cells
on Autopilot: Adaptive Cell (Re)Selection via Reinforcement Learning. 2026
24th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and
Wireless Networks (WiOpt).'
bibtex: '@inproceedings{Illian_Khalili_A. de A. Rocha_Wang_2026, title={Cells on
Autopilot: Adaptive Cell (Re)Selection via Reinforcement Learning}, booktitle={2026
24th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and
Wireless Networks (WiOpt)}, publisher={IFIP}, author={Illian, Marvin and Khalili,
Ramin and A. de A. Rocha, Antonio and Wang, Lin}, year={2026} }'
chicago: 'Illian, Marvin, Ramin Khalili, Antonio A. de A. Rocha, and Lin Wang. “Cells
on Autopilot: Adaptive Cell (Re)Selection via Reinforcement Learning.” In 2026
24th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and
Wireless Networks (WiOpt). IFIP, 2026.'
ieee: 'M. Illian, R. Khalili, A. A. de A. Rocha, and L. Wang, “Cells on Autopilot:
Adaptive Cell (Re)Selection via Reinforcement Learning,” 2026.'
mla: 'Illian, Marvin, et al. “Cells on Autopilot: Adaptive Cell (Re)Selection via
Reinforcement Learning.” 2026 24th International Symposium on Modeling and
Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), IFIP, 2026.'
short: 'M. Illian, R. Khalili, A. A. de A. Rocha, L. Wang, in: 2026 24th International
Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
(WiOpt), IFIP, 2026.'
date_created: 2026-03-16T14:46:45Z
date_updated: 2026-05-20T08:45:27Z
department:
- _id: '75'
language:
- iso: eng
publication: 2026 24th International Symposium on Modeling and Optimization in Mobile,
Ad Hoc, and Wireless Networks (WiOpt)
publisher: IFIP
quality_controlled: '1'
status: public
title: 'Cells on Autopilot: Adaptive Cell (Re)Selection via Reinforcement Learning'
type: conference
user_id: '44169'
year: '2026'
...
---
_id: '65670'
abstract:
- lang: eng
text: "Ensuring the veracity of assertions is {vital for building reliable and consistent
knowledge graphs}. \r\nA variety of automatic fact-checking approaches have been
proposed over the past decade. Among these, path-based fact-checking approaches
are particularly attractive due to their independence of supplementary external
knowledge and their faster runtimes compared to methods reliant on external corpora
or embeddings. \r\nHowever, the effectiveness of these approaches is fundamentally
limited by the incompleteness of existing knowledge graphs, which often lack the
paths necessary to support or refute assertions. \r\nTo address this limitation,
we propose \\system{}, a framework that supplements the knowledge graph with shallow
knowledge---automatically extracted RDF assertions from external unstructured
sources---even if this additional knowledge may not always fit a well-defined
ontology nor be fully verified. By appending such shallow knowledge, we enhance
the graph’s coverage and increase the chances of finding relevant evidence for
fact checking. Comprehensive experiments on three widely used benchmark datasets
demonstrate that integrating \\system{} consistently and significantly enhances
the performance of {state-of-the-art path-based fact-checking approaches}, yielding
improvements of up to 0.24 in Area Under the Receiver Operating Characteristic
Curve (AUROC). These results establish \\system{} as a broadly applicable auxiliary
component for improving the reliability and coverage of automatic fact checking
in knowledge graphs. Our code is open-source and can be found at \\url{https://github.com/dice-group/ShallKnow}."
author:
- first_name: Umair
full_name: Qudus, Umair
id: '83392'
last_name: Qudus
orcid: 0000-0001-6714-8729
- first_name: Neha
full_name: Pokharel, Neha
last_name: Pokharel
- first_name: Michael
full_name: Röder, Michael
id: '67199'
last_name: Röder
orcid: https://orcid.org/0000-0002-8609-8277
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
citation:
ama: 'Qudus U, Pokharel N, Röder M, Ngonga Ngomo A-C. No Need to Be a Know-It-All:
Fact Checking with Shallow Knowledge. In: Lecture Notes in Computer Science.
Springer Nature Switzerland; 2026. doi:10.1007/978-3-032-25156-5_23'
apa: 'Qudus, U., Pokharel, N., Röder, M., & Ngonga Ngomo, A.-C. (2026). No Need
to Be a Know-It-All: Fact Checking with Shallow Knowledge. In Lecture Notes
in Computer Science. Springer Nature Switzerland. https://doi.org/10.1007/978-3-032-25156-5_23'
bibtex: '@inbook{Qudus_Pokharel_Röder_Ngonga Ngomo_2026, place={Cham}, title={No
Need to Be a Know-It-All: Fact Checking with Shallow Knowledge}, DOI={10.1007/978-3-032-25156-5_23},
booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland},
author={Qudus, Umair and Pokharel, Neha and Röder, Michael and Ngonga Ngomo, Axel-Cyrille},
year={2026} }'
chicago: 'Qudus, Umair, Neha Pokharel, Michael Röder, and Axel-Cyrille Ngonga Ngomo.
“No Need to Be a Know-It-All: Fact Checking with Shallow Knowledge.” In Lecture
Notes in Computer Science. Cham: Springer Nature Switzerland, 2026. https://doi.org/10.1007/978-3-032-25156-5_23.'
ieee: 'U. Qudus, N. Pokharel, M. Röder, and A.-C. Ngonga Ngomo, “No Need to Be a Know-It-All:
Fact Checking with Shallow Knowledge,” in Lecture Notes in Computer Science,
Cham: Springer Nature Switzerland, 2026.'
mla: 'Qudus, Umair, et al. “No Need to Be a Know-It-All: Fact Checking with Shallow
Knowledge.” Lecture Notes in Computer Science, Springer Nature Switzerland,
2026, doi:10.1007/978-3-032-25156-5_23.'
short: 'U. Qudus, N. Pokharel, M. Röder, A.-C. Ngonga Ngomo, in: Lecture Notes in
Computer Science, Springer Nature Switzerland, Cham, 2026.'
date_created: 2026-05-21T11:45:24Z
date_updated: 2026-05-21T11:55:29Z
department:
- _id: '574'
doi: 10.1007/978-3-032-25156-5_23
keyword:
- fact checking
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783032251558'
- '9783032251565'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature Switzerland
status: public
title: 'No Need to Be a Know-It-All: Fact Checking with Shallow Knowledge'
type: book_chapter
user_id: '83392'
year: '2026'
...
---
_id: '65566'
author:
- first_name: Anselm
full_name: Haak, Anselm
id: '109969'
last_name: Haak
- first_name: Patrick
full_name: Koopmann, Patrick
last_name: Koopmann
- first_name: Yasir
full_name: Mahmood, Yasir
id: '99353'
last_name: Mahmood
- first_name: Anni-Yasmin
full_name: Turhan, Anni-Yasmin
id: '104470'
last_name: Turhan
citation:
ama: 'Haak A, Koopmann P, Mahmood Y, Turhan A-Y. ABox Abduction for Inconsistent
Knowledge Bases under Repair Semantics. In: ; 2026.'
apa: Haak, A., Koopmann, P., Mahmood, Y., & Turhan, A.-Y. (2026). ABox Abduction
for Inconsistent Knowledge Bases under Repair Semantics. 23rd International
Conference on Principles of Knowledge Representation and Reasoning, Lisbon.
bibtex: '@inproceedings{Haak_Koopmann_Mahmood_Turhan_2026, title={ABox Abduction
for Inconsistent Knowledge Bases under Repair Semantics}, author={Haak, Anselm
and Koopmann, Patrick and Mahmood, Yasir and Turhan, Anni-Yasmin}, year={2026}
}'
chicago: Haak, Anselm, Patrick Koopmann, Yasir Mahmood, and Anni-Yasmin Turhan.
“ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics,” 2026.
ieee: A. Haak, P. Koopmann, Y. Mahmood, and A.-Y. Turhan, “ABox Abduction for Inconsistent
Knowledge Bases under Repair Semantics,” presented at the 23rd International Conference
on Principles of Knowledge Representation and Reasoning, Lisbon, 2026.
mla: Haak, Anselm, et al. ABox Abduction for Inconsistent Knowledge Bases under
Repair Semantics. 2026.
short: 'A. Haak, P. Koopmann, Y. Mahmood, A.-Y. Turhan, in: 2026.'
conference:
end_date: 2026-07-23
location: Lisbon
name: 23rd International Conference on Principles of Knowledge Representation and
Reasoning
start_date: 2026-07-20
date_created: 2026-05-05T14:29:38Z
date_updated: 2026-05-21T08:26:07Z
department:
- _id: '888'
- _id: '574'
language:
- iso: eng
status: public
title: ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics
type: conference
user_id: '109969'
year: '2026'
...
---
_id: '65733'
abstract:
- lang: eng
text: "Abstract\r\n \r\n In
this paper, we study the computation of shortest paths within the\r\n geometric
amoebot model\r\n , a commonly used model for
programmable matter. Shortest paths are essential for various tasks and therefore
have been heavily investigated in many different contexts. We consider the\r\n
\ reconfigurable circuit extension\r\n
\ of the model where the amoebot structure is able to interconnect
amoebots by so-called circuits. These circuits permit the instantaneous transmission
of simple signals between connected amoebots. We propose distributed algorithms
for the\r\n shortest path forest problem\r\n
\ where, given a set of\r\n k\r\n
\ sources and a set of\r\n \r\n
\ \r\n $$\\ell
$$\r\n \r\n
\ ℓ\r\n \r\n
\ \r\n \r\n
\ destinations, the amoebot structure has to compute a forest
that connects each destination to its closest source on a shortest path. Our main
results are two algorithms for hole-free structures. The first algorithm constructs
a shortest path tree for a single source within\r\n \r\n
\ \r\n $$O(\\log
\\ell )$$\r\n \r\n
\ \r\n O\r\n
\ (\r\n log\r\n
\ ℓ\r\n )\r\n
\ \r\n \r\n
\ \r\n \r\n
\ rounds, and the second algorithm a shortest path forest for
an arbitrary number of sources within\r\n \r\n
\ \r\n $$O(\\log
n \\log ^2 k)$$\r\n \r\n
\ \r\n O\r\n
\ (\r\n log\r\n
\ n\r\n \r\n
\ log\r\n 2\r\n
\ \r\n k\r\n
\ )\r\n \r\n
\ \r\n \r\n
\ \r\n rounds. The
former algorithm also provides an\r\n O\r\n
\ (1) rounds solution for the\r\n single
pair shortest path problem\r\n (SPSP) and an\r\n
\ \r\n \r\n
\ $$O(\\log n)$$\r\n \r\n \r\n
\ O\r\n (\r\n
\ log\r\n n\r\n
\ )\r\n \r\n
\ \r\n \r\n
\ \r\n rounds solution
for the\r\n single source shortest path problem\r\n
\ (SSSP) since these problems are special cases of the considered
problem. Then, we adapt the latter algorithm to an offset version of the problem.
This allows us to solve the problem for amoebot structures with holes within\r\n
\ \r\n \r\n
\ $$O(h \\log ^3 n)$$\r\n
\ \r\n
\ \r\n O\r\n
\ (\r\n h\r\n
\ \r\n log\r\n
\ 3\r\n \r\n
\ n\r\n )\r\n
\ \r\n \r\n
\ \r\n \r\n
\ rounds w.h.p. where\r\n h\r\n
\ denotes the number of holes.\r\n "
article_number: '15'
author:
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Padalkin A, Scheideler C. Polylogarithmic time algorithms for shortest path
forests in programmable matter. Distributed Computing. 2026;39(2). doi:10.1007/s00446-026-00505-2
apa: Padalkin, A., & Scheideler, C. (2026). Polylogarithmic time algorithms
for shortest path forests in programmable matter. Distributed Computing,
39(2), Article 15. https://doi.org/10.1007/s00446-026-00505-2
bibtex: '@article{Padalkin_Scheideler_2026, title={Polylogarithmic time algorithms
for shortest path forests in programmable matter}, volume={39}, DOI={10.1007/s00446-026-00505-2},
number={215}, journal={Distributed Computing}, publisher={Springer Science and
Business Media LLC}, author={Padalkin, Andreas and Scheideler, Christian}, year={2026}
}'
chicago: Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms
for Shortest Path Forests in Programmable Matter.” Distributed Computing
39, no. 2 (2026). https://doi.org/10.1007/s00446-026-00505-2.
ieee: 'A. Padalkin and C. Scheideler, “Polylogarithmic time algorithms for shortest
path forests in programmable matter,” Distributed Computing, vol. 39, no.
2, Art. no. 15, 2026, doi: 10.1007/s00446-026-00505-2.'
mla: Padalkin, Andreas, and Christian Scheideler. “Polylogarithmic Time Algorithms
for Shortest Path Forests in Programmable Matter.” Distributed Computing,
vol. 39, no. 2, 15, Springer Science and Business Media LLC, 2026, doi:10.1007/s00446-026-00505-2.
short: A. Padalkin, C. Scheideler, Distributed Computing 39 (2026).
date_created: 2026-05-29T12:11:32Z
date_updated: 2026-05-29T12:13:09Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
doi: 10.1007/s00446-026-00505-2
intvolume: ' 39'
issue: '2'
language:
- iso: eng
publication: Distributed Computing
publication_identifier:
issn:
- 0178-2770
- 1432-0452
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Polylogarithmic time algorithms for shortest path forests in programmable matter
type: journal_article
user_id: '15578'
volume: 39
year: '2026'
...
---
_id: '65755'
author:
- first_name: Jan Luca
full_name: Twardzik, Jan Luca
last_name: Twardzik
- first_name: Lynn
full_name: Humpert, Lynn
last_name: Humpert
- first_name: Gerrit
full_name: Cichon, Gerrit
last_name: Cichon
- first_name: Roman
full_name: Dumitrescu, Roman
id: '16190'
last_name: Dumitrescu
citation:
ama: 'Twardzik JL, Humpert L, Cichon G, Dumitrescu R. Knowledge Gaps in Circular
Product Development: A Systematic Literature Review of the Manufacturing Industry.
In: Lecture Notes in Mechanical Engineering. Springer Nature Switzerland;
2026. doi:10.1007/978-3-032-21157-6_39'
apa: 'Twardzik, J. L., Humpert, L., Cichon, G., & Dumitrescu, R. (2026). Knowledge
Gaps in Circular Product Development: A Systematic Literature Review of the Manufacturing
Industry. In Lecture Notes in Mechanical Engineering. Springer Nature Switzerland.
https://doi.org/10.1007/978-3-032-21157-6_39'
bibtex: '@inbook{Twardzik_Humpert_Cichon_Dumitrescu_2026, place={Cham}, title={Knowledge
Gaps in Circular Product Development: A Systematic Literature Review of the Manufacturing
Industry}, DOI={10.1007/978-3-032-21157-6_39},
booktitle={Lecture Notes in Mechanical Engineering}, publisher={Springer Nature
Switzerland}, author={Twardzik, Jan Luca and Humpert, Lynn and Cichon, Gerrit
and Dumitrescu, Roman}, year={2026} }'
chicago: 'Twardzik, Jan Luca, Lynn Humpert, Gerrit Cichon, and Roman Dumitrescu.
“Knowledge Gaps in Circular Product Development: A Systematic Literature Review
of the Manufacturing Industry.” In Lecture Notes in Mechanical Engineering.
Cham: Springer Nature Switzerland, 2026. https://doi.org/10.1007/978-3-032-21157-6_39.'
ieee: 'J. L. Twardzik, L. Humpert, G. Cichon, and R. Dumitrescu, “Knowledge Gaps
in Circular Product Development: A Systematic Literature Review of the Manufacturing
Industry,” in Lecture Notes in Mechanical Engineering, Cham: Springer Nature
Switzerland, 2026.'
mla: 'Twardzik, Jan Luca, et al. “Knowledge Gaps in Circular Product Development:
A Systematic Literature Review of the Manufacturing Industry.” Lecture Notes
in Mechanical Engineering, Springer Nature Switzerland, 2026, doi:10.1007/978-3-032-21157-6_39.'
short: 'J.L. Twardzik, L. Humpert, G. Cichon, R. Dumitrescu, in: Lecture Notes in
Mechanical Engineering, Springer Nature Switzerland, Cham, 2026.'
date_created: 2026-06-02T11:46:11Z
date_updated: 2026-06-02T11:50:46Z
department:
- _id: '563'
doi: 10.1007/978-3-032-21157-6_39
language:
- iso: eng
place: Cham
publication: Lecture Notes in Mechanical Engineering
publication_identifier:
isbn:
- '9783032211569'
- '9783032211576'
issn:
- 2195-4356
- 2195-4364
publication_status: published
publisher: Springer Nature Switzerland
status: public
title: 'Knowledge Gaps in Circular Product Development: A Systematic Literature Review
of the Manufacturing Industry'
type: book_chapter
user_id: '15782'
year: '2026'
...