| Publication | Date of Publication | Type |
|---|
| Deciding bisimulation and trace equivalences for systems with many identical processes | 2023-03-21 | Paper |
| Competitive analysis of on-line disk scheduling | 2023-01-25 | Paper |
| On the decidability of the valuedness problem for two-way finite transducers | 2022-06-08 | Paper |
| Contact representations of directed planar graphs in 2D and 3D | 2020-05-13 | Paper |
| Characterizing the valuedness of two-way finite transducers | 2019-10-15 | Paper |
| Unfolding some classes of orthogonal polyhedra of arbitrary genus | 2019-06-06 | Paper |
| On contact representations of directed planar graphs | 2018-10-04 | Paper |
| On bend-minimized orthogonal drawings of planar 3-graphs | 2018-08-13 | Paper |
| Unfolding some classes of orthogonal polyhedra of arbitrary genus | 2017-10-23 | Paper |
| Improved Algorithms for Grid-Unfolding Orthogonal Polyhedra | 2017-10-20 | Paper |
| On orthogonally convex drawings of plane graphs | 2017-06-29 | Paper |
| Sequential versus concurrent languages of labeled conflict-free Petri nets | 2017-06-20 | Paper |
| Petri nets and semilinear sets (extended abstract) | 2016-12-21 | Paper |
| Area-universal drawings of biconnected outerplane graphs | 2016-11-23 | Paper |
| Unfolding orthogonal polyhedra with linear refinement | 2016-01-11 | Paper |
| Constrained floorplans in 2D and 3D | 2015-12-11 | Paper |
| A new approach for contact graph representations and its applications | 2015-10-30 | Paper |
| Rectilinear duals using monotone staircase polygons | 2015-09-11 | Paper |
| On orthogonally convex drawings of plane graphs (extended abstract) | 2013-12-20 | Paper |
| On the containment and equivalence problems for two-way transducers | 2012-05-30 | Paper |
| On Almost-Sure Properties of Probabilistic Discrete Event Systems | 2011-11-22 | Paper |
| One-and-a-half-side boundary labeling | 2011-08-12 | Paper |
| On two-way transducers | 2011-07-29 | Paper |
| Petri nets with simple circuits | 2011-03-18 | Paper |
| Complexity analysis of balloon drawing for rooted trees | 2011-02-02 | Paper |
| Timing parameter characterization of real-time systems | 2010-05-07 | Paper |
| On decision problems for parameterized machines | 2010-03-09 | Paper |
| PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS | 2009-08-21 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| On minimal elements of upward-closed sets | 2009-06-04 | Paper |
| Computing Minimal Elements of Upward-Closed Sets for Petri Nets | 2009-03-11 | Paper |
| Concurrency, Synchronization, and Conflicts in Petri Nets | 2009-02-12 | Paper |
| Many-to-One Boundary Labeling | 2009-01-19 | Paper |
| On Balloon Drawings of Rooted Trees | 2009-01-19 | Paper |
| DECIDABILITY AND COMPLEXITY ANALYSIS OF FORBIDDEN STATE PROBLEMS FOR DISCRETE EVENT SYSTEMS | 2008-09-25 | Paper |
| Width-Optimal Visibility Representations of Plane Graphs | 2008-05-27 | Paper |
| Deterministic catalytic systems are not universal | 2007-01-09 | Paper |
| On the computational power of 1-deterministic and sequential \(P\) systems | 2006-11-21 | Paper |
| Implementation and Application of Automata | 2006-11-13 | Paper |
| Membrane Computing | 2006-11-13 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Decidability analysis of self-stabilization for infinite-state systems | 2006-08-03 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS | 2005-08-03 | Paper |
| Reachability solution characterization of parametric real-time systems | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043739 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472326 | 2004-08-04 | Paper |
| Compact floor-planning via orderly spanning trees | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422293 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782063 | 2002-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778706 | 2002-11-19 | Paper |
| A valuation-based analysis of conflict-free Petri nets | 2002-07-15 | Paper |
| Distributed and on-line routing on tori | 2002-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499279 | 2001-03-05 | Paper |
| Priority conflict-free Petri nets | 1999-03-29 | Paper |
| Competitive analysis of on-line disk scheduling | 1999-02-18 | Paper |
| On reachability equivalence for BPP-nets | 1998-07-22 | Paper |
| Deciding a class of path formulas for conflict-free Petri nets | 1997-08-24 | Paper |
| Deciding bisimulation and trace equivalences for systems with many identical processes | 1997-02-27 | Paper |
| A note on fine covers and iterable factors of VAS languages | 1997-02-27 | Paper |
| On the regularity of Petri net languages | 1996-07-03 | Paper |
| SOME COMPLEXITY RESULTS FOR RINGS OF PETRI NETS | 1995-10-29 | Paper |
| Complexity analysis of propositional concurrent programs using domino tiling | 1993-12-06 | Paper |
| Normal and sinkless Petri nets | 1993-05-16 | Paper |
| A multiparameter analysis of domino tiling with an application to concurrent systems | 1992-09-27 | Paper |
| A unified approach for deciding the existence of certain petri net paths | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974867 | 1992-06-26 | Paper |
| A taxonomy of fairness and temporal logic problems for Petri nets | 1991-01-01 | Paper |
| Priority systems with many identical processes | 1991-01-01 | Paper |
| Global and local views of state fairness | 1991-01-01 | Paper |
| A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets | 1991-01-01 | Paper |
| On optimal parallelization of sorting networks | 1990-01-01 | Paper |
| Communicating processes, scheduling, and the complexity of nontermination | 1990-01-01 | Paper |
| Boundedness, hierarchy of fairness, and communication networks with delay | 1989-01-01 | Paper |
| On the complexity of deciding fair termination of probabilistic concurrent finite-state programs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3802633 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3771637 | 1987-01-01 | Paper |
| An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems | 1987-01-01 | Paper |
| Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-Machines | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3774963 | 1987-01-01 | Paper |
| A multiparameter analysis of the boundedness problem for vector addition systems | 1986-01-01 | Paper |
| Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states | 1986-01-01 | Paper |
| Boundedness, empty channel detection, and synchronization for communicating finite automata | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3746869 | 1986-01-01 | Paper |
| Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3685206 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3692862 | 1985-01-01 | Paper |
