Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bernhard Wolfrum

dblp:296/9441 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2026
0000-0003-4438-3755ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
design for manufacturability
0.912025
Manufacturing Cycle Time Optimization for Inkjet-Printed Electronics · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2025
Electronic design automation
manufacturing optimization
0.912025
Manufacturing Cycle Time Optimization for Inkjet-Printed Electronics · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2025

Methods — techniques the papers use, named apart from their topics

mixed integer linear programming · 0.9gaussian drying model · 0.9
YearPublicationVenuePosition
2026 Layout Decomposition and Printing Time Optimization for Inkjet-Printed Electronics
abstract
Inkjet-printed electronics is a low-cost option for large-scale production. To avoid manufacturing defects, recent research has considered design constraints, such as Laplace and proximity conflicts, decomposed the layouts into different layers, and printed them sequentially. The state-of-the-art work reduced the manufacturing time by optimizing the number of layers and drying time. In this work, we aim to enhance manufacturing efficiency from a new angle, concurrently optimizing the printing time and the layout decomposition of inkjet-printed electronics. We propose an integer linear programming formulation and a dynamic programming algorithm to determine layout decomposition and layer assignment and to estimate the total printing time by carefully considering printing characteristics and design constraints. Experimental results demonstrate significant reductions in overall printing time, leading to improved fabrication efficiency.
Meng Lian 0001, Hu Peng, Bernhard Wolfrum, Tsun-Ming Tseng, Iris Hui-Ru Jiang
ACM Trans. Design Autom. Electr. Syst.4
2025 Manufacturing Cycle Time Optimization for Inkjet-Printed Electronics
abstract
Inkjet-printed electronics has attracted considerable attention for low-cost mass production. High-density inkjet-printed designs can benefit from printing and drying in batches to avoid defects due to undesired ink redistribution and ink merging. The state-of-the-art approach decomposes the design into small objects, assigns the objects to different layers to be printed in different iterations, and minimizes the number of layers to reduce the number of iterations. However, it overlooks the differences in the printing and drying time between different layers and thus cannot properly model the impact of different layer assignment solutions on the manufacturing cycle time. In this work, we propose a row-based printing model that simulates the inkjet-printing mechanism and an integral Gaussian drying model that evaluates the local evaporation rate to approximate the printing and drying process of inkjet-printed manufacturing. Based on these models, we propose a mixed-integer-linear programming (MILP) method called the manufacturing model to minimize the manufacturing cycle time and avoid defects by optimally assigning objects to different iterations to be printed and dried in batches. Experimental results confirm that, compared with the preliminary work, manufacturing using our optimized solutions required up to 42.7% less time.
Meng Lian 0001, Hu Peng, Mengchu Li, Yushen Zhang, Tsun-Ming Tseng, Bernhard Wolfrum, Ulf Schlichtmann
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.6
2021 Manufacturing Cycle-Time Optimization Using Gaussian Drying Model for Inkjet-Printed Electronics
abstract
Inkjet-printed electronics have attracted considerable attention for low-cost mass production. To avoid undesired device behavior due to accidental ink merging and redistribution, high-density designs can benefit from layering and drying in batches. The overall manufacturing cycle-time, however, now becomes dominated by the cumulative drying time of these individual layers. The state-of-the-art approach decomposes the whole design, arranges the modified objects in different layers, and minimizes the number of layers. Fewer layers imply a reduction in the number of printing iterations and thus a higher manufacturing efficiency. Nevertheless, printing objects with significantly different drying dynamics in the same layer leads to a reduction of manufacturing efficiency, since the longest drying object in a given layer dominates the time required for this layer to dry. Consequently, an accurate estimation of the individual layers' drying time is indispensable to minimize the manufacturing cycle-time. To this end, we propose the first Gaussian drying model to evaluate the local evaporation rate in the drying process. Specifically, we estimate the drying time depending on the number, area, and distribution of the objects in a given layer. Finally, we minimize the total drying time by assigning to-be-printed objects to different layers with mixed-integer-linear programming (MILP) methods. Experimental results demonstrate that our Gaussian drying model closely approximates the actual drying process. In particular, comparing the non-optimized fabrication to the optimized results demonstrates that our method is able to reduce the drying time by 39%.
Tsun-Ming Tseng, Meng Lian 0001, Mengchu Li, Philipp Rinklin, Leroy Grob, Bernhard Wolfrum, Ulf Schlichtmann
ICCAD6